{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:VHK3N7PULD4TDMYS5EZY4DP4WI","short_pith_number":"pith:VHK3N7PU","schema_version":"1.0","canonical_sha256":"a9d5b6fdf458f931b312e9338e0dfcb216a108e49dcd9267d866c2d46de3928b","source":{"kind":"arxiv","id":"1312.3814","version":2},"attestation_state":"computed","paper":{"title":"Weak percolation on multiplex networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","math.PR","physics.soc-ph"],"primary_cat":"cond-mat.dis-nn","authors_text":"Davide Cellai, Gareth J. Baxter, Jos\\'e F. F. Mendes, Sergey N. Dorogovtsev","submitted_at":"2013-12-13T14:17:56Z","abstract_excerpt":"Bootstrap percolation is a simple but non-trivial model. It has applications in many areas of science and has been explored on random networks for several decades. In single layer (simplex) networks, it has been recently observed that bootstrap percolation, which is defined as an incremental process, can be seen as the opposite of pruning percolation, where nodes are removed according to a connectivity rule. Here we propose models of both bootstrap and pruning percolation for multiplex networks. We collectively refer to these two models with the concept of \"weak\" percolation, to distinguish th"},"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":"1312.3814","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2013-12-13T14:17:56Z","cross_cats_sorted":["cs.CR","math.PR","physics.soc-ph"],"title_canon_sha256":"7ee8dbc80a5feaff744c7a1f91c079342af21600d3ebc2bbb526eafbfa7c6cfb","abstract_canon_sha256":"4f4eeba23228f1ff93e9ae56c6c6b4203e0af22027155a94fceebdea05d1e616"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:53:40.508838Z","signature_b64":"b9/dEbF63E1qau1nKKD9nuhpnZ6ZPu6pmslVcATyO4QxSqLqdR996DjDaKggyPwn3bvES1lUfEMwltc9iPKGAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a9d5b6fdf458f931b312e9338e0dfcb216a108e49dcd9267d866c2d46de3928b","last_reissued_at":"2026-05-18T02:53:40.508334Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:53:40.508334Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Weak percolation on multiplex networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","math.PR","physics.soc-ph"],"primary_cat":"cond-mat.dis-nn","authors_text":"Davide Cellai, Gareth J. Baxter, Jos\\'e F. F. Mendes, Sergey N. Dorogovtsev","submitted_at":"2013-12-13T14:17:56Z","abstract_excerpt":"Bootstrap percolation is a simple but non-trivial model. It has applications in many areas of science and has been explored on random networks for several decades. In single layer (simplex) networks, it has been recently observed that bootstrap percolation, which is defined as an incremental process, can be seen as the opposite of pruning percolation, where nodes are removed according to a connectivity rule. Here we propose models of both bootstrap and pruning percolation for multiplex networks. We collectively refer to these two models with the concept of \"weak\" percolation, to distinguish th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.3814","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":"1312.3814","created_at":"2026-05-18T02:53:40.508409+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.3814v2","created_at":"2026-05-18T02:53:40.508409+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.3814","created_at":"2026-05-18T02:53:40.508409+00:00"},{"alias_kind":"pith_short_12","alias_value":"VHK3N7PULD4T","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_16","alias_value":"VHK3N7PULD4TDMYS","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_8","alias_value":"VHK3N7PU","created_at":"2026-05-18T12:28:04.890932+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/VHK3N7PULD4TDMYS5EZY4DP4WI","json":"https://pith.science/pith/VHK3N7PULD4TDMYS5EZY4DP4WI.json","graph_json":"https://pith.science/api/pith-number/VHK3N7PULD4TDMYS5EZY4DP4WI/graph.json","events_json":"https://pith.science/api/pith-number/VHK3N7PULD4TDMYS5EZY4DP4WI/events.json","paper":"https://pith.science/paper/VHK3N7PU"},"agent_actions":{"view_html":"https://pith.science/pith/VHK3N7PULD4TDMYS5EZY4DP4WI","download_json":"https://pith.science/pith/VHK3N7PULD4TDMYS5EZY4DP4WI.json","view_paper":"https://pith.science/paper/VHK3N7PU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.3814&json=true","fetch_graph":"https://pith.science/api/pith-number/VHK3N7PULD4TDMYS5EZY4DP4WI/graph.json","fetch_events":"https://pith.science/api/pith-number/VHK3N7PULD4TDMYS5EZY4DP4WI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VHK3N7PULD4TDMYS5EZY4DP4WI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VHK3N7PULD4TDMYS5EZY4DP4WI/action/storage_attestation","attest_author":"https://pith.science/pith/VHK3N7PULD4TDMYS5EZY4DP4WI/action/author_attestation","sign_citation":"https://pith.science/pith/VHK3N7PULD4TDMYS5EZY4DP4WI/action/citation_signature","submit_replication":"https://pith.science/pith/VHK3N7PULD4TDMYS5EZY4DP4WI/action/replication_record"}},"created_at":"2026-05-18T02:53:40.508409+00:00","updated_at":"2026-05-18T02:53:40.508409+00:00"}