{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:MSHTB7W54DGDBH3NRQ4JXKARRE","short_pith_number":"pith:MSHTB7W5","canonical_record":{"source":{"id":"1906.02359","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-06-05T23:44:27Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"14d73d5d4f66275021cdce9304308952e5f060d254c6e7e4fb97285931e41aaf","abstract_canon_sha256":"db51cd4ec919839ab88850cb504e2d92ae2dc9161e3c51db26fde9c4c4c5ddb4"},"schema_version":"1.0"},"canonical_sha256":"648f30fedde0cc309f6d8c389ba811893ba651478017f9cecdedb0b15b50783c","source":{"kind":"arxiv","id":"1906.02359","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.02359","created_at":"2026-05-17T23:44:01Z"},{"alias_kind":"arxiv_version","alias_value":"1906.02359v1","created_at":"2026-05-17T23:44:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.02359","created_at":"2026-05-17T23:44:01Z"},{"alias_kind":"pith_short_12","alias_value":"MSHTB7W54DGD","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"MSHTB7W54DGDBH3N","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"MSHTB7W5","created_at":"2026-05-18T12:33:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:MSHTB7W54DGDBH3NRQ4JXKARRE","target":"record","payload":{"canonical_record":{"source":{"id":"1906.02359","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-06-05T23:44:27Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"14d73d5d4f66275021cdce9304308952e5f060d254c6e7e4fb97285931e41aaf","abstract_canon_sha256":"db51cd4ec919839ab88850cb504e2d92ae2dc9161e3c51db26fde9c4c4c5ddb4"},"schema_version":"1.0"},"canonical_sha256":"648f30fedde0cc309f6d8c389ba811893ba651478017f9cecdedb0b15b50783c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:01.476783Z","signature_b64":"ptECb6eD1nlTGrdh0omKCq/2yyB0Cv63WhsgeQzu8abcFNLGR+wNWk/IVptSoY5Kpb18V94v1kV9vTTXe2ZhAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"648f30fedde0cc309f6d8c389ba811893ba651478017f9cecdedb0b15b50783c","last_reissued_at":"2026-05-17T23:44:01.476165Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:01.476165Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1906.02359","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:44:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OseyWvbPLM+nGNeoof+vq1g2I4/O2C7rGjhdxbV0DeO/zS4x22RsEE3Vr6dGsDJIR6o8g+LTz3+yhuM80W8xCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T03:16:02.130466Z"},"content_sha256":"80822083d6f56b4ab1bf22746f54b2fdb07ad34e3abaed539076ea0e2cb4234b","schema_version":"1.0","event_id":"sha256:80822083d6f56b4ab1bf22746f54b2fdb07ad34e3abaed539076ea0e2cb4234b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:MSHTB7W54DGDBH3NRQ4JXKARRE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"All Terminal Reliability Roots of Smallest Modulus","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Corey D. C. DeGagn\\'e, Jason I. Brown","submitted_at":"2019-06-05T23:44:27Z","abstract_excerpt":"Given a connected graph $G$ whose vertices are perfectly reliable and whose edges each fail independently with probability $q\\in[0,1],$ the \\textit{(all-terminal) reliability} of $G$ is the probability that the resulting subgraph of operational edges contains a spanning tree (this probability is always a polynomial in $q$). The location of the roots of reliability polynomials has been well studied, with particular interest in finding those with the largest moduli. In this paper, we will discuss a related problem -- among all reliability polynomials of graphs on $n$ vertices, which has a root o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.02359","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:44:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o1UOs9NWr33wk6gUG/5itSuBuLCkhNrcebm9XpKRUktQtiBWl6TTUSNwo6I1M8ctiTHyJRk/aBctmNrL7XQRBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T03:16:02.130838Z"},"content_sha256":"b078083a4e04d56b379c6a2ccc514bf47f99df70ae6f63b6c374546d6f00b533","schema_version":"1.0","event_id":"sha256:b078083a4e04d56b379c6a2ccc514bf47f99df70ae6f63b6c374546d6f00b533"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MSHTB7W54DGDBH3NRQ4JXKARRE/bundle.json","state_url":"https://pith.science/pith/MSHTB7W54DGDBH3NRQ4JXKARRE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MSHTB7W54DGDBH3NRQ4JXKARRE/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-24T03:16:02Z","links":{"resolver":"https://pith.science/pith/MSHTB7W54DGDBH3NRQ4JXKARRE","bundle":"https://pith.science/pith/MSHTB7W54DGDBH3NRQ4JXKARRE/bundle.json","state":"https://pith.science/pith/MSHTB7W54DGDBH3NRQ4JXKARRE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MSHTB7W54DGDBH3NRQ4JXKARRE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:MSHTB7W54DGDBH3NRQ4JXKARRE","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":"db51cd4ec919839ab88850cb504e2d92ae2dc9161e3c51db26fde9c4c4c5ddb4","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-06-05T23:44:27Z","title_canon_sha256":"14d73d5d4f66275021cdce9304308952e5f060d254c6e7e4fb97285931e41aaf"},"schema_version":"1.0","source":{"id":"1906.02359","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.02359","created_at":"2026-05-17T23:44:01Z"},{"alias_kind":"arxiv_version","alias_value":"1906.02359v1","created_at":"2026-05-17T23:44:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.02359","created_at":"2026-05-17T23:44:01Z"},{"alias_kind":"pith_short_12","alias_value":"MSHTB7W54DGD","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"MSHTB7W54DGDBH3N","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"MSHTB7W5","created_at":"2026-05-18T12:33:24Z"}],"graph_snapshots":[{"event_id":"sha256:b078083a4e04d56b379c6a2ccc514bf47f99df70ae6f63b6c374546d6f00b533","target":"graph","created_at":"2026-05-17T23:44:01Z","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 connected graph $G$ whose vertices are perfectly reliable and whose edges each fail independently with probability $q\\in[0,1],$ the \\textit{(all-terminal) reliability} of $G$ is the probability that the resulting subgraph of operational edges contains a spanning tree (this probability is always a polynomial in $q$). The location of the roots of reliability polynomials has been well studied, with particular interest in finding those with the largest moduli. In this paper, we will discuss a related problem -- among all reliability polynomials of graphs on $n$ vertices, which has a root o","authors_text":"Corey D. C. DeGagn\\'e, Jason I. Brown","cross_cats":["math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-06-05T23:44:27Z","title":"All Terminal Reliability Roots of Smallest Modulus"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.02359","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:80822083d6f56b4ab1bf22746f54b2fdb07ad34e3abaed539076ea0e2cb4234b","target":"record","created_at":"2026-05-17T23:44:01Z","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":"db51cd4ec919839ab88850cb504e2d92ae2dc9161e3c51db26fde9c4c4c5ddb4","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-06-05T23:44:27Z","title_canon_sha256":"14d73d5d4f66275021cdce9304308952e5f060d254c6e7e4fb97285931e41aaf"},"schema_version":"1.0","source":{"id":"1906.02359","kind":"arxiv","version":1}},"canonical_sha256":"648f30fedde0cc309f6d8c389ba811893ba651478017f9cecdedb0b15b50783c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"648f30fedde0cc309f6d8c389ba811893ba651478017f9cecdedb0b15b50783c","first_computed_at":"2026-05-17T23:44:01.476165Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:44:01.476165Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ptECb6eD1nlTGrdh0omKCq/2yyB0Cv63WhsgeQzu8abcFNLGR+wNWk/IVptSoY5Kpb18V94v1kV9vTTXe2ZhAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:44:01.476783Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.02359","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:80822083d6f56b4ab1bf22746f54b2fdb07ad34e3abaed539076ea0e2cb4234b","sha256:b078083a4e04d56b379c6a2ccc514bf47f99df70ae6f63b6c374546d6f00b533"],"state_sha256":"266d161cd4c1015f843a8e815b7ed7d2fbad65ff601da17580fda0ff076358fd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WYUnuU77LAj1AQd00GqLFCGaTbEdBTIajqVEhg/1Lsk8GiAmk2RbJqJGyNNMintGjqxtd4+Jojqy3f+zmD4EBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T03:16:02.132705Z","bundle_sha256":"c907da85707a3a742910cd450e47b16703d6ec2913eeb8bc4ce9c726aa00d465"}}