{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:DV2IVFRUMDL5N7JSR2COUZ62C3","short_pith_number":"pith:DV2IVFRU","schema_version":"1.0","canonical_sha256":"1d748a963460d7d6fd328e84ea67da16d9bd11345e205580c006d7184ad1a1a7","source":{"kind":"arxiv","id":"1105.5651","version":3},"attestation_state":"computed","paper":{"title":"Towards a Queueing-Based Framework for In-Network Function Computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.NI","authors_text":"Piyush Gupta, Sanjay Shakkottai, Siddhartha Banerjee","submitted_at":"2011-05-27T20:04:26Z","abstract_excerpt":"We seek to develop network algorithms for function computation in sensor networks. Specifically, we want dynamic joint aggregation, routing, and scheduling algorithms that have analytically provable performance benefits due to in-network computation as compared to simple data forwarding. To this end, we define a class of functions, the Fully-Multiplexible functions, which includes several functions such as parity, MAX, and k th -order statistics. For such functions we exactly characterize the maximum achievable refresh rate of the network in terms of an underlying graph primitive, the min-minc"},"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":"1105.5651","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-05-27T20:04:26Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"6064b706b3114973c629679d892b61e9090851723455104c3b1a7616845acfe6","abstract_canon_sha256":"73b4e884945ab3e5c808ce85529c993f7eaa421eb41654bac84e2234b8d7faa5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:52:53.408890Z","signature_b64":"E4kdvkrtRI+nqsR/kBRUlJDW//V6OsvkE4MxuBfvOLUZsGamHahyZ1YZyDOjB8w2zTDgKke6yl2oA7jiPwQGCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1d748a963460d7d6fd328e84ea67da16d9bd11345e205580c006d7184ad1a1a7","last_reissued_at":"2026-05-18T03:52:53.408067Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:52:53.408067Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Towards a Queueing-Based Framework for In-Network Function Computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.NI","authors_text":"Piyush Gupta, Sanjay Shakkottai, Siddhartha Banerjee","submitted_at":"2011-05-27T20:04:26Z","abstract_excerpt":"We seek to develop network algorithms for function computation in sensor networks. Specifically, we want dynamic joint aggregation, routing, and scheduling algorithms that have analytically provable performance benefits due to in-network computation as compared to simple data forwarding. To this end, we define a class of functions, the Fully-Multiplexible functions, which includes several functions such as parity, MAX, and k th -order statistics. For such functions we exactly characterize the maximum achievable refresh rate of the network in terms of an underlying graph primitive, the min-minc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.5651","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1105.5651","created_at":"2026-05-18T03:52:53.408188+00:00"},{"alias_kind":"arxiv_version","alias_value":"1105.5651v3","created_at":"2026-05-18T03:52:53.408188+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.5651","created_at":"2026-05-18T03:52:53.408188+00:00"},{"alias_kind":"pith_short_12","alias_value":"DV2IVFRUMDL5","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_16","alias_value":"DV2IVFRUMDL5N7JS","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_8","alias_value":"DV2IVFRU","created_at":"2026-05-18T12:26:26.731475+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/DV2IVFRUMDL5N7JSR2COUZ62C3","json":"https://pith.science/pith/DV2IVFRUMDL5N7JSR2COUZ62C3.json","graph_json":"https://pith.science/api/pith-number/DV2IVFRUMDL5N7JSR2COUZ62C3/graph.json","events_json":"https://pith.science/api/pith-number/DV2IVFRUMDL5N7JSR2COUZ62C3/events.json","paper":"https://pith.science/paper/DV2IVFRU"},"agent_actions":{"view_html":"https://pith.science/pith/DV2IVFRUMDL5N7JSR2COUZ62C3","download_json":"https://pith.science/pith/DV2IVFRUMDL5N7JSR2COUZ62C3.json","view_paper":"https://pith.science/paper/DV2IVFRU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1105.5651&json=true","fetch_graph":"https://pith.science/api/pith-number/DV2IVFRUMDL5N7JSR2COUZ62C3/graph.json","fetch_events":"https://pith.science/api/pith-number/DV2IVFRUMDL5N7JSR2COUZ62C3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DV2IVFRUMDL5N7JSR2COUZ62C3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DV2IVFRUMDL5N7JSR2COUZ62C3/action/storage_attestation","attest_author":"https://pith.science/pith/DV2IVFRUMDL5N7JSR2COUZ62C3/action/author_attestation","sign_citation":"https://pith.science/pith/DV2IVFRUMDL5N7JSR2COUZ62C3/action/citation_signature","submit_replication":"https://pith.science/pith/DV2IVFRUMDL5N7JSR2COUZ62C3/action/replication_record"}},"created_at":"2026-05-18T03:52:53.408188+00:00","updated_at":"2026-05-18T03:52:53.408188+00:00"}