{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:U7OGCNLVJH5BEKM6JPSBZFOINN","short_pith_number":"pith:U7OGCNLV","canonical_record":{"source":{"id":"2501.00120","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2024-12-30T19:38:40Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"a96cef8c324788ac42f0d574524819713ab393f7b1711b7faa278105b6750796","abstract_canon_sha256":"c3938b918e2debc206079860c4a8b40399e47101048de4ab18f4370cec4ca6f3"},"schema_version":"1.0"},"canonical_sha256":"a7dc61357549fa12299e4be41c95c86b54821af255389e485af64d6b7cba5076","source":{"kind":"arxiv","id":"2501.00120","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.00120","created_at":"2026-07-05T09:55:39Z"},{"alias_kind":"arxiv_version","alias_value":"2501.00120v1","created_at":"2026-07-05T09:55:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.00120","created_at":"2026-07-05T09:55:39Z"},{"alias_kind":"pith_short_12","alias_value":"U7OGCNLVJH5B","created_at":"2026-07-05T09:55:39Z"},{"alias_kind":"pith_short_16","alias_value":"U7OGCNLVJH5BEKM6","created_at":"2026-07-05T09:55:39Z"},{"alias_kind":"pith_short_8","alias_value":"U7OGCNLV","created_at":"2026-07-05T09:55:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:U7OGCNLVJH5BEKM6JPSBZFOINN","target":"record","payload":{"canonical_record":{"source":{"id":"2501.00120","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2024-12-30T19:38:40Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"a96cef8c324788ac42f0d574524819713ab393f7b1711b7faa278105b6750796","abstract_canon_sha256":"c3938b918e2debc206079860c4a8b40399e47101048de4ab18f4370cec4ca6f3"},"schema_version":"1.0"},"canonical_sha256":"a7dc61357549fa12299e4be41c95c86b54821af255389e485af64d6b7cba5076","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:55:39.377994Z","signature_b64":"ERQPzaaCSZjihy5XS4FH8uhX3xmOiz6vK80g+AU6sSUu2ps7w9QN/tRG189f8WoJdZvrvuyTqWs9ZQwWqcnsAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a7dc61357549fa12299e4be41c95c86b54821af255389e485af64d6b7cba5076","last_reissued_at":"2026-07-05T09:55:39.377632Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:55:39.377632Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2501.00120","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T09:55:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y27DKvpbcQr0pYZVZwAjBnVMG4WmTh33SrBTNSRAYjzl8VzAtlwsPEDTDaf49cCNkWjfjB7LrL0mo7dDjgpRCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T15:01:09.270013Z"},"content_sha256":"55b217b9d599fb5dbcd2781d326a0e1b189e79992f7576482f03d26e91c2630f","schema_version":"1.0","event_id":"sha256:55b217b9d599fb5dbcd2781d326a0e1b189e79992f7576482f03d26e91c2630f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:U7OGCNLVJH5BEKM6JPSBZFOINN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dynamic Unit-Disk Range Reporting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Haitao Wang, Yiming Zhao","submitted_at":"2024-12-30T19:38:40Z","abstract_excerpt":"For a set $P$ of $n$ points in the plane and a value $r > 0$, the unit-disk range reporting problem is to construct a data structure so that given any query disk of radius $r$, all points of $P$ in the disk can be reported efficiently. We consider the dynamic version of the problem where point insertions and deletions of $P$ are allowed. The previous best method provides a data structure of $O(n\\log n)$ space that supports $O(\\log^{3+\\epsilon}n)$ amortized insertion time, $O(\\log^{5+\\epsilon}n)$ amortized deletion time, and $O(\\log^2 n/\\log\\log n+k)$ query time, where $\\epsilon$ is an arbitrar"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.00120","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/2501.00120/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T09:55:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O8C6BHXGdEipndxFYLBb3kTc3CH2wAyZrEu6jP7h7EVVu1n2Te0oiEVsVyFRU6wPPwl6Lo6FGQ+itlaGjBLsCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T15:01:09.270541Z"},"content_sha256":"9f6b92c324c1221cac928a6ef6441483b5b52819a3d082b3e07426260dd1e6f9","schema_version":"1.0","event_id":"sha256:9f6b92c324c1221cac928a6ef6441483b5b52819a3d082b3e07426260dd1e6f9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/U7OGCNLVJH5BEKM6JPSBZFOINN/bundle.json","state_url":"https://pith.science/pith/U7OGCNLVJH5BEKM6JPSBZFOINN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/U7OGCNLVJH5BEKM6JPSBZFOINN/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-15T15:01:09Z","links":{"resolver":"https://pith.science/pith/U7OGCNLVJH5BEKM6JPSBZFOINN","bundle":"https://pith.science/pith/U7OGCNLVJH5BEKM6JPSBZFOINN/bundle.json","state":"https://pith.science/pith/U7OGCNLVJH5BEKM6JPSBZFOINN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/U7OGCNLVJH5BEKM6JPSBZFOINN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:U7OGCNLVJH5BEKM6JPSBZFOINN","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"c3938b918e2debc206079860c4a8b40399e47101048de4ab18f4370cec4ca6f3","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2024-12-30T19:38:40Z","title_canon_sha256":"a96cef8c324788ac42f0d574524819713ab393f7b1711b7faa278105b6750796"},"schema_version":"1.0","source":{"id":"2501.00120","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.00120","created_at":"2026-07-05T09:55:39Z"},{"alias_kind":"arxiv_version","alias_value":"2501.00120v1","created_at":"2026-07-05T09:55:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.00120","created_at":"2026-07-05T09:55:39Z"},{"alias_kind":"pith_short_12","alias_value":"U7OGCNLVJH5B","created_at":"2026-07-05T09:55:39Z"},{"alias_kind":"pith_short_16","alias_value":"U7OGCNLVJH5BEKM6","created_at":"2026-07-05T09:55:39Z"},{"alias_kind":"pith_short_8","alias_value":"U7OGCNLV","created_at":"2026-07-05T09:55:39Z"}],"graph_snapshots":[{"event_id":"sha256:9f6b92c324c1221cac928a6ef6441483b5b52819a3d082b3e07426260dd1e6f9","target":"graph","created_at":"2026-07-05T09:55:39Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2501.00120/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"For a set $P$ of $n$ points in the plane and a value $r > 0$, the unit-disk range reporting problem is to construct a data structure so that given any query disk of radius $r$, all points of $P$ in the disk can be reported efficiently. We consider the dynamic version of the problem where point insertions and deletions of $P$ are allowed. The previous best method provides a data structure of $O(n\\log n)$ space that supports $O(\\log^{3+\\epsilon}n)$ amortized insertion time, $O(\\log^{5+\\epsilon}n)$ amortized deletion time, and $O(\\log^2 n/\\log\\log n+k)$ query time, where $\\epsilon$ is an arbitrar","authors_text":"Haitao Wang, Yiming Zhao","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2024-12-30T19:38:40Z","title":"Dynamic Unit-Disk Range Reporting"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.00120","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:55b217b9d599fb5dbcd2781d326a0e1b189e79992f7576482f03d26e91c2630f","target":"record","created_at":"2026-07-05T09:55:39Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"c3938b918e2debc206079860c4a8b40399e47101048de4ab18f4370cec4ca6f3","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2024-12-30T19:38:40Z","title_canon_sha256":"a96cef8c324788ac42f0d574524819713ab393f7b1711b7faa278105b6750796"},"schema_version":"1.0","source":{"id":"2501.00120","kind":"arxiv","version":1}},"canonical_sha256":"a7dc61357549fa12299e4be41c95c86b54821af255389e485af64d6b7cba5076","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a7dc61357549fa12299e4be41c95c86b54821af255389e485af64d6b7cba5076","first_computed_at":"2026-07-05T09:55:39.377632Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:55:39.377632Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ERQPzaaCSZjihy5XS4FH8uhX3xmOiz6vK80g+AU6sSUu2ps7w9QN/tRG189f8WoJdZvrvuyTqWs9ZQwWqcnsAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T09:55:39.377994Z","signed_message":"canonical_sha256_bytes"},"source_id":"2501.00120","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:55b217b9d599fb5dbcd2781d326a0e1b189e79992f7576482f03d26e91c2630f","sha256:9f6b92c324c1221cac928a6ef6441483b5b52819a3d082b3e07426260dd1e6f9"],"state_sha256":"20bb4c77cbbdc4c1a973ba9b51be47ee3f7a226d8092c0cbd0504598e412ff88"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZqUjKVHq5cRN/BGQVDXauuqIk5g21yIXIVf3JDVfXDGMOUa9AzI2Xly1HcuGqv9NO9letvX/yFFuSQWIgLF6AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-15T15:01:09.279564Z","bundle_sha256":"3fa4a3004c885adb68fa8100fef1506419b46ef8036f002048a3f880ed31b01e"}}