{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:BK45LAJ4QAJSZ3EFA55TTR5GT2","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":"73b78542ec7ca698b981c1bf9176df4e79bfcc6990bf78d0471eadecab0464b0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-18T08:49:06Z","title_canon_sha256":"a747bf6c0c64369dc5b97050eb8138e2d593d79bdcd6b28a951d53b3e3e4dcfe"},"schema_version":"1.0","source":{"id":"1705.06473","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.06473","created_at":"2026-05-18T00:44:14Z"},{"alias_kind":"arxiv_version","alias_value":"1705.06473v1","created_at":"2026-05-18T00:44:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.06473","created_at":"2026-05-18T00:44:14Z"},{"alias_kind":"pith_short_12","alias_value":"BK45LAJ4QAJS","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"BK45LAJ4QAJSZ3EF","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"BK45LAJ4","created_at":"2026-05-18T12:31:08Z"}],"graph_snapshots":[{"event_id":"sha256:2644f107e6e9b491092ac87acdd71b72eb8625f9703e2d66634c62802dd4fc3a","target":"graph","created_at":"2026-05-18T00:44:14Z","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":"We consider the problem of sending a message from a sender $s$ to a receiver $r$ through an unreliable network by specifying in a protocol what each vertex is supposed to do if it receives the message from one of its neighbors. A protocol for routing a message in such a graph is finite if it never floods $r$ with an infinite number of copies of the message. The expected reliability of a given protocol is the probability that a message sent from $s$ reaches $r$ when the edges of the network fail independently with probability $1-p$.\n  We discuss, for given networks, the properties of finite pro","authors_text":"Andr\\'e K\\\"undgen, Janina Patno","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-18T08:49:06Z","title":"Expected reliability of communication protocols"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.06473","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:c219ddc9ddb67acfff4e7e127ef9eb35dac2dbbb838dbbe4ea0da64533665bbb","target":"record","created_at":"2026-05-18T00:44:14Z","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":"73b78542ec7ca698b981c1bf9176df4e79bfcc6990bf78d0471eadecab0464b0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-18T08:49:06Z","title_canon_sha256":"a747bf6c0c64369dc5b97050eb8138e2d593d79bdcd6b28a951d53b3e3e4dcfe"},"schema_version":"1.0","source":{"id":"1705.06473","kind":"arxiv","version":1}},"canonical_sha256":"0ab9d5813c80132cec85077b39c7a69e896fed23fd363ef28a58d574ec504c49","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0ab9d5813c80132cec85077b39c7a69e896fed23fd363ef28a58d574ec504c49","first_computed_at":"2026-05-18T00:44:14.613474Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:44:14.613474Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"svYtcY2lJSyGaaShhBtK+vKZCYisAth+zShImAR67tunXGdsLcSHlRSCs4UcChoTmLBPD5ZCI1uu7ZRiNwTyDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:44:14.614239Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.06473","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c219ddc9ddb67acfff4e7e127ef9eb35dac2dbbb838dbbe4ea0da64533665bbb","sha256:2644f107e6e9b491092ac87acdd71b72eb8625f9703e2d66634c62802dd4fc3a"],"state_sha256":"baa4c6cf0508c5187382fe5f68025cebdd42a58539a7419cc39c604969206ac0"}