{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:X7SRPUKMIWD56RRCAAKQBNDG2J","short_pith_number":"pith:X7SRPUKM","schema_version":"1.0","canonical_sha256":"bfe517d14c4587df4622001500b466d251ca7f746e3c066e2f576eed8a9e04b1","source":{"kind":"arxiv","id":"2602.17811","version":2},"attestation_state":"computed","paper":{"title":"Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Andrew Brady, Chase Hutton, Guy Blelloch, Jeremy Fineman, Kishen Gowda, Laxman Dhulipala","submitted_at":"2026-02-19T20:26:07Z","abstract_excerpt":"A low out-degree orientation directs each edge of an undirected graph with the goal of minimizing the maximum out-degree of a vertex. In the parallel batch-dynamic setting, one can insert or delete batches of edges, and the goal is to process the entire batch in parallel with work per edge similar to that of a single sequential update and with span (or depth) for the entire batch that is polylogarithmic. In this paper we present work-efficient parallel batch-dynamic algorithms for maintaining a low out-degree orientation of an undirected graph, both in the amortized and worst-case settings. Al"},"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":"2602.17811","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2026-02-19T20:26:07Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"e938cb75e8e0a6d2d9a8a4c903ce946f1e76d20a08db202872ebba587060ca05","abstract_canon_sha256":"6a7012b064fc8014bbedcdbb57b494d5c8b7fd1bcfe6efee0e959ea49e47eac7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bfe517d14c4587df4622001500b466d251ca7f746e3c066e2f576eed8a9e04b1","last_reissued_at":"2026-07-31T01:33:16.930467Z","signature_status":"unsigned_v0","first_computed_at":"2026-07-31T01:33:16.930467Z"},"graph_snapshot":{"paper":{"title":"Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Andrew Brady, Chase Hutton, Guy Blelloch, Jeremy Fineman, Kishen Gowda, Laxman Dhulipala","submitted_at":"2026-02-19T20:26:07Z","abstract_excerpt":"A low out-degree orientation directs each edge of an undirected graph with the goal of minimizing the maximum out-degree of a vertex. In the parallel batch-dynamic setting, one can insert or delete batches of edges, and the goal is to process the entire batch in parallel with work per edge similar to that of a single sequential update and with span (or depth) for the entire batch that is polylogarithmic. In this paper we present work-efficient parallel batch-dynamic algorithms for maintaining a low out-degree orientation of an undirected graph, both in the amortized and worst-case settings. Al"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2602.17811","kind":"arxiv","version":2},"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/2602.17811/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":"2602.17811","created_at":"2026-07-31T01:33:16.933600+00:00"},{"alias_kind":"arxiv_version","alias_value":"2602.17811v2","created_at":"2026-07-31T01:33:16.933600+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.17811","created_at":"2026-07-31T01:33:16.933600+00:00"},{"alias_kind":"pith_short_12","alias_value":"X7SRPUKMIWD5","created_at":"2026-07-31T01:33:16.933600+00:00"},{"alias_kind":"pith_short_16","alias_value":"X7SRPUKMIWD56RRC","created_at":"2026-07-31T01:33:16.933600+00:00"},{"alias_kind":"pith_short_8","alias_value":"X7SRPUKM","created_at":"2026-07-31T01:33:16.933600+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2604.07515","citing_title":"Parallel Batch-Dynamic Maximal Independent Set","ref_index":14,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/X7SRPUKMIWD56RRCAAKQBNDG2J","json":"https://pith.science/pith/X7SRPUKMIWD56RRCAAKQBNDG2J.json","graph_json":"https://pith.science/api/pith-number/X7SRPUKMIWD56RRCAAKQBNDG2J/graph.json","events_json":"https://pith.science/api/pith-number/X7SRPUKMIWD56RRCAAKQBNDG2J/events.json","paper":"https://pith.science/paper/X7SRPUKM"},"agent_actions":{"view_html":"https://pith.science/pith/X7SRPUKMIWD56RRCAAKQBNDG2J","download_json":"https://pith.science/pith/X7SRPUKMIWD56RRCAAKQBNDG2J.json","view_paper":"https://pith.science/paper/X7SRPUKM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2602.17811&json=true","fetch_graph":"https://pith.science/api/pith-number/X7SRPUKMIWD56RRCAAKQBNDG2J/graph.json","fetch_events":"https://pith.science/api/pith-number/X7SRPUKMIWD56RRCAAKQBNDG2J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X7SRPUKMIWD56RRCAAKQBNDG2J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X7SRPUKMIWD56RRCAAKQBNDG2J/action/storage_attestation","attest_author":"https://pith.science/pith/X7SRPUKMIWD56RRCAAKQBNDG2J/action/author_attestation","sign_citation":"https://pith.science/pith/X7SRPUKMIWD56RRCAAKQBNDG2J/action/citation_signature","submit_replication":"https://pith.science/pith/X7SRPUKMIWD56RRCAAKQBNDG2J/action/replication_record"}},"created_at":"2026-07-31T01:33:16.933600+00:00","updated_at":"2026-07-31T01:33:16.933600+00:00"}