{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:WFSPGDZD347K7NHO37Z4K4UOTU","short_pith_number":"pith:WFSPGDZD","schema_version":"1.0","canonical_sha256":"b164f30f23df3eafb4eedff3c5728e9d1b0b9160716236020d06c55bf8ba98e7","source":{"kind":"arxiv","id":"2305.12297","version":2},"attestation_state":"computed","paper":{"title":"The theory of percolation on hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.dis-nn","cond-mat.stat-mech","cs.SI"],"primary_cat":"physics.soc-ph","authors_text":"Ginestra Bianconi, Sergey N. Dorogovtsev","submitted_at":"2023-05-20T22:32:05Z","abstract_excerpt":"Hypergraphs capture the higher-order interactions in complex systems and always admit a factor graph representation, consisting of a bipartite network of nodes and hyperedges. As hypegraphs are ubiquitous, investigating hypergraph robustness is a problem of major research interest. In the literature the robustness of hypergraphs as been so far only treated adopting factor-graph percolation which describe well higher-order interactions which remain functional even after the removal of one of more of their nodes. This approach, however, fall short to describe situations in which higher-order int"},"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":"2305.12297","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2023-05-20T22:32:05Z","cross_cats_sorted":["cond-mat.dis-nn","cond-mat.stat-mech","cs.SI"],"title_canon_sha256":"44670ab35fdb960a7295412d981d87344ff376102c4b00219c9cc1925c588c38","abstract_canon_sha256":"3e23a1bd9776edcae666fbd4e696297969532a9b9b0b6e6ab9882844eb99affe"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:16:44.068403Z","signature_b64":"tPjt9dmJWhl+qzfOqWe8Mcpv8sVB6V22Og6uzF0ffa9iYb/PAPn/GMO5Zz8MKmzOzf1kMkBpDIjPoU8FcftiCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b164f30f23df3eafb4eedff3c5728e9d1b0b9160716236020d06c55bf8ba98e7","last_reissued_at":"2026-07-05T09:16:44.067905Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:16:44.067905Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The theory of percolation on hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.dis-nn","cond-mat.stat-mech","cs.SI"],"primary_cat":"physics.soc-ph","authors_text":"Ginestra Bianconi, Sergey N. Dorogovtsev","submitted_at":"2023-05-20T22:32:05Z","abstract_excerpt":"Hypergraphs capture the higher-order interactions in complex systems and always admit a factor graph representation, consisting of a bipartite network of nodes and hyperedges. As hypegraphs are ubiquitous, investigating hypergraph robustness is a problem of major research interest. In the literature the robustness of hypergraphs as been so far only treated adopting factor-graph percolation which describe well higher-order interactions which remain functional even after the removal of one of more of their nodes. This approach, however, fall short to describe situations in which higher-order int"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.12297","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/2305.12297/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":"2305.12297","created_at":"2026-07-05T09:16:44.067958+00:00"},{"alias_kind":"arxiv_version","alias_value":"2305.12297v2","created_at":"2026-07-05T09:16:44.067958+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.12297","created_at":"2026-07-05T09:16:44.067958+00:00"},{"alias_kind":"pith_short_12","alias_value":"WFSPGDZD347K","created_at":"2026-07-05T09:16:44.067958+00:00"},{"alias_kind":"pith_short_16","alias_value":"WFSPGDZD347K7NHO","created_at":"2026-07-05T09:16:44.067958+00:00"},{"alias_kind":"pith_short_8","alias_value":"WFSPGDZD","created_at":"2026-07-05T09:16:44.067958+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2602.10189","citing_title":"Entanglement percolation in random quantum networks","ref_index":62,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WFSPGDZD347K7NHO37Z4K4UOTU","json":"https://pith.science/pith/WFSPGDZD347K7NHO37Z4K4UOTU.json","graph_json":"https://pith.science/api/pith-number/WFSPGDZD347K7NHO37Z4K4UOTU/graph.json","events_json":"https://pith.science/api/pith-number/WFSPGDZD347K7NHO37Z4K4UOTU/events.json","paper":"https://pith.science/paper/WFSPGDZD"},"agent_actions":{"view_html":"https://pith.science/pith/WFSPGDZD347K7NHO37Z4K4UOTU","download_json":"https://pith.science/pith/WFSPGDZD347K7NHO37Z4K4UOTU.json","view_paper":"https://pith.science/paper/WFSPGDZD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2305.12297&json=true","fetch_graph":"https://pith.science/api/pith-number/WFSPGDZD347K7NHO37Z4K4UOTU/graph.json","fetch_events":"https://pith.science/api/pith-number/WFSPGDZD347K7NHO37Z4K4UOTU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WFSPGDZD347K7NHO37Z4K4UOTU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WFSPGDZD347K7NHO37Z4K4UOTU/action/storage_attestation","attest_author":"https://pith.science/pith/WFSPGDZD347K7NHO37Z4K4UOTU/action/author_attestation","sign_citation":"https://pith.science/pith/WFSPGDZD347K7NHO37Z4K4UOTU/action/citation_signature","submit_replication":"https://pith.science/pith/WFSPGDZD347K7NHO37Z4K4UOTU/action/replication_record"}},"created_at":"2026-07-05T09:16:44.067958+00:00","updated_at":"2026-07-05T09:16:44.067958+00:00"}