{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:BJAVEPJXNHKYA5JFY4AMOBJCER","short_pith_number":"pith:BJAVEPJX","schema_version":"1.0","canonical_sha256":"0a41523d3769d5807525c700c70522245d7f0fb117a5fb8197767239c800e630","source":{"kind":"arxiv","id":"1206.0244","version":2},"attestation_state":"computed","paper":{"title":"Detection Performance in Balanced Binary Relay Trees with Node and Link Failures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ali Pezeshki, Edwin K. P. Chong, Stephen D. Howard, William Moran, Zhenliang Zhang","submitted_at":"2012-06-01T16:43:04Z","abstract_excerpt":"We study the distributed detection problem in the context of a balanced binary relay tree, where the leaves of the tree correspond to $N$ identical and independent sensors generating binary messages. The root of the tree is a fusion center making an overall decision. Every other node is a relay node that aggregates the messages received from its child nodes into a new message and sends it up toward the fusion center. We derive upper and lower bounds for the total error probability $P_N$ as explicit functions of $N$ in the case where nodes and links fail with certain probabilities. These charac"},"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":"1206.0244","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-06-01T16:43:04Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"13a9055a6ef4469e7eefde0b4b15276f08278f0d4733b88118422ba46ab67ca8","abstract_canon_sha256":"34bb45c30d26c56296e19e9a4161c448cdc91dddbd45179b01a1a32a963e248c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:57:08.805038Z","signature_b64":"eMMFq/Jd3fAv2tMJxpNCh+QGjacxzxS3bg/NFUYHGNTPnKv2DtaZ5wBseuU9wLZEe5g1/b0O5XoK0g5wXCGWAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0a41523d3769d5807525c700c70522245d7f0fb117a5fb8197767239c800e630","last_reissued_at":"2026-05-18T01:57:08.804293Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:57:08.804293Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Detection Performance in Balanced Binary Relay Trees with Node and Link Failures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ali Pezeshki, Edwin K. P. Chong, Stephen D. Howard, William Moran, Zhenliang Zhang","submitted_at":"2012-06-01T16:43:04Z","abstract_excerpt":"We study the distributed detection problem in the context of a balanced binary relay tree, where the leaves of the tree correspond to $N$ identical and independent sensors generating binary messages. The root of the tree is a fusion center making an overall decision. Every other node is a relay node that aggregates the messages received from its child nodes into a new message and sends it up toward the fusion center. We derive upper and lower bounds for the total error probability $P_N$ as explicit functions of $N$ in the case where nodes and links fail with certain probabilities. These charac"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.0244","kind":"arxiv","version":2},"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":"1206.0244","created_at":"2026-05-18T01:57:08.804416+00:00"},{"alias_kind":"arxiv_version","alias_value":"1206.0244v2","created_at":"2026-05-18T01:57:08.804416+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.0244","created_at":"2026-05-18T01:57:08.804416+00:00"},{"alias_kind":"pith_short_12","alias_value":"BJAVEPJXNHKY","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_16","alias_value":"BJAVEPJXNHKYA5JF","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_8","alias_value":"BJAVEPJX","created_at":"2026-05-18T12:27:01.376967+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/BJAVEPJXNHKYA5JFY4AMOBJCER","json":"https://pith.science/pith/BJAVEPJXNHKYA5JFY4AMOBJCER.json","graph_json":"https://pith.science/api/pith-number/BJAVEPJXNHKYA5JFY4AMOBJCER/graph.json","events_json":"https://pith.science/api/pith-number/BJAVEPJXNHKYA5JFY4AMOBJCER/events.json","paper":"https://pith.science/paper/BJAVEPJX"},"agent_actions":{"view_html":"https://pith.science/pith/BJAVEPJXNHKYA5JFY4AMOBJCER","download_json":"https://pith.science/pith/BJAVEPJXNHKYA5JFY4AMOBJCER.json","view_paper":"https://pith.science/paper/BJAVEPJX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1206.0244&json=true","fetch_graph":"https://pith.science/api/pith-number/BJAVEPJXNHKYA5JFY4AMOBJCER/graph.json","fetch_events":"https://pith.science/api/pith-number/BJAVEPJXNHKYA5JFY4AMOBJCER/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BJAVEPJXNHKYA5JFY4AMOBJCER/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BJAVEPJXNHKYA5JFY4AMOBJCER/action/storage_attestation","attest_author":"https://pith.science/pith/BJAVEPJXNHKYA5JFY4AMOBJCER/action/author_attestation","sign_citation":"https://pith.science/pith/BJAVEPJXNHKYA5JFY4AMOBJCER/action/citation_signature","submit_replication":"https://pith.science/pith/BJAVEPJXNHKYA5JFY4AMOBJCER/action/replication_record"}},"created_at":"2026-05-18T01:57:08.804416+00:00","updated_at":"2026-05-18T01:57:08.804416+00:00"}