{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:BXCTJSFZ67Y5S2OU7GLS3ZMNJS","short_pith_number":"pith:BXCTJSFZ","canonical_record":{"source":{"id":"2202.05990","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2022-02-12T05:26:25Z","cross_cats_sorted":[],"title_canon_sha256":"87eb92f7c1987b38c22b62079c35f1b7ee834e664bcac5c0f87780dd749a9924","abstract_canon_sha256":"8789602a0df52f0293fea03b8daa548e5b9f4e4f5cbf919111e9410bb9f47609"},"schema_version":"1.0"},"canonical_sha256":"0dc534c8b9f7f1d969d4f9972de58d4c838c12f0acd02e17229987fcf84de157","source":{"kind":"arxiv","id":"2202.05990","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2202.05990","created_at":"2026-07-05T03:56:19Z"},{"alias_kind":"arxiv_version","alias_value":"2202.05990v1","created_at":"2026-07-05T03:56:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2202.05990","created_at":"2026-07-05T03:56:19Z"},{"alias_kind":"pith_short_12","alias_value":"BXCTJSFZ67Y5","created_at":"2026-07-05T03:56:19Z"},{"alias_kind":"pith_short_16","alias_value":"BXCTJSFZ67Y5S2OU","created_at":"2026-07-05T03:56:19Z"},{"alias_kind":"pith_short_8","alias_value":"BXCTJSFZ","created_at":"2026-07-05T03:56:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:BXCTJSFZ67Y5S2OU7GLS3ZMNJS","target":"record","payload":{"canonical_record":{"source":{"id":"2202.05990","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2022-02-12T05:26:25Z","cross_cats_sorted":[],"title_canon_sha256":"87eb92f7c1987b38c22b62079c35f1b7ee834e664bcac5c0f87780dd749a9924","abstract_canon_sha256":"8789602a0df52f0293fea03b8daa548e5b9f4e4f5cbf919111e9410bb9f47609"},"schema_version":"1.0"},"canonical_sha256":"0dc534c8b9f7f1d969d4f9972de58d4c838c12f0acd02e17229987fcf84de157","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:56:19.756953Z","signature_b64":"Z1TsyRA2ukiFWbEXSPnZVeCoQJV318WasVflGuhgZYAvQnc6rIwgcII3HmrhuLwZOrArkoDVJ3qANzuURMF8BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0dc534c8b9f7f1d969d4f9972de58d4c838c12f0acd02e17229987fcf84de157","last_reissued_at":"2026-07-05T03:56:19.756537Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:56:19.756537Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2202.05990","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-05T03:56:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"af6eeSNSHtAV/LXar1Mhn1qgy8cZogFYEcmMKNUTB0w9WQu0Um6UcCrrzAj+e4oTmllRIqgmnyeLSZy8WeT9Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-08T15:16:13.475443Z"},"content_sha256":"46c7c2e85c4bd10a39c9c69601d61e59f14e3735e7ab41e5c0432c6acd5e8991","schema_version":"1.0","event_id":"sha256:46c7c2e85c4bd10a39c9c69601d61e59f14e3735e7ab41e5c0432c6acd5e8991"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:BXCTJSFZ67Y5S2OU7GLS3ZMNJS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed D-core Decomposition over Large Directed Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Byron Choi, Jianliang Xu, Jiaxin Jiang, Qing Liu, Xin Huang, Xuankun Liao","submitted_at":"2022-02-12T05:26:25Z","abstract_excerpt":"Given a directed graph $G$ and integers $k$ and $l$, a D-core is the maximal subgraph $H \\subseteq G$ such that for every vertex of $H$, its in-degree and out-degree are no smaller than $k$ and $l$, respectively. For a directed graph $G$, the problem of D-core decomposition aims to compute the non-empty D-cores for all possible values of $k$ and $l$. In the literature, several \\emph{peeling-based} algorithms have been proposed to handle D-core decomposition. However, the peeling-based algorithms that work in a sequential fashion and require global graph information during processing are mainly"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2202.05990","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/2202.05990/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-05T03:56:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lISiC3sPRPcnHM9Rei6c9US5/ExZho0joRSIAi5JZ87tcfxTCphTLSlzpKtm6C95HAuhgkfgzrJvgJiRYP7HBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-08T15:16:13.475865Z"},"content_sha256":"ad653b6a092d0d3cdf1ba9b6796b0075d15a34dacd2045f9731ee49e3110f8e4","schema_version":"1.0","event_id":"sha256:ad653b6a092d0d3cdf1ba9b6796b0075d15a34dacd2045f9731ee49e3110f8e4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BXCTJSFZ67Y5S2OU7GLS3ZMNJS/bundle.json","state_url":"https://pith.science/pith/BXCTJSFZ67Y5S2OU7GLS3ZMNJS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BXCTJSFZ67Y5S2OU7GLS3ZMNJS/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-07-08T15:16:13Z","links":{"resolver":"https://pith.science/pith/BXCTJSFZ67Y5S2OU7GLS3ZMNJS","bundle":"https://pith.science/pith/BXCTJSFZ67Y5S2OU7GLS3ZMNJS/bundle.json","state":"https://pith.science/pith/BXCTJSFZ67Y5S2OU7GLS3ZMNJS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BXCTJSFZ67Y5S2OU7GLS3ZMNJS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:BXCTJSFZ67Y5S2OU7GLS3ZMNJS","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":"8789602a0df52f0293fea03b8daa548e5b9f4e4f5cbf919111e9410bb9f47609","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2022-02-12T05:26:25Z","title_canon_sha256":"87eb92f7c1987b38c22b62079c35f1b7ee834e664bcac5c0f87780dd749a9924"},"schema_version":"1.0","source":{"id":"2202.05990","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2202.05990","created_at":"2026-07-05T03:56:19Z"},{"alias_kind":"arxiv_version","alias_value":"2202.05990v1","created_at":"2026-07-05T03:56:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2202.05990","created_at":"2026-07-05T03:56:19Z"},{"alias_kind":"pith_short_12","alias_value":"BXCTJSFZ67Y5","created_at":"2026-07-05T03:56:19Z"},{"alias_kind":"pith_short_16","alias_value":"BXCTJSFZ67Y5S2OU","created_at":"2026-07-05T03:56:19Z"},{"alias_kind":"pith_short_8","alias_value":"BXCTJSFZ","created_at":"2026-07-05T03:56:19Z"}],"graph_snapshots":[{"event_id":"sha256:ad653b6a092d0d3cdf1ba9b6796b0075d15a34dacd2045f9731ee49e3110f8e4","target":"graph","created_at":"2026-07-05T03:56:19Z","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/2202.05990/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Given a directed graph $G$ and integers $k$ and $l$, a D-core is the maximal subgraph $H \\subseteq G$ such that for every vertex of $H$, its in-degree and out-degree are no smaller than $k$ and $l$, respectively. For a directed graph $G$, the problem of D-core decomposition aims to compute the non-empty D-cores for all possible values of $k$ and $l$. In the literature, several \\emph{peeling-based} algorithms have been proposed to handle D-core decomposition. However, the peeling-based algorithms that work in a sequential fashion and require global graph information during processing are mainly","authors_text":"Byron Choi, Jianliang Xu, Jiaxin Jiang, Qing Liu, Xin Huang, Xuankun Liao","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2022-02-12T05:26:25Z","title":"Distributed D-core Decomposition over Large Directed Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2202.05990","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:46c7c2e85c4bd10a39c9c69601d61e59f14e3735e7ab41e5c0432c6acd5e8991","target":"record","created_at":"2026-07-05T03:56:19Z","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":"8789602a0df52f0293fea03b8daa548e5b9f4e4f5cbf919111e9410bb9f47609","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2022-02-12T05:26:25Z","title_canon_sha256":"87eb92f7c1987b38c22b62079c35f1b7ee834e664bcac5c0f87780dd749a9924"},"schema_version":"1.0","source":{"id":"2202.05990","kind":"arxiv","version":1}},"canonical_sha256":"0dc534c8b9f7f1d969d4f9972de58d4c838c12f0acd02e17229987fcf84de157","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0dc534c8b9f7f1d969d4f9972de58d4c838c12f0acd02e17229987fcf84de157","first_computed_at":"2026-07-05T03:56:19.756537Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:56:19.756537Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Z1TsyRA2ukiFWbEXSPnZVeCoQJV318WasVflGuhgZYAvQnc6rIwgcII3HmrhuLwZOrArkoDVJ3qANzuURMF8BQ==","signature_status":"signed_v1","signed_at":"2026-07-05T03:56:19.756953Z","signed_message":"canonical_sha256_bytes"},"source_id":"2202.05990","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:46c7c2e85c4bd10a39c9c69601d61e59f14e3735e7ab41e5c0432c6acd5e8991","sha256:ad653b6a092d0d3cdf1ba9b6796b0075d15a34dacd2045f9731ee49e3110f8e4"],"state_sha256":"651c3df5c321a4d21ee9ea5511bacc751fd35d0d226da02dd2719254c4746291"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jWzFKpXC/LYCfkeLG9AloFUBdW46G5wJ3gatPXRlhjs9kqLJdxRGu62DOR7pM9wc/GyKMJovednfR5eJOlWQAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-08T15:16:13.478240Z","bundle_sha256":"cea42cc19e1b8914fdf7a70712e472c0f822652f2249d9bc14e70528d65f9b70"}}