{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:J3SK7ONAYJ4Y7V42PDSAHXT54D","short_pith_number":"pith:J3SK7ONA","canonical_record":{"source":{"id":"2006.03372","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-06-05T11:19:17Z","cross_cats_sorted":[],"title_canon_sha256":"d4b23a0086d2b5372e0bfabcd308668a4850dca31ca3299a3f31b0c84b58b6cb","abstract_canon_sha256":"5365ecdf1c7ee680ad19377ae42624e3ad0262826e4fb3d45ae8ced87f6c364f"},"schema_version":"1.0"},"canonical_sha256":"4ee4afb9a0c2798fd79a78e403de7de0dca057a4d28b2c4383d9f6696f0f1f60","source":{"kind":"arxiv","id":"2006.03372","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:J3SK7ONAYJ4Y7V42PDSAHXT54D","target":"record","payload":{"canonical_record":{"source":{"id":"2006.03372","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-06-05T11:19:17Z","cross_cats_sorted":[],"title_canon_sha256":"d4b23a0086d2b5372e0bfabcd308668a4850dca31ca3299a3f31b0c84b58b6cb","abstract_canon_sha256":"5365ecdf1c7ee680ad19377ae42624e3ad0262826e4fb3d45ae8ced87f6c364f"},"schema_version":"1.0"},"canonical_sha256":"4ee4afb9a0c2798fd79a78e403de7de0dca057a4d28b2c4383d9f6696f0f1f60","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:24:39.749422Z","signature_b64":"hKRMdsXlhajO5IoYQC8K+P4hrVEWLPpQ+KYaDbeIk/AnboXE624n6+OdcAGGnT47bQlcdviYdai2tUliSbxZAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4ee4afb9a0c2798fd79a78e403de7de0dca057a4d28b2c4383d9f6696f0f1f60","last_reissued_at":"2026-07-05T03:24:39.748960Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:24:39.748960Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2006.03372","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-05T03:24:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a1td8/jwwqi/xdl16hpJ56iOY+MbIO4lJ7lSLZmuCgQwH0jSH7+zEKXuZw5+o7w61/O7wF60BxoCo3DPiXPDDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T00:05:55.986634Z"},"content_sha256":"55a41796c472b8e3263c461caf1e06b395c2340b7e21c314bf7a4c41c437f468","schema_version":"1.0","event_id":"sha256:55a41796c472b8e3263c461caf1e06b395c2340b7e21c314bf7a4c41c437f468"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:J3SK7ONAYJ4Y7V42PDSAHXT54D","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Scaling Up Distance-generalized Core Decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Guoren Wang, Lu Qin, Qiangqiang Dai, Rong-Hua Li, Weihua Yang, Ye Yuan, Zhiwei Zhang","submitted_at":"2020-06-05T11:19:17Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.03372","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/2006.03372/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:24:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"32J7J+kzfy9t8PWQT2giRqetEVdJCXd6TDWjW2F8LWiKbktRKkY1jNWph+ZTxMOy1fhW4jQuY83hbjn09BJQDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T00:05:55.987564Z"},"content_sha256":"b7379f67aff3c9570bdd794f66cff44f8f1ece7809d0bef2bbeb9a16432796ba","schema_version":"1.0","event_id":"sha256:b7379f67aff3c9570bdd794f66cff44f8f1ece7809d0bef2bbeb9a16432796ba"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/J3SK7ONAYJ4Y7V42PDSAHXT54D/bundle.json","state_url":"https://pith.science/pith/J3SK7ONAYJ4Y7V42PDSAHXT54D/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/J3SK7ONAYJ4Y7V42PDSAHXT54D/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-07T00:05:56Z","links":{"resolver":"https://pith.science/pith/J3SK7ONAYJ4Y7V42PDSAHXT54D","bundle":"https://pith.science/pith/J3SK7ONAYJ4Y7V42PDSAHXT54D/bundle.json","state":"https://pith.science/pith/J3SK7ONAYJ4Y7V42PDSAHXT54D/state.json","well_known_bundle":"https://pith.science/.well-known/pith/J3SK7ONAYJ4Y7V42PDSAHXT54D/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mDsCoSv0g3YD2Uvh3NmObj7wB77ju67a+1vSxF7vKJfaYS4C8pM0KsvvDRmgbSdW3RJepwj/VbwbVHrAPpC7CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T00:05:56.181967Z","bundle_sha256":"a1e3816a7357602bdeb0e7bfafdb26e9b88217365ed20dd07f19a20e82c5b4e9"}}