{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:U3Z47Q67U26RM7EFXVSH55EEQP","short_pith_number":"pith:U3Z47Q67","schema_version":"1.0","canonical_sha256":"a6f3cfc3dfa6bd167c85bd647ef48483ef9fe5fe174dda9d69e476e7357131c0","source":{"kind":"arxiv","id":"2303.01007","version":2},"attestation_state":"computed","paper":{"title":"Hierarchical cycle-tree packing model for $K$-core attack problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","cs.CY","physics.soc-ph"],"primary_cat":"cond-mat.dis-nn","authors_text":"Hai-Jun Zhou, Jianwen Zhou","submitted_at":"2023-03-02T06:47:33Z","abstract_excerpt":"The $K$-core of a graph is the unique maximum subgraph within which each vertex connects to $K$ or more other vertices. The optimal $K$-core attack problem asks to delete the minimum number of vertices from the $K$-core to induce its complete collapse. A hierarchical cycle-tree packing model is introduced here for this challenging combinatorial optimization problem. We convert the temporally long-range correlated $K$-core pruning dynamics into locally tree-like static patterns and analyze this model through the replica-symmetric cavity method of statistical physics. A set of coarse-grained bel"},"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":"2303.01007","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2023-03-02T06:47:33Z","cross_cats_sorted":["cond-mat.stat-mech","cs.CY","physics.soc-ph"],"title_canon_sha256":"d7ecda02162b18bf6645c014e545b72b923391ba5efb9c4e3307f8a49d75ced4","abstract_canon_sha256":"9e5141552215e39bb99bb0b7e4f44e4baca232110331c7a8e12b95fd9972fafc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:31:39.296464Z","signature_b64":"ATVjCDM10QDTuJk2daM9jkJUJgeG5TUyIFOKiGwO9Ci/5i/c42sF7XU9ojY2LbFtOGT+Xs1RI2hVY1u0folBCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a6f3cfc3dfa6bd167c85bd647ef48483ef9fe5fe174dda9d69e476e7357131c0","last_reissued_at":"2026-07-05T08:31:39.296029Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:31:39.296029Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hierarchical cycle-tree packing model for $K$-core attack problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","cs.CY","physics.soc-ph"],"primary_cat":"cond-mat.dis-nn","authors_text":"Hai-Jun Zhou, Jianwen Zhou","submitted_at":"2023-03-02T06:47:33Z","abstract_excerpt":"The $K$-core of a graph is the unique maximum subgraph within which each vertex connects to $K$ or more other vertices. The optimal $K$-core attack problem asks to delete the minimum number of vertices from the $K$-core to induce its complete collapse. A hierarchical cycle-tree packing model is introduced here for this challenging combinatorial optimization problem. We convert the temporally long-range correlated $K$-core pruning dynamics into locally tree-like static patterns and analyze this model through the replica-symmetric cavity method of statistical physics. A set of coarse-grained bel"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.01007","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/2303.01007/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2303.01007","created_at":"2026-07-05T08:31:39.296090+00:00"},{"alias_kind":"arxiv_version","alias_value":"2303.01007v2","created_at":"2026-07-05T08:31:39.296090+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.01007","created_at":"2026-07-05T08:31:39.296090+00:00"},{"alias_kind":"pith_short_12","alias_value":"U3Z47Q67U26R","created_at":"2026-07-05T08:31:39.296090+00:00"},{"alias_kind":"pith_short_16","alias_value":"U3Z47Q67U26RM7EF","created_at":"2026-07-05T08:31:39.296090+00:00"},{"alias_kind":"pith_short_8","alias_value":"U3Z47Q67","created_at":"2026-07-05T08:31:39.296090+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/U3Z47Q67U26RM7EFXVSH55EEQP","json":"https://pith.science/pith/U3Z47Q67U26RM7EFXVSH55EEQP.json","graph_json":"https://pith.science/api/pith-number/U3Z47Q67U26RM7EFXVSH55EEQP/graph.json","events_json":"https://pith.science/api/pith-number/U3Z47Q67U26RM7EFXVSH55EEQP/events.json","paper":"https://pith.science/paper/U3Z47Q67"},"agent_actions":{"view_html":"https://pith.science/pith/U3Z47Q67U26RM7EFXVSH55EEQP","download_json":"https://pith.science/pith/U3Z47Q67U26RM7EFXVSH55EEQP.json","view_paper":"https://pith.science/paper/U3Z47Q67","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2303.01007&json=true","fetch_graph":"https://pith.science/api/pith-number/U3Z47Q67U26RM7EFXVSH55EEQP/graph.json","fetch_events":"https://pith.science/api/pith-number/U3Z47Q67U26RM7EFXVSH55EEQP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U3Z47Q67U26RM7EFXVSH55EEQP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U3Z47Q67U26RM7EFXVSH55EEQP/action/storage_attestation","attest_author":"https://pith.science/pith/U3Z47Q67U26RM7EFXVSH55EEQP/action/author_attestation","sign_citation":"https://pith.science/pith/U3Z47Q67U26RM7EFXVSH55EEQP/action/citation_signature","submit_replication":"https://pith.science/pith/U3Z47Q67U26RM7EFXVSH55EEQP/action/replication_record"}},"created_at":"2026-07-05T08:31:39.296090+00:00","updated_at":"2026-07-05T08:31:39.296090+00:00"}