{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:TCPNLLELUY4HY2ZPRGWUBZD6H5","short_pith_number":"pith:TCPNLLEL","canonical_record":{"source":{"id":"1207.3622","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-07-16T10:25:13Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"dd27a7cea9698da0b2b28102e1a3417ad79d43702173a896f7e337a34575c214","abstract_canon_sha256":"fbdaa00cc5116f7e9ff2bedc108a976fd4f221fa12b2cf83aa0afe5b92b51be4"},"schema_version":"1.0"},"canonical_sha256":"989ed5ac8ba6387c6b2f89ad40e47e3f40445c796acaa8dbf6fd7d0354c3babe","source":{"kind":"arxiv","id":"1207.3622","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.3622","created_at":"2026-05-18T03:51:00Z"},{"alias_kind":"arxiv_version","alias_value":"1207.3622v1","created_at":"2026-05-18T03:51:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.3622","created_at":"2026-05-18T03:51:00Z"},{"alias_kind":"pith_short_12","alias_value":"TCPNLLELUY4H","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"TCPNLLELUY4HY2ZP","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"TCPNLLEL","created_at":"2026-05-18T12:27:23Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:TCPNLLELUY4HY2ZPRGWUBZD6H5","target":"record","payload":{"canonical_record":{"source":{"id":"1207.3622","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-07-16T10:25:13Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"dd27a7cea9698da0b2b28102e1a3417ad79d43702173a896f7e337a34575c214","abstract_canon_sha256":"fbdaa00cc5116f7e9ff2bedc108a976fd4f221fa12b2cf83aa0afe5b92b51be4"},"schema_version":"1.0"},"canonical_sha256":"989ed5ac8ba6387c6b2f89ad40e47e3f40445c796acaa8dbf6fd7d0354c3babe","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:51:00.612606Z","signature_b64":"inPubvBxD+vseWPLLhpsUcjYhcJq1OvhPSDy9FglL+j/iFvAacysyKs/NzZCc2XrkenU0Y1sM1Pg2u/7129rBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"989ed5ac8ba6387c6b2f89ad40e47e3f40445c796acaa8dbf6fd7d0354c3babe","last_reissued_at":"2026-05-18T03:51:00.611888Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:51:00.611888Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.3622","source_version":1,"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-18T03:51:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q3pbYTkYxNklN3HjMlB/1DFyX3c7iV+zCXbcIFN67Hbyd4DySudptIOMNOJvW7SXlPZYW/O4UCHj85gUSP1WBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T17:17:03.026331Z"},"content_sha256":"c703529f68209f9c1d9ae03202efba3d1e1221bc1b9a4422918f933537c1e437","schema_version":"1.0","event_id":"sha256:c703529f68209f9c1d9ae03202efba3d1e1221bc1b9a4422918f933537c1e437"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:TCPNLLELUY4HY2ZPRGWUBZD6H5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximating the diameter of a graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Liam Roditty, Virginia Vassilevska Williams","submitted_at":"2012-07-16T10:25:13Z","abstract_excerpt":"In this paper we consider the fundamental problem of approximating the diameter $D$ of directed or undirected graphs. In a seminal paper, Aingworth, Chekuri, Indyk and Motwani [SIAM J. Comput. 1999] presented an algorithm that computes in $\\Ot(m\\sqrt n + n^2)$ time an estimate $\\hat{D}$ for the diameter of an $n$-node, $m$-edge graph, such that $\\lfloor 2/3 D \\rfloor \\leq \\hat{D} \\leq D$. In this paper we present an algorithm that produces the same estimate in $\\Ot(m\\sqrt n)$ expected running time. We then provide strong evidence that a better approximation may be hard to obtain if we insist o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.3622","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":""},"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-18T03:51:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rVoeyEORCWfrlEgm8gLW63Y27ZHp/LPeZzADw3NEfvNYtWtjB1eiqbz4jDIIOKxoOggaZ5fNArUbxgsAQfsbDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T17:17:03.027093Z"},"content_sha256":"04a32807f750270826d214a69b5c75088e351080fd9592cafbf396b29b813b50","schema_version":"1.0","event_id":"sha256:04a32807f750270826d214a69b5c75088e351080fd9592cafbf396b29b813b50"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TCPNLLELUY4HY2ZPRGWUBZD6H5/bundle.json","state_url":"https://pith.science/pith/TCPNLLELUY4HY2ZPRGWUBZD6H5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TCPNLLELUY4HY2ZPRGWUBZD6H5/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-06-11T17:17:03Z","links":{"resolver":"https://pith.science/pith/TCPNLLELUY4HY2ZPRGWUBZD6H5","bundle":"https://pith.science/pith/TCPNLLELUY4HY2ZPRGWUBZD6H5/bundle.json","state":"https://pith.science/pith/TCPNLLELUY4HY2ZPRGWUBZD6H5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TCPNLLELUY4HY2ZPRGWUBZD6H5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:TCPNLLELUY4HY2ZPRGWUBZD6H5","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":"fbdaa00cc5116f7e9ff2bedc108a976fd4f221fa12b2cf83aa0afe5b92b51be4","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-07-16T10:25:13Z","title_canon_sha256":"dd27a7cea9698da0b2b28102e1a3417ad79d43702173a896f7e337a34575c214"},"schema_version":"1.0","source":{"id":"1207.3622","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.3622","created_at":"2026-05-18T03:51:00Z"},{"alias_kind":"arxiv_version","alias_value":"1207.3622v1","created_at":"2026-05-18T03:51:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.3622","created_at":"2026-05-18T03:51:00Z"},{"alias_kind":"pith_short_12","alias_value":"TCPNLLELUY4H","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"TCPNLLELUY4HY2ZP","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"TCPNLLEL","created_at":"2026-05-18T12:27:23Z"}],"graph_snapshots":[{"event_id":"sha256:04a32807f750270826d214a69b5c75088e351080fd9592cafbf396b29b813b50","target":"graph","created_at":"2026-05-18T03:51:00Z","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":"In this paper we consider the fundamental problem of approximating the diameter $D$ of directed or undirected graphs. In a seminal paper, Aingworth, Chekuri, Indyk and Motwani [SIAM J. Comput. 1999] presented an algorithm that computes in $\\Ot(m\\sqrt n + n^2)$ time an estimate $\\hat{D}$ for the diameter of an $n$-node, $m$-edge graph, such that $\\lfloor 2/3 D \\rfloor \\leq \\hat{D} \\leq D$. In this paper we present an algorithm that produces the same estimate in $\\Ot(m\\sqrt n)$ expected running time. We then provide strong evidence that a better approximation may be hard to obtain if we insist o","authors_text":"Liam Roditty, Virginia Vassilevska Williams","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-07-16T10:25:13Z","title":"Approximating the diameter of a graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.3622","kind":"arxiv","version":1},"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:c703529f68209f9c1d9ae03202efba3d1e1221bc1b9a4422918f933537c1e437","target":"record","created_at":"2026-05-18T03:51:00Z","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":"fbdaa00cc5116f7e9ff2bedc108a976fd4f221fa12b2cf83aa0afe5b92b51be4","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-07-16T10:25:13Z","title_canon_sha256":"dd27a7cea9698da0b2b28102e1a3417ad79d43702173a896f7e337a34575c214"},"schema_version":"1.0","source":{"id":"1207.3622","kind":"arxiv","version":1}},"canonical_sha256":"989ed5ac8ba6387c6b2f89ad40e47e3f40445c796acaa8dbf6fd7d0354c3babe","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"989ed5ac8ba6387c6b2f89ad40e47e3f40445c796acaa8dbf6fd7d0354c3babe","first_computed_at":"2026-05-18T03:51:00.611888Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:51:00.611888Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"inPubvBxD+vseWPLLhpsUcjYhcJq1OvhPSDy9FglL+j/iFvAacysyKs/NzZCc2XrkenU0Y1sM1Pg2u/7129rBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:51:00.612606Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.3622","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c703529f68209f9c1d9ae03202efba3d1e1221bc1b9a4422918f933537c1e437","sha256:04a32807f750270826d214a69b5c75088e351080fd9592cafbf396b29b813b50"],"state_sha256":"8bf56ca282218eb303eff6f14cb077d4acab19e189ee8407c27f398d80ba1082"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DalJF2INRjCOgUS9kW43crSw1HXiX8qo9eITLGb73Z7Yhh2zYc3jLPod75/XPuaLVOKYaydlcpHaMZKASNtcDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T17:17:03.031148Z","bundle_sha256":"7630c4ba9cf0fea2a5d1354bfb2d6490aa68ea8dafe8a8b1e94e9726e3b739f1"}}