{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:DV2IVFRUMDL5N7JSR2COUZ62C3","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":"73b4e884945ab3e5c808ce85529c993f7eaa421eb41654bac84e2234b8d7faa5","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-05-27T20:04:26Z","title_canon_sha256":"6064b706b3114973c629679d892b61e9090851723455104c3b1a7616845acfe6"},"schema_version":"1.0","source":{"id":"1105.5651","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.5651","created_at":"2026-05-18T03:52:53Z"},{"alias_kind":"arxiv_version","alias_value":"1105.5651v3","created_at":"2026-05-18T03:52:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.5651","created_at":"2026-05-18T03:52:53Z"},{"alias_kind":"pith_short_12","alias_value":"DV2IVFRUMDL5","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"DV2IVFRUMDL5N7JS","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"DV2IVFRU","created_at":"2026-05-18T12:26:26Z"}],"graph_snapshots":[{"event_id":"sha256:c9df68098298eaa939a9e5de871ba5911f7a9845763175826014724c8770ce2a","target":"graph","created_at":"2026-05-18T03:52:53Z","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 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","authors_text":"Piyush Gupta, Sanjay Shakkottai, Siddhartha Banerjee","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-05-27T20:04:26Z","title":"Towards a Queueing-Based Framework for In-Network Function Computation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.5651","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:5b95d854285df124df05be91ab8aa8e7e95e95f0ee6a778dba7adb32ca7ac2c0","target":"record","created_at":"2026-05-18T03:52:53Z","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":"73b4e884945ab3e5c808ce85529c993f7eaa421eb41654bac84e2234b8d7faa5","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-05-27T20:04:26Z","title_canon_sha256":"6064b706b3114973c629679d892b61e9090851723455104c3b1a7616845acfe6"},"schema_version":"1.0","source":{"id":"1105.5651","kind":"arxiv","version":3}},"canonical_sha256":"1d748a963460d7d6fd328e84ea67da16d9bd11345e205580c006d7184ad1a1a7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1d748a963460d7d6fd328e84ea67da16d9bd11345e205580c006d7184ad1a1a7","first_computed_at":"2026-05-18T03:52:53.408067Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:52:53.408067Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"E4kdvkrtRI+nqsR/kBRUlJDW//V6OsvkE4MxuBfvOLUZsGamHahyZ1YZyDOjB8w2zTDgKke6yl2oA7jiPwQGCw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:52:53.408890Z","signed_message":"canonical_sha256_bytes"},"source_id":"1105.5651","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5b95d854285df124df05be91ab8aa8e7e95e95f0ee6a778dba7adb32ca7ac2c0","sha256:c9df68098298eaa939a9e5de871ba5911f7a9845763175826014724c8770ce2a"],"state_sha256":"ed06736068f68a863a3da7ebb3bf48014acf89d94971fb37225e090bed5eb9fa"}