{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:YKLSFBX5HDK4P4I3ITJBX4EEUM","short_pith_number":"pith:YKLSFBX5","canonical_record":{"source":{"id":"1904.07262","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-15T18:01:04Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"4852c759ad03aa569e1eeb8521a1202b3df9629127187f8e596efe63d4f7c138","abstract_canon_sha256":"48e0e67b8636f5b384580068fdd9dce5f4dcd973a71fa8c092727c0e89a1c3a2"},"schema_version":"1.0"},"canonical_sha256":"c2972286fd38d5c7f11b44d21bf084a30b00d1793c127ed85bc6247ed6e8b560","source":{"kind":"arxiv","id":"1904.07262","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.07262","created_at":"2026-05-17T23:48:29Z"},{"alias_kind":"arxiv_version","alias_value":"1904.07262v1","created_at":"2026-05-17T23:48:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.07262","created_at":"2026-05-17T23:48:29Z"},{"alias_kind":"pith_short_12","alias_value":"YKLSFBX5HDK4","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"YKLSFBX5HDK4P4I3","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"YKLSFBX5","created_at":"2026-05-18T12:33:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:YKLSFBX5HDK4P4I3ITJBX4EEUM","target":"record","payload":{"canonical_record":{"source":{"id":"1904.07262","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-15T18:01:04Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"4852c759ad03aa569e1eeb8521a1202b3df9629127187f8e596efe63d4f7c138","abstract_canon_sha256":"48e0e67b8636f5b384580068fdd9dce5f4dcd973a71fa8c092727c0e89a1c3a2"},"schema_version":"1.0"},"canonical_sha256":"c2972286fd38d5c7f11b44d21bf084a30b00d1793c127ed85bc6247ed6e8b560","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:29.149535Z","signature_b64":"/WdbFX4VJ+/OhpgHgNdUSlRlVGwRt6Z+Hzcq6hl604T+2VIhYw+sn5szVeWhj6yYTSQ+DrgsUYqcLgFsAYw2BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c2972286fd38d5c7f11b44d21bf084a30b00d1793c127ed85bc6247ed6e8b560","last_reissued_at":"2026-05-17T23:48:29.149070Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:29.149070Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1904.07262","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-05-17T23:48:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X/6tOPXOWbHNoQWorXt8ggfrwN/PxGXvsBBfgs9MdaocWquI1XWljtYfrtkxyn+h8E/OJnb4uIZ20qt6K5EGBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T12:59:24.360126Z"},"content_sha256":"ba4547ea8be5a2d9f7023048aaf6eac36cb6b2b072fb3d3b2b528c6ccfc6d77e","schema_version":"1.0","event_id":"sha256:ba4547ea8be5a2d9f7023048aaf6eac36cb6b2b072fb3d3b2b528c6ccfc6d77e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:YKLSFBX5HDK4P4I3ITJBX4EEUM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distance-generalized Core Decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.DS","authors_text":"Arijit Khan, Francesco Bonchi, Lorenzo Severini","submitted_at":"2019-04-15T18:01:04Z","abstract_excerpt":"The $k$-core of a graph is defined as the maximal subgraph in which every vertex is connected to at least $k$ other vertices within that subgraph. In this work we introduce a distance-based generalization of the notion of $k$-core, which we refer to as the $(k,h)$-core, i.e., the maximal subgraph in which every vertex has at least $k$ other vertices at distance $\\leq h$ within that subgraph. We study the properties of the $(k,h)$-core showing that it preserves many of the nice features of the classic core decomposition (e.g., its connection with the notion of distance-generalized chromatic num"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.07262","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":""},"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-05-17T23:48:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D+Wv5tYR5Cq7YII02N8vf1XKOTRPhmZcJJ3XeFe6J1JuJdaKFE3setQF1rVY6kEZwRU3F7Z8ajJK7DicXV91BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T12:59:24.360489Z"},"content_sha256":"0efdacfaa3f81c783f1fcb0ea3a375e63b79107c31aefbc681727293c14449df","schema_version":"1.0","event_id":"sha256:0efdacfaa3f81c783f1fcb0ea3a375e63b79107c31aefbc681727293c14449df"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YKLSFBX5HDK4P4I3ITJBX4EEUM/bundle.json","state_url":"https://pith.science/pith/YKLSFBX5HDK4P4I3ITJBX4EEUM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YKLSFBX5HDK4P4I3ITJBX4EEUM/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-06-21T12:59:24Z","links":{"resolver":"https://pith.science/pith/YKLSFBX5HDK4P4I3ITJBX4EEUM","bundle":"https://pith.science/pith/YKLSFBX5HDK4P4I3ITJBX4EEUM/bundle.json","state":"https://pith.science/pith/YKLSFBX5HDK4P4I3ITJBX4EEUM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YKLSFBX5HDK4P4I3ITJBX4EEUM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:YKLSFBX5HDK4P4I3ITJBX4EEUM","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":"48e0e67b8636f5b384580068fdd9dce5f4dcd973a71fa8c092727c0e89a1c3a2","cross_cats_sorted":["cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-15T18:01:04Z","title_canon_sha256":"4852c759ad03aa569e1eeb8521a1202b3df9629127187f8e596efe63d4f7c138"},"schema_version":"1.0","source":{"id":"1904.07262","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.07262","created_at":"2026-05-17T23:48:29Z"},{"alias_kind":"arxiv_version","alias_value":"1904.07262v1","created_at":"2026-05-17T23:48:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.07262","created_at":"2026-05-17T23:48:29Z"},{"alias_kind":"pith_short_12","alias_value":"YKLSFBX5HDK4","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"YKLSFBX5HDK4P4I3","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"YKLSFBX5","created_at":"2026-05-18T12:33:33Z"}],"graph_snapshots":[{"event_id":"sha256:0efdacfaa3f81c783f1fcb0ea3a375e63b79107c31aefbc681727293c14449df","target":"graph","created_at":"2026-05-17T23:48:29Z","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"},"paper":{"abstract_excerpt":"The $k$-core of a graph is defined as the maximal subgraph in which every vertex is connected to at least $k$ other vertices within that subgraph. In this work we introduce a distance-based generalization of the notion of $k$-core, which we refer to as the $(k,h)$-core, i.e., the maximal subgraph in which every vertex has at least $k$ other vertices at distance $\\leq h$ within that subgraph. We study the properties of the $(k,h)$-core showing that it preserves many of the nice features of the classic core decomposition (e.g., its connection with the notion of distance-generalized chromatic num","authors_text":"Arijit Khan, Francesco Bonchi, Lorenzo Severini","cross_cats":["cs.SI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-15T18:01:04Z","title":"Distance-generalized Core Decomposition"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.07262","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:ba4547ea8be5a2d9f7023048aaf6eac36cb6b2b072fb3d3b2b528c6ccfc6d77e","target":"record","created_at":"2026-05-17T23:48:29Z","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":"48e0e67b8636f5b384580068fdd9dce5f4dcd973a71fa8c092727c0e89a1c3a2","cross_cats_sorted":["cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-15T18:01:04Z","title_canon_sha256":"4852c759ad03aa569e1eeb8521a1202b3df9629127187f8e596efe63d4f7c138"},"schema_version":"1.0","source":{"id":"1904.07262","kind":"arxiv","version":1}},"canonical_sha256":"c2972286fd38d5c7f11b44d21bf084a30b00d1793c127ed85bc6247ed6e8b560","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c2972286fd38d5c7f11b44d21bf084a30b00d1793c127ed85bc6247ed6e8b560","first_computed_at":"2026-05-17T23:48:29.149070Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:48:29.149070Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/WdbFX4VJ+/OhpgHgNdUSlRlVGwRt6Z+Hzcq6hl604T+2VIhYw+sn5szVeWhj6yYTSQ+DrgsUYqcLgFsAYw2BQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:48:29.149535Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.07262","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ba4547ea8be5a2d9f7023048aaf6eac36cb6b2b072fb3d3b2b528c6ccfc6d77e","sha256:0efdacfaa3f81c783f1fcb0ea3a375e63b79107c31aefbc681727293c14449df"],"state_sha256":"d4e92501806db68e60c468e7f9034252a3a1ddc7c8c2d098e24bc22b0f9d92a6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wTGFXdAHBSd0pA83mogF3Es8Jw5AdasFaJ93U/sumrAZh5Cgb9I0Tfb9DC63xpekMLIAVKH/VCpyuBjDXcm5Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T12:59:24.362406Z","bundle_sha256":"809f08417c0085a719d9a7760ddf076eeb86c2b5c43332b22459b30e36f3e753"}}