{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:T62FOFT64GMRQXLKVMITLAQVI4","short_pith_number":"pith:T62FOFT6","schema_version":"1.0","canonical_sha256":"9fb457167ee199185d6aab11358215471ab3dac781b05cd9cf30e0fe21f6c6e4","source":{"kind":"arxiv","id":"2411.01836","version":3},"attestation_state":"computed","paper":{"title":"Some easy optimization problems have the overlap-gap property","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.CO","math.PR"],"primary_cat":"cs.CC","authors_text":"Shuangping Li, Tselil Schramm","submitted_at":"2024-11-04T06:15:25Z","abstract_excerpt":"We show that the shortest $s$-$t$ path problem has the overlap-gap property in (i) sparse $\\mathbf{G}(n,p)$ graphs and (ii) complete graphs with i.i.d. Exponential edge weights. Furthermore, we demonstrate that in sparse $\\mathbf{G}(n,p)$ graphs, shortest path is solved by $O(\\log n)$-degree polynomial estimators, and a uniform approximate shortest path can be sampled in polynomial time. This constitutes the first example in which the overlap-gap property is not predictive of algorithmic intractability for a (non-algebraic) average-case optimization problem."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2411.01836","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2024-11-04T06:15:25Z","cross_cats_sorted":["cs.DS","math.CO","math.PR"],"title_canon_sha256":"59b4de4ec4bebd85068acd8df6bb1b3ccb810a6c06dd4fc2414882669c501991","abstract_canon_sha256":"e4ce885f63263ca672f8c7fcc40f4728b0dab5d5f6f75135bcd518360f767193"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:26:01.481038Z","signature_b64":"a4fgHV7OCjPhbJmbk3dRT01noj8AbZ87b9+7dZ+1FS1knYj+Z/5rCluozHXCUCf8JJktXhXQe36tRRZCOpt8Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9fb457167ee199185d6aab11358215471ab3dac781b05cd9cf30e0fe21f6c6e4","last_reissued_at":"2026-07-05T11:26:01.480620Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:26:01.480620Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Some easy optimization problems have the overlap-gap property","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.CO","math.PR"],"primary_cat":"cs.CC","authors_text":"Shuangping Li, Tselil Schramm","submitted_at":"2024-11-04T06:15:25Z","abstract_excerpt":"We show that the shortest $s$-$t$ path problem has the overlap-gap property in (i) sparse $\\mathbf{G}(n,p)$ graphs and (ii) complete graphs with i.i.d. Exponential edge weights. Furthermore, we demonstrate that in sparse $\\mathbf{G}(n,p)$ graphs, shortest path is solved by $O(\\log n)$-degree polynomial estimators, and a uniform approximate shortest path can be sampled in polynomial time. This constitutes the first example in which the overlap-gap property is not predictive of algorithmic intractability for a (non-algebraic) average-case optimization problem."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.01836","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2411.01836/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2411.01836","created_at":"2026-07-05T11:26:01.480677+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.01836v3","created_at":"2026-07-05T11:26:01.480677+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.01836","created_at":"2026-07-05T11:26:01.480677+00:00"},{"alias_kind":"pith_short_12","alias_value":"T62FOFT64GMR","created_at":"2026-07-05T11:26:01.480677+00:00"},{"alias_kind":"pith_short_16","alias_value":"T62FOFT64GMRQXLK","created_at":"2026-07-05T11:26:01.480677+00:00"},{"alias_kind":"pith_short_8","alias_value":"T62FOFT6","created_at":"2026-07-05T11:26:01.480677+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.05618","citing_title":"Algorithmic Phase Transition for Large Independent Sets in Dense Hypergraphs","ref_index":85,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/T62FOFT64GMRQXLKVMITLAQVI4","json":"https://pith.science/pith/T62FOFT64GMRQXLKVMITLAQVI4.json","graph_json":"https://pith.science/api/pith-number/T62FOFT64GMRQXLKVMITLAQVI4/graph.json","events_json":"https://pith.science/api/pith-number/T62FOFT64GMRQXLKVMITLAQVI4/events.json","paper":"https://pith.science/paper/T62FOFT6"},"agent_actions":{"view_html":"https://pith.science/pith/T62FOFT64GMRQXLKVMITLAQVI4","download_json":"https://pith.science/pith/T62FOFT64GMRQXLKVMITLAQVI4.json","view_paper":"https://pith.science/paper/T62FOFT6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.01836&json=true","fetch_graph":"https://pith.science/api/pith-number/T62FOFT64GMRQXLKVMITLAQVI4/graph.json","fetch_events":"https://pith.science/api/pith-number/T62FOFT64GMRQXLKVMITLAQVI4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T62FOFT64GMRQXLKVMITLAQVI4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T62FOFT64GMRQXLKVMITLAQVI4/action/storage_attestation","attest_author":"https://pith.science/pith/T62FOFT64GMRQXLKVMITLAQVI4/action/author_attestation","sign_citation":"https://pith.science/pith/T62FOFT64GMRQXLKVMITLAQVI4/action/citation_signature","submit_replication":"https://pith.science/pith/T62FOFT64GMRQXLKVMITLAQVI4/action/replication_record"}},"created_at":"2026-07-05T11:26:01.480677+00:00","updated_at":"2026-07-05T11:26:01.480677+00:00"}