{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:WIEUBEEB7XZV7VCQAMWIOH6FFA","short_pith_number":"pith:WIEUBEEB","schema_version":"1.0","canonical_sha256":"b209409081fdf35fd450032c871fc5283c4a12aedb0607126559060791c2d27f","source":{"kind":"arxiv","id":"1104.0622","version":1},"attestation_state":"computed","paper":{"title":"Kinetic Stable Delaunay Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Haim Kaplan, Jie Gao, Leonidas J. Guibas, Micha Sharir, Natan Rubin, Pankaj K. Agarwal, Vladlen Koltun","submitted_at":"2011-04-04T16:43:45Z","abstract_excerpt":"We consider the problem of maintaining the Euclidean Delaunay triangulation $\\DT$ of a set $P$ of $n$ moving points in the plane, along algebraic trajectories of constant description complexity. Since the best known upper bound on the number of topological changes in the full $\\DT$ is nearly cubic, we seek to maintain a suitable portion of it that is less volatile yet retains many useful properties. We introduce the notion of a stable Delaunay graph, which is a dynamic subgraph of the Delaunay triangulation. The stable Delaunay graph (a) is easy to define, (b) experiences only a nearly quadrat"},"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":"1104.0622","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2011-04-04T16:43:45Z","cross_cats_sorted":[],"title_canon_sha256":"446e3f140b05cab689bf74d49bc157fe8742ac202e1d5c0c17f2c88556e9218a","abstract_canon_sha256":"590475f347dbaf3fa443648d12422d1feca4fd4e2ac7088103fa30d5d4fd52e9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:22:11.152116Z","signature_b64":"zF4Fu+IHtEyIKMqr78NdjTdIrpzHIqk/CcR524YmiW/W9+n36AyKhFFkSfUBL8Q+jltqDt61jIcZFh9HStHHAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b209409081fdf35fd450032c871fc5283c4a12aedb0607126559060791c2d27f","last_reissued_at":"2026-05-18T02:22:11.151678Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:22:11.151678Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Kinetic Stable Delaunay Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Haim Kaplan, Jie Gao, Leonidas J. Guibas, Micha Sharir, Natan Rubin, Pankaj K. Agarwal, Vladlen Koltun","submitted_at":"2011-04-04T16:43:45Z","abstract_excerpt":"We consider the problem of maintaining the Euclidean Delaunay triangulation $\\DT$ of a set $P$ of $n$ moving points in the plane, along algebraic trajectories of constant description complexity. Since the best known upper bound on the number of topological changes in the full $\\DT$ is nearly cubic, we seek to maintain a suitable portion of it that is less volatile yet retains many useful properties. We introduce the notion of a stable Delaunay graph, which is a dynamic subgraph of the Delaunay triangulation. The stable Delaunay graph (a) is easy to define, (b) experiences only a nearly quadrat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.0622","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":"1104.0622","created_at":"2026-05-18T02:22:11.151742+00:00"},{"alias_kind":"arxiv_version","alias_value":"1104.0622v1","created_at":"2026-05-18T02:22:11.151742+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.0622","created_at":"2026-05-18T02:22:11.151742+00:00"},{"alias_kind":"pith_short_12","alias_value":"WIEUBEEB7XZV","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_16","alias_value":"WIEUBEEB7XZV7VCQ","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_8","alias_value":"WIEUBEEB","created_at":"2026-05-18T12:26:44.992195+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/WIEUBEEB7XZV7VCQAMWIOH6FFA","json":"https://pith.science/pith/WIEUBEEB7XZV7VCQAMWIOH6FFA.json","graph_json":"https://pith.science/api/pith-number/WIEUBEEB7XZV7VCQAMWIOH6FFA/graph.json","events_json":"https://pith.science/api/pith-number/WIEUBEEB7XZV7VCQAMWIOH6FFA/events.json","paper":"https://pith.science/paper/WIEUBEEB"},"agent_actions":{"view_html":"https://pith.science/pith/WIEUBEEB7XZV7VCQAMWIOH6FFA","download_json":"https://pith.science/pith/WIEUBEEB7XZV7VCQAMWIOH6FFA.json","view_paper":"https://pith.science/paper/WIEUBEEB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1104.0622&json=true","fetch_graph":"https://pith.science/api/pith-number/WIEUBEEB7XZV7VCQAMWIOH6FFA/graph.json","fetch_events":"https://pith.science/api/pith-number/WIEUBEEB7XZV7VCQAMWIOH6FFA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WIEUBEEB7XZV7VCQAMWIOH6FFA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WIEUBEEB7XZV7VCQAMWIOH6FFA/action/storage_attestation","attest_author":"https://pith.science/pith/WIEUBEEB7XZV7VCQAMWIOH6FFA/action/author_attestation","sign_citation":"https://pith.science/pith/WIEUBEEB7XZV7VCQAMWIOH6FFA/action/citation_signature","submit_replication":"https://pith.science/pith/WIEUBEEB7XZV7VCQAMWIOH6FFA/action/replication_record"}},"created_at":"2026-05-18T02:22:11.151742+00:00","updated_at":"2026-05-18T02:22:11.151742+00:00"}