{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:52FLQW76ZIWZPONRD2LXDJIZXE","short_pith_number":"pith:52FLQW76","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"},"canonical_sha256":"ee8ab85bfeca2d97b9b11e9771a519b91dbe73fd713080084ce002e430e51b3c","source":{"kind":"arxiv","id":"2306.08786","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2306.08786","created_at":"2026-07-05T06:20:56Z"},{"alias_kind":"arxiv_version","alias_value":"2306.08786v1","created_at":"2026-07-05T06:20:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.08786","created_at":"2026-07-05T06:20:56Z"},{"alias_kind":"pith_short_12","alias_value":"52FLQW76ZIWZ","created_at":"2026-07-05T06:20:56Z"},{"alias_kind":"pith_short_16","alias_value":"52FLQW76ZIWZPONR","created_at":"2026-07-05T06:20:56Z"},{"alias_kind":"pith_short_8","alias_value":"52FLQW76","created_at":"2026-07-05T06:20:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:52FLQW76ZIWZPONRD2LXDJIZXE","target":"record","payload":{"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"},"canonical_sha256":"ee8ab85bfeca2d97b9b11e9771a519b91dbe73fd713080084ce002e430e51b3c","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"},"source_kind":"arxiv","source_id":"2306.08786","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-05T06:20:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UOOKCKQb8tD98G3uRggLX85RYxfwTm9J6hA6ixU2B8LUMUeOv2O6G9e4Wt2MhdPSuMGrCygFhcOKrAniPmQDDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T17:12:56.570413Z"},"content_sha256":"052bf1e116a95e03991a5f2d8f51a929889042e722bdffce08467cb54a980da4","schema_version":"1.0","event_id":"sha256:052bf1e116a95e03991a5f2d8f51a929889042e722bdffce08467cb54a980da4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:52FLQW76ZIWZPONRD2LXDJIZXE","target":"graph","payload":{"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"},"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-05T06:20:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NU1INZrVtOzUkvQsbk2aaOod543u5MNz/fGoVStKtkj2zYB2kE2w0uqKPqimFRiDGIb/d3a43qX0/hyzgqBYDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T17:12:56.570924Z"},"content_sha256":"8e36853b4bbefe87a069299e34f3e129bfa64f51343c4a9c4c46c0754ff175a4","schema_version":"1.0","event_id":"sha256:8e36853b4bbefe87a069299e34f3e129bfa64f51343c4a9c4c46c0754ff175a4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/52FLQW76ZIWZPONRD2LXDJIZXE/bundle.json","state_url":"https://pith.science/pith/52FLQW76ZIWZPONRD2LXDJIZXE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/52FLQW76ZIWZPONRD2LXDJIZXE/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-21T17:12:56Z","links":{"resolver":"https://pith.science/pith/52FLQW76ZIWZPONRD2LXDJIZXE","bundle":"https://pith.science/pith/52FLQW76ZIWZPONRD2LXDJIZXE/bundle.json","state":"https://pith.science/pith/52FLQW76ZIWZPONRD2LXDJIZXE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/52FLQW76ZIWZPONRD2LXDJIZXE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:52FLQW76ZIWZPONRD2LXDJIZXE","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":"9cd185262b4943937b984451c49baab665fa42ca2f457d211bc03200cdc3f176","cross_cats_sorted":["cs.DC"],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.DS","submitted_at":"2023-06-14T23:44:48Z","title_canon_sha256":"16a86eaec47ceb9681a292645de202fb409c4662fea81d23b91c674187d1d7dc"},"schema_version":"1.0","source":{"id":"2306.08786","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2306.08786","created_at":"2026-07-05T06:20:56Z"},{"alias_kind":"arxiv_version","alias_value":"2306.08786v1","created_at":"2026-07-05T06:20:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.08786","created_at":"2026-07-05T06:20:56Z"},{"alias_kind":"pith_short_12","alias_value":"52FLQW76ZIWZ","created_at":"2026-07-05T06:20:56Z"},{"alias_kind":"pith_short_16","alias_value":"52FLQW76ZIWZPONR","created_at":"2026-07-05T06:20:56Z"},{"alias_kind":"pith_short_8","alias_value":"52FLQW76","created_at":"2026-07-05T06:20:56Z"}],"graph_snapshots":[{"event_id":"sha256:8e36853b4bbefe87a069299e34f3e129bfa64f51343c4a9c4c46c0754ff175a4","target":"graph","created_at":"2026-07-05T06:20:56Z","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/2306.08786/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Daniel Anderson, Guy E. Blelloch","cross_cats":["cs.DC"],"headline":"","license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.DS","submitted_at":"2023-06-14T23:44:48Z","title":"Deterministic and Work-Efficient Parallel Batch-Dynamic Trees in Low Span"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.08786","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:052bf1e116a95e03991a5f2d8f51a929889042e722bdffce08467cb54a980da4","target":"record","created_at":"2026-07-05T06:20:56Z","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":"9cd185262b4943937b984451c49baab665fa42ca2f457d211bc03200cdc3f176","cross_cats_sorted":["cs.DC"],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.DS","submitted_at":"2023-06-14T23:44:48Z","title_canon_sha256":"16a86eaec47ceb9681a292645de202fb409c4662fea81d23b91c674187d1d7dc"},"schema_version":"1.0","source":{"id":"2306.08786","kind":"arxiv","version":1}},"canonical_sha256":"ee8ab85bfeca2d97b9b11e9771a519b91dbe73fd713080084ce002e430e51b3c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ee8ab85bfeca2d97b9b11e9771a519b91dbe73fd713080084ce002e430e51b3c","first_computed_at":"2026-07-05T06:20:56.251479Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:20:56.251479Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7YM5f5naXW5RKim7fkSXXaGngFuUauhOksrX/P5gW60L0EF5L1ewiGJ0sR89I769hZce3LkSVgfMYCTL87DRAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T06:20:56.251944Z","signed_message":"canonical_sha256_bytes"},"source_id":"2306.08786","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:052bf1e116a95e03991a5f2d8f51a929889042e722bdffce08467cb54a980da4","sha256:8e36853b4bbefe87a069299e34f3e129bfa64f51343c4a9c4c46c0754ff175a4"],"state_sha256":"a190f60c600ce986d67017f0fd60ae9cc2a3541b5127fdc699063c3fc6560f20"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nyYpOqa1ucRkOlhMCNT0u4APGjaOafA140RLSt1wjvioVihjhE3d1AJq2DPOB/epRYKgteSJfSzA1If1TatPAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-21T17:12:56.575729Z","bundle_sha256":"9b16ea2c3ab76fe9e881065d153e4304d87aeae34ae5cbc9a888b994dcbbae5c"}}