{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:BK45LAJ4QAJSZ3EFA55TTR5GT2","short_pith_number":"pith:BK45LAJ4","schema_version":"1.0","canonical_sha256":"0ab9d5813c80132cec85077b39c7a69e896fed23fd363ef28a58d574ec504c49","source":{"kind":"arxiv","id":"1705.06473","version":1},"attestation_state":"computed","paper":{"title":"Expected reliability of communication protocols","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andr\\'e K\\\"undgen, Janina Patno","submitted_at":"2017-05-18T08:49:06Z","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1705.06473","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-18T08:49:06Z","cross_cats_sorted":[],"title_canon_sha256":"a747bf6c0c64369dc5b97050eb8138e2d593d79bdcd6b28a951d53b3e3e4dcfe","abstract_canon_sha256":"73b78542ec7ca698b981c1bf9176df4e79bfcc6990bf78d0471eadecab0464b0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:14.614239Z","signature_b64":"svYtcY2lJSyGaaShhBtK+vKZCYisAth+zShImAR67tunXGdsLcSHlRSCs4UcChoTmLBPD5ZCI1uu7ZRiNwTyDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0ab9d5813c80132cec85077b39c7a69e896fed23fd363ef28a58d574ec504c49","last_reissued_at":"2026-05-18T00:44:14.613474Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:14.613474Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Expected reliability of communication protocols","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andr\\'e K\\\"undgen, Janina Patno","submitted_at":"2017-05-18T08:49:06Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.06473","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1705.06473","created_at":"2026-05-18T00:44:14.613590+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.06473v1","created_at":"2026-05-18T00:44:14.613590+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.06473","created_at":"2026-05-18T00:44:14.613590+00:00"},{"alias_kind":"pith_short_12","alias_value":"BK45LAJ4QAJS","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_16","alias_value":"BK45LAJ4QAJSZ3EF","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_8","alias_value":"BK45LAJ4","created_at":"2026-05-18T12:31:08.081275+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BK45LAJ4QAJSZ3EFA55TTR5GT2","json":"https://pith.science/pith/BK45LAJ4QAJSZ3EFA55TTR5GT2.json","graph_json":"https://pith.science/api/pith-number/BK45LAJ4QAJSZ3EFA55TTR5GT2/graph.json","events_json":"https://pith.science/api/pith-number/BK45LAJ4QAJSZ3EFA55TTR5GT2/events.json","paper":"https://pith.science/paper/BK45LAJ4"},"agent_actions":{"view_html":"https://pith.science/pith/BK45LAJ4QAJSZ3EFA55TTR5GT2","download_json":"https://pith.science/pith/BK45LAJ4QAJSZ3EFA55TTR5GT2.json","view_paper":"https://pith.science/paper/BK45LAJ4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.06473&json=true","fetch_graph":"https://pith.science/api/pith-number/BK45LAJ4QAJSZ3EFA55TTR5GT2/graph.json","fetch_events":"https://pith.science/api/pith-number/BK45LAJ4QAJSZ3EFA55TTR5GT2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BK45LAJ4QAJSZ3EFA55TTR5GT2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BK45LAJ4QAJSZ3EFA55TTR5GT2/action/storage_attestation","attest_author":"https://pith.science/pith/BK45LAJ4QAJSZ3EFA55TTR5GT2/action/author_attestation","sign_citation":"https://pith.science/pith/BK45LAJ4QAJSZ3EFA55TTR5GT2/action/citation_signature","submit_replication":"https://pith.science/pith/BK45LAJ4QAJSZ3EFA55TTR5GT2/action/replication_record"}},"created_at":"2026-05-18T00:44:14.613590+00:00","updated_at":"2026-05-18T00:44:14.613590+00:00"}