{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:T62FOFT64GMRQXLKVMITLAQVI4","short_pith_number":"pith:T62FOFT6","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"},"canonical_sha256":"9fb457167ee199185d6aab11358215471ab3dac781b05cd9cf30e0fe21f6c6e4","source":{"kind":"arxiv","id":"2411.01836","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.01836","created_at":"2026-07-05T11:26:01Z"},{"alias_kind":"arxiv_version","alias_value":"2411.01836v3","created_at":"2026-07-05T11:26:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.01836","created_at":"2026-07-05T11:26:01Z"},{"alias_kind":"pith_short_12","alias_value":"T62FOFT64GMR","created_at":"2026-07-05T11:26:01Z"},{"alias_kind":"pith_short_16","alias_value":"T62FOFT64GMRQXLK","created_at":"2026-07-05T11:26:01Z"},{"alias_kind":"pith_short_8","alias_value":"T62FOFT6","created_at":"2026-07-05T11:26:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:T62FOFT64GMRQXLKVMITLAQVI4","target":"record","payload":{"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"},"canonical_sha256":"9fb457167ee199185d6aab11358215471ab3dac781b05cd9cf30e0fe21f6c6e4","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"},"source_kind":"arxiv","source_id":"2411.01836","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:26:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RuuZEZu3RnwCUrZzlEm1k9bLhfHvW69GlEkP0nXJSyXeFc57xFTj4XuaBPUwjuoxRgoJOAjd5CWTQn2oZv1wAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T04:02:24.268052Z"},"content_sha256":"b52185bdc8ae48b0062ef5eb44198c7b8a67c882a0c008de6c47a3647d53c88a","schema_version":"1.0","event_id":"sha256:b52185bdc8ae48b0062ef5eb44198c7b8a67c882a0c008de6c47a3647d53c88a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:T62FOFT64GMRQXLKVMITLAQVI4","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:26:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Otc+IZxcV6rshvSwe8tmwcLVJGnUZV9XNNa+GC/Thd69S1D0PhdhMExVwJONk9dlxH/hqbCqUbJqHaeTaShFDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T04:02:24.268641Z"},"content_sha256":"34dfa68c020a1f9eddc6246896af6410db73389bb909c07122150b2b637d1341","schema_version":"1.0","event_id":"sha256:34dfa68c020a1f9eddc6246896af6410db73389bb909c07122150b2b637d1341"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/T62FOFT64GMRQXLKVMITLAQVI4/bundle.json","state_url":"https://pith.science/pith/T62FOFT64GMRQXLKVMITLAQVI4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/T62FOFT64GMRQXLKVMITLAQVI4/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-09T04:02:24Z","links":{"resolver":"https://pith.science/pith/T62FOFT64GMRQXLKVMITLAQVI4","bundle":"https://pith.science/pith/T62FOFT64GMRQXLKVMITLAQVI4/bundle.json","state":"https://pith.science/pith/T62FOFT64GMRQXLKVMITLAQVI4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/T62FOFT64GMRQXLKVMITLAQVI4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:T62FOFT64GMRQXLKVMITLAQVI4","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"e4ce885f63263ca672f8c7fcc40f4728b0dab5d5f6f75135bcd518360f767193","cross_cats_sorted":["cs.DS","math.CO","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2024-11-04T06:15:25Z","title_canon_sha256":"59b4de4ec4bebd85068acd8df6bb1b3ccb810a6c06dd4fc2414882669c501991"},"schema_version":"1.0","source":{"id":"2411.01836","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.01836","created_at":"2026-07-05T11:26:01Z"},{"alias_kind":"arxiv_version","alias_value":"2411.01836v3","created_at":"2026-07-05T11:26:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.01836","created_at":"2026-07-05T11:26:01Z"},{"alias_kind":"pith_short_12","alias_value":"T62FOFT64GMR","created_at":"2026-07-05T11:26:01Z"},{"alias_kind":"pith_short_16","alias_value":"T62FOFT64GMRQXLK","created_at":"2026-07-05T11:26:01Z"},{"alias_kind":"pith_short_8","alias_value":"T62FOFT6","created_at":"2026-07-05T11:26:01Z"}],"graph_snapshots":[{"event_id":"sha256:34dfa68c020a1f9eddc6246896af6410db73389bb909c07122150b2b637d1341","target":"graph","created_at":"2026-07-05T11:26:01Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2411.01836/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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.","authors_text":"Shuangping Li, Tselil Schramm","cross_cats":["cs.DS","math.CO","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2024-11-04T06:15:25Z","title":"Some easy optimization problems have the overlap-gap property"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.01836","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:b52185bdc8ae48b0062ef5eb44198c7b8a67c882a0c008de6c47a3647d53c88a","target":"record","created_at":"2026-07-05T11:26:01Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"e4ce885f63263ca672f8c7fcc40f4728b0dab5d5f6f75135bcd518360f767193","cross_cats_sorted":["cs.DS","math.CO","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2024-11-04T06:15:25Z","title_canon_sha256":"59b4de4ec4bebd85068acd8df6bb1b3ccb810a6c06dd4fc2414882669c501991"},"schema_version":"1.0","source":{"id":"2411.01836","kind":"arxiv","version":3}},"canonical_sha256":"9fb457167ee199185d6aab11358215471ab3dac781b05cd9cf30e0fe21f6c6e4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9fb457167ee199185d6aab11358215471ab3dac781b05cd9cf30e0fe21f6c6e4","first_computed_at":"2026-07-05T11:26:01.480620Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:26:01.480620Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"a4fgHV7OCjPhbJmbk3dRT01noj8AbZ87b9+7dZ+1FS1knYj+Z/5rCluozHXCUCf8JJktXhXQe36tRRZCOpt8Dg==","signature_status":"signed_v1","signed_at":"2026-07-05T11:26:01.481038Z","signed_message":"canonical_sha256_bytes"},"source_id":"2411.01836","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b52185bdc8ae48b0062ef5eb44198c7b8a67c882a0c008de6c47a3647d53c88a","sha256:34dfa68c020a1f9eddc6246896af6410db73389bb909c07122150b2b637d1341"],"state_sha256":"0ff1c6763d68ce8a108f9dda2b26c406bce37564c4c2df549611c7f7281f316f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a6QcCL/Ccv7SGR4UWKwVopUgbiVQtjOiHfvVISl7gkaEVC84k4GQvN5iEAjkB826ZElpSceAOrxO5Dt7ZNwMCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T04:02:24.272508Z","bundle_sha256":"b2c99b85ab58f2ecba5fa8e2befe44f8695decfb4b09c6bef48478ea45c210bf"}}