{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:KZ3222RAWV3OT6Y23OB53RYQPL","short_pith_number":"pith:KZ3222RA","schema_version":"1.0","canonical_sha256":"5677ad6a20b576e9fb1adb83ddc7107af106f863b06dd292d8e3e157e2778be1","source":{"kind":"arxiv","id":"1611.02617","version":1},"attestation_state":"computed","paper":{"title":"Color-avoiding percolation","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":"Michael M. Danziger, Sebastian M. Krause, Vinko Zlati\\'c","submitted_at":"2016-11-08T17:26:03Z","abstract_excerpt":"Many real world networks have groups of similar nodes which are vulnerable to the same failure or adversary. Nodes can be colored in such a way that colors encode the shared vulnerabilities. Using multiple paths to avoid these vulnerabilities can greatly improve network robustness. Color-avoiding percolation provides a theoretical framework for analyzing this scenario, focusing on the maximal set of nodes which can be connected via multiple color-avoiding paths. In this paper we extend the basic theory of color-avoiding percolation that was published in [Krause et. al., Phys. Rev. X 6 (2016) 0"},"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":"1611.02617","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2016-11-08T17:26:03Z","cross_cats_sorted":["cond-mat.dis-nn","cond-mat.stat-mech"],"title_canon_sha256":"285ef5c04ae67bcf5ddc679a757ea8484e94b397c22e5ae9a82e1fef89e7f290","abstract_canon_sha256":"6ba8298ff831abb3db0adc4c1d28e97d4533da13b5341cab662c562eec6554d2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:37:36.529386Z","signature_b64":"Zh88mzl0Ol9DMdHpJNTQE1VVDzV2PAR0Q9GBFD/upsxiO3Wqh769m7tFEgCDTnxuAALH8/0eqkD5jXsmN2sQDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5677ad6a20b576e9fb1adb83ddc7107af106f863b06dd292d8e3e157e2778be1","last_reissued_at":"2026-05-18T00:37:36.528740Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:37:36.528740Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Color-avoiding percolation","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":"Michael M. Danziger, Sebastian M. Krause, Vinko Zlati\\'c","submitted_at":"2016-11-08T17:26:03Z","abstract_excerpt":"Many real world networks have groups of similar nodes which are vulnerable to the same failure or adversary. Nodes can be colored in such a way that colors encode the shared vulnerabilities. Using multiple paths to avoid these vulnerabilities can greatly improve network robustness. Color-avoiding percolation provides a theoretical framework for analyzing this scenario, focusing on the maximal set of nodes which can be connected via multiple color-avoiding paths. In this paper we extend the basic theory of color-avoiding percolation that was published in [Krause et. al., Phys. Rev. X 6 (2016) 0"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.02617","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":"1611.02617","created_at":"2026-05-18T00:37:36.528825+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.02617v1","created_at":"2026-05-18T00:37:36.528825+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.02617","created_at":"2026-05-18T00:37:36.528825+00:00"},{"alias_kind":"pith_short_12","alias_value":"KZ3222RAWV3O","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_16","alias_value":"KZ3222RAWV3OT6Y2","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_8","alias_value":"KZ3222RA","created_at":"2026-05-18T12:30:29.479603+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/KZ3222RAWV3OT6Y23OB53RYQPL","json":"https://pith.science/pith/KZ3222RAWV3OT6Y23OB53RYQPL.json","graph_json":"https://pith.science/api/pith-number/KZ3222RAWV3OT6Y23OB53RYQPL/graph.json","events_json":"https://pith.science/api/pith-number/KZ3222RAWV3OT6Y23OB53RYQPL/events.json","paper":"https://pith.science/paper/KZ3222RA"},"agent_actions":{"view_html":"https://pith.science/pith/KZ3222RAWV3OT6Y23OB53RYQPL","download_json":"https://pith.science/pith/KZ3222RAWV3OT6Y23OB53RYQPL.json","view_paper":"https://pith.science/paper/KZ3222RA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.02617&json=true","fetch_graph":"https://pith.science/api/pith-number/KZ3222RAWV3OT6Y23OB53RYQPL/graph.json","fetch_events":"https://pith.science/api/pith-number/KZ3222RAWV3OT6Y23OB53RYQPL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KZ3222RAWV3OT6Y23OB53RYQPL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KZ3222RAWV3OT6Y23OB53RYQPL/action/storage_attestation","attest_author":"https://pith.science/pith/KZ3222RAWV3OT6Y23OB53RYQPL/action/author_attestation","sign_citation":"https://pith.science/pith/KZ3222RAWV3OT6Y23OB53RYQPL/action/citation_signature","submit_replication":"https://pith.science/pith/KZ3222RAWV3OT6Y23OB53RYQPL/action/replication_record"}},"created_at":"2026-05-18T00:37:36.528825+00:00","updated_at":"2026-05-18T00:37:36.528825+00:00"}