{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:AXGLG7V7ZXQMSJEQSXGJTSOQMQ","short_pith_number":"pith:AXGLG7V7","canonical_record":{"source":{"id":"1403.4155","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-03-17T16:36:39Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d69215da51346810a837510187d34b0e14ea1f55169fe6a397875c6c83966fe4","abstract_canon_sha256":"26c8aae17fd330683314b75754f3aa8b9cce6e601bc4da1f9101eb9a46c08689"},"schema_version":"1.0"},"canonical_sha256":"05ccb37ebfcde0c9249095cc99c9d0643cc9e99b974a610f6baa04b669f4f8d5","source":{"kind":"arxiv","id":"1403.4155","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.4155","created_at":"2026-05-18T01:44:00Z"},{"alias_kind":"arxiv_version","alias_value":"1403.4155v3","created_at":"2026-05-18T01:44:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.4155","created_at":"2026-05-18T01:44:00Z"},{"alias_kind":"pith_short_12","alias_value":"AXGLG7V7ZXQM","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"AXGLG7V7ZXQMSJEQ","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"AXGLG7V7","created_at":"2026-05-18T12:28:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:AXGLG7V7ZXQMSJEQSXGJTSOQMQ","target":"record","payload":{"canonical_record":{"source":{"id":"1403.4155","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-03-17T16:36:39Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d69215da51346810a837510187d34b0e14ea1f55169fe6a397875c6c83966fe4","abstract_canon_sha256":"26c8aae17fd330683314b75754f3aa8b9cce6e601bc4da1f9101eb9a46c08689"},"schema_version":"1.0"},"canonical_sha256":"05ccb37ebfcde0c9249095cc99c9d0643cc9e99b974a610f6baa04b669f4f8d5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:44:00.439373Z","signature_b64":"RDgwr1J/GfrgsrQfCKZUsiUk76m+p5kOYeHgOPXcKFLJ8o5e7x7gNUL1atPnybTVPMBNM/kSKGxnlKac8TwPBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"05ccb37ebfcde0c9249095cc99c9d0643cc9e99b974a610f6baa04b669f4f8d5","last_reissued_at":"2026-05-18T01:44:00.438789Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:44:00.438789Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1403.4155","source_version":3,"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:44:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K39k06aYjS0qC1YyyCDpoKUJMQVSqbe7En/I5lMgQy/0gIL64sluB97wDs0DlCufzi36i2QW9rBMqrG6QG+uDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T23:42:00.848123Z"},"content_sha256":"4d01830e3296518b912c0402b993dc02e6df614208446e2c147b5edc1ff25ed5","schema_version":"1.0","event_id":"sha256:4d01830e3296518b912c0402b993dc02e6df614208446e2c147b5edc1ff25ed5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:AXGLG7V7ZXQMSJEQSXGJTSOQMQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bayesian Design of Tandem Networks for Distributed Detection With Multi-bit Sensor Decisions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alla Tarighati, Joakim Jalden","submitted_at":"2014-03-17T16:36:39Z","abstract_excerpt":"We consider the problem of decentralized hypothesis testing under communication constraints in a topology where several peripheral nodes are arranged in tandem. Each node receives an observation and transmits a message to its successor, and the last node then decides which hypothesis is true. We assume that the observations at different nodes are, conditioned on the true hypothesis, independent and the channel between any two successive nodes is considered error-free but rate-constrained. We propose a cyclic numerical design algorithm for the design of nodes using a person-by-person methodolog"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.4155","kind":"arxiv","version":3},"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:44:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YRdkR+7wUZAxlJRVTAgykRKsvPAYctXmGQlte7uwMswm3ykXci4hCFoYpEF9SIHwWPoUolcPE9u7ylGVoPeCDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T23:42:00.848547Z"},"content_sha256":"280171d9e588650dcc6ceceae9d2c079b04eb9a22993fd37f9a97fb3757a44b0","schema_version":"1.0","event_id":"sha256:280171d9e588650dcc6ceceae9d2c079b04eb9a22993fd37f9a97fb3757a44b0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AXGLG7V7ZXQMSJEQSXGJTSOQMQ/bundle.json","state_url":"https://pith.science/pith/AXGLG7V7ZXQMSJEQSXGJTSOQMQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AXGLG7V7ZXQMSJEQSXGJTSOQMQ/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-26T23:42:00Z","links":{"resolver":"https://pith.science/pith/AXGLG7V7ZXQMSJEQSXGJTSOQMQ","bundle":"https://pith.science/pith/AXGLG7V7ZXQMSJEQSXGJTSOQMQ/bundle.json","state":"https://pith.science/pith/AXGLG7V7ZXQMSJEQSXGJTSOQMQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AXGLG7V7ZXQMSJEQSXGJTSOQMQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:AXGLG7V7ZXQMSJEQSXGJTSOQMQ","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":"26c8aae17fd330683314b75754f3aa8b9cce6e601bc4da1f9101eb9a46c08689","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-03-17T16:36:39Z","title_canon_sha256":"d69215da51346810a837510187d34b0e14ea1f55169fe6a397875c6c83966fe4"},"schema_version":"1.0","source":{"id":"1403.4155","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.4155","created_at":"2026-05-18T01:44:00Z"},{"alias_kind":"arxiv_version","alias_value":"1403.4155v3","created_at":"2026-05-18T01:44:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.4155","created_at":"2026-05-18T01:44:00Z"},{"alias_kind":"pith_short_12","alias_value":"AXGLG7V7ZXQM","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"AXGLG7V7ZXQMSJEQ","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"AXGLG7V7","created_at":"2026-05-18T12:28:19Z"}],"graph_snapshots":[{"event_id":"sha256:280171d9e588650dcc6ceceae9d2c079b04eb9a22993fd37f9a97fb3757a44b0","target":"graph","created_at":"2026-05-18T01:44:00Z","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 consider the problem of decentralized hypothesis testing under communication constraints in a topology where several peripheral nodes are arranged in tandem. Each node receives an observation and transmits a message to its successor, and the last node then decides which hypothesis is true. We assume that the observations at different nodes are, conditioned on the true hypothesis, independent and the channel between any two successive nodes is considered error-free but rate-constrained. We propose a cyclic numerical design algorithm for the design of nodes using a person-by-person methodolog","authors_text":"Alla Tarighati, Joakim Jalden","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-03-17T16:36:39Z","title":"Bayesian Design of Tandem Networks for Distributed Detection With Multi-bit Sensor Decisions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.4155","kind":"arxiv","version":3},"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:4d01830e3296518b912c0402b993dc02e6df614208446e2c147b5edc1ff25ed5","target":"record","created_at":"2026-05-18T01:44:00Z","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":"26c8aae17fd330683314b75754f3aa8b9cce6e601bc4da1f9101eb9a46c08689","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-03-17T16:36:39Z","title_canon_sha256":"d69215da51346810a837510187d34b0e14ea1f55169fe6a397875c6c83966fe4"},"schema_version":"1.0","source":{"id":"1403.4155","kind":"arxiv","version":3}},"canonical_sha256":"05ccb37ebfcde0c9249095cc99c9d0643cc9e99b974a610f6baa04b669f4f8d5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"05ccb37ebfcde0c9249095cc99c9d0643cc9e99b974a610f6baa04b669f4f8d5","first_computed_at":"2026-05-18T01:44:00.438789Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:44:00.438789Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RDgwr1J/GfrgsrQfCKZUsiUk76m+p5kOYeHgOPXcKFLJ8o5e7x7gNUL1atPnybTVPMBNM/kSKGxnlKac8TwPBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:44:00.439373Z","signed_message":"canonical_sha256_bytes"},"source_id":"1403.4155","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4d01830e3296518b912c0402b993dc02e6df614208446e2c147b5edc1ff25ed5","sha256:280171d9e588650dcc6ceceae9d2c079b04eb9a22993fd37f9a97fb3757a44b0"],"state_sha256":"3f41b8b46a76b394b450eee52ca4b502ce5759fa16d2bb0edf0a9ce378ba98c9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"05L9sOaEmsd0EHXn/U4NIXerq2ArUwUUcGAPRBCholCvylORwv0x/6xCt/X7kNh4jpSQ62ktLJVoJUlow65oAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T23:42:00.851095Z","bundle_sha256":"f8729d2bea5c8aba5bcda074751d6cdbd0873c91f65d969d6e213d3528073cfa"}}