{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:CZ2FAFUPTP5GMUJ7TTEBXFT5CI","short_pith_number":"pith:CZ2FAFUP","schema_version":"1.0","canonical_sha256":"167450168f9bfa66513f9cc81b967d122344d6781d9ad36c5cd89cc9e669e8bf","source":{"kind":"arxiv","id":"1604.05175","version":2},"attestation_state":"computed","paper":{"title":"Message passing theory for percolation models on multiplex networks with link overlap","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.dis-nn","cond-mat.stat-mech"],"primary_cat":"physics.soc-ph","authors_text":"Davide Cellai, Ginestra Bianconi, Sergey N. Dorogovtsev","submitted_at":"2016-04-18T14:25:04Z","abstract_excerpt":"Multiplex networks describe a large variety of complex systems including infrastructures, transportation networks and biological systems. Most of these networks feature a significant link overlap. It is therefore of particular importance to characterize the mutually connected giant component in these networks. Here we provide a message passing theory for characterizing the percolation transition in multiplex networks with link overlap and an arbitrary number of layers $M$. Specifically we propose and compare two message passing algorithms, that generalize the algorithm widely used to study the"},"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":"1604.05175","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2016-04-18T14:25:04Z","cross_cats_sorted":["cond-mat.dis-nn","cond-mat.stat-mech"],"title_canon_sha256":"7bf72d40e09e4ed329b388f7e9f0944ab67a799afa685cf3e71658b855cc51d9","abstract_canon_sha256":"611adf5dbdad319f834df3f443d92775f8806a694fc1eb58bdb8e755aa09293f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:05:43.467793Z","signature_b64":"uKPyjE5Nr7XpgkNKLmJdZWWqQRNA0UnLS7a6o++Uvpmog8ZKGrT3vaHL7ej125EuyZ6D05hKto/dB87qEIzbAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"167450168f9bfa66513f9cc81b967d122344d6781d9ad36c5cd89cc9e669e8bf","last_reissued_at":"2026-05-18T01:05:43.467308Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:05:43.467308Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Message passing theory for percolation models on multiplex networks with link overlap","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.dis-nn","cond-mat.stat-mech"],"primary_cat":"physics.soc-ph","authors_text":"Davide Cellai, Ginestra Bianconi, Sergey N. Dorogovtsev","submitted_at":"2016-04-18T14:25:04Z","abstract_excerpt":"Multiplex networks describe a large variety of complex systems including infrastructures, transportation networks and biological systems. Most of these networks feature a significant link overlap. It is therefore of particular importance to characterize the mutually connected giant component in these networks. Here we provide a message passing theory for characterizing the percolation transition in multiplex networks with link overlap and an arbitrary number of layers $M$. Specifically we propose and compare two message passing algorithms, that generalize the algorithm widely used to study the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.05175","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":"1604.05175","created_at":"2026-05-18T01:05:43.467400+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.05175v2","created_at":"2026-05-18T01:05:43.467400+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.05175","created_at":"2026-05-18T01:05:43.467400+00:00"},{"alias_kind":"pith_short_12","alias_value":"CZ2FAFUPTP5G","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_16","alias_value":"CZ2FAFUPTP5GMUJ7","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_8","alias_value":"CZ2FAFUP","created_at":"2026-05-18T12:30:09.641336+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/CZ2FAFUPTP5GMUJ7TTEBXFT5CI","json":"https://pith.science/pith/CZ2FAFUPTP5GMUJ7TTEBXFT5CI.json","graph_json":"https://pith.science/api/pith-number/CZ2FAFUPTP5GMUJ7TTEBXFT5CI/graph.json","events_json":"https://pith.science/api/pith-number/CZ2FAFUPTP5GMUJ7TTEBXFT5CI/events.json","paper":"https://pith.science/paper/CZ2FAFUP"},"agent_actions":{"view_html":"https://pith.science/pith/CZ2FAFUPTP5GMUJ7TTEBXFT5CI","download_json":"https://pith.science/pith/CZ2FAFUPTP5GMUJ7TTEBXFT5CI.json","view_paper":"https://pith.science/paper/CZ2FAFUP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.05175&json=true","fetch_graph":"https://pith.science/api/pith-number/CZ2FAFUPTP5GMUJ7TTEBXFT5CI/graph.json","fetch_events":"https://pith.science/api/pith-number/CZ2FAFUPTP5GMUJ7TTEBXFT5CI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CZ2FAFUPTP5GMUJ7TTEBXFT5CI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CZ2FAFUPTP5GMUJ7TTEBXFT5CI/action/storage_attestation","attest_author":"https://pith.science/pith/CZ2FAFUPTP5GMUJ7TTEBXFT5CI/action/author_attestation","sign_citation":"https://pith.science/pith/CZ2FAFUPTP5GMUJ7TTEBXFT5CI/action/citation_signature","submit_replication":"https://pith.science/pith/CZ2FAFUPTP5GMUJ7TTEBXFT5CI/action/replication_record"}},"created_at":"2026-05-18T01:05:43.467400+00:00","updated_at":"2026-05-18T01:05:43.467400+00:00"}