{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:52FLQW76ZIWZPONRD2LXDJIZXE","short_pith_number":"pith:52FLQW76","schema_version":"1.0","canonical_sha256":"ee8ab85bfeca2d97b9b11e9771a519b91dbe73fd713080084ce002e430e51b3c","source":{"kind":"arxiv","id":"2306.08786","version":1},"attestation_state":"computed","paper":{"title":"Deterministic and Work-Efficient Parallel Batch-Dynamic Trees in Low Span","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Daniel Anderson, Guy E. Blelloch","submitted_at":"2023-06-14T23:44:48Z","abstract_excerpt":"Dynamic trees are a well-studied and fundamental building block of dynamic graph algorithms dating back to the seminal work of Sleator and Tarjan [STOC'81, (1981), pp. 114-122]. The problem is to maintain a tree subject to online edge insertions and deletions while answering queries about the tree, such as the heaviest weight on a path, etc. In the parallel batch-dynamic setting, the goal is to process batches of edge updates work efficiently in low ($\\text{polylog}\\ n$) span. Two work-efficient algorithms are known, batch-parallel Euler Tour Trees by Tseng et al. [ALENEX'19, (2019), pp. 92-10"},"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":"2306.08786","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.DS","submitted_at":"2023-06-14T23:44:48Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"16a86eaec47ceb9681a292645de202fb409c4662fea81d23b91c674187d1d7dc","abstract_canon_sha256":"9cd185262b4943937b984451c49baab665fa42ca2f457d211bc03200cdc3f176"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:20:56.251944Z","signature_b64":"7YM5f5naXW5RKim7fkSXXaGngFuUauhOksrX/P5gW60L0EF5L1ewiGJ0sR89I769hZce3LkSVgfMYCTL87DRAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ee8ab85bfeca2d97b9b11e9771a519b91dbe73fd713080084ce002e430e51b3c","last_reissued_at":"2026-07-05T06:20:56.251479Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:20:56.251479Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deterministic and Work-Efficient Parallel Batch-Dynamic Trees in Low Span","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Daniel Anderson, Guy E. Blelloch","submitted_at":"2023-06-14T23:44:48Z","abstract_excerpt":"Dynamic trees are a well-studied and fundamental building block of dynamic graph algorithms dating back to the seminal work of Sleator and Tarjan [STOC'81, (1981), pp. 114-122]. The problem is to maintain a tree subject to online edge insertions and deletions while answering queries about the tree, such as the heaviest weight on a path, etc. In the parallel batch-dynamic setting, the goal is to process batches of edge updates work efficiently in low ($\\text{polylog}\\ n$) span. Two work-efficient algorithms are known, batch-parallel Euler Tour Trees by Tseng et al. [ALENEX'19, (2019), pp. 92-10"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.08786","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/2306.08786/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":"2306.08786","created_at":"2026-07-05T06:20:56.251540+00:00"},{"alias_kind":"arxiv_version","alias_value":"2306.08786v1","created_at":"2026-07-05T06:20:56.251540+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.08786","created_at":"2026-07-05T06:20:56.251540+00:00"},{"alias_kind":"pith_short_12","alias_value":"52FLQW76ZIWZ","created_at":"2026-07-05T06:20:56.251540+00:00"},{"alias_kind":"pith_short_16","alias_value":"52FLQW76ZIWZPONR","created_at":"2026-07-05T06:20:56.251540+00:00"},{"alias_kind":"pith_short_8","alias_value":"52FLQW76","created_at":"2026-07-05T06:20:56.251540+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":6,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/52FLQW76ZIWZPONRD2LXDJIZXE","json":"https://pith.science/pith/52FLQW76ZIWZPONRD2LXDJIZXE.json","graph_json":"https://pith.science/api/pith-number/52FLQW76ZIWZPONRD2LXDJIZXE/graph.json","events_json":"https://pith.science/api/pith-number/52FLQW76ZIWZPONRD2LXDJIZXE/events.json","paper":"https://pith.science/paper/52FLQW76"},"agent_actions":{"view_html":"https://pith.science/pith/52FLQW76ZIWZPONRD2LXDJIZXE","download_json":"https://pith.science/pith/52FLQW76ZIWZPONRD2LXDJIZXE.json","view_paper":"https://pith.science/paper/52FLQW76","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2306.08786&json=true","fetch_graph":"https://pith.science/api/pith-number/52FLQW76ZIWZPONRD2LXDJIZXE/graph.json","fetch_events":"https://pith.science/api/pith-number/52FLQW76ZIWZPONRD2LXDJIZXE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/52FLQW76ZIWZPONRD2LXDJIZXE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/52FLQW76ZIWZPONRD2LXDJIZXE/action/storage_attestation","attest_author":"https://pith.science/pith/52FLQW76ZIWZPONRD2LXDJIZXE/action/author_attestation","sign_citation":"https://pith.science/pith/52FLQW76ZIWZPONRD2LXDJIZXE/action/citation_signature","submit_replication":"https://pith.science/pith/52FLQW76ZIWZPONRD2LXDJIZXE/action/replication_record"}},"created_at":"2026-07-05T06:20:56.251540+00:00","updated_at":"2026-07-05T06:20:56.251540+00:00"}