{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:J5DQWW2EAPWGLL43563YFFH4TU","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"091b9603273b24b442cda1db3eff52fbfecf0699a9c95ae957c08769f165970b","cross_cats_sorted":["math.CA","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-07-28T15:12:35Z","title_canon_sha256":"880a98e708feb3989b666c3146207db623d8a678b3eaaa4c610435cc77f2559a"},"schema_version":"1.0","source":{"id":"1607.08496","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.08496","created_at":"2026-05-18T00:40:19Z"},{"alias_kind":"arxiv_version","alias_value":"1607.08496v1","created_at":"2026-05-18T00:40:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.08496","created_at":"2026-05-18T00:40:19Z"},{"alias_kind":"pith_short_12","alias_value":"J5DQWW2EAPWG","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"J5DQWW2EAPWGLL43","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"J5DQWW2E","created_at":"2026-05-18T12:30:22Z"}],"graph_snapshots":[{"event_id":"sha256:87c6600b45f3b22ec968e0e88f5bdad5bb04175fdfae3c96462ec3bf09c91e41","target":"graph","created_at":"2026-05-18T00:40:19Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Given a graph $G$ whose edges are perfectly reliable and whose nodes each operate independently with probability $p\\in[0,1],$ the node reliability of $G$ is the probability that at least one node is operational and that the operational nodes can all communicate in the subgraph that they induce; it is the analogous node measure of robustness to the well studied \\textit{all-terminal reliability}, where the nodes are perfectly reliable but the edges fail randomly. In sharp contrast to what is known about the roots of the all-terminal reliability polynomial, we show that the node reliability polyn","authors_text":"Jason Brown, Lucas Mol","cross_cats":["math.CA","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-07-28T15:12:35Z","title":"On the roots of the node reliability polynomial"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.08496","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:46ef76e4a9a9e24de4c52fbcc72561b2db6bcf939cfe8cb56e7b435a10d360f4","target":"record","created_at":"2026-05-18T00:40:19Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"091b9603273b24b442cda1db3eff52fbfecf0699a9c95ae957c08769f165970b","cross_cats_sorted":["math.CA","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-07-28T15:12:35Z","title_canon_sha256":"880a98e708feb3989b666c3146207db623d8a678b3eaaa4c610435cc77f2559a"},"schema_version":"1.0","source":{"id":"1607.08496","kind":"arxiv","version":1}},"canonical_sha256":"4f470b5b4403ec65af9befb78294fc9d10cd11f8117f1fabb458b3d11902afa7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4f470b5b4403ec65af9befb78294fc9d10cd11f8117f1fabb458b3d11902afa7","first_computed_at":"2026-05-18T00:40:19.613246Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:40:19.613246Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4WPF78wefZ85OVr3EgOrfLkrKgVgjr0qroBO7E3Ep3OpuZOqYIyca3461rCYHVVAgHcxl/99+R+b7/vdIKg0CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:40:19.613864Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.08496","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:46ef76e4a9a9e24de4c52fbcc72561b2db6bcf939cfe8cb56e7b435a10d360f4","sha256:87c6600b45f3b22ec968e0e88f5bdad5bb04175fdfae3c96462ec3bf09c91e41"],"state_sha256":"6722407ddcea860b23203eac5e9f5789a3ba2756d39e5e457fd5c28856bf6256"}