{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:KJS3PQPMT74TWIOVAP3HJICSSL","short_pith_number":"pith:KJS3PQPM","schema_version":"1.0","canonical_sha256":"5265b7c1ec9ff93b21d503f674a05292ca5a0653e909a822da5a7da7b4f0b8a8","source":{"kind":"arxiv","id":"2010.02379","version":3},"attestation_state":"computed","paper":{"title":"A Parallel Batch-Dynamic Data Structure for the Closest Pair Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DS","authors_text":"Julian Shun, Shangdi Yu, Yan Gu, Yiqiu Wang","submitted_at":"2020-10-05T22:50:33Z","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"},"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":"2010.02379","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-10-05T22:50:33Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"00a2508118fb690020c8d4a72524773b77b9a9f4e70295a4432792359a872522","abstract_canon_sha256":"f8631db666d7c5ba15a034c3e28e63d94ec5054d3608a376f5b22f44c60e68aa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:25:50.338985Z","signature_b64":"TrHTMpDZ07vgJiv9xeNPlzRl2E29q8mHFsE9iMC7aj5cBjp1pKQkqnUQc6ugLg1QlfNeCkJpV3sRpi9JG54oBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5265b7c1ec9ff93b21d503f674a05292ca5a0653e909a822da5a7da7b4f0b8a8","last_reissued_at":"2026-07-05T02:25:50.338423Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:25:50.338423Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Parallel Batch-Dynamic Data Structure for the Closest Pair Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DS","authors_text":"Julian Shun, Shangdi Yu, Yan Gu, Yiqiu Wang","submitted_at":"2020-10-05T22:50:33Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.02379","kind":"arxiv","version":3},"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/2010.02379/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":"2010.02379","created_at":"2026-07-05T02:25:50.338500+00:00"},{"alias_kind":"arxiv_version","alias_value":"2010.02379v3","created_at":"2026-07-05T02:25:50.338500+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.02379","created_at":"2026-07-05T02:25:50.338500+00:00"},{"alias_kind":"pith_short_12","alias_value":"KJS3PQPMT74T","created_at":"2026-07-05T02:25:50.338500+00:00"},{"alias_kind":"pith_short_16","alias_value":"KJS3PQPMT74TWIOV","created_at":"2026-07-05T02:25:50.338500+00:00"},{"alias_kind":"pith_short_8","alias_value":"KJS3PQPM","created_at":"2026-07-05T02:25:50.338500+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.18384","citing_title":"Fully-Dynamic Parallel Algorithms for Single-Linkage Clustering","ref_index":54,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KJS3PQPMT74TWIOVAP3HJICSSL","json":"https://pith.science/pith/KJS3PQPMT74TWIOVAP3HJICSSL.json","graph_json":"https://pith.science/api/pith-number/KJS3PQPMT74TWIOVAP3HJICSSL/graph.json","events_json":"https://pith.science/api/pith-number/KJS3PQPMT74TWIOVAP3HJICSSL/events.json","paper":"https://pith.science/paper/KJS3PQPM"},"agent_actions":{"view_html":"https://pith.science/pith/KJS3PQPMT74TWIOVAP3HJICSSL","download_json":"https://pith.science/pith/KJS3PQPMT74TWIOVAP3HJICSSL.json","view_paper":"https://pith.science/paper/KJS3PQPM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2010.02379&json=true","fetch_graph":"https://pith.science/api/pith-number/KJS3PQPMT74TWIOVAP3HJICSSL/graph.json","fetch_events":"https://pith.science/api/pith-number/KJS3PQPMT74TWIOVAP3HJICSSL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KJS3PQPMT74TWIOVAP3HJICSSL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KJS3PQPMT74TWIOVAP3HJICSSL/action/storage_attestation","attest_author":"https://pith.science/pith/KJS3PQPMT74TWIOVAP3HJICSSL/action/author_attestation","sign_citation":"https://pith.science/pith/KJS3PQPMT74TWIOVAP3HJICSSL/action/citation_signature","submit_replication":"https://pith.science/pith/KJS3PQPMT74TWIOVAP3HJICSSL/action/replication_record"}},"created_at":"2026-07-05T02:25:50.338500+00:00","updated_at":"2026-07-05T02:25:50.338500+00:00"}