{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:6WJA3YJ4UXB56G7YOSJTTAI3HD","short_pith_number":"pith:6WJA3YJ4","schema_version":"1.0","canonical_sha256":"f5920de13ca5c3df1bf8749339811b38e18c3c117e0c682cd5ff58cdec31a45a","source":{"kind":"arxiv","id":"2606.23289","version":1},"attestation_state":"computed","paper":{"title":"Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"physics.soc-ph","authors_text":"Hongwei Zheng, Longzhao Liu, Shaoting Tang, Xin Wang, Yajing Hao, Zhihao Han","submitted_at":"2026-06-22T13:04:05Z","abstract_excerpt":"Network dismantling aims to identify a node removal sequence that can rapidly destroy network connectivity, which is an important problem for understanding the structural fragility of complex systems and designing intervention strategies. Existing studies mainly focus on pairwise networks or assume weak-deletion rules where node removal only causes hyperedges to shrink in higher-order networks. However, in many real higher-order systems, the failure of one participant may cause the entire group interaction to fail, i.e., the strong-deletion mechanism. Such a mechanism cannot be fully captured "},"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":"2606.23289","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2026-06-22T13:04:05Z","cross_cats_sorted":[],"title_canon_sha256":"2413afc1bdfbdc4a2351d7ec0db1b6c0ee9ca1e667c5f224602cc32a07821668","abstract_canon_sha256":"25ce00aca73d4fd6dca1eaaa57f99508be50baa76d0df4bcb6305b8c01abf2df"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-23T03:14:15.859238Z","signature_b64":"N1ODIs9zoRgWGa7CaUgCfUM5B/mNBOPdCjuU2ABtLBNw4xQQynC78iW0kAcx9mvhPvDXpWQSmKadtwkUk/bbAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f5920de13ca5c3df1bf8749339811b38e18c3c117e0c682cd5ff58cdec31a45a","last_reissued_at":"2026-06-23T03:14:15.858841Z","signature_status":"signed_v1","first_computed_at":"2026-06-23T03:14:15.858841Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"physics.soc-ph","authors_text":"Hongwei Zheng, Longzhao Liu, Shaoting Tang, Xin Wang, Yajing Hao, Zhihao Han","submitted_at":"2026-06-22T13:04:05Z","abstract_excerpt":"Network dismantling aims to identify a node removal sequence that can rapidly destroy network connectivity, which is an important problem for understanding the structural fragility of complex systems and designing intervention strategies. Existing studies mainly focus on pairwise networks or assume weak-deletion rules where node removal only causes hyperedges to shrink in higher-order networks. However, in many real higher-order systems, the failure of one participant may cause the entire group interaction to fail, i.e., the strong-deletion mechanism. Such a mechanism cannot be fully captured "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.23289","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.23289/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":"2606.23289","created_at":"2026-06-23T03:14:15.858904+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.23289v1","created_at":"2026-06-23T03:14:15.858904+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.23289","created_at":"2026-06-23T03:14:15.858904+00:00"},{"alias_kind":"pith_short_12","alias_value":"6WJA3YJ4UXB5","created_at":"2026-06-23T03:14:15.858904+00:00"},{"alias_kind":"pith_short_16","alias_value":"6WJA3YJ4UXB56G7Y","created_at":"2026-06-23T03:14:15.858904+00:00"},{"alias_kind":"pith_short_8","alias_value":"6WJA3YJ4","created_at":"2026-06-23T03:14:15.858904+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.07874","citing_title":"Adaptive higher-order contagion of harmful information with platform-induced group dissolution and individual rewiring","ref_index":27,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6WJA3YJ4UXB56G7YOSJTTAI3HD","json":"https://pith.science/pith/6WJA3YJ4UXB56G7YOSJTTAI3HD.json","graph_json":"https://pith.science/api/pith-number/6WJA3YJ4UXB56G7YOSJTTAI3HD/graph.json","events_json":"https://pith.science/api/pith-number/6WJA3YJ4UXB56G7YOSJTTAI3HD/events.json","paper":"https://pith.science/paper/6WJA3YJ4"},"agent_actions":{"view_html":"https://pith.science/pith/6WJA3YJ4UXB56G7YOSJTTAI3HD","download_json":"https://pith.science/pith/6WJA3YJ4UXB56G7YOSJTTAI3HD.json","view_paper":"https://pith.science/paper/6WJA3YJ4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.23289&json=true","fetch_graph":"https://pith.science/api/pith-number/6WJA3YJ4UXB56G7YOSJTTAI3HD/graph.json","fetch_events":"https://pith.science/api/pith-number/6WJA3YJ4UXB56G7YOSJTTAI3HD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6WJA3YJ4UXB56G7YOSJTTAI3HD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6WJA3YJ4UXB56G7YOSJTTAI3HD/action/storage_attestation","attest_author":"https://pith.science/pith/6WJA3YJ4UXB56G7YOSJTTAI3HD/action/author_attestation","sign_citation":"https://pith.science/pith/6WJA3YJ4UXB56G7YOSJTTAI3HD/action/citation_signature","submit_replication":"https://pith.science/pith/6WJA3YJ4UXB56G7YOSJTTAI3HD/action/replication_record"}},"created_at":"2026-06-23T03:14:15.858904+00:00","updated_at":"2026-06-23T03:14:15.858904+00:00"}