{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:XNGLXS4GYQCH5WRESZENOT56XE","short_pith_number":"pith:XNGLXS4G","canonical_record":{"source":{"id":"1011.5496","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-11-24T20:53:43Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"53e037b75fa81c8e631980804113a92a07d32803eec0e0d07667c3a5260cc76d","abstract_canon_sha256":"f794c21cafb0dd34001d3de0a57042149736f61ab887302f06d8b7f34262c2a5"},"schema_version":"1.0"},"canonical_sha256":"bb4cbbcb86c4047eda249648d74fbeb9086a1cf094d8ff2aeb4d8335d44be205","source":{"kind":"arxiv","id":"1011.5496","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.5496","created_at":"2026-05-18T04:34:27Z"},{"alias_kind":"arxiv_version","alias_value":"1011.5496v2","created_at":"2026-05-18T04:34:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.5496","created_at":"2026-05-18T04:34:27Z"},{"alias_kind":"pith_short_12","alias_value":"XNGLXS4GYQCH","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_16","alias_value":"XNGLXS4GYQCH5WRE","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_8","alias_value":"XNGLXS4G","created_at":"2026-05-18T12:26:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:XNGLXS4GYQCH5WRESZENOT56XE","target":"record","payload":{"canonical_record":{"source":{"id":"1011.5496","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-11-24T20:53:43Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"53e037b75fa81c8e631980804113a92a07d32803eec0e0d07667c3a5260cc76d","abstract_canon_sha256":"f794c21cafb0dd34001d3de0a57042149736f61ab887302f06d8b7f34262c2a5"},"schema_version":"1.0"},"canonical_sha256":"bb4cbbcb86c4047eda249648d74fbeb9086a1cf094d8ff2aeb4d8335d44be205","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:34:27.088696Z","signature_b64":"PJZDcPqDf280C0TMjdc5PIBUVIWGmXT/uysTJw+1p3Fu9owLumSzseRVQ1Orf46PmjgOu5duEWpmJLgX4ueeBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bb4cbbcb86c4047eda249648d74fbeb9086a1cf094d8ff2aeb4d8335d44be205","last_reissued_at":"2026-05-18T04:34:27.088266Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:34:27.088266Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1011.5496","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-18T04:34:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bDhBxr3Rm7nRraULvN5PU1QmjuFKSAh6/Js4YFhuWlg2w8FpnH2q8ObY/PZxEmHzuKouaK2bexG0ZgOeV7jYDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T21:40:18.122500Z"},"content_sha256":"be15c4dd10dadc4c0dae002ec179bfe49fbeaf890888f174418a3a7dfd8a5534","schema_version":"1.0","event_id":"sha256:be15c4dd10dadc4c0dae002ec179bfe49fbeaf890888f174418a3a7dfd8a5534"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:XNGLXS4GYQCH5WRESZENOT56XE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Network Functional Compression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Muriel Medard, Soheil Feizi","submitted_at":"2010-11-24T20:53:43Z","abstract_excerpt":"In this paper, we consider different aspects of the network functional compression problem where computation of a function (or, some functions) of sources located at certain nodes in a network is desired at receiver(s). The rate region of this problem has been considered in the literature under certain restrictive assumptions, particularly in terms of the network topology, the functions and the characteristics of the sources. In this paper, we present results that significantly relax these assumptions. Firstly, we consider this problem for an arbitrary tree network and asymptotically lossless "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.5496","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-18T04:34:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q/RatQaS5d4H8pAnDjnqRiTLjcvyRFUBTXyFPYRzaBQcxkJ/1FZfSKnIB5WSdmGt9+AsQXQYVLTElWbmKqDqAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T21:40:18.122955Z"},"content_sha256":"4d303d543b93e5bbed3c18ec0a323ab557f0758631e7f14275ad4f5faef72f54","schema_version":"1.0","event_id":"sha256:4d303d543b93e5bbed3c18ec0a323ab557f0758631e7f14275ad4f5faef72f54"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XNGLXS4GYQCH5WRESZENOT56XE/bundle.json","state_url":"https://pith.science/pith/XNGLXS4GYQCH5WRESZENOT56XE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XNGLXS4GYQCH5WRESZENOT56XE/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-05-24T21:40:18Z","links":{"resolver":"https://pith.science/pith/XNGLXS4GYQCH5WRESZENOT56XE","bundle":"https://pith.science/pith/XNGLXS4GYQCH5WRESZENOT56XE/bundle.json","state":"https://pith.science/pith/XNGLXS4GYQCH5WRESZENOT56XE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XNGLXS4GYQCH5WRESZENOT56XE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:XNGLXS4GYQCH5WRESZENOT56XE","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":"f794c21cafb0dd34001d3de0a57042149736f61ab887302f06d8b7f34262c2a5","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-11-24T20:53:43Z","title_canon_sha256":"53e037b75fa81c8e631980804113a92a07d32803eec0e0d07667c3a5260cc76d"},"schema_version":"1.0","source":{"id":"1011.5496","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.5496","created_at":"2026-05-18T04:34:27Z"},{"alias_kind":"arxiv_version","alias_value":"1011.5496v2","created_at":"2026-05-18T04:34:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.5496","created_at":"2026-05-18T04:34:27Z"},{"alias_kind":"pith_short_12","alias_value":"XNGLXS4GYQCH","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_16","alias_value":"XNGLXS4GYQCH5WRE","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_8","alias_value":"XNGLXS4G","created_at":"2026-05-18T12:26:17Z"}],"graph_snapshots":[{"event_id":"sha256:4d303d543b93e5bbed3c18ec0a323ab557f0758631e7f14275ad4f5faef72f54","target":"graph","created_at":"2026-05-18T04:34:27Z","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":"In this paper, we consider different aspects of the network functional compression problem where computation of a function (or, some functions) of sources located at certain nodes in a network is desired at receiver(s). The rate region of this problem has been considered in the literature under certain restrictive assumptions, particularly in terms of the network topology, the functions and the characteristics of the sources. In this paper, we present results that significantly relax these assumptions. Firstly, we consider this problem for an arbitrary tree network and asymptotically lossless ","authors_text":"Muriel Medard, Soheil Feizi","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-11-24T20:53:43Z","title":"On Network Functional Compression"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.5496","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:be15c4dd10dadc4c0dae002ec179bfe49fbeaf890888f174418a3a7dfd8a5534","target":"record","created_at":"2026-05-18T04:34:27Z","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":"f794c21cafb0dd34001d3de0a57042149736f61ab887302f06d8b7f34262c2a5","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-11-24T20:53:43Z","title_canon_sha256":"53e037b75fa81c8e631980804113a92a07d32803eec0e0d07667c3a5260cc76d"},"schema_version":"1.0","source":{"id":"1011.5496","kind":"arxiv","version":2}},"canonical_sha256":"bb4cbbcb86c4047eda249648d74fbeb9086a1cf094d8ff2aeb4d8335d44be205","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bb4cbbcb86c4047eda249648d74fbeb9086a1cf094d8ff2aeb4d8335d44be205","first_computed_at":"2026-05-18T04:34:27.088266Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:34:27.088266Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PJZDcPqDf280C0TMjdc5PIBUVIWGmXT/uysTJw+1p3Fu9owLumSzseRVQ1Orf46PmjgOu5duEWpmJLgX4ueeBw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:34:27.088696Z","signed_message":"canonical_sha256_bytes"},"source_id":"1011.5496","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:be15c4dd10dadc4c0dae002ec179bfe49fbeaf890888f174418a3a7dfd8a5534","sha256:4d303d543b93e5bbed3c18ec0a323ab557f0758631e7f14275ad4f5faef72f54"],"state_sha256":"1a230e51a4ad62250602de296af4ca9d20e07d20f3840f7016071d3cd0bf4e1d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M4N0mc0DVIamHcUBvqqYvRO0eVK8y3P9JxUR40UBzewdhHHvadzY67Lm1eIMX8nGF5+U6WKtSUeUXlu04LD2Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T21:40:18.126349Z","bundle_sha256":"efe5caa081568a4aac88ac140d9e3e1da7b2e40142761dba3c4c2f8b30af980e"}}