{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:GYPIOH6SWOPNIK6EWDHFI7GUSB","short_pith_number":"pith:GYPIOH6S","canonical_record":{"source":{"id":"1712.03053","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-12-08T13:23:57Z","cross_cats_sorted":[],"title_canon_sha256":"1896388cd1058ab3ce5dc28547bd0e6787daa84b2d31b56771a4b4be62afe3a3","abstract_canon_sha256":"21d3914cb6e3715cb76218400e8a541001d2f47dcd2818662c78c18e628c5d7d"},"schema_version":"1.0"},"canonical_sha256":"361e871fd2b39ed42bc4b0ce547cd4904118dd70806330470e0006b4d557c27d","source":{"kind":"arxiv","id":"1712.03053","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.03053","created_at":"2026-05-18T00:28:28Z"},{"alias_kind":"arxiv_version","alias_value":"1712.03053v1","created_at":"2026-05-18T00:28:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.03053","created_at":"2026-05-18T00:28:28Z"},{"alias_kind":"pith_short_12","alias_value":"GYPIOH6SWOPN","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"GYPIOH6SWOPNIK6E","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"GYPIOH6S","created_at":"2026-05-18T12:31:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:GYPIOH6SWOPNIK6EWDHFI7GUSB","target":"record","payload":{"canonical_record":{"source":{"id":"1712.03053","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-12-08T13:23:57Z","cross_cats_sorted":[],"title_canon_sha256":"1896388cd1058ab3ce5dc28547bd0e6787daa84b2d31b56771a4b4be62afe3a3","abstract_canon_sha256":"21d3914cb6e3715cb76218400e8a541001d2f47dcd2818662c78c18e628c5d7d"},"schema_version":"1.0"},"canonical_sha256":"361e871fd2b39ed42bc4b0ce547cd4904118dd70806330470e0006b4d557c27d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:28:28.462862Z","signature_b64":"kwa0zXlX/E/rWGo5U2kry5837q/0HN/HBCGc5nSYVolQ1wdTDND77JMZGXZED/SowhJRFYx71eFn35F1JySOBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"361e871fd2b39ed42bc4b0ce547cd4904118dd70806330470e0006b4d557c27d","last_reissued_at":"2026-05-18T00:28:28.462285Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:28:28.462285Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.03053","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:28:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uRPmR6mYLVRF75ANzTRtswUSePwdtrEGQAtYyN3ez+S7KWpnLQDqRdSJwn7vTjt0lDs1bg9fqJEcs4CP7X0GBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T00:44:00.759473Z"},"content_sha256":"e087b071cfaade139983312d2624ad1f614add22e7240f5fef5a5701c11f1bdc","schema_version":"1.0","event_id":"sha256:e087b071cfaade139983312d2624ad1f614add22e7240f5fef5a5701c11f1bdc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:GYPIOH6SWOPNIK6EWDHFI7GUSB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Wireless Aggregation at Nearly Constant Rate","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Magnus M. Halldorsson, Tigran Tonoyan","submitted_at":"2017-12-08T13:23:57Z","abstract_excerpt":"One of the most fundamental tasks in sensor networks is the computation of a (compressible) aggregation function of the input measurements. What rate of computation can be maintained, by properly choosing the aggregation tree, the TDMA schedule of the tree edges, and the transmission powers? This can be viewed as the convergecast capacity of a wireless network. We show here that the optimal rate is effectively a constant. This holds even in \\emph{arbitrary} networks, under the physical model of interference. This compares with previous bounds that are logarithmic (e.g., $\\Omega(1/\\log n)$). Na"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.03053","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:28:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nMDdMfZpijSPAKxKG+P8HKxnJT/lumfy5L7YilUDvviuPgnx7s0hZnDCF4KEpFD30PO9E3LU+zvz+uHqLhlCBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T00:44:00.760159Z"},"content_sha256":"242911650575713f4597de3a5d97c6570900faf5ec601a9e1813e5912225943d","schema_version":"1.0","event_id":"sha256:242911650575713f4597de3a5d97c6570900faf5ec601a9e1813e5912225943d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GYPIOH6SWOPNIK6EWDHFI7GUSB/bundle.json","state_url":"https://pith.science/pith/GYPIOH6SWOPNIK6EWDHFI7GUSB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GYPIOH6SWOPNIK6EWDHFI7GUSB/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-24T00:44:00Z","links":{"resolver":"https://pith.science/pith/GYPIOH6SWOPNIK6EWDHFI7GUSB","bundle":"https://pith.science/pith/GYPIOH6SWOPNIK6EWDHFI7GUSB/bundle.json","state":"https://pith.science/pith/GYPIOH6SWOPNIK6EWDHFI7GUSB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GYPIOH6SWOPNIK6EWDHFI7GUSB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:GYPIOH6SWOPNIK6EWDHFI7GUSB","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":"21d3914cb6e3715cb76218400e8a541001d2f47dcd2818662c78c18e628c5d7d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-12-08T13:23:57Z","title_canon_sha256":"1896388cd1058ab3ce5dc28547bd0e6787daa84b2d31b56771a4b4be62afe3a3"},"schema_version":"1.0","source":{"id":"1712.03053","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.03053","created_at":"2026-05-18T00:28:28Z"},{"alias_kind":"arxiv_version","alias_value":"1712.03053v1","created_at":"2026-05-18T00:28:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.03053","created_at":"2026-05-18T00:28:28Z"},{"alias_kind":"pith_short_12","alias_value":"GYPIOH6SWOPN","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"GYPIOH6SWOPNIK6E","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"GYPIOH6S","created_at":"2026-05-18T12:31:18Z"}],"graph_snapshots":[{"event_id":"sha256:242911650575713f4597de3a5d97c6570900faf5ec601a9e1813e5912225943d","target":"graph","created_at":"2026-05-18T00:28:28Z","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":"One of the most fundamental tasks in sensor networks is the computation of a (compressible) aggregation function of the input measurements. What rate of computation can be maintained, by properly choosing the aggregation tree, the TDMA schedule of the tree edges, and the transmission powers? This can be viewed as the convergecast capacity of a wireless network. We show here that the optimal rate is effectively a constant. This holds even in \\emph{arbitrary} networks, under the physical model of interference. This compares with previous bounds that are logarithmic (e.g., $\\Omega(1/\\log n)$). Na","authors_text":"Magnus M. Halldorsson, Tigran Tonoyan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-12-08T13:23:57Z","title":"Wireless Aggregation at Nearly Constant Rate"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.03053","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:e087b071cfaade139983312d2624ad1f614add22e7240f5fef5a5701c11f1bdc","target":"record","created_at":"2026-05-18T00:28:28Z","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":"21d3914cb6e3715cb76218400e8a541001d2f47dcd2818662c78c18e628c5d7d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-12-08T13:23:57Z","title_canon_sha256":"1896388cd1058ab3ce5dc28547bd0e6787daa84b2d31b56771a4b4be62afe3a3"},"schema_version":"1.0","source":{"id":"1712.03053","kind":"arxiv","version":1}},"canonical_sha256":"361e871fd2b39ed42bc4b0ce547cd4904118dd70806330470e0006b4d557c27d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"361e871fd2b39ed42bc4b0ce547cd4904118dd70806330470e0006b4d557c27d","first_computed_at":"2026-05-18T00:28:28.462285Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:28:28.462285Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kwa0zXlX/E/rWGo5U2kry5837q/0HN/HBCGc5nSYVolQ1wdTDND77JMZGXZED/SowhJRFYx71eFn35F1JySOBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:28:28.462862Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.03053","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e087b071cfaade139983312d2624ad1f614add22e7240f5fef5a5701c11f1bdc","sha256:242911650575713f4597de3a5d97c6570900faf5ec601a9e1813e5912225943d"],"state_sha256":"6d88eafe74042cdb294f3e739ae7f366c0d9982f0892a92a9284ac13e4b20298"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Pp/zCho93bcspn+MscAGa762/FSmTNbZOdKe9nEkpv6Cmd12CJiVpN4K8DbXGGMoeUZz8j1UBdwagGn64gyBDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T00:44:00.765489Z","bundle_sha256":"9ed8759f8524c875a346db3dc3c597d3f67f3e104a3114efdf5051e84ad7b68a"}}