{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:BW2KZIOZQXEFSSOVJO7JTOXRFB","short_pith_number":"pith:BW2KZIOZ","schema_version":"1.0","canonical_sha256":"0db4aca1d985c85949d54bbe99baf1286e22ae1f4140b9ee30827d35d39f8284","source":{"kind":"arxiv","id":"1011.6181","version":2},"attestation_state":"computed","paper":{"title":"Computing the diameter polynomially faster than APSP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Raphael Yuster","submitted_at":"2010-11-29T10:26:27Z","abstract_excerpt":"We present a new randomized algorithm for computing the diameter of a weighted directed graph. The algorithm runs in $\\Ot(M^{\\w/(\\w+1)}n^{(\\w^2+3)/(\\w+1)})$ time, where $\\w < 2.376$ is the exponent of fast matrix multiplication, $n$ is the number of vertices of the graph, and the edge weights are integers in $\\{-M,...,0,...,M\\}$. For bounded integer weights the running time is $O(n^{2.561})$ and if $\\w=2+o(1)$ it is $\\Ot(n^{7/3})$. This is the first algorithm that computes the diameter of an integer weighted directed graph polynomially faster than any known All-Pairs Shortest Paths (APSP) algo"},"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":"1011.6181","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-11-29T10:26:27Z","cross_cats_sorted":[],"title_canon_sha256":"ebfa1c919eef1dc6a18f95323bde95f1b5298adfdb61e63f7ddfd0859b90f0ee","abstract_canon_sha256":"66c188ba443429dd6fa479ed01645e28fae64484c8c0d82af0304017953a4cbc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:31:42.047712Z","signature_b64":"gySS6slU7v3qpvXpDQTKxm6QBgooxu5w4gccegyvuCp5eP0Lmhpqdv+9eleekcvJy40QE4Cs3mq7trWIvp0gBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0db4aca1d985c85949d54bbe99baf1286e22ae1f4140b9ee30827d35d39f8284","last_reissued_at":"2026-05-18T04:31:42.047027Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:31:42.047027Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computing the diameter polynomially faster than APSP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Raphael Yuster","submitted_at":"2010-11-29T10:26:27Z","abstract_excerpt":"We present a new randomized algorithm for computing the diameter of a weighted directed graph. The algorithm runs in $\\Ot(M^{\\w/(\\w+1)}n^{(\\w^2+3)/(\\w+1)})$ time, where $\\w < 2.376$ is the exponent of fast matrix multiplication, $n$ is the number of vertices of the graph, and the edge weights are integers in $\\{-M,...,0,...,M\\}$. For bounded integer weights the running time is $O(n^{2.561})$ and if $\\w=2+o(1)$ it is $\\Ot(n^{7/3})$. This is the first algorithm that computes the diameter of an integer weighted directed graph polynomially faster than any known All-Pairs Shortest Paths (APSP) algo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.6181","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":""},"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":"1011.6181","created_at":"2026-05-18T04:31:42.047121+00:00"},{"alias_kind":"arxiv_version","alias_value":"1011.6181v2","created_at":"2026-05-18T04:31:42.047121+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.6181","created_at":"2026-05-18T04:31:42.047121+00:00"},{"alias_kind":"pith_short_12","alias_value":"BW2KZIOZQXEF","created_at":"2026-05-18T12:26:05.355336+00:00"},{"alias_kind":"pith_short_16","alias_value":"BW2KZIOZQXEFSSOV","created_at":"2026-05-18T12:26:05.355336+00:00"},{"alias_kind":"pith_short_8","alias_value":"BW2KZIOZ","created_at":"2026-05-18T12:26:05.355336+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/BW2KZIOZQXEFSSOVJO7JTOXRFB","json":"https://pith.science/pith/BW2KZIOZQXEFSSOVJO7JTOXRFB.json","graph_json":"https://pith.science/api/pith-number/BW2KZIOZQXEFSSOVJO7JTOXRFB/graph.json","events_json":"https://pith.science/api/pith-number/BW2KZIOZQXEFSSOVJO7JTOXRFB/events.json","paper":"https://pith.science/paper/BW2KZIOZ"},"agent_actions":{"view_html":"https://pith.science/pith/BW2KZIOZQXEFSSOVJO7JTOXRFB","download_json":"https://pith.science/pith/BW2KZIOZQXEFSSOVJO7JTOXRFB.json","view_paper":"https://pith.science/paper/BW2KZIOZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1011.6181&json=true","fetch_graph":"https://pith.science/api/pith-number/BW2KZIOZQXEFSSOVJO7JTOXRFB/graph.json","fetch_events":"https://pith.science/api/pith-number/BW2KZIOZQXEFSSOVJO7JTOXRFB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BW2KZIOZQXEFSSOVJO7JTOXRFB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BW2KZIOZQXEFSSOVJO7JTOXRFB/action/storage_attestation","attest_author":"https://pith.science/pith/BW2KZIOZQXEFSSOVJO7JTOXRFB/action/author_attestation","sign_citation":"https://pith.science/pith/BW2KZIOZQXEFSSOVJO7JTOXRFB/action/citation_signature","submit_replication":"https://pith.science/pith/BW2KZIOZQXEFSSOVJO7JTOXRFB/action/replication_record"}},"created_at":"2026-05-18T04:31:42.047121+00:00","updated_at":"2026-05-18T04:31:42.047121+00:00"}