{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:LOAHV4SANOPUA6U3XQR2IX3ELA","short_pith_number":"pith:LOAHV4SA","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"},"canonical_sha256":"5b807af2406b9f407a9bbc23a45f64582428ea0a9256f7fac436ee98446c0f79","source":{"kind":"arxiv","id":"1803.07527","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.07527","created_at":"2026-05-18T00:20:32Z"},{"alias_kind":"arxiv_version","alias_value":"1803.07527v1","created_at":"2026-05-18T00:20:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.07527","created_at":"2026-05-18T00:20:32Z"},{"alias_kind":"pith_short_12","alias_value":"LOAHV4SANOPU","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"LOAHV4SANOPUA6U3","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"LOAHV4SA","created_at":"2026-05-18T12:32:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:LOAHV4SANOPUA6U3XQR2IX3ELA","target":"record","payload":{"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"},"canonical_sha256":"5b807af2406b9f407a9bbc23a45f64582428ea0a9256f7fac436ee98446c0f79","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"},"source_kind":"arxiv","source_id":"1803.07527","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-18T00:20:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rkIO4k5Q9Isp9tRsdwBcqa+r/FvRG0lQxpxCHlxO7OBGbb4D8YdcapCH3IoSPXHbLBZdOycOpRzQXgw++vdjCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T01:17:40.734138Z"},"content_sha256":"5fb6b65a7b98519d82ed8d1b46560c92bfb05606da195d73a8963f071dee0087","schema_version":"1.0","event_id":"sha256:5fb6b65a7b98519d82ed8d1b46560c92bfb05606da195d73a8963f071dee0087"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:LOAHV4SANOPUA6U3XQR2IX3ELA","target":"graph","payload":{"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"},"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-18T00:20:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F8QPUBq7X/aZJNRMvfDehhjarSKROLiqNRqHzoiYFwKnPx/906P2/QYLfITEt8ETQTAOh/Y5SQRyOZMqJ9DYDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T01:17:40.734517Z"},"content_sha256":"8d1135510f4619c1ee6e10810417e9256b011748f152d7ff36ec162b67297366","schema_version":"1.0","event_id":"sha256:8d1135510f4619c1ee6e10810417e9256b011748f152d7ff36ec162b67297366"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LOAHV4SANOPUA6U3XQR2IX3ELA/bundle.json","state_url":"https://pith.science/pith/LOAHV4SANOPUA6U3XQR2IX3ELA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LOAHV4SANOPUA6U3XQR2IX3ELA/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-05-31T01:17:40Z","links":{"resolver":"https://pith.science/pith/LOAHV4SANOPUA6U3XQR2IX3ELA","bundle":"https://pith.science/pith/LOAHV4SANOPUA6U3XQR2IX3ELA/bundle.json","state":"https://pith.science/pith/LOAHV4SANOPUA6U3XQR2IX3ELA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LOAHV4SANOPUA6U3XQR2IX3ELA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:LOAHV4SANOPUA6U3XQR2IX3ELA","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":"099770b87f3e7120c75cbe8f36ee8c03dced0561691a1f4fb95a96d03e50b7b4","cross_cats_sorted":["math.IT","math.PR","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-03-20T17:10:08Z","title_canon_sha256":"c3bfcaf70a43b1e35721458f49c0c00e5b124de81894b1700a1ba203f65e67b1"},"schema_version":"1.0","source":{"id":"1803.07527","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.07527","created_at":"2026-05-18T00:20:32Z"},{"alias_kind":"arxiv_version","alias_value":"1803.07527v1","created_at":"2026-05-18T00:20:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.07527","created_at":"2026-05-18T00:20:32Z"},{"alias_kind":"pith_short_12","alias_value":"LOAHV4SANOPU","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"LOAHV4SANOPUA6U3","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"LOAHV4SA","created_at":"2026-05-18T12:32:37Z"}],"graph_snapshots":[{"event_id":"sha256:8d1135510f4619c1ee6e10810417e9256b011748f152d7ff36ec162b67297366","target":"graph","created_at":"2026-05-18T00:20:32Z","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 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","authors_text":"Anuran Makur, Elchanan Mossel, Yury Polyanskiy","cross_cats":["math.IT","math.PR","math.ST","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-03-20T17:10:08Z","title":"Broadcasting on Bounded Degree DAGs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.07527","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:5fb6b65a7b98519d82ed8d1b46560c92bfb05606da195d73a8963f071dee0087","target":"record","created_at":"2026-05-18T00:20:32Z","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":"099770b87f3e7120c75cbe8f36ee8c03dced0561691a1f4fb95a96d03e50b7b4","cross_cats_sorted":["math.IT","math.PR","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-03-20T17:10:08Z","title_canon_sha256":"c3bfcaf70a43b1e35721458f49c0c00e5b124de81894b1700a1ba203f65e67b1"},"schema_version":"1.0","source":{"id":"1803.07527","kind":"arxiv","version":1}},"canonical_sha256":"5b807af2406b9f407a9bbc23a45f64582428ea0a9256f7fac436ee98446c0f79","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5b807af2406b9f407a9bbc23a45f64582428ea0a9256f7fac436ee98446c0f79","first_computed_at":"2026-05-18T00:20:32.905819Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:20:32.905819Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QGUg53e2ax3i0cO7Uwhh5dpxpVtK95L7ihJNWJrVrFZ4wkTqoa7tAq/EoWm0y4YPOw8/6WVGMuHIYeMVKtYmDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:20:32.906526Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.07527","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5fb6b65a7b98519d82ed8d1b46560c92bfb05606da195d73a8963f071dee0087","sha256:8d1135510f4619c1ee6e10810417e9256b011748f152d7ff36ec162b67297366"],"state_sha256":"2ac4a601f0ac87f70ce36e16d2dcad88d92adc280466a8feb492e407b3e82bef"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vYd0wAsV+oNq+TsRUrf+q1PlGtx7IOrIVVEpQn4CJNCrSWY6zSjM9TmGfpELg52NSWhIpgGqItSXS9f7PZZrDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T01:17:40.736565Z","bundle_sha256":"58f9e7a12a295c1f9c1eadb4986b529b771fe41551129364d17aa72346f70b86"}}