{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:GL5OC37FZRBW3OZYAWVP5W7EIT","short_pith_number":"pith:GL5OC37F","schema_version":"1.0","canonical_sha256":"32fae16fe5cc436dbb3805aafedbe444fdb8935a570c14ef51c247948ceb7d14","source":{"kind":"arxiv","id":"1807.11695","version":2},"attestation_state":"computed","paper":{"title":"Generalization of core percolation on complex networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cond-mat.dis-nn","authors_text":"N. Azimi-Tafreshi, S. N. Dorogovtsev, S. Osat","submitted_at":"2018-07-31T07:53:47Z","abstract_excerpt":"We introduce a $k$-leaf removal algorithm as a generalization of the so-called leaf removal algorithm. In this pruning algorithm, vertices of degree smaller than $k$, together with their first nearest neighbors and all incident edges are progressively removed from a random network. As the result of this pruning the network is reduced to a subgraph which we call the Generalized $k$-core ($Gk$-core). Performing this pruning for the sequence of natural numbers $k$, we decompose the network into a hierarchy of progressively nested $Gk$-cores. We present an analytical framework for description of $"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1807.11695","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2018-07-31T07:53:47Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"f817bb00f942080f1f46b608c68893e92a5f96a3a554234e07155ecae58764a6","abstract_canon_sha256":"f760ca4040b48d8d9928d7a2696db7d4b47c55ae26d03d9f921427ced9ee8f1d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:52.571364Z","signature_b64":"nAhUYHTNrjKEaDPYBvL9i+3ekkM2cBASO2XaORC2i4vElLaM5hggJ2Hw7zo97SM15zFmThHxLNR+DoTbCHKiAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"32fae16fe5cc436dbb3805aafedbe444fdb8935a570c14ef51c247948ceb7d14","last_reissued_at":"2026-05-17T23:52:52.570671Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:52.570671Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generalization of core percolation on complex networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cond-mat.dis-nn","authors_text":"N. Azimi-Tafreshi, S. N. Dorogovtsev, S. Osat","submitted_at":"2018-07-31T07:53:47Z","abstract_excerpt":"We introduce a $k$-leaf removal algorithm as a generalization of the so-called leaf removal algorithm. In this pruning algorithm, vertices of degree smaller than $k$, together with their first nearest neighbors and all incident edges are progressively removed from a random network. As the result of this pruning the network is reduced to a subgraph which we call the Generalized $k$-core ($Gk$-core). Performing this pruning for the sequence of natural numbers $k$, we decompose the network into a hierarchy of progressively nested $Gk$-cores. We present an analytical framework for description of $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.11695","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":""},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1807.11695","created_at":"2026-05-17T23:52:52.570776+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.11695v2","created_at":"2026-05-17T23:52:52.570776+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.11695","created_at":"2026-05-17T23:52:52.570776+00:00"},{"alias_kind":"pith_short_12","alias_value":"GL5OC37FZRBW","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_16","alias_value":"GL5OC37FZRBW3OZY","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_8","alias_value":"GL5OC37F","created_at":"2026-05-18T12:32:25.280505+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GL5OC37FZRBW3OZYAWVP5W7EIT","json":"https://pith.science/pith/GL5OC37FZRBW3OZYAWVP5W7EIT.json","graph_json":"https://pith.science/api/pith-number/GL5OC37FZRBW3OZYAWVP5W7EIT/graph.json","events_json":"https://pith.science/api/pith-number/GL5OC37FZRBW3OZYAWVP5W7EIT/events.json","paper":"https://pith.science/paper/GL5OC37F"},"agent_actions":{"view_html":"https://pith.science/pith/GL5OC37FZRBW3OZYAWVP5W7EIT","download_json":"https://pith.science/pith/GL5OC37FZRBW3OZYAWVP5W7EIT.json","view_paper":"https://pith.science/paper/GL5OC37F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.11695&json=true","fetch_graph":"https://pith.science/api/pith-number/GL5OC37FZRBW3OZYAWVP5W7EIT/graph.json","fetch_events":"https://pith.science/api/pith-number/GL5OC37FZRBW3OZYAWVP5W7EIT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GL5OC37FZRBW3OZYAWVP5W7EIT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GL5OC37FZRBW3OZYAWVP5W7EIT/action/storage_attestation","attest_author":"https://pith.science/pith/GL5OC37FZRBW3OZYAWVP5W7EIT/action/author_attestation","sign_citation":"https://pith.science/pith/GL5OC37FZRBW3OZYAWVP5W7EIT/action/citation_signature","submit_replication":"https://pith.science/pith/GL5OC37FZRBW3OZYAWVP5W7EIT/action/replication_record"}},"created_at":"2026-05-17T23:52:52.570776+00:00","updated_at":"2026-05-17T23:52:52.570776+00:00"}