{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:AERE34BUKM6ED4MOMVXT3SYDIU","short_pith_number":"pith:AERE34BU","schema_version":"1.0","canonical_sha256":"01224df034533c41f18e656f3dcb03451001c195642263feeb03d26cba8386dd","source":{"kind":"arxiv","id":"2311.02520","version":2},"attestation_state":"computed","paper":{"title":"Single-Source Shortest Paths with Negative Real Weights in $\\tilde{O}(mn^{8/9})$ Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jeremy T. Fineman","submitted_at":"2023-11-04T22:35:39Z","abstract_excerpt":"This paper presents a randomized algorithm for the problem of single-source shortest paths on directed graphs with real (both positive and negative) edge weights. Given an input graph with $n$ vertices and $m$ edges, the algorithm completes in $\\tilde{O}(mn^{8/9})$ time with high probability. For real-weighted graphs, this result constitutes the first asymptotic improvement over the classic $O(mn)$-time algorithm variously attributed to Shimbel, Bellman, Ford, and Moore."},"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":"2311.02520","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-11-04T22:35:39Z","cross_cats_sorted":[],"title_canon_sha256":"10469b19e543b0f6350e68f85247ef42e6a261e3fcad2eb6b3b78b343836aa21","abstract_canon_sha256":"46c4b6f2f003ca4d4675364b57e7f5f133a733289c145bd530749990f5338691"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:12:01.180935Z","signature_b64":"dVLFPE0wTI1bDaIy6+qRS6eXJiuPJAgNXnMtUIPCwzclldJPtxNyM41nzCb5A2kfQYTrXsz5tFBv0aifVGxdBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"01224df034533c41f18e656f3dcb03451001c195642263feeb03d26cba8386dd","last_reissued_at":"2026-07-05T07:12:01.180510Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:12:01.180510Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Single-Source Shortest Paths with Negative Real Weights in $\\tilde{O}(mn^{8/9})$ Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jeremy T. Fineman","submitted_at":"2023-11-04T22:35:39Z","abstract_excerpt":"This paper presents a randomized algorithm for the problem of single-source shortest paths on directed graphs with real (both positive and negative) edge weights. Given an input graph with $n$ vertices and $m$ edges, the algorithm completes in $\\tilde{O}(mn^{8/9})$ time with high probability. For real-weighted graphs, this result constitutes the first asymptotic improvement over the classic $O(mn)$-time algorithm variously attributed to Shimbel, Bellman, Ford, and Moore."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.02520","kind":"arxiv","version":2},"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/2311.02520/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":"2311.02520","created_at":"2026-07-05T07:12:01.180568+00:00"},{"alias_kind":"arxiv_version","alias_value":"2311.02520v2","created_at":"2026-07-05T07:12:01.180568+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.02520","created_at":"2026-07-05T07:12:01.180568+00:00"},{"alias_kind":"pith_short_12","alias_value":"AERE34BUKM6E","created_at":"2026-07-05T07:12:01.180568+00:00"},{"alias_kind":"pith_short_16","alias_value":"AERE34BUKM6ED4MO","created_at":"2026-07-05T07:12:01.180568+00:00"},{"alias_kind":"pith_short_8","alias_value":"AERE34BU","created_at":"2026-07-05T07:12:01.180568+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.14202","citing_title":"PRM-Free Security Alignment of Large Models via Red Teaming and Adversarial Training","ref_index":47,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AERE34BUKM6ED4MOMVXT3SYDIU","json":"https://pith.science/pith/AERE34BUKM6ED4MOMVXT3SYDIU.json","graph_json":"https://pith.science/api/pith-number/AERE34BUKM6ED4MOMVXT3SYDIU/graph.json","events_json":"https://pith.science/api/pith-number/AERE34BUKM6ED4MOMVXT3SYDIU/events.json","paper":"https://pith.science/paper/AERE34BU"},"agent_actions":{"view_html":"https://pith.science/pith/AERE34BUKM6ED4MOMVXT3SYDIU","download_json":"https://pith.science/pith/AERE34BUKM6ED4MOMVXT3SYDIU.json","view_paper":"https://pith.science/paper/AERE34BU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2311.02520&json=true","fetch_graph":"https://pith.science/api/pith-number/AERE34BUKM6ED4MOMVXT3SYDIU/graph.json","fetch_events":"https://pith.science/api/pith-number/AERE34BUKM6ED4MOMVXT3SYDIU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AERE34BUKM6ED4MOMVXT3SYDIU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AERE34BUKM6ED4MOMVXT3SYDIU/action/storage_attestation","attest_author":"https://pith.science/pith/AERE34BUKM6ED4MOMVXT3SYDIU/action/author_attestation","sign_citation":"https://pith.science/pith/AERE34BUKM6ED4MOMVXT3SYDIU/action/citation_signature","submit_replication":"https://pith.science/pith/AERE34BUKM6ED4MOMVXT3SYDIU/action/replication_record"}},"created_at":"2026-07-05T07:12:01.180568+00:00","updated_at":"2026-07-05T07:12:01.180568+00:00"}