{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:LOAHV4SANOPUA6U3XQR2IX3ELA","short_pith_number":"pith:LOAHV4SA","schema_version":"1.0","canonical_sha256":"5b807af2406b9f407a9bbc23a45f64582428ea0a9256f7fac436ee98446c0f79","source":{"kind":"arxiv","id":"1803.07527","version":1},"attestation_state":"computed","paper":{"title":"Broadcasting on Bounded Degree DAGs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.PR","math.ST","stat.TH"],"primary_cat":"cs.IT","authors_text":"Anuran Makur, Elchanan Mossel, Yury Polyanskiy","submitted_at":"2018-03-20T17:10:08Z","abstract_excerpt":"We study the following generalization of the well-known model of broadcasting on trees. Consider an infinite directed acyclic graph (DAG) with a unique source node $X$. Let the collection of nodes at distance $k$ from $X$ be called the $k$th layer. At time zero, the source node is given a bit. At time $k\\geq 1$, each node in the $(k-1)$th layer inspects its inputs and sends a bit to its descendants in the $k$th layer. Each bit is flipped with a probability of error $\\delta \\in \\left(0,\\frac{1}{2}\\right)$ in the process of transmission. The goal is to be able to recover the original bit with pr"},"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":"1803.07527","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-03-20T17:10:08Z","cross_cats_sorted":["math.IT","math.PR","math.ST","stat.TH"],"title_canon_sha256":"c3bfcaf70a43b1e35721458f49c0c00e5b124de81894b1700a1ba203f65e67b1","abstract_canon_sha256":"099770b87f3e7120c75cbe8f36ee8c03dced0561691a1f4fb95a96d03e50b7b4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:32.906526Z","signature_b64":"QGUg53e2ax3i0cO7Uwhh5dpxpVtK95L7ihJNWJrVrFZ4wkTqoa7tAq/EoWm0y4YPOw8/6WVGMuHIYeMVKtYmDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5b807af2406b9f407a9bbc23a45f64582428ea0a9256f7fac436ee98446c0f79","last_reissued_at":"2026-05-18T00:20:32.905819Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:32.905819Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Broadcasting on Bounded Degree DAGs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.PR","math.ST","stat.TH"],"primary_cat":"cs.IT","authors_text":"Anuran Makur, Elchanan Mossel, Yury Polyanskiy","submitted_at":"2018-03-20T17:10:08Z","abstract_excerpt":"We study the following generalization of the well-known model of broadcasting on trees. Consider an infinite directed acyclic graph (DAG) with a unique source node $X$. Let the collection of nodes at distance $k$ from $X$ be called the $k$th layer. At time zero, the source node is given a bit. At time $k\\geq 1$, each node in the $(k-1)$th layer inspects its inputs and sends a bit to its descendants in the $k$th layer. Each bit is flipped with a probability of error $\\delta \\in \\left(0,\\frac{1}{2}\\right)$ in the process of transmission. The goal is to be able to recover the original bit with pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.07527","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":"1803.07527","created_at":"2026-05-18T00:20:32.905941+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.07527v1","created_at":"2026-05-18T00:20:32.905941+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.07527","created_at":"2026-05-18T00:20:32.905941+00:00"},{"alias_kind":"pith_short_12","alias_value":"LOAHV4SANOPU","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_16","alias_value":"LOAHV4SANOPUA6U3","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_8","alias_value":"LOAHV4SA","created_at":"2026-05-18T12:32:37.024351+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/LOAHV4SANOPUA6U3XQR2IX3ELA","json":"https://pith.science/pith/LOAHV4SANOPUA6U3XQR2IX3ELA.json","graph_json":"https://pith.science/api/pith-number/LOAHV4SANOPUA6U3XQR2IX3ELA/graph.json","events_json":"https://pith.science/api/pith-number/LOAHV4SANOPUA6U3XQR2IX3ELA/events.json","paper":"https://pith.science/paper/LOAHV4SA"},"agent_actions":{"view_html":"https://pith.science/pith/LOAHV4SANOPUA6U3XQR2IX3ELA","download_json":"https://pith.science/pith/LOAHV4SANOPUA6U3XQR2IX3ELA.json","view_paper":"https://pith.science/paper/LOAHV4SA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.07527&json=true","fetch_graph":"https://pith.science/api/pith-number/LOAHV4SANOPUA6U3XQR2IX3ELA/graph.json","fetch_events":"https://pith.science/api/pith-number/LOAHV4SANOPUA6U3XQR2IX3ELA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LOAHV4SANOPUA6U3XQR2IX3ELA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LOAHV4SANOPUA6U3XQR2IX3ELA/action/storage_attestation","attest_author":"https://pith.science/pith/LOAHV4SANOPUA6U3XQR2IX3ELA/action/author_attestation","sign_citation":"https://pith.science/pith/LOAHV4SANOPUA6U3XQR2IX3ELA/action/citation_signature","submit_replication":"https://pith.science/pith/LOAHV4SANOPUA6U3XQR2IX3ELA/action/replication_record"}},"created_at":"2026-05-18T00:20:32.905941+00:00","updated_at":"2026-05-18T00:20:32.905941+00:00"}