TheoremDB
R1790claimStatus: reportedEvidence: SupportedReplay: source only

[#R1790] Current status and exact unresolved remainder

claim. OPEN as checked on 2026-08-01. Strongest checked neighboring result: The best general algorithms improve cubic time by subpolynomial factors; many problems are subcubic-equivalent to APSP. Exact unresolved remainder: A fixed positive exponent saving remains unknown.

View evidenceOpen source ↗

1Summary

The problem was checked as open on 2026-08-01.

The strongest neighboring result found in the cited sources is: The best general algorithms improve cubic time by subpolynomial factors; many problems are subcubic-equivalent to APSP.

Supported evidence. Replay readiness: source only.

2Evidence

Evidence package: source only

A verification source is cited. This record has no executable replay attached.

Verification source: arxiv.org ↗, R. Williams, Faster all-pairs shortest paths via circuit complexity, STOC 2014. main theorem

3Overview

The exact unresolved remainder is: A fixed positive exponent saving remains unknown.

A complete resolution must meet the following acceptance conditions: - Give a correct truly subcubic algorithm in the stated word-RAM or bit model. - Or prove an n^{3−o(1)} lower bound in a clearly specified standard model.

4What was measured

As of
2026-08-01
Exact open remainder
A fixed positive exponent saving remains unknown.

5How it connects

Informed by

Evidenced by

Addressed by

Recorded for

6Agent packet

A compact handoff with the evidence boundary, replay manifest, and relation pointers.

View structured packet
json
{
  "schema": "theoremdb-agent-record-v1",
  "ref": "R1790",
  "content_hash": null,
  "slug": "truly-subcubic-apsp-claim-status-20260801",
  "type": "claim",
  "title": "Current status and exact unresolved remainder",
  "summary": "OPEN as checked on 2026-08-01. Strongest checked neighboring result: The best general algorithms improve cubic time by subpolynomial factors; many problems are subcubic-equivalent to APSP. Exact unresolved remainder: A fixed positive exponent saving remains unknown.",
  "relevance": "This is the dated publication status for the canonical target Is there a truly subcubic algorithm for weighted APSP?.",
  "relevance_source": "recorded",
  "body": "The problem was checked as open on 2026-08-01.\n\nThe strongest neighboring result found in the cited sources is: The best general algorithms improve cubic time by subpolynomial factors; many problems are subcubic-equivalent to APSP.\n\nThe exact unresolved remainder is: A fixed positive exponent saving remains unknown.\n\nA complete resolution must meet the following acceptance conditions:\n- Give a correct truly subcubic algorithm in the stated word-RAM or bit model.\n- Or prove an n^{3−o(1)} lower bound in a clearly specified standard model.",
  "status": "reported",
  "evidence_grade": "sourced",
  "scope": null,
  "reproduction": {
    "schema": "theoremdb-reproduction-v1",
    "readiness": "source_only",
    "kind": "claim",
    "citation": {
      "url": "https://arxiv.org/abs/1312.6680",
      "locator": "R. Williams, Faster all-pairs shortest paths via circuit complexity, STOC 2014. main theorem"
    },
    "missing": [
      "source",
      "command",
      "runtime",
      "expected_output"
    ]
  },
  "formal_statement": null,
  "source": {
    "url": "https://arxiv.org/abs/1312.6680",
    "locator": "R. Williams, Faster all-pairs shortest paths via circuit complexity, STOC 2014. main theorem"
  },
  "relations": [
    {
      "slug": "R1789",
      "title": "Strongest checked neighboring result",
      "object_type": "claim",
      "relation": "informs",
      "direction": "incoming"
    },
    {
      "slug": "R1787",
      "title": "Dated source and duplicate audit",
      "object_type": "attempt",
      "relation": "evidences",
      "direction": "incoming"
    },
    {
      "slug": "R1788",
      "title": "Work at the unresolved boundary",
      "object_type": "attempt",
      "relation": "addresses",
      "direction": "incoming"
    },
    {
      "slug": "truly-subcubic-apsp",
      "title": "truly subcubic apsp",
      "object_type": "problem",
      "relation": "recorded_for",
      "direction": "outgoing"
    }
  ]
}

7Provenance

View source, identifiers, and projection details
Project
truly-subcubic-apsp-release-300-source-review
Locator
R. Williams, Faster all-pairs shortest paths via circuit complexity, STOC 2014. main theorem
License
CC0-1.0
Contributors
TheoremDB maintainers
Public record
R1790
Stable alias
truly-subcubic-apsp-claim-status-20260801
Projection
Reproduction fields are derived from the immutable record.

A statement this project treats as settled at the recorded evidence grade, with the work that backs it.

Report a problem

Your ChatGPT account

Opening ChatGPT

ChatGPT is opening in a new tab.