{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:VKBJKFPJDN2MSEX2GIIWGCWYWF","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":"72f4d659eeb7677599e48e1750598edb4dfbe30c0aec67165c29175600a9a59b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-30T17:01:04Z","title_canon_sha256":"453f9d28453f32f4e4b10fa7966d718dee02c3f2fc787a4b6dd1fd5a56536cb9"},"schema_version":"1.0","source":{"id":"1703.10566","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.10566","created_at":"2026-05-18T00:23:45Z"},{"alias_kind":"arxiv_version","alias_value":"1703.10566v1","created_at":"2026-05-18T00:23:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.10566","created_at":"2026-05-18T00:23:45Z"},{"alias_kind":"pith_short_12","alias_value":"VKBJKFPJDN2M","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"VKBJKFPJDN2MSEX2","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"VKBJKFPJ","created_at":"2026-05-18T12:31:49Z"}],"graph_snapshots":[{"event_id":"sha256:f487bdd34b917d00a76465b703777e909b31fc1f28729a230fbfa636079590e0","target":"graph","created_at":"2026-05-18T00:23:45Z","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$ in which each edge fails independently with probability $q\\in[0,1],$ the all-terminal reliability of $G$ is the probability that all vertices of $G$ can communicate with one another, that is, the probability that the operational edges span the graph. The all-terminal reliability is a polynomial in $q$ whose roots (all-terminal reliability roots) were conjectured to have modulus at most $1$ by Brown and Colbourn. Royle and Sokal proved the conjecture false, finding roots of modulus larger than $1$ by a slim margin. Here, we present the first nontrivial upper bound on the modul","authors_text":"Jason Brown, Lucas Mol","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-30T17:01:04Z","title":"On the roots of all-terminal reliability polynomials"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.10566","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:e122e91d135ae24c6089b43af47d5ee8fb8cf5ef2272d7bf55e1930bcdd43722","target":"record","created_at":"2026-05-18T00:23:45Z","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":"72f4d659eeb7677599e48e1750598edb4dfbe30c0aec67165c29175600a9a59b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-30T17:01:04Z","title_canon_sha256":"453f9d28453f32f4e4b10fa7966d718dee02c3f2fc787a4b6dd1fd5a56536cb9"},"schema_version":"1.0","source":{"id":"1703.10566","kind":"arxiv","version":1}},"canonical_sha256":"aa829515e91b74c912fa3211630ad8b14eadd1ca393c21830c3ea2f02a60501e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aa829515e91b74c912fa3211630ad8b14eadd1ca393c21830c3ea2f02a60501e","first_computed_at":"2026-05-18T00:23:45.825131Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:23:45.825131Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"01uQ90otlTiq9uBwibJzFIj3vp+YVQVeUQdycyTV7yDu/Hz9SdgMKNe6MNJsz0TFbcwx4b5vq9pGul9HHmflAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:23:45.825625Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.10566","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e122e91d135ae24c6089b43af47d5ee8fb8cf5ef2272d7bf55e1930bcdd43722","sha256:f487bdd34b917d00a76465b703777e909b31fc1f28729a230fbfa636079590e0"],"state_sha256":"c387a56c483733904ea92d8e94a36f8300b5279b11bb1e54b59e3771d5246414"}