{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:QAIEQQJT3TR4OM4QDD5DEZTESX","short_pith_number":"pith:QAIEQQJT","canonical_record":{"source":{"id":"0901.2356","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-01-15T21:56:09Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"28891fe6de591be30c73792f8f2d178aebdff03a8e9fe35ed0c50d26023e08ec","abstract_canon_sha256":"82c667d8dfc0bc369aa25441c81d5bc88a667ee7b15bf695115d8ea0fbcc635d"},"schema_version":"1.0"},"canonical_sha256":"8010484133dce3c7339018fa32666495f6fdc32aaf12b48539a1d32c5a800bbd","source":{"kind":"arxiv","id":"0901.2356","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0901.2356","created_at":"2026-05-18T00:58:48Z"},{"alias_kind":"arxiv_version","alias_value":"0901.2356v3","created_at":"2026-05-18T00:58:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0901.2356","created_at":"2026-05-18T00:58:48Z"},{"alias_kind":"pith_short_12","alias_value":"QAIEQQJT3TR4","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_16","alias_value":"QAIEQQJT3TR4OM4Q","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_8","alias_value":"QAIEQQJT","created_at":"2026-05-18T12:26:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:QAIEQQJT3TR4OM4QDD5DEZTESX","target":"record","payload":{"canonical_record":{"source":{"id":"0901.2356","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-01-15T21:56:09Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"28891fe6de591be30c73792f8f2d178aebdff03a8e9fe35ed0c50d26023e08ec","abstract_canon_sha256":"82c667d8dfc0bc369aa25441c81d5bc88a667ee7b15bf695115d8ea0fbcc635d"},"schema_version":"1.0"},"canonical_sha256":"8010484133dce3c7339018fa32666495f6fdc32aaf12b48539a1d32c5a800bbd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:48.280605Z","signature_b64":"HOOqO5eSyFOx1ghGJFJ7eGnnaSu/37maThbSZDWVIRKhugKrHF/JnRVWcDPBtsadRVP7RSt1YzMaGUY59KC6DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8010484133dce3c7339018fa32666495f6fdc32aaf12b48539a1d32c5a800bbd","last_reissued_at":"2026-05-18T00:58:48.279914Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:48.279914Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0901.2356","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-18T00:58:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CHWf148/PTyprR09FwKWEO6hbraVXFKDOfpOCC20tBXN/XYOjaZhi1p23fimT1mzysaYEtel1RKFqylWANRFCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T21:50:26.308235Z"},"content_sha256":"7367ce02462c951e03b9e0424bf703ec5462f90f0b537556bb27a967fb94695d","schema_version":"1.0","event_id":"sha256:7367ce02462c951e03b9e0424bf703ec5462f90f0b537556bb27a967fb94695d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:QAIEQQJT3TR4OM4QDD5DEZTESX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Information-Theoretic Bounds for Multiround Function Computation in Collocated Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Nan Ma, Piyush Gupta, Prakash Ishwar","submitted_at":"2009-01-15T21:56:09Z","abstract_excerpt":"We study the limits of communication efficiency for function computation in collocated networks within the framework of multi-terminal block source coding theory. With the goal of computing a desired function of sources at a sink, nodes interact with each other through a sequence of error-free, network-wide broadcasts of finite-rate messages. For any function of independent sources, we derive a computable characterization of the set of all feasible message coding rates - the rate region - in terms of single-letter information measures. We show that when computing symmetric functions of binary "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0901.2356","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-18T00:58:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VhZzXCQl1rrOr7yXJn9hhZ2S3bIWoMn4XFL/V1uagS6tHjVAtibCVCW8TSVbFg4KaxfoZE2iNt+UJR8gwywyDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T21:50:26.308757Z"},"content_sha256":"c237916679c6eb77b2d5901e0c3a6fd37e0c35d42a4c68a8ad7e8b8ec9bd1da7","schema_version":"1.0","event_id":"sha256:c237916679c6eb77b2d5901e0c3a6fd37e0c35d42a4c68a8ad7e8b8ec9bd1da7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QAIEQQJT3TR4OM4QDD5DEZTESX/bundle.json","state_url":"https://pith.science/pith/QAIEQQJT3TR4OM4QDD5DEZTESX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QAIEQQJT3TR4OM4QDD5DEZTESX/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-03T21:50:26Z","links":{"resolver":"https://pith.science/pith/QAIEQQJT3TR4OM4QDD5DEZTESX","bundle":"https://pith.science/pith/QAIEQQJT3TR4OM4QDD5DEZTESX/bundle.json","state":"https://pith.science/pith/QAIEQQJT3TR4OM4QDD5DEZTESX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QAIEQQJT3TR4OM4QDD5DEZTESX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:QAIEQQJT3TR4OM4QDD5DEZTESX","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":"82c667d8dfc0bc369aa25441c81d5bc88a667ee7b15bf695115d8ea0fbcc635d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-01-15T21:56:09Z","title_canon_sha256":"28891fe6de591be30c73792f8f2d178aebdff03a8e9fe35ed0c50d26023e08ec"},"schema_version":"1.0","source":{"id":"0901.2356","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0901.2356","created_at":"2026-05-18T00:58:48Z"},{"alias_kind":"arxiv_version","alias_value":"0901.2356v3","created_at":"2026-05-18T00:58:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0901.2356","created_at":"2026-05-18T00:58:48Z"},{"alias_kind":"pith_short_12","alias_value":"QAIEQQJT3TR4","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_16","alias_value":"QAIEQQJT3TR4OM4Q","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_8","alias_value":"QAIEQQJT","created_at":"2026-05-18T12:26:01Z"}],"graph_snapshots":[{"event_id":"sha256:c237916679c6eb77b2d5901e0c3a6fd37e0c35d42a4c68a8ad7e8b8ec9bd1da7","target":"graph","created_at":"2026-05-18T00:58:48Z","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 limits of communication efficiency for function computation in collocated networks within the framework of multi-terminal block source coding theory. With the goal of computing a desired function of sources at a sink, nodes interact with each other through a sequence of error-free, network-wide broadcasts of finite-rate messages. For any function of independent sources, we derive a computable characterization of the set of all feasible message coding rates - the rate region - in terms of single-letter information measures. We show that when computing symmetric functions of binary ","authors_text":"Nan Ma, Piyush Gupta, Prakash Ishwar","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-01-15T21:56:09Z","title":"Information-Theoretic Bounds for Multiround Function Computation in Collocated Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0901.2356","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:7367ce02462c951e03b9e0424bf703ec5462f90f0b537556bb27a967fb94695d","target":"record","created_at":"2026-05-18T00:58:48Z","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":"82c667d8dfc0bc369aa25441c81d5bc88a667ee7b15bf695115d8ea0fbcc635d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-01-15T21:56:09Z","title_canon_sha256":"28891fe6de591be30c73792f8f2d178aebdff03a8e9fe35ed0c50d26023e08ec"},"schema_version":"1.0","source":{"id":"0901.2356","kind":"arxiv","version":3}},"canonical_sha256":"8010484133dce3c7339018fa32666495f6fdc32aaf12b48539a1d32c5a800bbd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8010484133dce3c7339018fa32666495f6fdc32aaf12b48539a1d32c5a800bbd","first_computed_at":"2026-05-18T00:58:48.279914Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:48.279914Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HOOqO5eSyFOx1ghGJFJ7eGnnaSu/37maThbSZDWVIRKhugKrHF/JnRVWcDPBtsadRVP7RSt1YzMaGUY59KC6DA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:48.280605Z","signed_message":"canonical_sha256_bytes"},"source_id":"0901.2356","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7367ce02462c951e03b9e0424bf703ec5462f90f0b537556bb27a967fb94695d","sha256:c237916679c6eb77b2d5901e0c3a6fd37e0c35d42a4c68a8ad7e8b8ec9bd1da7"],"state_sha256":"2096ca990ca5a81f9d3284eb19e798f533f7c90d3dcc4f09eef31b358567660e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4K8G60BuHsfRBrF4hx7hDpe1JrogefueyJ13rRD2RC2KhQFTQoExeAcO3DlYTT7YSLpejL8yTVHorOlXzEIpAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T21:50:26.311080Z","bundle_sha256":"a10e0dd10cbe8df2a25c60e5f78f52a0470aad752e8256a9a0199dc5223279a2"}}