{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:J3SK7ONAYJ4Y7V42PDSAHXT54D","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":"5365ecdf1c7ee680ad19377ae42624e3ad0262826e4fb3d45ae8ced87f6c364f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-06-05T11:19:17Z","title_canon_sha256":"d4b23a0086d2b5372e0bfabcd308668a4850dca31ca3299a3f31b0c84b58b6cb"},"schema_version":"1.0","source":{"id":"2006.03372","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2006.03372","created_at":"2026-07-05T03:24:39Z"},{"alias_kind":"arxiv_version","alias_value":"2006.03372v2","created_at":"2026-07-05T03:24:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.03372","created_at":"2026-07-05T03:24:39Z"},{"alias_kind":"pith_short_12","alias_value":"J3SK7ONAYJ4Y","created_at":"2026-07-05T03:24:39Z"},{"alias_kind":"pith_short_16","alias_value":"J3SK7ONAYJ4Y7V42","created_at":"2026-07-05T03:24:39Z"},{"alias_kind":"pith_short_8","alias_value":"J3SK7ONA","created_at":"2026-07-05T03:24:39Z"}],"graph_snapshots":[{"event_id":"sha256:b7379f67aff3c9570bdd794f66cff44f8f1ece7809d0bef2bbeb9a16432796ba","target":"graph","created_at":"2026-07-05T03:24:39Z","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/2006.03372/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Core decomposition is a fundamental operator in network analysis. In this paper, we study the problem of computing distance-generalized core decomposition on a network. A distance-generalized core, also termed $(k, h)$-core, is a maximal subgraph in which every vertex has at least $k$ other vertices at distance no larger than $h$. The state-of-the-art algorithm for solving this problem is based on a peeling technique which iteratively removes the vertex (denoted by $v$) from the graph that has the smallest $h$-degree. The $h$-degree of a vertex $v$ denotes the number of other vertices that are","authors_text":"Guoren Wang, Lu Qin, Qiangqiang Dai, Rong-Hua Li, Weihua Yang, Ye Yuan, Zhiwei Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-06-05T11:19:17Z","title":"Scaling Up Distance-generalized Core Decomposition"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.03372","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:55a41796c472b8e3263c461caf1e06b395c2340b7e21c314bf7a4c41c437f468","target":"record","created_at":"2026-07-05T03:24:39Z","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":"5365ecdf1c7ee680ad19377ae42624e3ad0262826e4fb3d45ae8ced87f6c364f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-06-05T11:19:17Z","title_canon_sha256":"d4b23a0086d2b5372e0bfabcd308668a4850dca31ca3299a3f31b0c84b58b6cb"},"schema_version":"1.0","source":{"id":"2006.03372","kind":"arxiv","version":2}},"canonical_sha256":"4ee4afb9a0c2798fd79a78e403de7de0dca057a4d28b2c4383d9f6696f0f1f60","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4ee4afb9a0c2798fd79a78e403de7de0dca057a4d28b2c4383d9f6696f0f1f60","first_computed_at":"2026-07-05T03:24:39.748960Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:24:39.748960Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hKRMdsXlhajO5IoYQC8K+P4hrVEWLPpQ+KYaDbeIk/AnboXE624n6+OdcAGGnT47bQlcdviYdai2tUliSbxZAw==","signature_status":"signed_v1","signed_at":"2026-07-05T03:24:39.749422Z","signed_message":"canonical_sha256_bytes"},"source_id":"2006.03372","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:55a41796c472b8e3263c461caf1e06b395c2340b7e21c314bf7a4c41c437f468","sha256:b7379f67aff3c9570bdd794f66cff44f8f1ece7809d0bef2bbeb9a16432796ba"],"state_sha256":"f105cade938d9c706374c79c97115b869b1cf19959e2ff7c92413b3e896ac571"}