{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:RVITWUBK2EF54VR2S55TYCNZKU","short_pith_number":"pith:RVITWUBK","canonical_record":{"source":{"id":"2502.08042","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-02-12T00:58:31Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"7a5e6a20333bfb891f1ea669833530166f0c2199a41ef8bf1e0271927518f000","abstract_canon_sha256":"d9d4982fb945c27eb77fa0467b5497e31eab31a218bfa95b905e4370b6a7b1e3"},"schema_version":"1.0"},"canonical_sha256":"8d513b502ad10bde563a977b3c09b95525738399adf7263705339648cdcb7494","source":{"kind":"arxiv","id":"2502.08042","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.08042","created_at":"2026-07-05T10:38:22Z"},{"alias_kind":"arxiv_version","alias_value":"2502.08042v2","created_at":"2026-07-05T10:38:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.08042","created_at":"2026-07-05T10:38:22Z"},{"alias_kind":"pith_short_12","alias_value":"RVITWUBK2EF5","created_at":"2026-07-05T10:38:22Z"},{"alias_kind":"pith_short_16","alias_value":"RVITWUBK2EF54VR2","created_at":"2026-07-05T10:38:22Z"},{"alias_kind":"pith_short_8","alias_value":"RVITWUBK","created_at":"2026-07-05T10:38:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:RVITWUBK2EF54VR2S55TYCNZKU","target":"record","payload":{"canonical_record":{"source":{"id":"2502.08042","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-02-12T00:58:31Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"7a5e6a20333bfb891f1ea669833530166f0c2199a41ef8bf1e0271927518f000","abstract_canon_sha256":"d9d4982fb945c27eb77fa0467b5497e31eab31a218bfa95b905e4370b6a7b1e3"},"schema_version":"1.0"},"canonical_sha256":"8d513b502ad10bde563a977b3c09b95525738399adf7263705339648cdcb7494","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:38:22.959366Z","signature_b64":"LM1NrcvDIqlMMK8DlOOtmXC/a/2BmGOi4bWpsL8GKqLIaGgh/W4oIf3eaitM1pZ69ugNzUZSbuM5KPjvxiXOCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8d513b502ad10bde563a977b3c09b95525738399adf7263705339648cdcb7494","last_reissued_at":"2026-07-05T10:38:22.958857Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:38:22.958857Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2502.08042","source_version":2,"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-05T10:38:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W/aCZoRKl1TmHt8YcVOf9qv2KBjtkNKOuHq3Ky/9jcHTwHCTl8oWQ9y3/qfMtCnQcdkD62cYfSO9TkcZreS0Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T16:04:48.385624Z"},"content_sha256":"5b9c046ed27e2f44e6b6024bda4b13ec51d53687b56d48d8c75ac80ac298b4d7","schema_version":"1.0","event_id":"sha256:5b9c046ed27e2f44e6b6024bda4b13ec51d53687b56d48d8c75ac80ac298b4d7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:RVITWUBK2EF54VR2S55TYCNZKU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parallel $k$-Core Decomposition: Theory and Practice","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Xiaojun Dong, Yan Gu, Yihan Sun, Youzhe Liu","submitted_at":"2025-02-12T00:58:31Z","abstract_excerpt":"This paper proposes efficient solutions for $k$-core decomposition with high parallelism. The problem of $k$-core decomposition is fundamental in graph analysis and has applications across various domains. However, existing algorithms face significant challenges in achieving work-efficiency in theory and/or high parallelism in practice, and suffer from various performance bottlenecks.\n  We present a simple, work-efficient parallel framework for $k$-core decomposition that is easy to implement and adaptable to various strategies for improving work-efficiency. We introduce two techniques to enha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.08042","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/2502.08042/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-05T10:38:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U3WCAlzojiCQG9uh7sEceFJc+PLTVE3jnOSGBevBBzZQopENgxsvl8hr95feJPYFxaasraas92JanjKimFNuDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T16:04:48.386191Z"},"content_sha256":"0e65dca7eae832d2d49b66c3ee71d30d21061db38e8a681d1035669148910301","schema_version":"1.0","event_id":"sha256:0e65dca7eae832d2d49b66c3ee71d30d21061db38e8a681d1035669148910301"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RVITWUBK2EF54VR2S55TYCNZKU/bundle.json","state_url":"https://pith.science/pith/RVITWUBK2EF54VR2S55TYCNZKU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RVITWUBK2EF54VR2S55TYCNZKU/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-18T16:04:48Z","links":{"resolver":"https://pith.science/pith/RVITWUBK2EF54VR2S55TYCNZKU","bundle":"https://pith.science/pith/RVITWUBK2EF54VR2S55TYCNZKU/bundle.json","state":"https://pith.science/pith/RVITWUBK2EF54VR2S55TYCNZKU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RVITWUBK2EF54VR2S55TYCNZKU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:RVITWUBK2EF54VR2S55TYCNZKU","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":"d9d4982fb945c27eb77fa0467b5497e31eab31a218bfa95b905e4370b6a7b1e3","cross_cats_sorted":["cs.DC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-02-12T00:58:31Z","title_canon_sha256":"7a5e6a20333bfb891f1ea669833530166f0c2199a41ef8bf1e0271927518f000"},"schema_version":"1.0","source":{"id":"2502.08042","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.08042","created_at":"2026-07-05T10:38:22Z"},{"alias_kind":"arxiv_version","alias_value":"2502.08042v2","created_at":"2026-07-05T10:38:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.08042","created_at":"2026-07-05T10:38:22Z"},{"alias_kind":"pith_short_12","alias_value":"RVITWUBK2EF5","created_at":"2026-07-05T10:38:22Z"},{"alias_kind":"pith_short_16","alias_value":"RVITWUBK2EF54VR2","created_at":"2026-07-05T10:38:22Z"},{"alias_kind":"pith_short_8","alias_value":"RVITWUBK","created_at":"2026-07-05T10:38:22Z"}],"graph_snapshots":[{"event_id":"sha256:0e65dca7eae832d2d49b66c3ee71d30d21061db38e8a681d1035669148910301","target":"graph","created_at":"2026-07-05T10:38:22Z","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/2502.08042/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper proposes efficient solutions for $k$-core decomposition with high parallelism. The problem of $k$-core decomposition is fundamental in graph analysis and has applications across various domains. However, existing algorithms face significant challenges in achieving work-efficiency in theory and/or high parallelism in practice, and suffer from various performance bottlenecks.\n  We present a simple, work-efficient parallel framework for $k$-core decomposition that is easy to implement and adaptable to various strategies for improving work-efficiency. We introduce two techniques to enha","authors_text":"Xiaojun Dong, Yan Gu, Yihan Sun, Youzhe Liu","cross_cats":["cs.DC"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-02-12T00:58:31Z","title":"Parallel $k$-Core Decomposition: Theory and Practice"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.08042","kind":"arxiv","version":2},"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:5b9c046ed27e2f44e6b6024bda4b13ec51d53687b56d48d8c75ac80ac298b4d7","target":"record","created_at":"2026-07-05T10:38:22Z","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":"d9d4982fb945c27eb77fa0467b5497e31eab31a218bfa95b905e4370b6a7b1e3","cross_cats_sorted":["cs.DC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-02-12T00:58:31Z","title_canon_sha256":"7a5e6a20333bfb891f1ea669833530166f0c2199a41ef8bf1e0271927518f000"},"schema_version":"1.0","source":{"id":"2502.08042","kind":"arxiv","version":2}},"canonical_sha256":"8d513b502ad10bde563a977b3c09b95525738399adf7263705339648cdcb7494","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8d513b502ad10bde563a977b3c09b95525738399adf7263705339648cdcb7494","first_computed_at":"2026-07-05T10:38:22.958857Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:38:22.958857Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LM1NrcvDIqlMMK8DlOOtmXC/a/2BmGOi4bWpsL8GKqLIaGgh/W4oIf3eaitM1pZ69ugNzUZSbuM5KPjvxiXOCA==","signature_status":"signed_v1","signed_at":"2026-07-05T10:38:22.959366Z","signed_message":"canonical_sha256_bytes"},"source_id":"2502.08042","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5b9c046ed27e2f44e6b6024bda4b13ec51d53687b56d48d8c75ac80ac298b4d7","sha256:0e65dca7eae832d2d49b66c3ee71d30d21061db38e8a681d1035669148910301"],"state_sha256":"ce6bfd73683db01c5bf8f5b66999088904e6b329dbe4255a0a6b3015ebb54f1c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PGbztOAuHjtbgA3btqDZWGyXtTl767CunYo2bNkVFpGrXK76uSZqdklYU3vJ9bxSRT3mtCWts/rMT/WzRkTCAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-18T16:04:48.390218Z","bundle_sha256":"5a39c5525d24cf9f748a6077dc9f4b571fd1386cb061d7a568406c6379c366ce"}}