{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:CUJVGCLQMMSGRZGC76GPKUKDGW","short_pith_number":"pith:CUJVGCLQ","schema_version":"1.0","canonical_sha256":"1513530970632468e4c2ff8cf5514335aabce3ce302d0ac1dc572f12cfb4001e","source":{"kind":"arxiv","id":"2604.25397","version":1},"attestation_state":"computed","paper":{"title":"A dynamic $(1+\\varepsilon)$-spanner for disk intersection graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Persistent data structures maintain a (1+ε)-spanner for dynamic disk intersection graphs with bounded diameters.","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Eva Rotenberg, Ivor van der Hoog, Johanne M. Vistisen, Sampson Wong, Sarita de Berg","submitted_at":"2026-04-28T09:07:25Z","abstract_excerpt":"We maintain a $(1+\\varepsilon)$-spanner over the disk intersection graph of a dynamic set of disks. We restrict all disks to have their diameter in $[4,\\Psi]$ for some fixed and known $\\Psi$. The resulting $(1+\\varepsilon)$-spanner has size $O(n \\varepsilon^{-2} \\log \\Psi \\log (\\varepsilon^{-1}))$, where $n$ is the present number of disks.\n  We develop a novel use of persistent data structures to dynamically maintain our $(1+\\varepsilon)$-spanner. Our approach requires $O(\\varepsilon^{-2} n \\log^4 n \\log \\Psi)$ space and has an $O( \\left( \\frac{\\Psi}{\\varepsilon} \\right)^2 \\log^4 n \\log^2 \\Psi"},"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":true,"formal_links_present":false},"canonical_record":{"source":{"id":"2604.25397","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2026-04-28T09:07:25Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"f5df67445dee46faef61c3c755fba7e8b52f71261903e5d8a076c96b6148a4fe","abstract_canon_sha256":"443f7d519b2f2ae5343e757fd1c45ee26c253a54a4c7631ef644a95efa52f1f3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:00:39.479418Z","signature_b64":"YNbI7DLGm393Qw3Zi59jVxWDKNramCkKKfZ0vf5vBzHgBQGYwBV5lC8WrZhqndgn5dAaDgav6ojE+e+uzp5zCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1513530970632468e4c2ff8cf5514335aabce3ce302d0ac1dc572f12cfb4001e","last_reissued_at":"2026-05-20T00:00:39.478666Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:00:39.478666Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A dynamic $(1+\\varepsilon)$-spanner for disk intersection graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Persistent data structures maintain a (1+ε)-spanner for dynamic disk intersection graphs with bounded diameters.","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Eva Rotenberg, Ivor van der Hoog, Johanne M. Vistisen, Sampson Wong, Sarita de Berg","submitted_at":"2026-04-28T09:07:25Z","abstract_excerpt":"We maintain a $(1+\\varepsilon)$-spanner over the disk intersection graph of a dynamic set of disks. We restrict all disks to have their diameter in $[4,\\Psi]$ for some fixed and known $\\Psi$. The resulting $(1+\\varepsilon)$-spanner has size $O(n \\varepsilon^{-2} \\log \\Psi \\log (\\varepsilon^{-1}))$, where $n$ is the present number of disks.\n  We develop a novel use of persistent data structures to dynamically maintain our $(1+\\varepsilon)$-spanner. Our approach requires $O(\\varepsilon^{-2} n \\log^4 n \\log \\Psi)$ space and has an $O( \\left( \\frac{\\Psi}{\\varepsilon} \\right)^2 \\log^4 n \\log^2 \\Psi"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We maintain a (1+ε)-spanner over the disk intersection graph of a dynamic set of disks with diameters in [4, Ψ]. The spanner has size O(n ε^{-2} log Ψ log(ε^{-1})), uses O(ε^{-2} n log^4 n log Ψ) space, and supports updates in O((Ψ/ε)^2 log^4 n log^2 Ψ log^2(ε^{-1})) expected amortized time. For constant ε and Ψ the bounds become near-linear size, near-linear space, and polylogarithmic updates. The same spanner supports connectivity queries.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"All disks have diameters restricted to the fixed known interval [4, Ψ]; without this bounded-diameter assumption the size and update bounds no longer hold and the persistent-structure approach may not apply directly.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"A dynamic (1+ε)-spanner of size O(n ε^{-2} log Ψ log(ε^{-1})) with O((Ψ/ε)^2 log^4 n log^2 Ψ log^2(ε^{-1})) expected amortized update time for disk intersection graphs with bounded diameters.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Persistent data structures maintain a (1+ε)-spanner for dynamic disk intersection graphs with bounded diameters.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"af50a833922500faa7988ec527bfbcb3785d93942c8355e21fee7d4ef7a174f8"},"source":{"id":"2604.25397","kind":"arxiv","version":1},"verdict":{"id":"e059a77a-5dc2-421b-95ee-b9d06aca6d18","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-07T13:48:27.312915Z","strongest_claim":"We maintain a (1+ε)-spanner over the disk intersection graph of a dynamic set of disks with diameters in [4, Ψ]. The spanner has size O(n ε^{-2} log Ψ log(ε^{-1})), uses O(ε^{-2} n log^4 n log Ψ) space, and supports updates in O((Ψ/ε)^2 log^4 n log^2 Ψ log^2(ε^{-1})) expected amortized time. For constant ε and Ψ the bounds become near-linear size, near-linear space, and polylogarithmic updates. The same spanner supports connectivity queries.","one_line_summary":"A dynamic (1+ε)-spanner of size O(n ε^{-2} log Ψ log(ε^{-1})) with O((Ψ/ε)^2 log^4 n log^2 Ψ log^2(ε^{-1})) expected amortized update time for disk intersection graphs with bounded diameters.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"All disks have diameters restricted to the fixed known interval [4, Ψ]; without this bounded-diameter assumption the size and update bounds no longer hold and the persistent-structure approach may not apply directly.","pith_extraction_headline":"Persistent data structures maintain a (1+ε)-spanner for dynamic disk intersection graphs with bounded diameters."},"integrity":{"clean":false,"summary":{"advisory":1,"critical":0,"by_detector":{"doi_compliance":{"total":1,"advisory":1,"critical":0,"informational":0}},"informational":0},"endpoint":"/pith/2604.25397/integrity.json","findings":[{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1016/J.COMGEO.2022.101979.48) was visible in the surrounding text but could not be confirmed against doi.org as printed.","detector":"doi_compliance","severity":"advisory","ref_index":14,"audited_at":"2026-05-19T21:12:15.013657Z","detected_doi":"10.1016/J.COMGEO.2022.101979.48","finding_type":"recoverable_identifier","verdict_class":"incontrovertible","detected_arxiv_id":null}],"available":true,"detectors_run":[{"name":"doi_compliance","ran_at":"2026-05-19T21:12:15.013657Z","status":"completed","version":"1.0.0","findings_count":1}],"snapshot_sha256":"c76144c57fc1b6f7a82e85537dfa06f7242cbcff618859fcc00dd3af2fbcc2fc"},"references":{"count":17,"sample":[{"doi":"10.4230/lipics.socg.2015.186","year":2015,"title":"Geometric spanners for points inside a polygonal domain","work_id":"0ededbb4-271e-423c-9d04-3ff5162f4961","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1109/sfcs.1998.743504","year":1998,"title":"4 Ingo Althöfer, Gautam Das, David P","work_id":"761aec79-405c-4087-82b5-4f9db1202504","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1007/bf02189308","year":2025,"title":"5 Shinwoo An, Eunjin Oh, and Jie Xue","work_id":"a59d4e23-f6fc-4acd-9015-9584ea95565e","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1137/19m1246493","year":null,"title":"34 A dynamic(1 +ε)-spanner for disk intersection graphs 21 Timothy M","work_id":"2aa90d24-5a25-4e4e-bea4-75e42b3ffacb","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.4230/lipics.socg.2023.23","year":2023,"title":"doi:10.4230/LIPIcs.SoCG.2023.23","work_id":"d4148f61-83b1-470d-98b3-989791f3c829","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":17,"snapshot_sha256":"8ad569cbdf07861b71cad2fc81e87c588c79e8c3b5c08d53088e303d0da2e547","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":"2604.25397","created_at":"2026-05-20T00:00:39.478789+00:00"},{"alias_kind":"arxiv_version","alias_value":"2604.25397v1","created_at":"2026-05-20T00:00:39.478789+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.25397","created_at":"2026-05-20T00:00:39.478789+00:00"},{"alias_kind":"pith_short_12","alias_value":"CUJVGCLQMMSG","created_at":"2026-05-20T00:00:39.478789+00:00"},{"alias_kind":"pith_short_16","alias_value":"CUJVGCLQMMSGRZGC","created_at":"2026-05-20T00:00:39.478789+00:00"},{"alias_kind":"pith_short_8","alias_value":"CUJVGCLQ","created_at":"2026-05-20T00:00:39.478789+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/CUJVGCLQMMSGRZGC76GPKUKDGW","json":"https://pith.science/pith/CUJVGCLQMMSGRZGC76GPKUKDGW.json","graph_json":"https://pith.science/api/pith-number/CUJVGCLQMMSGRZGC76GPKUKDGW/graph.json","events_json":"https://pith.science/api/pith-number/CUJVGCLQMMSGRZGC76GPKUKDGW/events.json","paper":"https://pith.science/paper/CUJVGCLQ"},"agent_actions":{"view_html":"https://pith.science/pith/CUJVGCLQMMSGRZGC76GPKUKDGW","download_json":"https://pith.science/pith/CUJVGCLQMMSGRZGC76GPKUKDGW.json","view_paper":"https://pith.science/paper/CUJVGCLQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2604.25397&json=true","fetch_graph":"https://pith.science/api/pith-number/CUJVGCLQMMSGRZGC76GPKUKDGW/graph.json","fetch_events":"https://pith.science/api/pith-number/CUJVGCLQMMSGRZGC76GPKUKDGW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CUJVGCLQMMSGRZGC76GPKUKDGW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CUJVGCLQMMSGRZGC76GPKUKDGW/action/storage_attestation","attest_author":"https://pith.science/pith/CUJVGCLQMMSGRZGC76GPKUKDGW/action/author_attestation","sign_citation":"https://pith.science/pith/CUJVGCLQMMSGRZGC76GPKUKDGW/action/citation_signature","submit_replication":"https://pith.science/pith/CUJVGCLQMMSGRZGC76GPKUKDGW/action/replication_record"}},"created_at":"2026-05-20T00:00:39.478789+00:00","updated_at":"2026-05-20T00:00:39.478789+00:00"}