{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:BL7WXZ3LZXOEWGBWHHCFJQZPHO","short_pith_number":"pith:BL7WXZ3L","canonical_record":{"source":{"id":"1111.5735","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-11-24T11:53:27Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"09ae84fc06ec731800bdb1a495042f59b9fed25ed38540ade8ba6d3bbca183ca","abstract_canon_sha256":"9d18227725cc13aea546d9bbb40defac0ef3791da1b439548ca4443fff923193"},"schema_version":"1.0"},"canonical_sha256":"0aff6be76bcddc4b183639c454c32f3bb9bed14df1a59361b80929ee746f2bbf","source":{"kind":"arxiv","id":"1111.5735","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.5735","created_at":"2026-05-18T04:07:42Z"},{"alias_kind":"arxiv_version","alias_value":"1111.5735v1","created_at":"2026-05-18T04:07:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.5735","created_at":"2026-05-18T04:07:42Z"},{"alias_kind":"pith_short_12","alias_value":"BL7WXZ3LZXOE","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"BL7WXZ3LZXOEWGBW","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"BL7WXZ3L","created_at":"2026-05-18T12:26:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:BL7WXZ3LZXOEWGBWHHCFJQZPHO","target":"record","payload":{"canonical_record":{"source":{"id":"1111.5735","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-11-24T11:53:27Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"09ae84fc06ec731800bdb1a495042f59b9fed25ed38540ade8ba6d3bbca183ca","abstract_canon_sha256":"9d18227725cc13aea546d9bbb40defac0ef3791da1b439548ca4443fff923193"},"schema_version":"1.0"},"canonical_sha256":"0aff6be76bcddc4b183639c454c32f3bb9bed14df1a59361b80929ee746f2bbf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:07:42.450764Z","signature_b64":"xBc3CCaZY38I1U0yYsKRbj+KdNYP7ZHr+8j4amyDHGX4z87+Rlf3zojjqIrP5kDPY6m9mtgXFHRWkCu+HwHmAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0aff6be76bcddc4b183639c454c32f3bb9bed14df1a59361b80929ee746f2bbf","last_reissued_at":"2026-05-18T04:07:42.450155Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:07:42.450155Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1111.5735","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:07:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"It5rJngjfJ17KnVgU1RqCZK449EXyNdidkAoF2TSt4vb7H554HMSkuVs/O/lloP+kQUYm1U0VH7Iq07PsBXsDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T08:51:08.141994Z"},"content_sha256":"baea44050d09ab97893dda9b6d3d9e273e328a9f53809c63b55767591e995c9c","schema_version":"1.0","event_id":"sha256:baea44050d09ab97893dda9b6d3d9e273e328a9f53809c63b55767591e995c9c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:BL7WXZ3LZXOEWGBWHHCFJQZPHO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Joint Network-Source Coding for Multiple Terminals with Side Information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Asaf Cohen, Chen Avin, Michael Borokhovich, Zvi Lotker","submitted_at":"2011-11-24T11:53:27Z","abstract_excerpt":"Consider the problem of source coding in networks with multiple receiving terminals, each having access to some kind of side information. In this case, standard coding techniques are either prohibitively complex to decode, or require network-source coding separation, resulting in sub-optimal transmission rates. To alleviate this problem, we offer a joint network-source coding scheme based on matrix sparsification at the code design phase, which allows the terminals to use an efficient decoding procedure (syndrome decoding using LDPC), despite the network coding throughout the network. Via a no"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.5735","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:07:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LVx8qefC6jt/GIz9NqgA10smyYIyFd+/m/2EDYhsh3zDwryO4+ykmduJjSana81rgfWj4HwCngNXVSo+kF7UAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T08:51:08.142457Z"},"content_sha256":"7ef47cac2c871f8da2fe2bcd73e256e780345344ec6a88ac7bccf846e60a8cb1","schema_version":"1.0","event_id":"sha256:7ef47cac2c871f8da2fe2bcd73e256e780345344ec6a88ac7bccf846e60a8cb1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BL7WXZ3LZXOEWGBWHHCFJQZPHO/bundle.json","state_url":"https://pith.science/pith/BL7WXZ3LZXOEWGBWHHCFJQZPHO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BL7WXZ3LZXOEWGBWHHCFJQZPHO/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-26T08:51:08Z","links":{"resolver":"https://pith.science/pith/BL7WXZ3LZXOEWGBWHHCFJQZPHO","bundle":"https://pith.science/pith/BL7WXZ3LZXOEWGBWHHCFJQZPHO/bundle.json","state":"https://pith.science/pith/BL7WXZ3LZXOEWGBWHHCFJQZPHO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BL7WXZ3LZXOEWGBWHHCFJQZPHO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:BL7WXZ3LZXOEWGBWHHCFJQZPHO","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":"9d18227725cc13aea546d9bbb40defac0ef3791da1b439548ca4443fff923193","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-11-24T11:53:27Z","title_canon_sha256":"09ae84fc06ec731800bdb1a495042f59b9fed25ed38540ade8ba6d3bbca183ca"},"schema_version":"1.0","source":{"id":"1111.5735","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.5735","created_at":"2026-05-18T04:07:42Z"},{"alias_kind":"arxiv_version","alias_value":"1111.5735v1","created_at":"2026-05-18T04:07:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.5735","created_at":"2026-05-18T04:07:42Z"},{"alias_kind":"pith_short_12","alias_value":"BL7WXZ3LZXOE","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"BL7WXZ3LZXOEWGBW","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"BL7WXZ3L","created_at":"2026-05-18T12:26:24Z"}],"graph_snapshots":[{"event_id":"sha256:7ef47cac2c871f8da2fe2bcd73e256e780345344ec6a88ac7bccf846e60a8cb1","target":"graph","created_at":"2026-05-18T04:07:42Z","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":"Consider the problem of source coding in networks with multiple receiving terminals, each having access to some kind of side information. In this case, standard coding techniques are either prohibitively complex to decode, or require network-source coding separation, resulting in sub-optimal transmission rates. To alleviate this problem, we offer a joint network-source coding scheme based on matrix sparsification at the code design phase, which allows the terminals to use an efficient decoding procedure (syndrome decoding using LDPC), despite the network coding throughout the network. Via a no","authors_text":"Asaf Cohen, Chen Avin, Michael Borokhovich, Zvi Lotker","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-11-24T11:53:27Z","title":"Efficient Joint Network-Source Coding for Multiple Terminals with Side Information"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.5735","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:baea44050d09ab97893dda9b6d3d9e273e328a9f53809c63b55767591e995c9c","target":"record","created_at":"2026-05-18T04:07:42Z","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":"9d18227725cc13aea546d9bbb40defac0ef3791da1b439548ca4443fff923193","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-11-24T11:53:27Z","title_canon_sha256":"09ae84fc06ec731800bdb1a495042f59b9fed25ed38540ade8ba6d3bbca183ca"},"schema_version":"1.0","source":{"id":"1111.5735","kind":"arxiv","version":1}},"canonical_sha256":"0aff6be76bcddc4b183639c454c32f3bb9bed14df1a59361b80929ee746f2bbf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0aff6be76bcddc4b183639c454c32f3bb9bed14df1a59361b80929ee746f2bbf","first_computed_at":"2026-05-18T04:07:42.450155Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:07:42.450155Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xBc3CCaZY38I1U0yYsKRbj+KdNYP7ZHr+8j4amyDHGX4z87+Rlf3zojjqIrP5kDPY6m9mtgXFHRWkCu+HwHmAA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:07:42.450764Z","signed_message":"canonical_sha256_bytes"},"source_id":"1111.5735","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:baea44050d09ab97893dda9b6d3d9e273e328a9f53809c63b55767591e995c9c","sha256:7ef47cac2c871f8da2fe2bcd73e256e780345344ec6a88ac7bccf846e60a8cb1"],"state_sha256":"27f018d804cc8b4a4407a36d48ee1955d3ee92032166977bce6d9584b0bd4ee1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PvCkOVepvvrhuz09ZQiD6TUu4JzxtJURAeRSpS3n9UxahePhgh6y9M/TSU/PQG8ZVIbfD7w7j7PqBSKptiTMCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T08:51:08.145881Z","bundle_sha256":"1797e029d595d05c2aaef599c65e7c2f94d3ab5085951d4485951d0579c0403e"}}