{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:ISZ4JCF6PTASIQLGH4X4LUIV7N","short_pith_number":"pith:ISZ4JCF6","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"},"canonical_sha256":"44b3c488be7cc12441663f2fc5d115fb5a0315fa4ab5b51968be17fac3a4823a","source":{"kind":"arxiv","id":"2507.06334","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.06334","created_at":"2026-07-05T11:34:13Z"},{"alias_kind":"arxiv_version","alias_value":"2507.06334v1","created_at":"2026-07-05T11:34:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.06334","created_at":"2026-07-05T11:34:13Z"},{"alias_kind":"pith_short_12","alias_value":"ISZ4JCF6PTAS","created_at":"2026-07-05T11:34:13Z"},{"alias_kind":"pith_short_16","alias_value":"ISZ4JCF6PTASIQLG","created_at":"2026-07-05T11:34:13Z"},{"alias_kind":"pith_short_8","alias_value":"ISZ4JCF6","created_at":"2026-07-05T11:34:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:ISZ4JCF6PTASIQLGH4X4LUIV7N","target":"record","payload":{"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"},"canonical_sha256":"44b3c488be7cc12441663f2fc5d115fb5a0315fa4ab5b51968be17fac3a4823a","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"},"source_kind":"arxiv","source_id":"2507.06334","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-05T11:34:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gjVTd3SCNb9oiP5IrK4kv8+ra4J5NxI2JOGv1z7wPK7xx3m3CF56iY7jGUe/8IkEo3aGb+R9J6TNxBhvYGABBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T14:48:31.554600Z"},"content_sha256":"c6079c34653c43509de8a61baf26769d4e216f12c617bc87a5a91733b3bd473c","schema_version":"1.0","event_id":"sha256:c6079c34653c43509de8a61baf26769d4e216f12c617bc87a5a91733b3bd473c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:ISZ4JCF6PTASIQLGH4X4LUIV7N","target":"graph","payload":{"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"},"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-05T11:34:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K/UHNkTdZ88Q9TVDb13h71/G1ZL7I9+Gh8UkdsYyDjBX45sI4r6mDHsUMA2qRUa/WiMJFM0uPc70THJBb6+7BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T14:48:31.555117Z"},"content_sha256":"309d3de65e58ba12b34b3c40d5d6cf1c2eeb7ac5fc50a62ef7a5293818596cd4","schema_version":"1.0","event_id":"sha256:309d3de65e58ba12b34b3c40d5d6cf1c2eeb7ac5fc50a62ef7a5293818596cd4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ISZ4JCF6PTASIQLGH4X4LUIV7N/bundle.json","state_url":"https://pith.science/pith/ISZ4JCF6PTASIQLGH4X4LUIV7N/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ISZ4JCF6PTASIQLGH4X4LUIV7N/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-08T14:48:31Z","links":{"resolver":"https://pith.science/pith/ISZ4JCF6PTASIQLGH4X4LUIV7N","bundle":"https://pith.science/pith/ISZ4JCF6PTASIQLGH4X4LUIV7N/bundle.json","state":"https://pith.science/pith/ISZ4JCF6PTASIQLGH4X4LUIV7N/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ISZ4JCF6PTASIQLGH4X4LUIV7N/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:ISZ4JCF6PTASIQLGH4X4LUIV7N","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":"73190360e6eced1d3c486310e5a5d4feedff34824ae902bc1420b7b706f32018","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DS","submitted_at":"2025-07-08T18:44:08Z","title_canon_sha256":"8e6fec6d6e0458a6510e290893639500331f15c488b94879c6261330491148d6"},"schema_version":"1.0","source":{"id":"2507.06334","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.06334","created_at":"2026-07-05T11:34:13Z"},{"alias_kind":"arxiv_version","alias_value":"2507.06334v1","created_at":"2026-07-05T11:34:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.06334","created_at":"2026-07-05T11:34:13Z"},{"alias_kind":"pith_short_12","alias_value":"ISZ4JCF6PTAS","created_at":"2026-07-05T11:34:13Z"},{"alias_kind":"pith_short_16","alias_value":"ISZ4JCF6PTASIQLG","created_at":"2026-07-05T11:34:13Z"},{"alias_kind":"pith_short_8","alias_value":"ISZ4JCF6","created_at":"2026-07-05T11:34:13Z"}],"graph_snapshots":[{"event_id":"sha256:309d3de65e58ba12b34b3c40d5d6cf1c2eeb7ac5fc50a62ef7a5293818596cd4","target":"graph","created_at":"2026-07-05T11:34:13Z","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/2507.06334/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Jaehyun Koo, Mohsen Ghaffari","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DS","submitted_at":"2025-07-08T18:44:08Z","title":"Parallel Batch-Dynamic Coreness Decomposition with Worst-Case Guarantees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.06334","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:c6079c34653c43509de8a61baf26769d4e216f12c617bc87a5a91733b3bd473c","target":"record","created_at":"2026-07-05T11:34:13Z","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":"73190360e6eced1d3c486310e5a5d4feedff34824ae902bc1420b7b706f32018","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DS","submitted_at":"2025-07-08T18:44:08Z","title_canon_sha256":"8e6fec6d6e0458a6510e290893639500331f15c488b94879c6261330491148d6"},"schema_version":"1.0","source":{"id":"2507.06334","kind":"arxiv","version":1}},"canonical_sha256":"44b3c488be7cc12441663f2fc5d115fb5a0315fa4ab5b51968be17fac3a4823a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"44b3c488be7cc12441663f2fc5d115fb5a0315fa4ab5b51968be17fac3a4823a","first_computed_at":"2026-07-05T11:34:13.819516Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:34:13.819516Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tURP1D3pV8nmS998z/x2CklaKqj/DFm/kgZVBghVFFCN0/CSkBEkq0PrcF2rdbArVWDuud9tb5AyE69gkFC9Bg==","signature_status":"signed_v1","signed_at":"2026-07-05T11:34:13.819931Z","signed_message":"canonical_sha256_bytes"},"source_id":"2507.06334","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c6079c34653c43509de8a61baf26769d4e216f12c617bc87a5a91733b3bd473c","sha256:309d3de65e58ba12b34b3c40d5d6cf1c2eeb7ac5fc50a62ef7a5293818596cd4"],"state_sha256":"a132045952bd87dbd97c7dfb04823a08b16e41dbe31452a4c646ae64300f9dac"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rFn5EDMWjvphQhFde46RHHznoZexgNEvLkKfl54XfboQgyGqAGtLPvR5iQoIK8Hgg8xdcXXcl1tpQbbIaDK5Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T14:48:31.560427Z","bundle_sha256":"1e9dc19b3eac0eaa6ab85c51143915b7e7f547cdfa932d4bb777089e5a510eb8"}}