{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:TXSBCWAOYOW6FWQFAA6H2QQ4VI","short_pith_number":"pith:TXSBCWAO","canonical_record":{"source":{"id":"1812.09913","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-12-24T13:08:31Z","cross_cats_sorted":[],"title_canon_sha256":"53ad59c0bcccf986cef1c2076f8ad917efc6267844f062070d5581303d391630","abstract_canon_sha256":"98669332554ddb9a2ba01965d85acc8ee2d29e7642fbca796583ebefeccddd11"},"schema_version":"1.0"},"canonical_sha256":"9de411580ec3ade2da05003c7d421caa1097d9790c180623dc0cba11abc860b4","source":{"kind":"arxiv","id":"1812.09913","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.09913","created_at":"2026-05-17T23:56:52Z"},{"alias_kind":"arxiv_version","alias_value":"1812.09913v2","created_at":"2026-05-17T23:56:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.09913","created_at":"2026-05-17T23:56:52Z"},{"alias_kind":"pith_short_12","alias_value":"TXSBCWAOYOW6","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"TXSBCWAOYOW6FWQF","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"TXSBCWAO","created_at":"2026-05-18T12:32:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:TXSBCWAOYOW6FWQFAA6H2QQ4VI","target":"record","payload":{"canonical_record":{"source":{"id":"1812.09913","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-12-24T13:08:31Z","cross_cats_sorted":[],"title_canon_sha256":"53ad59c0bcccf986cef1c2076f8ad917efc6267844f062070d5581303d391630","abstract_canon_sha256":"98669332554ddb9a2ba01965d85acc8ee2d29e7642fbca796583ebefeccddd11"},"schema_version":"1.0"},"canonical_sha256":"9de411580ec3ade2da05003c7d421caa1097d9790c180623dc0cba11abc860b4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:52.472088Z","signature_b64":"N5sUY8Clvdg4l3U6wTlaWXHUOSCzcviP2lvYNu42JUcBXMXrTKGUHjC0ZcL7C6XlXsH24dQO3ej0RlcnASP+Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9de411580ec3ade2da05003c7d421caa1097d9790c180623dc0cba11abc860b4","last_reissued_at":"2026-05-17T23:56:52.471647Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:52.471647Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1812.09913","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-17T23:56:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xS8iPB/JsAndLGtsfXZUm2WVJvB5MA/i3q3ixa9vtdSK91roA5tAjJQ7yXj6TnT5bYlcmfISUM23HRZRn6afAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T16:35:53.204156Z"},"content_sha256":"0aab2896c1f8d5a40d35921ce9ea94927e1b3bcdd55e2fc5f06e0b27cf67ab2d","schema_version":"1.0","event_id":"sha256:0aab2896c1f8d5a40d35921ce9ea94927e1b3bcdd55e2fc5f06e0b27cf67ab2d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:TXSBCWAOYOW6FWQFAA6H2QQ4VI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Near-Optimal $O(k)$-Robust Geometric Spanners","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Pat Morin, Paz Carmi, Prosenjit Bose, Vida Dujmovic","submitted_at":"2018-12-24T13:08:31Z","abstract_excerpt":"For any constants $d\\ge 1$, $\\epsilon >0$, $t>1$, and any $n$-point set $P\\subset\\mathbb{R}^d$, we show that there is a geometric graph $G=(P,E)$ having $O(n\\log^2 n\\log\\log n)$ edges with the following property: For any $F\\subseteq P$, there exists $F^+\\supseteq F$, $|F^+| \\le (1+\\epsilon)|F|$ such that, for any pair $p,q\\in P\\setminus F^+$, the graph $G-F$ contains a path from $p$ to $q$ whose (Euclidean) length is at most $t$ times the Euclidean distance between $p$ and $q$.\n  In the terminology of robust spanners (Bose \\et al, SICOMP, 42(4):1720--1736, 2013) the graph $G$ is a $(1+\\epsilon"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.09913","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-17T23:56:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W9ItzWtRKI9rU+jRiCKLd8QM9KCOMRGcx99JCnu2WWwobXEBA/m4CNyQNsQ9nYNB28QMLL9ccGKR5wX1BCjXDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T16:35:53.204829Z"},"content_sha256":"8ee76361bc5706dad47ae5d1162013f77d5bbf20e4cf91cff66d52388c9f22b7","schema_version":"1.0","event_id":"sha256:8ee76361bc5706dad47ae5d1162013f77d5bbf20e4cf91cff66d52388c9f22b7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TXSBCWAOYOW6FWQFAA6H2QQ4VI/bundle.json","state_url":"https://pith.science/pith/TXSBCWAOYOW6FWQFAA6H2QQ4VI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TXSBCWAOYOW6FWQFAA6H2QQ4VI/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-25T16:35:53Z","links":{"resolver":"https://pith.science/pith/TXSBCWAOYOW6FWQFAA6H2QQ4VI","bundle":"https://pith.science/pith/TXSBCWAOYOW6FWQFAA6H2QQ4VI/bundle.json","state":"https://pith.science/pith/TXSBCWAOYOW6FWQFAA6H2QQ4VI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TXSBCWAOYOW6FWQFAA6H2QQ4VI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:TXSBCWAOYOW6FWQFAA6H2QQ4VI","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":"98669332554ddb9a2ba01965d85acc8ee2d29e7642fbca796583ebefeccddd11","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-12-24T13:08:31Z","title_canon_sha256":"53ad59c0bcccf986cef1c2076f8ad917efc6267844f062070d5581303d391630"},"schema_version":"1.0","source":{"id":"1812.09913","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.09913","created_at":"2026-05-17T23:56:52Z"},{"alias_kind":"arxiv_version","alias_value":"1812.09913v2","created_at":"2026-05-17T23:56:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.09913","created_at":"2026-05-17T23:56:52Z"},{"alias_kind":"pith_short_12","alias_value":"TXSBCWAOYOW6","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"TXSBCWAOYOW6FWQF","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"TXSBCWAO","created_at":"2026-05-18T12:32:56Z"}],"graph_snapshots":[{"event_id":"sha256:8ee76361bc5706dad47ae5d1162013f77d5bbf20e4cf91cff66d52388c9f22b7","target":"graph","created_at":"2026-05-17T23:56:52Z","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":"For any constants $d\\ge 1$, $\\epsilon >0$, $t>1$, and any $n$-point set $P\\subset\\mathbb{R}^d$, we show that there is a geometric graph $G=(P,E)$ having $O(n\\log^2 n\\log\\log n)$ edges with the following property: For any $F\\subseteq P$, there exists $F^+\\supseteq F$, $|F^+| \\le (1+\\epsilon)|F|$ such that, for any pair $p,q\\in P\\setminus F^+$, the graph $G-F$ contains a path from $p$ to $q$ whose (Euclidean) length is at most $t$ times the Euclidean distance between $p$ and $q$.\n  In the terminology of robust spanners (Bose \\et al, SICOMP, 42(4):1720--1736, 2013) the graph $G$ is a $(1+\\epsilon","authors_text":"Pat Morin, Paz Carmi, Prosenjit Bose, Vida Dujmovic","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-12-24T13:08:31Z","title":"Near-Optimal $O(k)$-Robust Geometric Spanners"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.09913","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:0aab2896c1f8d5a40d35921ce9ea94927e1b3bcdd55e2fc5f06e0b27cf67ab2d","target":"record","created_at":"2026-05-17T23:56:52Z","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":"98669332554ddb9a2ba01965d85acc8ee2d29e7642fbca796583ebefeccddd11","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-12-24T13:08:31Z","title_canon_sha256":"53ad59c0bcccf986cef1c2076f8ad917efc6267844f062070d5581303d391630"},"schema_version":"1.0","source":{"id":"1812.09913","kind":"arxiv","version":2}},"canonical_sha256":"9de411580ec3ade2da05003c7d421caa1097d9790c180623dc0cba11abc860b4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9de411580ec3ade2da05003c7d421caa1097d9790c180623dc0cba11abc860b4","first_computed_at":"2026-05-17T23:56:52.471647Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:56:52.471647Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"N5sUY8Clvdg4l3U6wTlaWXHUOSCzcviP2lvYNu42JUcBXMXrTKGUHjC0ZcL7C6XlXsH24dQO3ej0RlcnASP+Ag==","signature_status":"signed_v1","signed_at":"2026-05-17T23:56:52.472088Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.09913","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0aab2896c1f8d5a40d35921ce9ea94927e1b3bcdd55e2fc5f06e0b27cf67ab2d","sha256:8ee76361bc5706dad47ae5d1162013f77d5bbf20e4cf91cff66d52388c9f22b7"],"state_sha256":"61052f45b821e42fb4aed892e26839918fb9ee7db82a6f1e2e1e7dc0bf95ee1b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NfK6iXSECRmSwoN8mQDZv4VZTY4wXbhLGar+eyhmNfbQGiZQOQ+FZRl2DxEuxKFIJBmeFmL2Y5UxWo3v5AV/Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T16:35:53.207997Z","bundle_sha256":"19fd60417d9695ca793e7b1321233d676e381cd029e32b59ca4d1858d56a8291"}}