{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:WWPMREZV2LBO5OK2SCYU7D5OYC","short_pith_number":"pith:WWPMREZV","canonical_record":{"source":{"id":"1009.6057","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2010-09-30T08:01:57Z","cross_cats_sorted":["cs.DC","cs.IT","math.IT"],"title_canon_sha256":"405c900883b1756fc7e461b465cc9d4e38c78f266b61640dfa529daaeb918304","abstract_canon_sha256":"8492ab48028f289ceb065ae349a67080776d6f37518fdc53a51d8a87e7af9b8e"},"schema_version":"1.0"},"canonical_sha256":"b59ec89335d2c2eeb95a90b14f8faec0a275d499c62d037077be7943dc4f028a","source":{"kind":"arxiv","id":"1009.6057","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.6057","created_at":"2026-05-18T04:40:01Z"},{"alias_kind":"arxiv_version","alias_value":"1009.6057v1","created_at":"2026-05-18T04:40:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.6057","created_at":"2026-05-18T04:40:01Z"},{"alias_kind":"pith_short_12","alias_value":"WWPMREZV2LBO","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_16","alias_value":"WWPMREZV2LBO5OK2","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_8","alias_value":"WWPMREZV","created_at":"2026-05-18T12:26:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:WWPMREZV2LBO5OK2SCYU7D5OYC","target":"record","payload":{"canonical_record":{"source":{"id":"1009.6057","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2010-09-30T08:01:57Z","cross_cats_sorted":["cs.DC","cs.IT","math.IT"],"title_canon_sha256":"405c900883b1756fc7e461b465cc9d4e38c78f266b61640dfa529daaeb918304","abstract_canon_sha256":"8492ab48028f289ceb065ae349a67080776d6f37518fdc53a51d8a87e7af9b8e"},"schema_version":"1.0"},"canonical_sha256":"b59ec89335d2c2eeb95a90b14f8faec0a275d499c62d037077be7943dc4f028a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:40:01.136498Z","signature_b64":"qZTI/DG4F/dlPnWlT6Vhci3rLzLngrZuTWuWlKZia/I0yHZUUzGAShYeB580qrq+eoMz3bTa0N0IWkTmsrIpBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b59ec89335d2c2eeb95a90b14f8faec0a275d499c62d037077be7943dc4f028a","last_reissued_at":"2026-05-18T04:40:01.136098Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:40:01.136098Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1009.6057","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-18T04:40:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t6staES/Aadb74TvSXI0ie7VgLLOsG21wDcab5ScpkLGzxiHCApUAf/D899MLz+tpPieA/5HLaoo5wpxpKotDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T15:13:10.341264Z"},"content_sha256":"f6ca428adf4741604218c2bcbe5763f169f3050cd36a784bc3536b349226b47c","schema_version":"1.0","event_id":"sha256:f6ca428adf4741604218c2bcbe5763f169f3050cd36a784bc3536b349226b47c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:WWPMREZV2LBO5OK2SCYU7D5OYC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Network Flows for Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.IT","math.IT"],"primary_cat":"cs.NI","authors_text":"Bikash Kumar Dey, D. Manjunath, Virag Shah","submitted_at":"2010-09-30T08:01:57Z","abstract_excerpt":"We consider in-network computation of an arbitrary function over an arbitrary communication network. A network with capacity constraints on the links is given. Some nodes in the network generate data, e.g., like sensor nodes in a sensor network. An arbitrary function of this distributed data is to be obtained at a terminal node. The structure of the function is described by a given computation schema, which in turn is represented by a directed tree. We design computing and communicating schemes to obtain the function at the terminal at the maximum rate. For this, we formulate linear programs t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.6057","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-18T04:40:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"00XpZHJFMa+T9Is9dy5l0jxQLrJ6o+ENtTaurGAdAQvAcPWWtuGOu2ijLjD8u1wTQCE0yfF0dU7mbW2wDFAHDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T15:13:10.341641Z"},"content_sha256":"603468d0f646c366e7c388e13077c3ccec52ba01cb9e43f14d0de6dc422c6849","schema_version":"1.0","event_id":"sha256:603468d0f646c366e7c388e13077c3ccec52ba01cb9e43f14d0de6dc422c6849"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WWPMREZV2LBO5OK2SCYU7D5OYC/bundle.json","state_url":"https://pith.science/pith/WWPMREZV2LBO5OK2SCYU7D5OYC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WWPMREZV2LBO5OK2SCYU7D5OYC/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-24T15:13:10Z","links":{"resolver":"https://pith.science/pith/WWPMREZV2LBO5OK2SCYU7D5OYC","bundle":"https://pith.science/pith/WWPMREZV2LBO5OK2SCYU7D5OYC/bundle.json","state":"https://pith.science/pith/WWPMREZV2LBO5OK2SCYU7D5OYC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WWPMREZV2LBO5OK2SCYU7D5OYC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:WWPMREZV2LBO5OK2SCYU7D5OYC","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":"8492ab48028f289ceb065ae349a67080776d6f37518fdc53a51d8a87e7af9b8e","cross_cats_sorted":["cs.DC","cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2010-09-30T08:01:57Z","title_canon_sha256":"405c900883b1756fc7e461b465cc9d4e38c78f266b61640dfa529daaeb918304"},"schema_version":"1.0","source":{"id":"1009.6057","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.6057","created_at":"2026-05-18T04:40:01Z"},{"alias_kind":"arxiv_version","alias_value":"1009.6057v1","created_at":"2026-05-18T04:40:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.6057","created_at":"2026-05-18T04:40:01Z"},{"alias_kind":"pith_short_12","alias_value":"WWPMREZV2LBO","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_16","alias_value":"WWPMREZV2LBO5OK2","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_8","alias_value":"WWPMREZV","created_at":"2026-05-18T12:26:17Z"}],"graph_snapshots":[{"event_id":"sha256:603468d0f646c366e7c388e13077c3ccec52ba01cb9e43f14d0de6dc422c6849","target":"graph","created_at":"2026-05-18T04:40:01Z","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 consider in-network computation of an arbitrary function over an arbitrary communication network. A network with capacity constraints on the links is given. Some nodes in the network generate data, e.g., like sensor nodes in a sensor network. An arbitrary function of this distributed data is to be obtained at a terminal node. The structure of the function is described by a given computation schema, which in turn is represented by a directed tree. We design computing and communicating schemes to obtain the function at the terminal at the maximum rate. For this, we formulate linear programs t","authors_text":"Bikash Kumar Dey, D. Manjunath, Virag Shah","cross_cats":["cs.DC","cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2010-09-30T08:01:57Z","title":"Network Flows for Functions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.6057","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:f6ca428adf4741604218c2bcbe5763f169f3050cd36a784bc3536b349226b47c","target":"record","created_at":"2026-05-18T04:40:01Z","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":"8492ab48028f289ceb065ae349a67080776d6f37518fdc53a51d8a87e7af9b8e","cross_cats_sorted":["cs.DC","cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2010-09-30T08:01:57Z","title_canon_sha256":"405c900883b1756fc7e461b465cc9d4e38c78f266b61640dfa529daaeb918304"},"schema_version":"1.0","source":{"id":"1009.6057","kind":"arxiv","version":1}},"canonical_sha256":"b59ec89335d2c2eeb95a90b14f8faec0a275d499c62d037077be7943dc4f028a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b59ec89335d2c2eeb95a90b14f8faec0a275d499c62d037077be7943dc4f028a","first_computed_at":"2026-05-18T04:40:01.136098Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:40:01.136098Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qZTI/DG4F/dlPnWlT6Vhci3rLzLngrZuTWuWlKZia/I0yHZUUzGAShYeB580qrq+eoMz3bTa0N0IWkTmsrIpBw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:40:01.136498Z","signed_message":"canonical_sha256_bytes"},"source_id":"1009.6057","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f6ca428adf4741604218c2bcbe5763f169f3050cd36a784bc3536b349226b47c","sha256:603468d0f646c366e7c388e13077c3ccec52ba01cb9e43f14d0de6dc422c6849"],"state_sha256":"e3761a4ab7861d3fbde1e00e2a3b909b8ad1b95569030d8437ac551e61db98af"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WB6EdlClNSG3uf1qYKjzGIlGdw6uwXi1t5rge7z1T+B3woKPpoYGXz3/16fgClg5nYIl63kpMoC+eGnczvIPDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T15:13:10.343649Z","bundle_sha256":"20b1329927194b4b88aca70a105151802ce39a65fa0d3e745eaf039a1f111691"}}