{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:PLHDG7KMDAODS2PBC2KVMW7F2E","short_pith_number":"pith:PLHDG7KM","schema_version":"1.0","canonical_sha256":"7ace337d4c181c3969e11695565be5d104853f98dc0dd65d8a71286d4e44b591","source":{"kind":"arxiv","id":"1908.01956","version":1},"attestation_state":"computed","paper":{"title":"Parallel Batch-Dynamic Graphs: Algorithms and Lower Bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"David Durfee, Janardhan Kulkarni, Laxman Dhulipala, Richard Peng, Saurabh Sawlani, Xiaorui Sun","submitted_at":"2019-08-06T04:56:46Z","abstract_excerpt":"In this paper we study the problem of dynamically maintaining graph properties under batches of edge insertions and deletions in the massively parallel model of computation. In this setting, the graph is stored on a number of machines, each having space strongly sublinear with respect to the number of vertices, that is, $n^\\epsilon$ for some constant $0 < \\epsilon < 1$. Our goal is to handle batches of updates and queries where the data for each batch fits onto one machine in constant rounds of parallel computation, as well as to reduce the total communication between the machines. This object"},"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":"1908.01956","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-06T04:56:46Z","cross_cats_sorted":[],"title_canon_sha256":"94e0512cd9d21c544f472b515f8fd1919a09b717158c9ef913325adedb162f55","abstract_canon_sha256":"0aa8b7060e4aeb9e710bffd37aaf2d4b25cbea3040ab9c7664019ac1413c2d2b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:51:49.678539Z","signature_b64":"OWLIWWNCJhpAKbgNq13G7wkKZAxQ6QhBFR58E+1QPRnMbqV+8qWY8uijrOwajZKdyWA96Sif+eOoT6d790GhDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7ace337d4c181c3969e11695565be5d104853f98dc0dd65d8a71286d4e44b591","last_reissued_at":"2026-07-04T23:51:49.678139Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:51:49.678139Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parallel Batch-Dynamic Graphs: Algorithms and Lower Bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"David Durfee, Janardhan Kulkarni, Laxman Dhulipala, Richard Peng, Saurabh Sawlani, Xiaorui Sun","submitted_at":"2019-08-06T04:56:46Z","abstract_excerpt":"In this paper we study the problem of dynamically maintaining graph properties under batches of edge insertions and deletions in the massively parallel model of computation. In this setting, the graph is stored on a number of machines, each having space strongly sublinear with respect to the number of vertices, that is, $n^\\epsilon$ for some constant $0 < \\epsilon < 1$. Our goal is to handle batches of updates and queries where the data for each batch fits onto one machine in constant rounds of parallel computation, as well as to reduce the total communication between the machines. This object"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.01956","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/1908.01956/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":"1908.01956","created_at":"2026-07-04T23:51:49.678196+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.01956v1","created_at":"2026-07-04T23:51:49.678196+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.01956","created_at":"2026-07-04T23:51:49.678196+00:00"},{"alias_kind":"pith_short_12","alias_value":"PLHDG7KMDAOD","created_at":"2026-07-04T23:51:49.678196+00:00"},{"alias_kind":"pith_short_16","alias_value":"PLHDG7KMDAODS2PB","created_at":"2026-07-04T23:51:49.678196+00:00"},{"alias_kind":"pith_short_8","alias_value":"PLHDG7KM","created_at":"2026-07-04T23:51:49.678196+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PLHDG7KMDAODS2PBC2KVMW7F2E","json":"https://pith.science/pith/PLHDG7KMDAODS2PBC2KVMW7F2E.json","graph_json":"https://pith.science/api/pith-number/PLHDG7KMDAODS2PBC2KVMW7F2E/graph.json","events_json":"https://pith.science/api/pith-number/PLHDG7KMDAODS2PBC2KVMW7F2E/events.json","paper":"https://pith.science/paper/PLHDG7KM"},"agent_actions":{"view_html":"https://pith.science/pith/PLHDG7KMDAODS2PBC2KVMW7F2E","download_json":"https://pith.science/pith/PLHDG7KMDAODS2PBC2KVMW7F2E.json","view_paper":"https://pith.science/paper/PLHDG7KM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.01956&json=true","fetch_graph":"https://pith.science/api/pith-number/PLHDG7KMDAODS2PBC2KVMW7F2E/graph.json","fetch_events":"https://pith.science/api/pith-number/PLHDG7KMDAODS2PBC2KVMW7F2E/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PLHDG7KMDAODS2PBC2KVMW7F2E/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PLHDG7KMDAODS2PBC2KVMW7F2E/action/storage_attestation","attest_author":"https://pith.science/pith/PLHDG7KMDAODS2PBC2KVMW7F2E/action/author_attestation","sign_citation":"https://pith.science/pith/PLHDG7KMDAODS2PBC2KVMW7F2E/action/citation_signature","submit_replication":"https://pith.science/pith/PLHDG7KMDAODS2PBC2KVMW7F2E/action/replication_record"}},"created_at":"2026-07-04T23:51:49.678196+00:00","updated_at":"2026-07-04T23:51:49.678196+00:00"}