{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:ZT5AOFPMPWBKXWNGGCNP53QFZN","short_pith_number":"pith:ZT5AOFPM","canonical_record":{"source":{"id":"1601.06095","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-22T18:25:56Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9a92d4c2dfa3979c85be8f61811119a21389394698d7d45e965d7c78f8a36f8c","abstract_canon_sha256":"18a108aa7ca7d4064634cd5c4147bd94bd7f2debb6daf4243372611cbbcb6627"},"schema_version":"1.0"},"canonical_sha256":"ccfa0715ec7d82abd9a6309afeee05cb46ebf5b8c60da32aa220dd66880a0a8f","source":{"kind":"arxiv","id":"1601.06095","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.06095","created_at":"2026-05-18T01:22:09Z"},{"alias_kind":"arxiv_version","alias_value":"1601.06095v1","created_at":"2026-05-18T01:22:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.06095","created_at":"2026-05-18T01:22:09Z"},{"alias_kind":"pith_short_12","alias_value":"ZT5AOFPMPWBK","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"ZT5AOFPMPWBKXWNG","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"ZT5AOFPM","created_at":"2026-05-18T12:30:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:ZT5AOFPMPWBKXWNGGCNP53QFZN","target":"record","payload":{"canonical_record":{"source":{"id":"1601.06095","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-22T18:25:56Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9a92d4c2dfa3979c85be8f61811119a21389394698d7d45e965d7c78f8a36f8c","abstract_canon_sha256":"18a108aa7ca7d4064634cd5c4147bd94bd7f2debb6daf4243372611cbbcb6627"},"schema_version":"1.0"},"canonical_sha256":"ccfa0715ec7d82abd9a6309afeee05cb46ebf5b8c60da32aa220dd66880a0a8f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:22:09.319293Z","signature_b64":"jTicdSgT4AMCAq+ccZU9Eo/RynCT7Vmby0IEA3uA97DBFrrj/Ot8J+w9GGIU6OCZ0rD671foyt9WU08OIIJACw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ccfa0715ec7d82abd9a6309afeee05cb46ebf5b8c60da32aa220dd66880a0a8f","last_reissued_at":"2026-05-18T01:22:09.318695Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:22:09.318695Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1601.06095","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-18T01:22:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8Va37xkx7wuQheJ2NPRe6U4B8/UMmlQ4n2qiDtdN8MzBHIyIw6KSjRzrZZE15DQS+VmR1KffpGrrbXvtGS4RCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T16:06:57.431039Z"},"content_sha256":"b7c248adf562fe913df4b12450129a1ce22af844dfb730b3b78e143185b89501","schema_version":"1.0","event_id":"sha256:b7c248adf562fe913df4b12450129a1ce22af844dfb730b3b78e143185b89501"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:ZT5AOFPMPWBKXWNGGCNP53QFZN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Energy Efficient Distributed Coding for Data Collection in a Noisy Sparse 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":"2016-01-22T18:25:56Z","abstract_excerpt":"We consider the problem of data collection in a two-layer network consisting of (1) links between $N$ distributed agents and a remote sink node; (2) a sparse network formed by these distributed agents. We study the effect of inter-agent communications on the overall energy consumption. Despite the sparse connections between agents, we provide an in-network coding scheme that reduces the overall energy consumption by a factor of $\\Theta(\\log N)$ compared to a naive scheme which neglects inter-agent communications. By providing lower bounds on both the energy consumption and the sparseness (numb"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.06095","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-18T01:22:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PF0sxJE3WQnni7h5kwK0qQr+jpPnqyMfA/X422LWltFtPyAQtnTrFCA6b5NVQEmTWEbOsEq6WX2/0lTO5bfuBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T16:06:57.431707Z"},"content_sha256":"758bdc482cd35ef28b4b78b86b5e1e18d922f2e5b314dc4db4232aa67ffc61f3","schema_version":"1.0","event_id":"sha256:758bdc482cd35ef28b4b78b86b5e1e18d922f2e5b314dc4db4232aa67ffc61f3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZT5AOFPMPWBKXWNGGCNP53QFZN/bundle.json","state_url":"https://pith.science/pith/ZT5AOFPMPWBKXWNGGCNP53QFZN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZT5AOFPMPWBKXWNGGCNP53QFZN/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-26T16:06:57Z","links":{"resolver":"https://pith.science/pith/ZT5AOFPMPWBKXWNGGCNP53QFZN","bundle":"https://pith.science/pith/ZT5AOFPMPWBKXWNGGCNP53QFZN/bundle.json","state":"https://pith.science/pith/ZT5AOFPMPWBKXWNGGCNP53QFZN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZT5AOFPMPWBKXWNGGCNP53QFZN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:ZT5AOFPMPWBKXWNGGCNP53QFZN","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":"18a108aa7ca7d4064634cd5c4147bd94bd7f2debb6daf4243372611cbbcb6627","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-22T18:25:56Z","title_canon_sha256":"9a92d4c2dfa3979c85be8f61811119a21389394698d7d45e965d7c78f8a36f8c"},"schema_version":"1.0","source":{"id":"1601.06095","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.06095","created_at":"2026-05-18T01:22:09Z"},{"alias_kind":"arxiv_version","alias_value":"1601.06095v1","created_at":"2026-05-18T01:22:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.06095","created_at":"2026-05-18T01:22:09Z"},{"alias_kind":"pith_short_12","alias_value":"ZT5AOFPMPWBK","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"ZT5AOFPMPWBKXWNG","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"ZT5AOFPM","created_at":"2026-05-18T12:30:55Z"}],"graph_snapshots":[{"event_id":"sha256:758bdc482cd35ef28b4b78b86b5e1e18d922f2e5b314dc4db4232aa67ffc61f3","target":"graph","created_at":"2026-05-18T01:22:09Z","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 data collection in a two-layer network consisting of (1) links between $N$ distributed agents and a remote sink node; (2) a sparse network formed by these distributed agents. We study the effect of inter-agent communications on the overall energy consumption. Despite the sparse connections between agents, we provide an in-network coding scheme that reduces the overall energy consumption by a factor of $\\Theta(\\log N)$ compared to a naive scheme which neglects inter-agent communications. By providing lower bounds on both the energy consumption and the sparseness (numb","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":"2016-01-22T18:25:56Z","title":"Energy Efficient Distributed Coding for Data Collection in a Noisy Sparse Network"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.06095","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:b7c248adf562fe913df4b12450129a1ce22af844dfb730b3b78e143185b89501","target":"record","created_at":"2026-05-18T01:22:09Z","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":"18a108aa7ca7d4064634cd5c4147bd94bd7f2debb6daf4243372611cbbcb6627","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-22T18:25:56Z","title_canon_sha256":"9a92d4c2dfa3979c85be8f61811119a21389394698d7d45e965d7c78f8a36f8c"},"schema_version":"1.0","source":{"id":"1601.06095","kind":"arxiv","version":1}},"canonical_sha256":"ccfa0715ec7d82abd9a6309afeee05cb46ebf5b8c60da32aa220dd66880a0a8f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ccfa0715ec7d82abd9a6309afeee05cb46ebf5b8c60da32aa220dd66880a0a8f","first_computed_at":"2026-05-18T01:22:09.318695Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:22:09.318695Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jTicdSgT4AMCAq+ccZU9Eo/RynCT7Vmby0IEA3uA97DBFrrj/Ot8J+w9GGIU6OCZ0rD671foyt9WU08OIIJACw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:22:09.319293Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.06095","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b7c248adf562fe913df4b12450129a1ce22af844dfb730b3b78e143185b89501","sha256:758bdc482cd35ef28b4b78b86b5e1e18d922f2e5b314dc4db4232aa67ffc61f3"],"state_sha256":"b482d827f41ceb849643ec7f8b20c5321c401296c92dac9488b9fb22e7a64dab"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qXpkGGsrue0uzTX5TPB+HYPN1fpuWi8uUvZCxeaecS90V6yU9WlrM2DN3yZSGi+EmX230FRc1l17N4CPbArbAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T16:06:57.435205Z","bundle_sha256":"a8c45a5d4d38ee9c1ea5732d8e355185f031e7badacd71a9a8890f79972241c3"}}