{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:GYPIOH6SWOPNIK6EWDHFI7GUSB","short_pith_number":"pith:GYPIOH6S","schema_version":"1.0","canonical_sha256":"361e871fd2b39ed42bc4b0ce547cd4904118dd70806330470e0006b4d557c27d","source":{"kind":"arxiv","id":"1712.03053","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1712.03053","created_at":"2026-05-18T00:28:28.462407+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.03053v1","created_at":"2026-05-18T00:28:28.462407+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.03053","created_at":"2026-05-18T00:28:28.462407+00:00"},{"alias_kind":"pith_short_12","alias_value":"GYPIOH6SWOPN","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_16","alias_value":"GYPIOH6SWOPNIK6E","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_8","alias_value":"GYPIOH6S","created_at":"2026-05-18T12:31:18.294218+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GYPIOH6SWOPNIK6EWDHFI7GUSB","json":"https://pith.science/pith/GYPIOH6SWOPNIK6EWDHFI7GUSB.json","graph_json":"https://pith.science/api/pith-number/GYPIOH6SWOPNIK6EWDHFI7GUSB/graph.json","events_json":"https://pith.science/api/pith-number/GYPIOH6SWOPNIK6EWDHFI7GUSB/events.json","paper":"https://pith.science/paper/GYPIOH6S"},"agent_actions":{"view_html":"https://pith.science/pith/GYPIOH6SWOPNIK6EWDHFI7GUSB","download_json":"https://pith.science/pith/GYPIOH6SWOPNIK6EWDHFI7GUSB.json","view_paper":"https://pith.science/paper/GYPIOH6S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.03053&json=true","fetch_graph":"https://pith.science/api/pith-number/GYPIOH6SWOPNIK6EWDHFI7GUSB/graph.json","fetch_events":"https://pith.science/api/pith-number/GYPIOH6SWOPNIK6EWDHFI7GUSB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GYPIOH6SWOPNIK6EWDHFI7GUSB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GYPIOH6SWOPNIK6EWDHFI7GUSB/action/storage_attestation","attest_author":"https://pith.science/pith/GYPIOH6SWOPNIK6EWDHFI7GUSB/action/author_attestation","sign_citation":"https://pith.science/pith/GYPIOH6SWOPNIK6EWDHFI7GUSB/action/citation_signature","submit_replication":"https://pith.science/pith/GYPIOH6SWOPNIK6EWDHFI7GUSB/action/replication_record"}},"created_at":"2026-05-18T00:28:28.462407+00:00","updated_at":"2026-05-18T00:28:28.462407+00:00"}