{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:KA6LHDK3O2UX3NLN32XDRHMWBS","short_pith_number":"pith:KA6LHDK3","schema_version":"1.0","canonical_sha256":"503cb38d5b76a97db56ddeae389d960c92d574281b84c7667d9fb01eae71f058","source":{"kind":"arxiv","id":"1803.08719","version":1},"attestation_state":"computed","paper":{"title":"$\\mathcal{O}(k)$-robust spanners in one dimension","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"D\\'aniel Ol\\'ah, Kevin Buchin, Tim Hulshof","submitted_at":"2018-03-23T10:30:51Z","abstract_excerpt":"A geometric $t$-spanner on a set of points in Euclidean space is a graph containing for every pair of points a path of length at most $t$ times the Euclidean distance between the points. Informally, a spanner is $\\mathcal{O}(k)$-robust if deleting $k$ vertices only harms $\\mathcal{O}(k)$ other vertices. We show that on any one-dimensional set of $n$ points, for any $\\varepsilon>0$, there exists an $\\mathcal{O}(k)$-robust $1$-spanner with $\\mathcal{O}(n^{1+\\varepsilon})$ edges. Previously it was only known that $\\mathcal{O}(k)$-robust spanners with $\\mathcal{O}(n^2)$ edges exists and that there"},"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":"1803.08719","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-03-23T10:30:51Z","cross_cats_sorted":[],"title_canon_sha256":"ca87e3b520601dcc7a1bdad352e7b7fc85e2954b9f6bcf7e000caf26d71eda51","abstract_canon_sha256":"3191155a6b4804a69a6fbcac12f5657395e71734e143112d7c032a19cde27b78"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:18.716194Z","signature_b64":"wOS/h3QnVC5xsHdzj2MQZ2tmuUCdcQq5v0/+UOqWit9B1TakvcFXmRcl0M+PZq7yFxw7Br9uagggvBpbFgicAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"503cb38d5b76a97db56ddeae389d960c92d574281b84c7667d9fb01eae71f058","last_reissued_at":"2026-05-18T00:20:18.715539Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:18.715539Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"$\\mathcal{O}(k)$-robust spanners in one dimension","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"D\\'aniel Ol\\'ah, Kevin Buchin, Tim Hulshof","submitted_at":"2018-03-23T10:30:51Z","abstract_excerpt":"A geometric $t$-spanner on a set of points in Euclidean space is a graph containing for every pair of points a path of length at most $t$ times the Euclidean distance between the points. Informally, a spanner is $\\mathcal{O}(k)$-robust if deleting $k$ vertices only harms $\\mathcal{O}(k)$ other vertices. We show that on any one-dimensional set of $n$ points, for any $\\varepsilon>0$, there exists an $\\mathcal{O}(k)$-robust $1$-spanner with $\\mathcal{O}(n^{1+\\varepsilon})$ edges. Previously it was only known that $\\mathcal{O}(k)$-robust spanners with $\\mathcal{O}(n^2)$ edges exists and that there"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.08719","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1803.08719","created_at":"2026-05-18T00:20:18.715629+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.08719v1","created_at":"2026-05-18T00:20:18.715629+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.08719","created_at":"2026-05-18T00:20:18.715629+00:00"},{"alias_kind":"pith_short_12","alias_value":"KA6LHDK3O2UX","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_16","alias_value":"KA6LHDK3O2UX3NLN","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_8","alias_value":"KA6LHDK3","created_at":"2026-05-18T12:32:33.847187+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/KA6LHDK3O2UX3NLN32XDRHMWBS","json":"https://pith.science/pith/KA6LHDK3O2UX3NLN32XDRHMWBS.json","graph_json":"https://pith.science/api/pith-number/KA6LHDK3O2UX3NLN32XDRHMWBS/graph.json","events_json":"https://pith.science/api/pith-number/KA6LHDK3O2UX3NLN32XDRHMWBS/events.json","paper":"https://pith.science/paper/KA6LHDK3"},"agent_actions":{"view_html":"https://pith.science/pith/KA6LHDK3O2UX3NLN32XDRHMWBS","download_json":"https://pith.science/pith/KA6LHDK3O2UX3NLN32XDRHMWBS.json","view_paper":"https://pith.science/paper/KA6LHDK3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.08719&json=true","fetch_graph":"https://pith.science/api/pith-number/KA6LHDK3O2UX3NLN32XDRHMWBS/graph.json","fetch_events":"https://pith.science/api/pith-number/KA6LHDK3O2UX3NLN32XDRHMWBS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KA6LHDK3O2UX3NLN32XDRHMWBS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KA6LHDK3O2UX3NLN32XDRHMWBS/action/storage_attestation","attest_author":"https://pith.science/pith/KA6LHDK3O2UX3NLN32XDRHMWBS/action/author_attestation","sign_citation":"https://pith.science/pith/KA6LHDK3O2UX3NLN32XDRHMWBS/action/citation_signature","submit_replication":"https://pith.science/pith/KA6LHDK3O2UX3NLN32XDRHMWBS/action/replication_record"}},"created_at":"2026-05-18T00:20:18.715629+00:00","updated_at":"2026-05-18T00:20:18.715629+00:00"}