{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:KJS3PQPMT74TWIOVAP3HJICSSL","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":"f8631db666d7c5ba15a034c3e28e63d94ec5054d3608a376f5b22f44c60e68aa","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-10-05T22:50:33Z","title_canon_sha256":"00a2508118fb690020c8d4a72524773b77b9a9f4e70295a4432792359a872522"},"schema_version":"1.0","source":{"id":"2010.02379","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2010.02379","created_at":"2026-07-05T02:25:50Z"},{"alias_kind":"arxiv_version","alias_value":"2010.02379v3","created_at":"2026-07-05T02:25:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.02379","created_at":"2026-07-05T02:25:50Z"},{"alias_kind":"pith_short_12","alias_value":"KJS3PQPMT74T","created_at":"2026-07-05T02:25:50Z"},{"alias_kind":"pith_short_16","alias_value":"KJS3PQPMT74TWIOV","created_at":"2026-07-05T02:25:50Z"},{"alias_kind":"pith_short_8","alias_value":"KJS3PQPM","created_at":"2026-07-05T02:25:50Z"}],"graph_snapshots":[{"event_id":"sha256:3b57f93e909221e3317bc3255343a47819c20686f7f83d4f58f8d6265fb47dec","target":"graph","created_at":"2026-07-05T02:25:50Z","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/2010.02379/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We propose a theoretically-efficient and practical parallel batch-dynamic data structure for the closest pair problem. Our solution is based on a serial dynamic closest pair data structure by Golin et al., and supports batches of insertions and deletions in parallel. For a data set of size $n$, our data structure supports a batch of insertions or deletions of size $m$ in $O(m(1+\\log ((n+m)/m)))$ expected work and $O(\\log (n+m)\\log^*(n+m))$ depth with high probability, and takes linear space. The key techniques for achieving these bounds are a new work-efficient parallel batch-dynamic binary he","authors_text":"Julian Shun, Shangdi Yu, Yan Gu, Yiqiu Wang","cross_cats":["cs.CG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-10-05T22:50:33Z","title":"A Parallel Batch-Dynamic Data Structure for the Closest Pair Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.02379","kind":"arxiv","version":3},"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:d1e2f57ae4e0aac07edcf3f9e38e84d8f3f8129e16cbfd8b73f7ed42b957f804","target":"record","created_at":"2026-07-05T02:25:50Z","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":"f8631db666d7c5ba15a034c3e28e63d94ec5054d3608a376f5b22f44c60e68aa","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-10-05T22:50:33Z","title_canon_sha256":"00a2508118fb690020c8d4a72524773b77b9a9f4e70295a4432792359a872522"},"schema_version":"1.0","source":{"id":"2010.02379","kind":"arxiv","version":3}},"canonical_sha256":"5265b7c1ec9ff93b21d503f674a05292ca5a0653e909a822da5a7da7b4f0b8a8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5265b7c1ec9ff93b21d503f674a05292ca5a0653e909a822da5a7da7b4f0b8a8","first_computed_at":"2026-07-05T02:25:50.338423Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:25:50.338423Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TrHTMpDZ07vgJiv9xeNPlzRl2E29q8mHFsE9iMC7aj5cBjp1pKQkqnUQc6ugLg1QlfNeCkJpV3sRpi9JG54oBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T02:25:50.338985Z","signed_message":"canonical_sha256_bytes"},"source_id":"2010.02379","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d1e2f57ae4e0aac07edcf3f9e38e84d8f3f8129e16cbfd8b73f7ed42b957f804","sha256:3b57f93e909221e3317bc3255343a47819c20686f7f83d4f58f8d6265fb47dec"],"state_sha256":"7fd76936625877b88769b8e9ee0c0d32195739d010309083e3092a707e6eea44"}