{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:LFDSRSFZSQ3RCQH2TJIE73PKAK","short_pith_number":"pith:LFDSRSFZ","canonical_record":{"source":{"id":"1104.5214","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-04-27T18:57:20Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"6693741794cac0d2e0b29773a6eed75478e43b7d8add31d68b249d1c3ba2a4fd","abstract_canon_sha256":"8f1abf16c4e8c84539517df083d4852bdf92f3b9445d3f2256f56e137796f580"},"schema_version":"1.0"},"canonical_sha256":"594728c8b994371140fa9a504fedea028a5c7ed51f45f409bd1010d2508afdaa","source":{"kind":"arxiv","id":"1104.5214","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.5214","created_at":"2026-05-18T04:08:34Z"},{"alias_kind":"arxiv_version","alias_value":"1104.5214v1","created_at":"2026-05-18T04:08:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.5214","created_at":"2026-05-18T04:08:34Z"},{"alias_kind":"pith_short_12","alias_value":"LFDSRSFZSQ3R","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"LFDSRSFZSQ3RCQH2","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"LFDSRSFZ","created_at":"2026-05-18T12:26:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:LFDSRSFZSQ3RCQH2TJIE73PKAK","target":"record","payload":{"canonical_record":{"source":{"id":"1104.5214","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-04-27T18:57:20Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"6693741794cac0d2e0b29773a6eed75478e43b7d8add31d68b249d1c3ba2a4fd","abstract_canon_sha256":"8f1abf16c4e8c84539517df083d4852bdf92f3b9445d3f2256f56e137796f580"},"schema_version":"1.0"},"canonical_sha256":"594728c8b994371140fa9a504fedea028a5c7ed51f45f409bd1010d2508afdaa","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:08:34.693144Z","signature_b64":"tWIFokXvCbLo3cDjFAa38kll1MQhZsSUtemcfDFXMeaxYyoHI6FxlENPwml0ROKFp3GOy92HMgA6beTdKVWGDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"594728c8b994371140fa9a504fedea028a5c7ed51f45f409bd1010d2508afdaa","last_reissued_at":"2026-05-18T04:08:34.692700Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:08:34.692700Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1104.5214","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-18T04:08:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8f9ckKBCedvq4T0q5jQAS3OnWNGLsCjTnZpDXSY/i/6BqupsMWpqEwXAxvkboKobw/L2e92OVmTwfOt+WAjEBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T13:08:13.609472Z"},"content_sha256":"a5809a7e1856e5a634eda48aa9c9bb0ee18a6df53598e99d6d7ffcb122a33829","schema_version":"1.0","event_id":"sha256:a5809a7e1856e5a634eda48aa9c9bb0ee18a6df53598e99d6d7ffcb122a33829"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:LFDSRSFZSQ3RCQH2TJIE73PKAK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Linear-Space Approximate Distance Oracles for Planar, Bounded-Genus, and Minor-Free Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Christian Sommer, Ken-ichi Kawarabayashi, Philip N. Klein","submitted_at":"2011-04-27T18:57:20Z","abstract_excerpt":"A (1 + eps)-approximate distance oracle for a graph is a data structure that supports approximate point-to-point shortest-path-distance queries. The most relevant measures for a distance-oracle construction are: space, query time, and preprocessing time. There are strong distance-oracle constructions known for planar graphs (Thorup, JACM'04) and, subsequently, minor-excluded graphs (Abraham and Gavoille, PODC'06). However, these require Omega(eps^{-1} n lg n) space for n-node graphs. We argue that a very low space requirement is essential. Since modern computer architectures involve hierarchic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.5214","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-18T04:08:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HVNu9gnI5FCJQL77V3agVnqjAzy1cSg5VM+UMPs3PGoMSm7asw27k5hJ3AkKOgJkDZ+3oxzfelc7aStOP5H9BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T13:08:13.609814Z"},"content_sha256":"92e983020a2e5b0cbc413c048c1778e1fa9e10493b65defd6683feec503a5fea","schema_version":"1.0","event_id":"sha256:92e983020a2e5b0cbc413c048c1778e1fa9e10493b65defd6683feec503a5fea"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LFDSRSFZSQ3RCQH2TJIE73PKAK/bundle.json","state_url":"https://pith.science/pith/LFDSRSFZSQ3RCQH2TJIE73PKAK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LFDSRSFZSQ3RCQH2TJIE73PKAK/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-03T13:08:13Z","links":{"resolver":"https://pith.science/pith/LFDSRSFZSQ3RCQH2TJIE73PKAK","bundle":"https://pith.science/pith/LFDSRSFZSQ3RCQH2TJIE73PKAK/bundle.json","state":"https://pith.science/pith/LFDSRSFZSQ3RCQH2TJIE73PKAK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LFDSRSFZSQ3RCQH2TJIE73PKAK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:LFDSRSFZSQ3RCQH2TJIE73PKAK","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":"8f1abf16c4e8c84539517df083d4852bdf92f3b9445d3f2256f56e137796f580","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-04-27T18:57:20Z","title_canon_sha256":"6693741794cac0d2e0b29773a6eed75478e43b7d8add31d68b249d1c3ba2a4fd"},"schema_version":"1.0","source":{"id":"1104.5214","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.5214","created_at":"2026-05-18T04:08:34Z"},{"alias_kind":"arxiv_version","alias_value":"1104.5214v1","created_at":"2026-05-18T04:08:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.5214","created_at":"2026-05-18T04:08:34Z"},{"alias_kind":"pith_short_12","alias_value":"LFDSRSFZSQ3R","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"LFDSRSFZSQ3RCQH2","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"LFDSRSFZ","created_at":"2026-05-18T12:26:34Z"}],"graph_snapshots":[{"event_id":"sha256:92e983020a2e5b0cbc413c048c1778e1fa9e10493b65defd6683feec503a5fea","target":"graph","created_at":"2026-05-18T04:08:34Z","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":"A (1 + eps)-approximate distance oracle for a graph is a data structure that supports approximate point-to-point shortest-path-distance queries. The most relevant measures for a distance-oracle construction are: space, query time, and preprocessing time. There are strong distance-oracle constructions known for planar graphs (Thorup, JACM'04) and, subsequently, minor-excluded graphs (Abraham and Gavoille, PODC'06). However, these require Omega(eps^{-1} n lg n) space for n-node graphs. We argue that a very low space requirement is essential. Since modern computer architectures involve hierarchic","authors_text":"Christian Sommer, Ken-ichi Kawarabayashi, Philip N. Klein","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-04-27T18:57:20Z","title":"Linear-Space Approximate Distance Oracles for Planar, Bounded-Genus, and Minor-Free Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.5214","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:a5809a7e1856e5a634eda48aa9c9bb0ee18a6df53598e99d6d7ffcb122a33829","target":"record","created_at":"2026-05-18T04:08:34Z","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":"8f1abf16c4e8c84539517df083d4852bdf92f3b9445d3f2256f56e137796f580","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-04-27T18:57:20Z","title_canon_sha256":"6693741794cac0d2e0b29773a6eed75478e43b7d8add31d68b249d1c3ba2a4fd"},"schema_version":"1.0","source":{"id":"1104.5214","kind":"arxiv","version":1}},"canonical_sha256":"594728c8b994371140fa9a504fedea028a5c7ed51f45f409bd1010d2508afdaa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"594728c8b994371140fa9a504fedea028a5c7ed51f45f409bd1010d2508afdaa","first_computed_at":"2026-05-18T04:08:34.692700Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:08:34.692700Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tWIFokXvCbLo3cDjFAa38kll1MQhZsSUtemcfDFXMeaxYyoHI6FxlENPwml0ROKFp3GOy92HMgA6beTdKVWGDA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:08:34.693144Z","signed_message":"canonical_sha256_bytes"},"source_id":"1104.5214","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a5809a7e1856e5a634eda48aa9c9bb0ee18a6df53598e99d6d7ffcb122a33829","sha256:92e983020a2e5b0cbc413c048c1778e1fa9e10493b65defd6683feec503a5fea"],"state_sha256":"b2d0de07faba9d6ad022a3af4bc5977c43916c1c5adee3783e42f933e64589d1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BGJHKmGfyc2LRZ+FiKyByf4h/7BMVJZTaPGq+PR2gGPxpE1eJpaGgEegZZ9CRmhl7OCD6PbFJLMsrqVhP/QOBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T13:08:13.611755Z","bundle_sha256":"353f051da13c6d56a9ad7f0f46d4ee49ac67af118be3721294b539b2bc777118"}}