{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:TXSBCWAOYOW6FWQFAA6H2QQ4VI","short_pith_number":"pith:TXSBCWAO","schema_version":"1.0","canonical_sha256":"9de411580ec3ade2da05003c7d421caa1097d9790c180623dc0cba11abc860b4","source":{"kind":"arxiv","id":"1812.09913","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1812.09913","created_at":"2026-05-17T23:56:52.471714+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.09913v2","created_at":"2026-05-17T23:56:52.471714+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.09913","created_at":"2026-05-17T23:56:52.471714+00:00"},{"alias_kind":"pith_short_12","alias_value":"TXSBCWAOYOW6","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_16","alias_value":"TXSBCWAOYOW6FWQF","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_8","alias_value":"TXSBCWAO","created_at":"2026-05-18T12:32:56.356000+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/TXSBCWAOYOW6FWQFAA6H2QQ4VI","json":"https://pith.science/pith/TXSBCWAOYOW6FWQFAA6H2QQ4VI.json","graph_json":"https://pith.science/api/pith-number/TXSBCWAOYOW6FWQFAA6H2QQ4VI/graph.json","events_json":"https://pith.science/api/pith-number/TXSBCWAOYOW6FWQFAA6H2QQ4VI/events.json","paper":"https://pith.science/paper/TXSBCWAO"},"agent_actions":{"view_html":"https://pith.science/pith/TXSBCWAOYOW6FWQFAA6H2QQ4VI","download_json":"https://pith.science/pith/TXSBCWAOYOW6FWQFAA6H2QQ4VI.json","view_paper":"https://pith.science/paper/TXSBCWAO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.09913&json=true","fetch_graph":"https://pith.science/api/pith-number/TXSBCWAOYOW6FWQFAA6H2QQ4VI/graph.json","fetch_events":"https://pith.science/api/pith-number/TXSBCWAOYOW6FWQFAA6H2QQ4VI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TXSBCWAOYOW6FWQFAA6H2QQ4VI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TXSBCWAOYOW6FWQFAA6H2QQ4VI/action/storage_attestation","attest_author":"https://pith.science/pith/TXSBCWAOYOW6FWQFAA6H2QQ4VI/action/author_attestation","sign_citation":"https://pith.science/pith/TXSBCWAOYOW6FWQFAA6H2QQ4VI/action/citation_signature","submit_replication":"https://pith.science/pith/TXSBCWAOYOW6FWQFAA6H2QQ4VI/action/replication_record"}},"created_at":"2026-05-17T23:56:52.471714+00:00","updated_at":"2026-05-17T23:56:52.471714+00:00"}