{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:AWE5TTL5PV6E7DVYK63MW5OB7S","short_pith_number":"pith:AWE5TTL5","canonical_record":{"source":{"id":"1101.0858","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-01-05T00:37:48Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"1979b7efb5ee22bc33e349bfb262f677b9b435680c286432ddd305f7a510008c","abstract_canon_sha256":"96078226f97bdfca1a614fc42a35433034ba1f93f256c4afb8b7cc958d55a592"},"schema_version":"1.0"},"canonical_sha256":"0589d9cd7d7d7c4f8eb857b6cb75c1fca8c5069be3515ae7b81dd9507efd0816","source":{"kind":"arxiv","id":"1101.0858","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.0858","created_at":"2026-05-18T00:58:43Z"},{"alias_kind":"arxiv_version","alias_value":"1101.0858v2","created_at":"2026-05-18T00:58:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.0858","created_at":"2026-05-18T00:58:43Z"},{"alias_kind":"pith_short_12","alias_value":"AWE5TTL5PV6E","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"AWE5TTL5PV6E7DVY","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"AWE5TTL5","created_at":"2026-05-18T12:26:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:AWE5TTL5PV6E7DVYK63MW5OB7S","target":"record","payload":{"canonical_record":{"source":{"id":"1101.0858","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-01-05T00:37:48Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"1979b7efb5ee22bc33e349bfb262f677b9b435680c286432ddd305f7a510008c","abstract_canon_sha256":"96078226f97bdfca1a614fc42a35433034ba1f93f256c4afb8b7cc958d55a592"},"schema_version":"1.0"},"canonical_sha256":"0589d9cd7d7d7c4f8eb857b6cb75c1fca8c5069be3515ae7b81dd9507efd0816","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:43.744803Z","signature_b64":"VVcTYWEhyV43p+EEqQnPlIum34EX614OeeBO6uVRwqAn/bA7e07gsNe/ISnpywLe54Z09wAM9Sw7l7d2AC3JAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0589d9cd7d7d7c4f8eb857b6cb75c1fca8c5069be3515ae7b81dd9507efd0816","last_reissued_at":"2026-05-18T00:58:43.744307Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:43.744307Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1101.0858","source_version":2,"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:58:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7G+K2HsCFGOCrIWACmIfRqZO/ptoPpHs0AF0LqxugKA55KBIJpXTv1mU5DPwNNCd50hPbJyZJJ8hb1RM7JbYDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T18:45:34.882758Z"},"content_sha256":"2d833dd975197dc891c048dc997b6e481688f7d3110fb3d16a68e756ad0cfe1e","schema_version":"1.0","event_id":"sha256:2d833dd975197dc891c048dc997b6e481688f7d3110fb3d16a68e756ad0cfe1e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:AWE5TTL5PV6E7DVYK63MW5OB7S","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Energy-Latency Tradeoff for In-Network Function Computation in Random Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.NI","authors_text":"Alan Willsky, Animashree Anandkumar, B\\'ela Bollob\\'as, Paul Balister","submitted_at":"2011-01-05T00:37:48Z","abstract_excerpt":"The problem of designing policies for in-network function computation with minimum energy consumption subject to a latency constraint is considered. The scaling behavior of the energy consumption under the latency constraint is analyzed for random networks, where the nodes are uniformly placed in growing regions and the number of nodes goes to infinity. The special case of sum function computation and its delivery to a designated root node is considered first. A policy which achieves order-optimal average energy consumption in random networks subject to the given latency constraint is proposed"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.0858","kind":"arxiv","version":2},"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:58:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vSP2b2mGyb0dPGKvWy7VEUO6OUWI4sxCLul1cyICGIH6g03fUcp6puJvFFdElxrEXNy0sfJZOO6arDG1ftrEBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T18:45:34.883108Z"},"content_sha256":"616c6477623b9810b5f7edcceacbd3b4737c6fcbf32b4c7163dbc27cf9876c68","schema_version":"1.0","event_id":"sha256:616c6477623b9810b5f7edcceacbd3b4737c6fcbf32b4c7163dbc27cf9876c68"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AWE5TTL5PV6E7DVYK63MW5OB7S/bundle.json","state_url":"https://pith.science/pith/AWE5TTL5PV6E7DVYK63MW5OB7S/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AWE5TTL5PV6E7DVYK63MW5OB7S/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-06-02T18:45:34Z","links":{"resolver":"https://pith.science/pith/AWE5TTL5PV6E7DVYK63MW5OB7S","bundle":"https://pith.science/pith/AWE5TTL5PV6E7DVYK63MW5OB7S/bundle.json","state":"https://pith.science/pith/AWE5TTL5PV6E7DVYK63MW5OB7S/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AWE5TTL5PV6E7DVYK63MW5OB7S/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:AWE5TTL5PV6E7DVYK63MW5OB7S","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":"96078226f97bdfca1a614fc42a35433034ba1f93f256c4afb8b7cc958d55a592","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-01-05T00:37:48Z","title_canon_sha256":"1979b7efb5ee22bc33e349bfb262f677b9b435680c286432ddd305f7a510008c"},"schema_version":"1.0","source":{"id":"1101.0858","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.0858","created_at":"2026-05-18T00:58:43Z"},{"alias_kind":"arxiv_version","alias_value":"1101.0858v2","created_at":"2026-05-18T00:58:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.0858","created_at":"2026-05-18T00:58:43Z"},{"alias_kind":"pith_short_12","alias_value":"AWE5TTL5PV6E","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"AWE5TTL5PV6E7DVY","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"AWE5TTL5","created_at":"2026-05-18T12:26:24Z"}],"graph_snapshots":[{"event_id":"sha256:616c6477623b9810b5f7edcceacbd3b4737c6fcbf32b4c7163dbc27cf9876c68","target":"graph","created_at":"2026-05-18T00:58:43Z","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":"The problem of designing policies for in-network function computation with minimum energy consumption subject to a latency constraint is considered. The scaling behavior of the energy consumption under the latency constraint is analyzed for random networks, where the nodes are uniformly placed in growing regions and the number of nodes goes to infinity. The special case of sum function computation and its delivery to a designated root node is considered first. A policy which achieves order-optimal average energy consumption in random networks subject to the given latency constraint is proposed","authors_text":"Alan Willsky, Animashree Anandkumar, B\\'ela Bollob\\'as, Paul Balister","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-01-05T00:37:48Z","title":"Energy-Latency Tradeoff for In-Network Function Computation in Random Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.0858","kind":"arxiv","version":2},"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:2d833dd975197dc891c048dc997b6e481688f7d3110fb3d16a68e756ad0cfe1e","target":"record","created_at":"2026-05-18T00:58:43Z","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":"96078226f97bdfca1a614fc42a35433034ba1f93f256c4afb8b7cc958d55a592","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-01-05T00:37:48Z","title_canon_sha256":"1979b7efb5ee22bc33e349bfb262f677b9b435680c286432ddd305f7a510008c"},"schema_version":"1.0","source":{"id":"1101.0858","kind":"arxiv","version":2}},"canonical_sha256":"0589d9cd7d7d7c4f8eb857b6cb75c1fca8c5069be3515ae7b81dd9507efd0816","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0589d9cd7d7d7c4f8eb857b6cb75c1fca8c5069be3515ae7b81dd9507efd0816","first_computed_at":"2026-05-18T00:58:43.744307Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:43.744307Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VVcTYWEhyV43p+EEqQnPlIum34EX614OeeBO6uVRwqAn/bA7e07gsNe/ISnpywLe54Z09wAM9Sw7l7d2AC3JAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:43.744803Z","signed_message":"canonical_sha256_bytes"},"source_id":"1101.0858","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2d833dd975197dc891c048dc997b6e481688f7d3110fb3d16a68e756ad0cfe1e","sha256:616c6477623b9810b5f7edcceacbd3b4737c6fcbf32b4c7163dbc27cf9876c68"],"state_sha256":"02af2220c44a3605cc7d47c19e54dd7cbc250dc7b5a26080694cad9a8963bf78"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R6W+Gu0FDuc1uSTgJ2j2ur+3I22WZiHcAXLlXnVMmieI/+Hw8sBRuKUjq1yykp8kh6XctbmnywI0O46SPAcWBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T18:45:34.885129Z","bundle_sha256":"3b38d36514c632c04faec8c8af63be436e780968cf86ebbdf745a652de107b08"}}