{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:ISZ4JCF6PTASIQLGH4X4LUIV7N","short_pith_number":"pith:ISZ4JCF6","schema_version":"1.0","canonical_sha256":"44b3c488be7cc12441663f2fc5d115fb5a0315fa4ab5b51968be17fac3a4823a","source":{"kind":"arxiv","id":"2507.06334","version":1},"attestation_state":"computed","paper":{"title":"Parallel Batch-Dynamic Coreness Decomposition with Worst-Case Guarantees","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jaehyun Koo, Mohsen Ghaffari","submitted_at":"2025-07-08T18:44:08Z","abstract_excerpt":"We present the first parallel batch-dynamic algorithm for approximating coreness decomposition with worst-case update times. Given any batch of edge insertions and deletions, our algorithm processes all these updates in $ \\text{poly}(\\log n)$ depth, using a worst-case work bound of $b\\cdot \\text{poly}(\\log n)$ where $b$ denotes the batch size. This means the batch gets processed in $\\tilde{O}(b/p)$ time, given $p$ processors, which is optimal up to logarithmic factors. Previously, an algorithm with similar guarantees was known by the celebrated work of Liu, Shi, Yu, Dhulipala, and Shun [SPAA'2"},"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":"2507.06334","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DS","submitted_at":"2025-07-08T18:44:08Z","cross_cats_sorted":[],"title_canon_sha256":"8e6fec6d6e0458a6510e290893639500331f15c488b94879c6261330491148d6","abstract_canon_sha256":"73190360e6eced1d3c486310e5a5d4feedff34824ae902bc1420b7b706f32018"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:34:13.819931Z","signature_b64":"tURP1D3pV8nmS998z/x2CklaKqj/DFm/kgZVBghVFFCN0/CSkBEkq0PrcF2rdbArVWDuud9tb5AyE69gkFC9Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"44b3c488be7cc12441663f2fc5d115fb5a0315fa4ab5b51968be17fac3a4823a","last_reissued_at":"2026-07-05T11:34:13.819516Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:34:13.819516Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parallel Batch-Dynamic Coreness Decomposition with Worst-Case Guarantees","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jaehyun Koo, Mohsen Ghaffari","submitted_at":"2025-07-08T18:44:08Z","abstract_excerpt":"We present the first parallel batch-dynamic algorithm for approximating coreness decomposition with worst-case update times. Given any batch of edge insertions and deletions, our algorithm processes all these updates in $ \\text{poly}(\\log n)$ depth, using a worst-case work bound of $b\\cdot \\text{poly}(\\log n)$ where $b$ denotes the batch size. This means the batch gets processed in $\\tilde{O}(b/p)$ time, given $p$ processors, which is optimal up to logarithmic factors. Previously, an algorithm with similar guarantees was known by the celebrated work of Liu, Shi, Yu, Dhulipala, and Shun [SPAA'2"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.06334","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/2507.06334/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":"2507.06334","created_at":"2026-07-05T11:34:13.819573+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.06334v1","created_at":"2026-07-05T11:34:13.819573+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.06334","created_at":"2026-07-05T11:34:13.819573+00:00"},{"alias_kind":"pith_short_12","alias_value":"ISZ4JCF6PTAS","created_at":"2026-07-05T11:34:13.819573+00:00"},{"alias_kind":"pith_short_16","alias_value":"ISZ4JCF6PTASIQLG","created_at":"2026-07-05T11:34:13.819573+00:00"},{"alias_kind":"pith_short_8","alias_value":"ISZ4JCF6","created_at":"2026-07-05T11:34:13.819573+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/ISZ4JCF6PTASIQLGH4X4LUIV7N","json":"https://pith.science/pith/ISZ4JCF6PTASIQLGH4X4LUIV7N.json","graph_json":"https://pith.science/api/pith-number/ISZ4JCF6PTASIQLGH4X4LUIV7N/graph.json","events_json":"https://pith.science/api/pith-number/ISZ4JCF6PTASIQLGH4X4LUIV7N/events.json","paper":"https://pith.science/paper/ISZ4JCF6"},"agent_actions":{"view_html":"https://pith.science/pith/ISZ4JCF6PTASIQLGH4X4LUIV7N","download_json":"https://pith.science/pith/ISZ4JCF6PTASIQLGH4X4LUIV7N.json","view_paper":"https://pith.science/paper/ISZ4JCF6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.06334&json=true","fetch_graph":"https://pith.science/api/pith-number/ISZ4JCF6PTASIQLGH4X4LUIV7N/graph.json","fetch_events":"https://pith.science/api/pith-number/ISZ4JCF6PTASIQLGH4X4LUIV7N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ISZ4JCF6PTASIQLGH4X4LUIV7N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ISZ4JCF6PTASIQLGH4X4LUIV7N/action/storage_attestation","attest_author":"https://pith.science/pith/ISZ4JCF6PTASIQLGH4X4LUIV7N/action/author_attestation","sign_citation":"https://pith.science/pith/ISZ4JCF6PTASIQLGH4X4LUIV7N/action/citation_signature","submit_replication":"https://pith.science/pith/ISZ4JCF6PTASIQLGH4X4LUIV7N/action/replication_record"}},"created_at":"2026-07-05T11:34:13.819573+00:00","updated_at":"2026-07-05T11:34:13.819573+00:00"}