{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:T7MUQU75A6S6KQJCWUNXQGXRZP","short_pith_number":"pith:T7MUQU75","schema_version":"1.0","canonical_sha256":"9fd94853fd07a5e54122b51b781af1cbfd34813682298bce9e34adc030ecf318","source":{"kind":"arxiv","id":"2311.18365","version":1},"attestation_state":"computed","paper":{"title":"Fully Dynamic Algorithms for Euclidean Steiner Tree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Bo Wang, Gramoz Goranci, Quan Xue, Shaofeng H.-C. Jiang, T-H. Hubert Chan","submitted_at":"2023-11-30T09:04:33Z","abstract_excerpt":"The Euclidean Steiner tree problem asks to find a min-cost metric graph that connects a given set of \\emph{terminal} points $X$ in $\\mathbb{R}^d$, possibly using points not in $X$ which are called Steiner points. Even though near-linear time $(1 + \\epsilon)$-approximation was obtained in the offline setting in seminal works of Arora and Mitchell, efficient dynamic algorithms for Steiner tree is still open. We give the first algorithm that (implicitly) maintains a $(1 + \\epsilon)$-approximate solution which is accessed via a set of tree traversal queries, subject to point insertion and deletion"},"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":"2311.18365","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2023-11-30T09:04:33Z","cross_cats_sorted":[],"title_canon_sha256":"c055a97eff259c93a1c8fd0cf6c2e4c872749f4d23717ededd4bf3047f754f91","abstract_canon_sha256":"f965712259c564da2a714c2e354fa70a0d255a69fb390b5bc282c98c77d90936"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:18:41.418394Z","signature_b64":"rbKoY4uUzpEK58NoeZaEFHXu0nc46GRYhrBBMXp2YuhRPYIoS5udDiznwYg/lhuAYr8GwwjjbFUx2EGIlPtmBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9fd94853fd07a5e54122b51b781af1cbfd34813682298bce9e34adc030ecf318","last_reissued_at":"2026-07-05T07:18:41.418045Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:18:41.418045Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fully Dynamic Algorithms for Euclidean Steiner Tree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Bo Wang, Gramoz Goranci, Quan Xue, Shaofeng H.-C. Jiang, T-H. Hubert Chan","submitted_at":"2023-11-30T09:04:33Z","abstract_excerpt":"The Euclidean Steiner tree problem asks to find a min-cost metric graph that connects a given set of \\emph{terminal} points $X$ in $\\mathbb{R}^d$, possibly using points not in $X$ which are called Steiner points. Even though near-linear time $(1 + \\epsilon)$-approximation was obtained in the offline setting in seminal works of Arora and Mitchell, efficient dynamic algorithms for Steiner tree is still open. We give the first algorithm that (implicitly) maintains a $(1 + \\epsilon)$-approximate solution which is accessed via a set of tree traversal queries, subject to point insertion and deletion"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.18365","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2311.18365/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2311.18365","created_at":"2026-07-05T07:18:41.418098+00:00"},{"alias_kind":"arxiv_version","alias_value":"2311.18365v1","created_at":"2026-07-05T07:18:41.418098+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.18365","created_at":"2026-07-05T07:18:41.418098+00:00"},{"alias_kind":"pith_short_12","alias_value":"T7MUQU75A6S6","created_at":"2026-07-05T07:18:41.418098+00:00"},{"alias_kind":"pith_short_16","alias_value":"T7MUQU75A6S6KQJC","created_at":"2026-07-05T07:18:41.418098+00:00"},{"alias_kind":"pith_short_8","alias_value":"T7MUQU75","created_at":"2026-07-05T07:18:41.418098+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/T7MUQU75A6S6KQJCWUNXQGXRZP","json":"https://pith.science/pith/T7MUQU75A6S6KQJCWUNXQGXRZP.json","graph_json":"https://pith.science/api/pith-number/T7MUQU75A6S6KQJCWUNXQGXRZP/graph.json","events_json":"https://pith.science/api/pith-number/T7MUQU75A6S6KQJCWUNXQGXRZP/events.json","paper":"https://pith.science/paper/T7MUQU75"},"agent_actions":{"view_html":"https://pith.science/pith/T7MUQU75A6S6KQJCWUNXQGXRZP","download_json":"https://pith.science/pith/T7MUQU75A6S6KQJCWUNXQGXRZP.json","view_paper":"https://pith.science/paper/T7MUQU75","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2311.18365&json=true","fetch_graph":"https://pith.science/api/pith-number/T7MUQU75A6S6KQJCWUNXQGXRZP/graph.json","fetch_events":"https://pith.science/api/pith-number/T7MUQU75A6S6KQJCWUNXQGXRZP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T7MUQU75A6S6KQJCWUNXQGXRZP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T7MUQU75A6S6KQJCWUNXQGXRZP/action/storage_attestation","attest_author":"https://pith.science/pith/T7MUQU75A6S6KQJCWUNXQGXRZP/action/author_attestation","sign_citation":"https://pith.science/pith/T7MUQU75A6S6KQJCWUNXQGXRZP/action/citation_signature","submit_replication":"https://pith.science/pith/T7MUQU75A6S6KQJCWUNXQGXRZP/action/replication_record"}},"created_at":"2026-07-05T07:18:41.418098+00:00","updated_at":"2026-07-05T07:18:41.418098+00:00"}