{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:N3FTE3UUXB4F6N7ZUMPX3E4I4M","short_pith_number":"pith:N3FTE3UU","schema_version":"1.0","canonical_sha256":"6ecb326e94b8785f37f9a31f7d9388e31a12d1dbdb29a1fac34490514842c70c","source":{"kind":"arxiv","id":"1112.1116","version":6},"attestation_state":"computed","paper":{"title":"Approximating the Diameter of Planar Graphs in Near Linear Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Oren Weimann, Raphael Yuster","submitted_at":"2011-12-05T22:46:04Z","abstract_excerpt":"We present a $(1+\\epsilon)$-approximation algorithm running in $O(f(\\epsilon)\\cdot n \\log^4 n)$ time for finding the diameter of an undirected planar graph with non-negative edge lengths."},"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":"1112.1116","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-12-05T22:46:04Z","cross_cats_sorted":[],"title_canon_sha256":"154e5a6619331ecc8e0d6a54588478543e3ebb49a73fa9ffd57c83916e7bb940","abstract_canon_sha256":"f6a37e36175c392649d7fe276e8d777803de6f44a1db7ca4b81b3ef376357b3e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:27:33.016418Z","signature_b64":"L+eWYC8bPvqgxPSirvsKbVxLYHgbMWJIv68lLrOrrJhcZ1QvAf9XdDB4ApKZxt6M3Ttp02OdUJM7UnxAEeYJCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6ecb326e94b8785f37f9a31f7d9388e31a12d1dbdb29a1fac34490514842c70c","last_reissued_at":"2026-05-18T03:27:33.015930Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:27:33.015930Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximating the Diameter of Planar Graphs in Near Linear Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Oren Weimann, Raphael Yuster","submitted_at":"2011-12-05T22:46:04Z","abstract_excerpt":"We present a $(1+\\epsilon)$-approximation algorithm running in $O(f(\\epsilon)\\cdot n \\log^4 n)$ time for finding the diameter of an undirected planar graph with non-negative edge lengths."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.1116","kind":"arxiv","version":6},"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":"1112.1116","created_at":"2026-05-18T03:27:33.015999+00:00"},{"alias_kind":"arxiv_version","alias_value":"1112.1116v6","created_at":"2026-05-18T03:27:33.015999+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.1116","created_at":"2026-05-18T03:27:33.015999+00:00"},{"alias_kind":"pith_short_12","alias_value":"N3FTE3UUXB4F","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_16","alias_value":"N3FTE3UUXB4F6N7Z","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_8","alias_value":"N3FTE3UU","created_at":"2026-05-18T12:26:37.096874+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/N3FTE3UUXB4F6N7ZUMPX3E4I4M","json":"https://pith.science/pith/N3FTE3UUXB4F6N7ZUMPX3E4I4M.json","graph_json":"https://pith.science/api/pith-number/N3FTE3UUXB4F6N7ZUMPX3E4I4M/graph.json","events_json":"https://pith.science/api/pith-number/N3FTE3UUXB4F6N7ZUMPX3E4I4M/events.json","paper":"https://pith.science/paper/N3FTE3UU"},"agent_actions":{"view_html":"https://pith.science/pith/N3FTE3UUXB4F6N7ZUMPX3E4I4M","download_json":"https://pith.science/pith/N3FTE3UUXB4F6N7ZUMPX3E4I4M.json","view_paper":"https://pith.science/paper/N3FTE3UU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1112.1116&json=true","fetch_graph":"https://pith.science/api/pith-number/N3FTE3UUXB4F6N7ZUMPX3E4I4M/graph.json","fetch_events":"https://pith.science/api/pith-number/N3FTE3UUXB4F6N7ZUMPX3E4I4M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N3FTE3UUXB4F6N7ZUMPX3E4I4M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N3FTE3UUXB4F6N7ZUMPX3E4I4M/action/storage_attestation","attest_author":"https://pith.science/pith/N3FTE3UUXB4F6N7ZUMPX3E4I4M/action/author_attestation","sign_citation":"https://pith.science/pith/N3FTE3UUXB4F6N7ZUMPX3E4I4M/action/citation_signature","submit_replication":"https://pith.science/pith/N3FTE3UUXB4F6N7ZUMPX3E4I4M/action/replication_record"}},"created_at":"2026-05-18T03:27:33.015999+00:00","updated_at":"2026-05-18T03:27:33.015999+00:00"}