{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:SSL3NOR2NQHROR7HRZ2GMFJ2UG","short_pith_number":"pith:SSL3NOR2","schema_version":"1.0","canonical_sha256":"9497b6ba3a6c0f1747e78e7466153aa1b2cefa6825a2c0dcf0423789abe78e79","source":{"kind":"arxiv","id":"1202.1354","version":2},"attestation_state":"computed","paper":{"title":"Error Probability Bounds for M-ary Relay Trees","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-02-07T06:19:33Z","abstract_excerpt":"We study the detection error probabilities associated with an M-ary relay tree, where the leaves of the tree correspond to identical and independent sensors. Only these leaves are sensors. The root of the tree represents a fusion center that makes the overall detection decision. Each of the other nodes in the tree is a relay node that combines M summarized messages from its immediate child nodes to form a single output message using the majority dominance rule. We derive tight upper and lower bounds for the Type I and II error probabilities at the fusion center as explicit functions of the num"},"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":"1202.1354","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-07T06:19:33Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"77200b8001ee74b87d02d4a50b834675edb46925532ed56cbda1aaa171b4c342","abstract_canon_sha256":"c58d272c5b94c6b276e290ee074849aaff62e3d1e1b18df545d01ee94a40f2d4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:41:44.175232Z","signature_b64":"u9Ql2I1bqBJQNUzNdc/QB7sjaGoDC1z50b9/RP0V0Cg8GiAC6OohIf8wPQ/sJzG7RtlP3KEcAYQ+S5WT9vCLAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9497b6ba3a6c0f1747e78e7466153aa1b2cefa6825a2c0dcf0423789abe78e79","last_reissued_at":"2026-05-18T03:41:44.174294Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:41:44.174294Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Error Probability Bounds for M-ary Relay Trees","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-02-07T06:19:33Z","abstract_excerpt":"We study the detection error probabilities associated with an M-ary relay tree, where the leaves of the tree correspond to identical and independent sensors. Only these leaves are sensors. The root of the tree represents a fusion center that makes the overall detection decision. Each of the other nodes in the tree is a relay node that combines M summarized messages from its immediate child nodes to form a single output message using the majority dominance rule. We derive tight upper and lower bounds for the Type I and II error probabilities at the fusion center as explicit functions of the num"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.1354","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":"1202.1354","created_at":"2026-05-18T03:41:44.174467+00:00"},{"alias_kind":"arxiv_version","alias_value":"1202.1354v2","created_at":"2026-05-18T03:41:44.174467+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.1354","created_at":"2026-05-18T03:41:44.174467+00:00"},{"alias_kind":"pith_short_12","alias_value":"SSL3NOR2NQHR","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_16","alias_value":"SSL3NOR2NQHROR7H","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_8","alias_value":"SSL3NOR2","created_at":"2026-05-18T12:27:20.899486+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/SSL3NOR2NQHROR7HRZ2GMFJ2UG","json":"https://pith.science/pith/SSL3NOR2NQHROR7HRZ2GMFJ2UG.json","graph_json":"https://pith.science/api/pith-number/SSL3NOR2NQHROR7HRZ2GMFJ2UG/graph.json","events_json":"https://pith.science/api/pith-number/SSL3NOR2NQHROR7HRZ2GMFJ2UG/events.json","paper":"https://pith.science/paper/SSL3NOR2"},"agent_actions":{"view_html":"https://pith.science/pith/SSL3NOR2NQHROR7HRZ2GMFJ2UG","download_json":"https://pith.science/pith/SSL3NOR2NQHROR7HRZ2GMFJ2UG.json","view_paper":"https://pith.science/paper/SSL3NOR2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1202.1354&json=true","fetch_graph":"https://pith.science/api/pith-number/SSL3NOR2NQHROR7HRZ2GMFJ2UG/graph.json","fetch_events":"https://pith.science/api/pith-number/SSL3NOR2NQHROR7HRZ2GMFJ2UG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SSL3NOR2NQHROR7HRZ2GMFJ2UG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SSL3NOR2NQHROR7HRZ2GMFJ2UG/action/storage_attestation","attest_author":"https://pith.science/pith/SSL3NOR2NQHROR7HRZ2GMFJ2UG/action/author_attestation","sign_citation":"https://pith.science/pith/SSL3NOR2NQHROR7HRZ2GMFJ2UG/action/citation_signature","submit_replication":"https://pith.science/pith/SSL3NOR2NQHROR7HRZ2GMFJ2UG/action/replication_record"}},"created_at":"2026-05-18T03:41:44.174467+00:00","updated_at":"2026-05-18T03:41:44.174467+00:00"}