{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:BW2KZIOZQXEFSSOVJO7JTOXRFB","short_pith_number":"pith:BW2KZIOZ","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"},"canonical_sha256":"0db4aca1d985c85949d54bbe99baf1286e22ae1f4140b9ee30827d35d39f8284","source":{"kind":"arxiv","id":"1011.6181","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.6181","created_at":"2026-05-18T04:31:42Z"},{"alias_kind":"arxiv_version","alias_value":"1011.6181v2","created_at":"2026-05-18T04:31:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.6181","created_at":"2026-05-18T04:31:42Z"},{"alias_kind":"pith_short_12","alias_value":"BW2KZIOZQXEF","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_16","alias_value":"BW2KZIOZQXEFSSOV","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_8","alias_value":"BW2KZIOZ","created_at":"2026-05-18T12:26:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:BW2KZIOZQXEFSSOVJO7JTOXRFB","target":"record","payload":{"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"},"canonical_sha256":"0db4aca1d985c85949d54bbe99baf1286e22ae1f4140b9ee30827d35d39f8284","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"},"source_kind":"arxiv","source_id":"1011.6181","source_version":2,"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-05-18T04:31:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1hknIg6EKM59AwykcLKvInk+Hg7d06fDcNgbiOJuRFA12k03bCTF64DIoWExeAe6qi9iXu0MNnNx+TdOrI8TBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-18T20:38:47.546466Z"},"content_sha256":"2dc93a5daefa50279b32c8c5405df95439b58506d1fb710ea1a8a7d2c8ffa131","schema_version":"1.0","event_id":"sha256:2dc93a5daefa50279b32c8c5405df95439b58506d1fb710ea1a8a7d2c8ffa131"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:BW2KZIOZQXEFSSOVJO7JTOXRFB","target":"graph","payload":{"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"},"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-05-18T04:31:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7SJa7j96fWn37G3Cb9yehdlq8M3LbPeCSEt6N6OnR5W1x7VfPn+xeVL6jzrCNyFY1uTp7aGokedV/Xz/C+THCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-18T20:38:47.547099Z"},"content_sha256":"cc81d095dd874790d9e138c7583312adb1648d865ea4b3cda42c149cece95198","schema_version":"1.0","event_id":"sha256:cc81d095dd874790d9e138c7583312adb1648d865ea4b3cda42c149cece95198"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BW2KZIOZQXEFSSOVJO7JTOXRFB/bundle.json","state_url":"https://pith.science/pith/BW2KZIOZQXEFSSOVJO7JTOXRFB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BW2KZIOZQXEFSSOVJO7JTOXRFB/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-05-18T20:38:47Z","links":{"resolver":"https://pith.science/pith/BW2KZIOZQXEFSSOVJO7JTOXRFB","bundle":"https://pith.science/pith/BW2KZIOZQXEFSSOVJO7JTOXRFB/bundle.json","state":"https://pith.science/pith/BW2KZIOZQXEFSSOVJO7JTOXRFB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BW2KZIOZQXEFSSOVJO7JTOXRFB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:BW2KZIOZQXEFSSOVJO7JTOXRFB","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":"66c188ba443429dd6fa479ed01645e28fae64484c8c0d82af0304017953a4cbc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-11-29T10:26:27Z","title_canon_sha256":"ebfa1c919eef1dc6a18f95323bde95f1b5298adfdb61e63f7ddfd0859b90f0ee"},"schema_version":"1.0","source":{"id":"1011.6181","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.6181","created_at":"2026-05-18T04:31:42Z"},{"alias_kind":"arxiv_version","alias_value":"1011.6181v2","created_at":"2026-05-18T04:31:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.6181","created_at":"2026-05-18T04:31:42Z"},{"alias_kind":"pith_short_12","alias_value":"BW2KZIOZQXEF","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_16","alias_value":"BW2KZIOZQXEFSSOV","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_8","alias_value":"BW2KZIOZ","created_at":"2026-05-18T12:26:05Z"}],"graph_snapshots":[{"event_id":"sha256:cc81d095dd874790d9e138c7583312adb1648d865ea4b3cda42c149cece95198","target":"graph","created_at":"2026-05-18T04:31:42Z","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"},"paper":{"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","authors_text":"Raphael Yuster","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-11-29T10:26:27Z","title":"Computing the diameter polynomially faster than APSP"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.6181","kind":"arxiv","version":2},"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:2dc93a5daefa50279b32c8c5405df95439b58506d1fb710ea1a8a7d2c8ffa131","target":"record","created_at":"2026-05-18T04:31:42Z","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":"66c188ba443429dd6fa479ed01645e28fae64484c8c0d82af0304017953a4cbc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-11-29T10:26:27Z","title_canon_sha256":"ebfa1c919eef1dc6a18f95323bde95f1b5298adfdb61e63f7ddfd0859b90f0ee"},"schema_version":"1.0","source":{"id":"1011.6181","kind":"arxiv","version":2}},"canonical_sha256":"0db4aca1d985c85949d54bbe99baf1286e22ae1f4140b9ee30827d35d39f8284","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0db4aca1d985c85949d54bbe99baf1286e22ae1f4140b9ee30827d35d39f8284","first_computed_at":"2026-05-18T04:31:42.047027Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:31:42.047027Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gySS6slU7v3qpvXpDQTKxm6QBgooxu5w4gccegyvuCp5eP0Lmhpqdv+9eleekcvJy40QE4Cs3mq7trWIvp0gBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:31:42.047712Z","signed_message":"canonical_sha256_bytes"},"source_id":"1011.6181","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2dc93a5daefa50279b32c8c5405df95439b58506d1fb710ea1a8a7d2c8ffa131","sha256:cc81d095dd874790d9e138c7583312adb1648d865ea4b3cda42c149cece95198"],"state_sha256":"4501f194269652d88e5a82ec288f6cd98fa57d704d8499e0d5f43199602e635b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AR+yfFdJCFZY1+odKQcMNIN9kIcMqb0t5aiUGF7uLrZJZ8E2VxP/SunRHl9/XWdgPRhGkUL3EKGXpC6RH/1hBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-18T20:38:47.549264Z","bundle_sha256":"1b9489643c47ba898206467811004ece791e7e2a2bda5807ae9ef74a3b7ea887"}}