{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:MUPTALXQRYCKAT24HFU2BT2JTN","short_pith_number":"pith:MUPTALXQ","canonical_record":{"source":{"id":"1407.7150","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-07-26T19:32:31Z","cross_cats_sorted":["math.IT","stat.AP"],"title_canon_sha256":"aeae076c6648c5d9532bdac6d6a109279d3d3b7060c0064874233bdede15b470","abstract_canon_sha256":"fd6b917765ad6b54ea3241ea840d003d0b37e239bfb5bf1dc83cc352dca73cf4"},"schema_version":"1.0"},"canonical_sha256":"651f302ef08e04a04f5c3969a0cf499b4648873cd790fc7c7ab062afb86df8ea","source":{"kind":"arxiv","id":"1407.7150","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.7150","created_at":"2026-05-18T00:58:41Z"},{"alias_kind":"arxiv_version","alias_value":"1407.7150v1","created_at":"2026-05-18T00:58:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.7150","created_at":"2026-05-18T00:58:41Z"},{"alias_kind":"pith_short_12","alias_value":"MUPTALXQRYCK","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"MUPTALXQRYCKAT24","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"MUPTALXQ","created_at":"2026-05-18T12:28:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:MUPTALXQRYCKAT24HFU2BT2JTN","target":"record","payload":{"canonical_record":{"source":{"id":"1407.7150","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-07-26T19:32:31Z","cross_cats_sorted":["math.IT","stat.AP"],"title_canon_sha256":"aeae076c6648c5d9532bdac6d6a109279d3d3b7060c0064874233bdede15b470","abstract_canon_sha256":"fd6b917765ad6b54ea3241ea840d003d0b37e239bfb5bf1dc83cc352dca73cf4"},"schema_version":"1.0"},"canonical_sha256":"651f302ef08e04a04f5c3969a0cf499b4648873cd790fc7c7ab062afb86df8ea","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:41.208788Z","signature_b64":"uPALErFkfJWUJ9U7Q4zOMXvqwkTSAt0MKzszmGYM2WVkQIeicC6Z57ShUtMCxZetpOtYw08cS6PVMcMawThWAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"651f302ef08e04a04f5c3969a0cf499b4648873cd790fc7c7ab062afb86df8ea","last_reissued_at":"2026-05-18T00:58:41.208093Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:41.208093Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1407.7150","source_version":1,"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-18T00:58:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QXIYWHaBpWltv5EOIJ9SD93ZhB3uubCh1OD+w1giw3LYJxjt9fyftE7CoUmDr6Wxml7RZ6jieLFniErbQNgCBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T02:37:54.520282Z"},"content_sha256":"216fa614abd51b446d413a75150b095d91775cbeb7ca7b1749784224c854c46d","schema_version":"1.0","event_id":"sha256:216fa614abd51b446d413a75150b095d91775cbeb7ca7b1749784224c854c46d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:MUPTALXQRYCKAT24HFU2BT2JTN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed Inference in Tree Networks using Coding Theory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","stat.AP"],"primary_cat":"cs.IT","authors_text":"Aditya Vempaty, Bhavya Kailkhura, Pramod K. Varshney","submitted_at":"2014-07-26T19:32:31Z","abstract_excerpt":"In this paper, we consider the problem of distributed inference in tree based networks. In the framework considered in this paper, distributed nodes make a 1-bit local decision regarding a phenomenon before sending it to the fusion center (FC) via intermediate nodes. We propose the use of coding theory based techniques to solve this distributed inference problem in such structures. Data is progressively compressed as it moves towards the FC. The FC makes the global inference after receiving data from intermediate nodes. Data fusion at nodes as well as at the FC is implemented via error correct"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.7150","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"},"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-18T00:58:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BzkDdp53SJrl4NsVkfB7i2FjY5U6lzmyGo9CQ3LvRoUzLWSIgUHDv9Tv9uoIOnvoO+NzjSXM676lH7pXGaFxCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T02:37:54.520652Z"},"content_sha256":"3a3abf4582b0430739435380e5ccb5617fcc551dc5db1e35ebbb69d4bc99507b","schema_version":"1.0","event_id":"sha256:3a3abf4582b0430739435380e5ccb5617fcc551dc5db1e35ebbb69d4bc99507b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MUPTALXQRYCKAT24HFU2BT2JTN/bundle.json","state_url":"https://pith.science/pith/MUPTALXQRYCKAT24HFU2BT2JTN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MUPTALXQRYCKAT24HFU2BT2JTN/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-06-03T02:37:54Z","links":{"resolver":"https://pith.science/pith/MUPTALXQRYCKAT24HFU2BT2JTN","bundle":"https://pith.science/pith/MUPTALXQRYCKAT24HFU2BT2JTN/bundle.json","state":"https://pith.science/pith/MUPTALXQRYCKAT24HFU2BT2JTN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MUPTALXQRYCKAT24HFU2BT2JTN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:MUPTALXQRYCKAT24HFU2BT2JTN","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":"fd6b917765ad6b54ea3241ea840d003d0b37e239bfb5bf1dc83cc352dca73cf4","cross_cats_sorted":["math.IT","stat.AP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-07-26T19:32:31Z","title_canon_sha256":"aeae076c6648c5d9532bdac6d6a109279d3d3b7060c0064874233bdede15b470"},"schema_version":"1.0","source":{"id":"1407.7150","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.7150","created_at":"2026-05-18T00:58:41Z"},{"alias_kind":"arxiv_version","alias_value":"1407.7150v1","created_at":"2026-05-18T00:58:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.7150","created_at":"2026-05-18T00:58:41Z"},{"alias_kind":"pith_short_12","alias_value":"MUPTALXQRYCK","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"MUPTALXQRYCKAT24","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"MUPTALXQ","created_at":"2026-05-18T12:28:38Z"}],"graph_snapshots":[{"event_id":"sha256:3a3abf4582b0430739435380e5ccb5617fcc551dc5db1e35ebbb69d4bc99507b","target":"graph","created_at":"2026-05-18T00:58:41Z","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":"In this paper, we consider the problem of distributed inference in tree based networks. In the framework considered in this paper, distributed nodes make a 1-bit local decision regarding a phenomenon before sending it to the fusion center (FC) via intermediate nodes. We propose the use of coding theory based techniques to solve this distributed inference problem in such structures. Data is progressively compressed as it moves towards the FC. The FC makes the global inference after receiving data from intermediate nodes. Data fusion at nodes as well as at the FC is implemented via error correct","authors_text":"Aditya Vempaty, Bhavya Kailkhura, Pramod K. Varshney","cross_cats":["math.IT","stat.AP"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-07-26T19:32:31Z","title":"Distributed Inference in Tree Networks using Coding Theory"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.7150","kind":"arxiv","version":1},"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:216fa614abd51b446d413a75150b095d91775cbeb7ca7b1749784224c854c46d","target":"record","created_at":"2026-05-18T00:58:41Z","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":"fd6b917765ad6b54ea3241ea840d003d0b37e239bfb5bf1dc83cc352dca73cf4","cross_cats_sorted":["math.IT","stat.AP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-07-26T19:32:31Z","title_canon_sha256":"aeae076c6648c5d9532bdac6d6a109279d3d3b7060c0064874233bdede15b470"},"schema_version":"1.0","source":{"id":"1407.7150","kind":"arxiv","version":1}},"canonical_sha256":"651f302ef08e04a04f5c3969a0cf499b4648873cd790fc7c7ab062afb86df8ea","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"651f302ef08e04a04f5c3969a0cf499b4648873cd790fc7c7ab062afb86df8ea","first_computed_at":"2026-05-18T00:58:41.208093Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:41.208093Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uPALErFkfJWUJ9U7Q4zOMXvqwkTSAt0MKzszmGYM2WVkQIeicC6Z57ShUtMCxZetpOtYw08cS6PVMcMawThWAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:41.208788Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.7150","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:216fa614abd51b446d413a75150b095d91775cbeb7ca7b1749784224c854c46d","sha256:3a3abf4582b0430739435380e5ccb5617fcc551dc5db1e35ebbb69d4bc99507b"],"state_sha256":"a55ef64545f9b410b9b4faee3ad415757893af04b7563f826c13a8b1d7dc2e7b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uu5VjOrheveAQ62CIgs6axV/Hi+m58V2yI/RKAXcSHcq7pk+GDaIgD1l18rmFaqrzjHJx967OeJTdZ2WaCIYCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T02:37:54.522712Z","bundle_sha256":"1d2c8db7c04f97a7cb43343080e83a164942baa7056a5dd23825cb55d87a0842"}}