{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:B4HPDJII37TSCKLTGTEMEHCKWG","short_pith_number":"pith:B4HPDJII","canonical_record":{"source":{"id":"1912.11361","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-12-23T13:40:22Z","cross_cats_sorted":[],"title_canon_sha256":"5819f5196a9e4c90e09524cd330ca496a5c784ddc300fdb5a6013d678f4c8349","abstract_canon_sha256":"1e473d4aae84c5272193b5e1234c1d3c36b31566b08c6263b0cec048267ef238"},"schema_version":"1.0"},"canonical_sha256":"0f0ef1a508dfe721297334c8c21c4ab1844816c7b3f99df606b4a5f1a557c9d2","source":{"kind":"arxiv","id":"1912.11361","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1912.11361","created_at":"2026-07-05T02:18:50Z"},{"alias_kind":"arxiv_version","alias_value":"1912.11361v2","created_at":"2026-07-05T02:18:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1912.11361","created_at":"2026-07-05T02:18:50Z"},{"alias_kind":"pith_short_12","alias_value":"B4HPDJII37TS","created_at":"2026-07-05T02:18:50Z"},{"alias_kind":"pith_short_16","alias_value":"B4HPDJII37TSCKLT","created_at":"2026-07-05T02:18:50Z"},{"alias_kind":"pith_short_8","alias_value":"B4HPDJII","created_at":"2026-07-05T02:18:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:B4HPDJII37TSCKLTGTEMEHCKWG","target":"record","payload":{"canonical_record":{"source":{"id":"1912.11361","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-12-23T13:40:22Z","cross_cats_sorted":[],"title_canon_sha256":"5819f5196a9e4c90e09524cd330ca496a5c784ddc300fdb5a6013d678f4c8349","abstract_canon_sha256":"1e473d4aae84c5272193b5e1234c1d3c36b31566b08c6263b0cec048267ef238"},"schema_version":"1.0"},"canonical_sha256":"0f0ef1a508dfe721297334c8c21c4ab1844816c7b3f99df606b4a5f1a557c9d2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:18:50.278500Z","signature_b64":"/2ssOj6IJ/OZHjfzOqO0dqXpE8dVD8dGByrjwhuVL1esEGx8TLFUnKSfsG5ekpGgmgrkNVRiyIZyhnki5oo6DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0f0ef1a508dfe721297334c8c21c4ab1844816c7b3f99df606b4a5f1a557c9d2","last_reissued_at":"2026-07-05T02:18:50.277878Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:18:50.277878Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1912.11361","source_version":2,"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-07-05T02:18:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IALivEUp7Uc/yB+UIe908sRqmFWnH1R4RPknKs2TJrP7957dCsFsY8+pAiqIGIUCz5R9p6tTL+I6nkmLdabkBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-12T16:51:17.773948Z"},"content_sha256":"32f9520a6d01936c9e25b1332c0de2c62c8662c6636f083541720fe09067fc74","schema_version":"1.0","event_id":"sha256:32f9520a6d01936c9e25b1332c0de2c62c8662c6636f083541720fe09067fc74"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:B4HPDJII37TSCKLTGTEMEHCKWG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Uniformly most reliable three-terminal graph of dense graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Haixing Zhao, Jun Yin, Sun Xie","submitted_at":"2019-12-23T13:40:22Z","abstract_excerpt":"A graph $G$ with $k$ specified target vertices in vertex set is a $k$-terminal graph. The $k$-terminal reliability is the connection probability of the fixed $k$ target vertices in a $k$-terminal graph when every edge of this graph survives independently with probability $p$. For the class of two-terminal graphs with a large number of edges, Betrand, Goff, Graves and Sun constructed a locally most reliable two-terminal graph for $p$ close to $1$, and illustrated by a counterexample that this locally most reliable graph is not the uniformly most reliable two-terminal graph. At the same time, th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1912.11361","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1912.11361/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T02:18:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"50osd0kN8r6fy+D9+E6sLwvOQmSTH609tdTk3bP3SO7tR+9ZGjakh8NjnE43Gf7I0X/EUlNx80phBdULYfG9Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-12T16:51:17.774330Z"},"content_sha256":"d7c24b9af070ac2a6cc73730ea149a3af456e0b4eb35e4598103093f4c1c97a5","schema_version":"1.0","event_id":"sha256:d7c24b9af070ac2a6cc73730ea149a3af456e0b4eb35e4598103093f4c1c97a5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B4HPDJII37TSCKLTGTEMEHCKWG/bundle.json","state_url":"https://pith.science/pith/B4HPDJII37TSCKLTGTEMEHCKWG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B4HPDJII37TSCKLTGTEMEHCKWG/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-07-12T16:51:17Z","links":{"resolver":"https://pith.science/pith/B4HPDJII37TSCKLTGTEMEHCKWG","bundle":"https://pith.science/pith/B4HPDJII37TSCKLTGTEMEHCKWG/bundle.json","state":"https://pith.science/pith/B4HPDJII37TSCKLTGTEMEHCKWG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B4HPDJII37TSCKLTGTEMEHCKWG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:B4HPDJII37TSCKLTGTEMEHCKWG","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":"1e473d4aae84c5272193b5e1234c1d3c36b31566b08c6263b0cec048267ef238","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-12-23T13:40:22Z","title_canon_sha256":"5819f5196a9e4c90e09524cd330ca496a5c784ddc300fdb5a6013d678f4c8349"},"schema_version":"1.0","source":{"id":"1912.11361","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1912.11361","created_at":"2026-07-05T02:18:50Z"},{"alias_kind":"arxiv_version","alias_value":"1912.11361v2","created_at":"2026-07-05T02:18:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1912.11361","created_at":"2026-07-05T02:18:50Z"},{"alias_kind":"pith_short_12","alias_value":"B4HPDJII37TS","created_at":"2026-07-05T02:18:50Z"},{"alias_kind":"pith_short_16","alias_value":"B4HPDJII37TSCKLT","created_at":"2026-07-05T02:18:50Z"},{"alias_kind":"pith_short_8","alias_value":"B4HPDJII","created_at":"2026-07-05T02:18:50Z"}],"graph_snapshots":[{"event_id":"sha256:d7c24b9af070ac2a6cc73730ea149a3af456e0b4eb35e4598103093f4c1c97a5","target":"graph","created_at":"2026-07-05T02:18:50Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1912.11361/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A graph $G$ with $k$ specified target vertices in vertex set is a $k$-terminal graph. The $k$-terminal reliability is the connection probability of the fixed $k$ target vertices in a $k$-terminal graph when every edge of this graph survives independently with probability $p$. For the class of two-terminal graphs with a large number of edges, Betrand, Goff, Graves and Sun constructed a locally most reliable two-terminal graph for $p$ close to $1$, and illustrated by a counterexample that this locally most reliable graph is not the uniformly most reliable two-terminal graph. At the same time, th","authors_text":"Haixing Zhao, Jun Yin, Sun Xie","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-12-23T13:40:22Z","title":"Uniformly most reliable three-terminal graph of dense graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1912.11361","kind":"arxiv","version":2},"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:32f9520a6d01936c9e25b1332c0de2c62c8662c6636f083541720fe09067fc74","target":"record","created_at":"2026-07-05T02:18:50Z","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":"1e473d4aae84c5272193b5e1234c1d3c36b31566b08c6263b0cec048267ef238","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-12-23T13:40:22Z","title_canon_sha256":"5819f5196a9e4c90e09524cd330ca496a5c784ddc300fdb5a6013d678f4c8349"},"schema_version":"1.0","source":{"id":"1912.11361","kind":"arxiv","version":2}},"canonical_sha256":"0f0ef1a508dfe721297334c8c21c4ab1844816c7b3f99df606b4a5f1a557c9d2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0f0ef1a508dfe721297334c8c21c4ab1844816c7b3f99df606b4a5f1a557c9d2","first_computed_at":"2026-07-05T02:18:50.277878Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:18:50.277878Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/2ssOj6IJ/OZHjfzOqO0dqXpE8dVD8dGByrjwhuVL1esEGx8TLFUnKSfsG5ekpGgmgrkNVRiyIZyhnki5oo6DQ==","signature_status":"signed_v1","signed_at":"2026-07-05T02:18:50.278500Z","signed_message":"canonical_sha256_bytes"},"source_id":"1912.11361","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:32f9520a6d01936c9e25b1332c0de2c62c8662c6636f083541720fe09067fc74","sha256:d7c24b9af070ac2a6cc73730ea149a3af456e0b4eb35e4598103093f4c1c97a5"],"state_sha256":"988e172d1e3600c1c0681c9d5c2e58f25733d0ba0c0c666ce17eb5868b04e064"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"njMQAH2ctv1XJjwxF6qcb0PKOgkIPCQB+fxbGwFUs1n1K4kRlgwQ9wodgV46+foDOsLRLa24Nd6QwN7VuO7FDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-12T16:51:17.776429Z","bundle_sha256":"90125adeba855a23f61bd01083d72b87043c11db88c3b5651178762b1a942cec"}}