{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:X3A3B432SLYUDQ6L7DEECWHMPP","short_pith_number":"pith:X3A3B432","schema_version":"1.0","canonical_sha256":"bec1b0f37a92f141c3cbf8c84158ec7bd6d63081647238e0ab32676f8a24e192","source":{"kind":"arxiv","id":"2607.19342","version":1},"attestation_state":"computed","paper":{"title":"Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"George Z. Li, Isaac M. Hair, Jason Li, Junkai Zhang","submitted_at":"2026-07-21T17:59:04Z","abstract_excerpt":"We revisit the single-source shortest paths (SSSP) problem on directed graphs with nonnegative real weights and give a deterministic parallel algorithm with $O(n^{1+o(1)}t^2 + m^{1+o(1)})$ work and $\\tilde{O}(n/t)$ span, for any $t \\in [1, n]$. This matches (up to subpolynomial factors) the tradeoff due to [Shi and Spencer '99] for undirected graphs with nonnegative real weights."},"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":"2607.19342","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-07-21T17:59:04Z","cross_cats_sorted":[],"title_canon_sha256":"8ccb8b49b0f5d8753f797bd94038a980fa6b545300c8d925c2a1d33f01d221f7","abstract_canon_sha256":"4e973d38f78930d6a7864df0c67e2fa5a75dea6703f315c7239336eec367595a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-22T01:24:38.137567Z","signature_b64":"ZacZaAZA8BaGRC3JRw40ggz2SGXdGEHVIW413hIeTE6eh7ZpIFEPMms2fDuoADxG1WepUFIskepY+yfniq8nDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bec1b0f37a92f141c3cbf8c84158ec7bd6d63081647238e0ab32676f8a24e192","last_reissued_at":"2026-07-22T01:24:38.136735Z","signature_status":"signed_v1","first_computed_at":"2026-07-22T01:24:38.136735Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"George Z. Li, Isaac M. Hair, Jason Li, Junkai Zhang","submitted_at":"2026-07-21T17:59:04Z","abstract_excerpt":"We revisit the single-source shortest paths (SSSP) problem on directed graphs with nonnegative real weights and give a deterministic parallel algorithm with $O(n^{1+o(1)}t^2 + m^{1+o(1)})$ work and $\\tilde{O}(n/t)$ span, for any $t \\in [1, n]$. This matches (up to subpolynomial factors) the tradeoff due to [Shi and Spencer '99] for undirected graphs with nonnegative real weights."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.19342","kind":"arxiv","version":1},"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/2607.19342/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":"2607.19342","created_at":"2026-07-22T01:24:38.137161+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.19342v1","created_at":"2026-07-22T01:24:38.137161+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.19342","created_at":"2026-07-22T01:24:38.137161+00:00"},{"alias_kind":"pith_short_12","alias_value":"X3A3B432SLYU","created_at":"2026-07-22T01:24:38.137161+00:00"},{"alias_kind":"pith_short_16","alias_value":"X3A3B432SLYUDQ6L","created_at":"2026-07-22T01:24:38.137161+00:00"},{"alias_kind":"pith_short_8","alias_value":"X3A3B432","created_at":"2026-07-22T01:24:38.137161+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/X3A3B432SLYUDQ6L7DEECWHMPP","json":"https://pith.science/pith/X3A3B432SLYUDQ6L7DEECWHMPP.json","graph_json":"https://pith.science/api/pith-number/X3A3B432SLYUDQ6L7DEECWHMPP/graph.json","events_json":"https://pith.science/api/pith-number/X3A3B432SLYUDQ6L7DEECWHMPP/events.json","paper":"https://pith.science/paper/X3A3B432"},"agent_actions":{"view_html":"https://pith.science/pith/X3A3B432SLYUDQ6L7DEECWHMPP","download_json":"https://pith.science/pith/X3A3B432SLYUDQ6L7DEECWHMPP.json","view_paper":"https://pith.science/paper/X3A3B432","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.19342&json=true","fetch_graph":"https://pith.science/api/pith-number/X3A3B432SLYUDQ6L7DEECWHMPP/graph.json","fetch_events":"https://pith.science/api/pith-number/X3A3B432SLYUDQ6L7DEECWHMPP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X3A3B432SLYUDQ6L7DEECWHMPP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X3A3B432SLYUDQ6L7DEECWHMPP/action/storage_attestation","attest_author":"https://pith.science/pith/X3A3B432SLYUDQ6L7DEECWHMPP/action/author_attestation","sign_citation":"https://pith.science/pith/X3A3B432SLYUDQ6L7DEECWHMPP/action/citation_signature","submit_replication":"https://pith.science/pith/X3A3B432SLYUDQ6L7DEECWHMPP/action/replication_record"}},"created_at":"2026-07-22T01:24:38.137161+00:00","updated_at":"2026-07-22T01:24:38.137161+00:00"}