{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:WY74HWRYBBRFKI3EPJ4XYO6DHV","short_pith_number":"pith:WY74HWRY","canonical_record":{"source":{"id":"1508.01553","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-08-06T22:18:10Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"fece460858d6c0376e3662bbfaf7757fd9a262e57817e86a6bd09df47f1fe89b","abstract_canon_sha256":"3a62b30962da52acc531b4a833cbd299517efa3a10d03ad3aa9d75fe62d5cbeb"},"schema_version":"1.0"},"canonical_sha256":"b63fc3da3808625523647a797c3bc33d712573135db29acd00ba5d84046526b5","source":{"kind":"arxiv","id":"1508.01553","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.01553","created_at":"2026-05-18T00:51:52Z"},{"alias_kind":"arxiv_version","alias_value":"1508.01553v3","created_at":"2026-05-18T00:51:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.01553","created_at":"2026-05-18T00:51:52Z"},{"alias_kind":"pith_short_12","alias_value":"WY74HWRYBBRF","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"WY74HWRYBBRFKI3E","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"WY74HWRY","created_at":"2026-05-18T12:29:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:WY74HWRYBBRFKI3EPJ4XYO6DHV","target":"record","payload":{"canonical_record":{"source":{"id":"1508.01553","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-08-06T22:18:10Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"fece460858d6c0376e3662bbfaf7757fd9a262e57817e86a6bd09df47f1fe89b","abstract_canon_sha256":"3a62b30962da52acc531b4a833cbd299517efa3a10d03ad3aa9d75fe62d5cbeb"},"schema_version":"1.0"},"canonical_sha256":"b63fc3da3808625523647a797c3bc33d712573135db29acd00ba5d84046526b5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:52.215619Z","signature_b64":"1zJYe0CEfyznHOHlSijKQsGBUVOqgPEgsFTXZliYDKYE9AKX/lG0ffV1CM4zCSa0DB8MR9wdYn+OQ8yvoiE5AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b63fc3da3808625523647a797c3bc33d712573135db29acd00ba5d84046526b5","last_reissued_at":"2026-05-18T00:51:52.215007Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:52.215007Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1508.01553","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:51:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ppz4sZpLG7XT3816E+UOx8F1PArXQ6buo9FrOS0P5fj23S/tRyNwdWaUYrXYPrlTrP0m+k3JUdB8EyvhuIMyAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T17:23:50.355994Z"},"content_sha256":"cf37c55255e6c67c73a6211d2f80bae8cc1258e8bbfda4a0c592fe4fe5906593","schema_version":"1.0","event_id":"sha256:cf37c55255e6c67c73a6211d2f80bae8cc1258e8bbfda4a0c592fe4fe5906593"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:WY74HWRYBBRFKI3EPJ4XYO6DHV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Graph Codes for Distributed Instant Message Collection in an Arbitrary Noisy Broadcast Network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Pulkit Grover, Soummya Kar, Yaoqing Yang","submitted_at":"2015-08-06T22:18:10Z","abstract_excerpt":"We consider the problem of minimizing the number of broadcasts for collecting all sensor measurements at a sink node in a noisy broadcast sensor network. Focusing first on arbitrary network topologies, we provide (i) fundamental limits on the required number of broadcasts of data gathering, and (ii) a general in-network computing strategy to achieve an upper bound within factor $\\log N$ of the fundamental limits, where $N$ is the number of agents in the network. Next, focusing on two example networks, namely, \\textcolor{black}{arbitrary geometric networks and random Erd$\\ddot{o}$s-R$\\acute{e}$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.01553","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:51:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N2fAhBnhoucLuTrdMBi0wt4G7ypj0RYz4ZQdDi9c5Ly9rsHQQ3EqSBw5AE5zMxFonYdMXSlC/lLbb9dVkwamBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T17:23:50.356486Z"},"content_sha256":"ab405bbdf22607767767ab50cb4dd8321e3afdc98ed17db2d5d4a39cd660b125","schema_version":"1.0","event_id":"sha256:ab405bbdf22607767767ab50cb4dd8321e3afdc98ed17db2d5d4a39cd660b125"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WY74HWRYBBRFKI3EPJ4XYO6DHV/bundle.json","state_url":"https://pith.science/pith/WY74HWRYBBRFKI3EPJ4XYO6DHV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WY74HWRYBBRFKI3EPJ4XYO6DHV/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-26T17:23:50Z","links":{"resolver":"https://pith.science/pith/WY74HWRYBBRFKI3EPJ4XYO6DHV","bundle":"https://pith.science/pith/WY74HWRYBBRFKI3EPJ4XYO6DHV/bundle.json","state":"https://pith.science/pith/WY74HWRYBBRFKI3EPJ4XYO6DHV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WY74HWRYBBRFKI3EPJ4XYO6DHV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:WY74HWRYBBRFKI3EPJ4XYO6DHV","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":"3a62b30962da52acc531b4a833cbd299517efa3a10d03ad3aa9d75fe62d5cbeb","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-08-06T22:18:10Z","title_canon_sha256":"fece460858d6c0376e3662bbfaf7757fd9a262e57817e86a6bd09df47f1fe89b"},"schema_version":"1.0","source":{"id":"1508.01553","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.01553","created_at":"2026-05-18T00:51:52Z"},{"alias_kind":"arxiv_version","alias_value":"1508.01553v3","created_at":"2026-05-18T00:51:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.01553","created_at":"2026-05-18T00:51:52Z"},{"alias_kind":"pith_short_12","alias_value":"WY74HWRYBBRF","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"WY74HWRYBBRFKI3E","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"WY74HWRY","created_at":"2026-05-18T12:29:47Z"}],"graph_snapshots":[{"event_id":"sha256:ab405bbdf22607767767ab50cb4dd8321e3afdc98ed17db2d5d4a39cd660b125","target":"graph","created_at":"2026-05-18T00:51:52Z","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 minimizing the number of broadcasts for collecting all sensor measurements at a sink node in a noisy broadcast sensor network. Focusing first on arbitrary network topologies, we provide (i) fundamental limits on the required number of broadcasts of data gathering, and (ii) a general in-network computing strategy to achieve an upper bound within factor $\\log N$ of the fundamental limits, where $N$ is the number of agents in the network. Next, focusing on two example networks, namely, \\textcolor{black}{arbitrary geometric networks and random Erd$\\ddot{o}$s-R$\\acute{e}$","authors_text":"Pulkit Grover, Soummya Kar, Yaoqing Yang","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-08-06T22:18:10Z","title":"Graph Codes for Distributed Instant Message Collection in an Arbitrary Noisy Broadcast Network"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.01553","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:cf37c55255e6c67c73a6211d2f80bae8cc1258e8bbfda4a0c592fe4fe5906593","target":"record","created_at":"2026-05-18T00:51:52Z","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":"3a62b30962da52acc531b4a833cbd299517efa3a10d03ad3aa9d75fe62d5cbeb","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-08-06T22:18:10Z","title_canon_sha256":"fece460858d6c0376e3662bbfaf7757fd9a262e57817e86a6bd09df47f1fe89b"},"schema_version":"1.0","source":{"id":"1508.01553","kind":"arxiv","version":3}},"canonical_sha256":"b63fc3da3808625523647a797c3bc33d712573135db29acd00ba5d84046526b5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b63fc3da3808625523647a797c3bc33d712573135db29acd00ba5d84046526b5","first_computed_at":"2026-05-18T00:51:52.215007Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:51:52.215007Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1zJYe0CEfyznHOHlSijKQsGBUVOqgPEgsFTXZliYDKYE9AKX/lG0ffV1CM4zCSa0DB8MR9wdYn+OQ8yvoiE5AA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:51:52.215619Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.01553","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cf37c55255e6c67c73a6211d2f80bae8cc1258e8bbfda4a0c592fe4fe5906593","sha256:ab405bbdf22607767767ab50cb4dd8321e3afdc98ed17db2d5d4a39cd660b125"],"state_sha256":"c0ff8f8fcd81d2879a91b80e3333e7ef0831491aeeaf27ddb78b3739654fc957"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4qPDZSsHchKQFT2JZfa1+7QRMaz5blgINGWrl5DHw/TO4S8hSWvx3fZmhbHBN4cBKfmUdjQseu7R10nXAa03Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T17:23:50.358978Z","bundle_sha256":"a5b4dfd24327daef8f4549890b6d1105a6a1ee25a5f7dff39c2c70ce701a6dbf"}}