{"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"}