{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:DUU3SE4HDNRNFBUSUN7UIX6MIZ","short_pith_number":"pith:DUU3SE4H","schema_version":"1.0","canonical_sha256":"1d29b913871b62d28692a37f445fcc466b4ff914e8a3e32e18c34b21a3ea3f1d","source":{"kind":"arxiv","id":"1707.01401","version":1},"attestation_state":"computed","paper":{"title":"Optimal percolation on multiplex networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"physics.soc-ph","authors_text":"Ali Faqeeh, Filippo Radicchi, Saeed Osat","submitted_at":"2017-07-05T14:04:44Z","abstract_excerpt":"Optimal percolation is the problem of finding the minimal set of nodes such that if the members of this set are removed from a network, the network is fragmented into non-extensive disconnected clusters. The solution of the optimal percolation problem has direct applicability in strategies of immunization in disease spreading processes, and influence maximization for certain classes of opinion dynamical models. In this paper, we consider the problem of optimal percolation on multiplex networks. The multiplex scenario serves to realistically model various technological, biological, and social n"},"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":"1707.01401","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2017-07-05T14:04:44Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"cb13b234154c69903f5d76e897b48a2f1907ae92d0c0c926392370deae35bf6f","abstract_canon_sha256":"3e7f4369b0e555b5dac5b898ad650f01b92779d187d99835f35cbab630f5fa91"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:16.137390Z","signature_b64":"WB5q8SULHbCdiY/bfl48kw0AJH3KdSA4UlklnIKtVrF5a/mGK6i0DVIoQ4yxPOPrkkUETy1JiRr6Pl7nu/SkCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1d29b913871b62d28692a37f445fcc466b4ff914e8a3e32e18c34b21a3ea3f1d","last_reissued_at":"2026-05-18T00:22:16.136726Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:16.136726Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal percolation on multiplex networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"physics.soc-ph","authors_text":"Ali Faqeeh, Filippo Radicchi, Saeed Osat","submitted_at":"2017-07-05T14:04:44Z","abstract_excerpt":"Optimal percolation is the problem of finding the minimal set of nodes such that if the members of this set are removed from a network, the network is fragmented into non-extensive disconnected clusters. The solution of the optimal percolation problem has direct applicability in strategies of immunization in disease spreading processes, and influence maximization for certain classes of opinion dynamical models. In this paper, we consider the problem of optimal percolation on multiplex networks. The multiplex scenario serves to realistically model various technological, biological, and social n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.01401","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":""},"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":"1707.01401","created_at":"2026-05-18T00:22:16.136833+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.01401v1","created_at":"2026-05-18T00:22:16.136833+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.01401","created_at":"2026-05-18T00:22:16.136833+00:00"},{"alias_kind":"pith_short_12","alias_value":"DUU3SE4HDNRN","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_16","alias_value":"DUU3SE4HDNRNFBUS","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_8","alias_value":"DUU3SE4H","created_at":"2026-05-18T12:31:12.930513+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/DUU3SE4HDNRNFBUSUN7UIX6MIZ","json":"https://pith.science/pith/DUU3SE4HDNRNFBUSUN7UIX6MIZ.json","graph_json":"https://pith.science/api/pith-number/DUU3SE4HDNRNFBUSUN7UIX6MIZ/graph.json","events_json":"https://pith.science/api/pith-number/DUU3SE4HDNRNFBUSUN7UIX6MIZ/events.json","paper":"https://pith.science/paper/DUU3SE4H"},"agent_actions":{"view_html":"https://pith.science/pith/DUU3SE4HDNRNFBUSUN7UIX6MIZ","download_json":"https://pith.science/pith/DUU3SE4HDNRNFBUSUN7UIX6MIZ.json","view_paper":"https://pith.science/paper/DUU3SE4H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.01401&json=true","fetch_graph":"https://pith.science/api/pith-number/DUU3SE4HDNRNFBUSUN7UIX6MIZ/graph.json","fetch_events":"https://pith.science/api/pith-number/DUU3SE4HDNRNFBUSUN7UIX6MIZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DUU3SE4HDNRNFBUSUN7UIX6MIZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DUU3SE4HDNRNFBUSUN7UIX6MIZ/action/storage_attestation","attest_author":"https://pith.science/pith/DUU3SE4HDNRNFBUSUN7UIX6MIZ/action/author_attestation","sign_citation":"https://pith.science/pith/DUU3SE4HDNRNFBUSUN7UIX6MIZ/action/citation_signature","submit_replication":"https://pith.science/pith/DUU3SE4HDNRNFBUSUN7UIX6MIZ/action/replication_record"}},"created_at":"2026-05-18T00:22:16.136833+00:00","updated_at":"2026-05-18T00:22:16.136833+00:00"}