{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:IWMVK4UUCJSZTT5W4MTVHC74O3","short_pith_number":"pith:IWMVK4UU","schema_version":"1.0","canonical_sha256":"4599557294126599cfb6e327538bfc76e364085df424fac9f34298bd575963df","source":{"kind":"arxiv","id":"0903.4812","version":1},"attestation_state":"computed","paper":{"title":"A computational method for bounding the probability of reconstruction on trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Elitza Maneva, Nayantara Bhatnagar","submitted_at":"2009-03-27T14:50:01Z","abstract_excerpt":"For a tree Markov random field non-reconstruction is said to hold if as the depth of the tree goes to infinity the information that a typical configuration at the leaves gives about the value at the root goes to zero. The distribution of the measure at the root conditioned on a typical boundary can be computed using a distributional recurrence. However the exact computation is not feasible because the support of the distribution grows exponentially with the depth.\n  In this work, we introduce a notion of a survey of a distribution over probability vectors which is a succinct representation of "},"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":"0903.4812","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2009-03-27T14:50:01Z","cross_cats_sorted":[],"title_canon_sha256":"efba47fd81ee39645806c9e6dff09060333a41c5ea5731880463f2732918dea9","abstract_canon_sha256":"863a7e303b2bc6f889573ff995d9dcc566feec0bb04e0b5337f56099b4f6bd83"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:16:52.503454Z","signature_b64":"QfVEHUXbsyuZfIIwdHWNzwh+3s7HUWyPtk3LjwLYus7HD2rRXbp0DGyiHPSokK7JApJ51BaFYZtsgo3iAe30CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4599557294126599cfb6e327538bfc76e364085df424fac9f34298bd575963df","last_reissued_at":"2026-05-18T04:16:52.502876Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:16:52.502876Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A computational method for bounding the probability of reconstruction on trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Elitza Maneva, Nayantara Bhatnagar","submitted_at":"2009-03-27T14:50:01Z","abstract_excerpt":"For a tree Markov random field non-reconstruction is said to hold if as the depth of the tree goes to infinity the information that a typical configuration at the leaves gives about the value at the root goes to zero. The distribution of the measure at the root conditioned on a typical boundary can be computed using a distributional recurrence. However the exact computation is not feasible because the support of the distribution grows exponentially with the depth.\n  In this work, we introduce a notion of a survey of a distribution over probability vectors which is a succinct representation of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0903.4812","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":"0903.4812","created_at":"2026-05-18T04:16:52.502950+00:00"},{"alias_kind":"arxiv_version","alias_value":"0903.4812v1","created_at":"2026-05-18T04:16:52.502950+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0903.4812","created_at":"2026-05-18T04:16:52.502950+00:00"},{"alias_kind":"pith_short_12","alias_value":"IWMVK4UUCJSZ","created_at":"2026-05-18T12:26:00.592388+00:00"},{"alias_kind":"pith_short_16","alias_value":"IWMVK4UUCJSZTT5W","created_at":"2026-05-18T12:26:00.592388+00:00"},{"alias_kind":"pith_short_8","alias_value":"IWMVK4UU","created_at":"2026-05-18T12:26:00.592388+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/IWMVK4UUCJSZTT5W4MTVHC74O3","json":"https://pith.science/pith/IWMVK4UUCJSZTT5W4MTVHC74O3.json","graph_json":"https://pith.science/api/pith-number/IWMVK4UUCJSZTT5W4MTVHC74O3/graph.json","events_json":"https://pith.science/api/pith-number/IWMVK4UUCJSZTT5W4MTVHC74O3/events.json","paper":"https://pith.science/paper/IWMVK4UU"},"agent_actions":{"view_html":"https://pith.science/pith/IWMVK4UUCJSZTT5W4MTVHC74O3","download_json":"https://pith.science/pith/IWMVK4UUCJSZTT5W4MTVHC74O3.json","view_paper":"https://pith.science/paper/IWMVK4UU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0903.4812&json=true","fetch_graph":"https://pith.science/api/pith-number/IWMVK4UUCJSZTT5W4MTVHC74O3/graph.json","fetch_events":"https://pith.science/api/pith-number/IWMVK4UUCJSZTT5W4MTVHC74O3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IWMVK4UUCJSZTT5W4MTVHC74O3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IWMVK4UUCJSZTT5W4MTVHC74O3/action/storage_attestation","attest_author":"https://pith.science/pith/IWMVK4UUCJSZTT5W4MTVHC74O3/action/author_attestation","sign_citation":"https://pith.science/pith/IWMVK4UUCJSZTT5W4MTVHC74O3/action/citation_signature","submit_replication":"https://pith.science/pith/IWMVK4UUCJSZTT5W4MTVHC74O3/action/replication_record"}},"created_at":"2026-05-18T04:16:52.502950+00:00","updated_at":"2026-05-18T04:16:52.502950+00:00"}