{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:BJAVEPJXNHKYA5JFY4AMOBJCER","short_pith_number":"pith:BJAVEPJX","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"},"canonical_sha256":"0a41523d3769d5807525c700c70522245d7f0fb117a5fb8197767239c800e630","source":{"kind":"arxiv","id":"1206.0244","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.0244","created_at":"2026-05-18T01:57:08Z"},{"alias_kind":"arxiv_version","alias_value":"1206.0244v2","created_at":"2026-05-18T01:57:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.0244","created_at":"2026-05-18T01:57:08Z"},{"alias_kind":"pith_short_12","alias_value":"BJAVEPJXNHKY","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"BJAVEPJXNHKYA5JF","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"BJAVEPJX","created_at":"2026-05-18T12:27:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:BJAVEPJXNHKYA5JFY4AMOBJCER","target":"record","payload":{"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"},"canonical_sha256":"0a41523d3769d5807525c700c70522245d7f0fb117a5fb8197767239c800e630","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"},"source_kind":"arxiv","source_id":"1206.0244","source_version":2,"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-18T01:57:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IejKr5455EBLnd22Nz1Vr39rQGUR8/j39Mwd4j0/eNKgAWVLdSGRnsXy+h8JqOhzk/Z+8cjE01pOFfvuTThWBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T11:04:20.223048Z"},"content_sha256":"822b4b8a8763c18edd7b2e740c3901b93e1aa9a531571306138837aedc443858","schema_version":"1.0","event_id":"sha256:822b4b8a8763c18edd7b2e740c3901b93e1aa9a531571306138837aedc443858"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:BJAVEPJXNHKYA5JFY4AMOBJCER","target":"graph","payload":{"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"},"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-18T01:57:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S9W4pc85wFWOmI9g7e4sRNPeTuDcj9htBuoT2oouKM9YJ7kTTXSr5qvdZvXeGxH8Jr99C5DU3oROYrs+ycXcAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T11:04:20.223747Z"},"content_sha256":"bb7d3c388802a407188a826cfe6100a28fb2e8138b40e77f3b5e27aeadf59916","schema_version":"1.0","event_id":"sha256:bb7d3c388802a407188a826cfe6100a28fb2e8138b40e77f3b5e27aeadf59916"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BJAVEPJXNHKYA5JFY4AMOBJCER/bundle.json","state_url":"https://pith.science/pith/BJAVEPJXNHKYA5JFY4AMOBJCER/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BJAVEPJXNHKYA5JFY4AMOBJCER/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-26T11:04:20Z","links":{"resolver":"https://pith.science/pith/BJAVEPJXNHKYA5JFY4AMOBJCER","bundle":"https://pith.science/pith/BJAVEPJXNHKYA5JFY4AMOBJCER/bundle.json","state":"https://pith.science/pith/BJAVEPJXNHKYA5JFY4AMOBJCER/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BJAVEPJXNHKYA5JFY4AMOBJCER/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:BJAVEPJXNHKYA5JFY4AMOBJCER","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":"34bb45c30d26c56296e19e9a4161c448cdc91dddbd45179b01a1a32a963e248c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-06-01T16:43:04Z","title_canon_sha256":"13a9055a6ef4469e7eefde0b4b15276f08278f0d4733b88118422ba46ab67ca8"},"schema_version":"1.0","source":{"id":"1206.0244","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.0244","created_at":"2026-05-18T01:57:08Z"},{"alias_kind":"arxiv_version","alias_value":"1206.0244v2","created_at":"2026-05-18T01:57:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.0244","created_at":"2026-05-18T01:57:08Z"},{"alias_kind":"pith_short_12","alias_value":"BJAVEPJXNHKY","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"BJAVEPJXNHKYA5JF","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"BJAVEPJX","created_at":"2026-05-18T12:27:01Z"}],"graph_snapshots":[{"event_id":"sha256:bb7d3c388802a407188a826cfe6100a28fb2e8138b40e77f3b5e27aeadf59916","target":"graph","created_at":"2026-05-18T01:57:08Z","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 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","authors_text":"Ali Pezeshki, Edwin K. P. Chong, Stephen D. Howard, William Moran, Zhenliang Zhang","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-06-01T16:43:04Z","title":"Detection Performance in Balanced Binary Relay Trees with Node and Link Failures"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.0244","kind":"arxiv","version":2},"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:822b4b8a8763c18edd7b2e740c3901b93e1aa9a531571306138837aedc443858","target":"record","created_at":"2026-05-18T01:57:08Z","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":"34bb45c30d26c56296e19e9a4161c448cdc91dddbd45179b01a1a32a963e248c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-06-01T16:43:04Z","title_canon_sha256":"13a9055a6ef4469e7eefde0b4b15276f08278f0d4733b88118422ba46ab67ca8"},"schema_version":"1.0","source":{"id":"1206.0244","kind":"arxiv","version":2}},"canonical_sha256":"0a41523d3769d5807525c700c70522245d7f0fb117a5fb8197767239c800e630","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0a41523d3769d5807525c700c70522245d7f0fb117a5fb8197767239c800e630","first_computed_at":"2026-05-18T01:57:08.804293Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:57:08.804293Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eMMFq/Jd3fAv2tMJxpNCh+QGjacxzxS3bg/NFUYHGNTPnKv2DtaZ5wBseuU9wLZEe5g1/b0O5XoK0g5wXCGWAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:57:08.805038Z","signed_message":"canonical_sha256_bytes"},"source_id":"1206.0244","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:822b4b8a8763c18edd7b2e740c3901b93e1aa9a531571306138837aedc443858","sha256:bb7d3c388802a407188a826cfe6100a28fb2e8138b40e77f3b5e27aeadf59916"],"state_sha256":"d502dbe820b6a1747ae4b226dd4e1e3e971072efd497cb91b223111078bbf8a5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Soq18BBO1cd+1i+sIQ31KFlKNvoWol/an0xyAxldiRWSr7UnjNzdzyZKrHTESeMmVsJq0ql4MjdwVSxe3s7FAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T11:04:20.227399Z","bundle_sha256":"dbc72446066747ba5aa60ba2cdd376845d8ad4201ba67dac0e349d3bcc455a94"}}