{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:BMWJW3WIRLJFASSOM6XO272ZZ4","short_pith_number":"pith:BMWJW3WI","canonical_record":{"source":{"id":"1212.5288","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-12-20T22:28:43Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3fcbfe850e455db62ae4d7ff6edbc9b10be4534356c5ee401f2f617084dbe3c5","abstract_canon_sha256":"c0e456d5bebe41d4f35e008a1c4a260ad0346f082e0f0cb5bf59536381c39b15"},"schema_version":"1.0"},"canonical_sha256":"0b2c9b6ec88ad2504a4e67aeed7f59cf200a96c11009abf2fa60bf7ce57511c7","source":{"kind":"arxiv","id":"1212.5288","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.5288","created_at":"2026-05-18T03:38:02Z"},{"alias_kind":"arxiv_version","alias_value":"1212.5288v1","created_at":"2026-05-18T03:38:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.5288","created_at":"2026-05-18T03:38:02Z"},{"alias_kind":"pith_short_12","alias_value":"BMWJW3WIRLJF","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"BMWJW3WIRLJFASSO","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"BMWJW3WI","created_at":"2026-05-18T12:27:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:BMWJW3WIRLJFASSOM6XO272ZZ4","target":"record","payload":{"canonical_record":{"source":{"id":"1212.5288","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-12-20T22:28:43Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3fcbfe850e455db62ae4d7ff6edbc9b10be4534356c5ee401f2f617084dbe3c5","abstract_canon_sha256":"c0e456d5bebe41d4f35e008a1c4a260ad0346f082e0f0cb5bf59536381c39b15"},"schema_version":"1.0"},"canonical_sha256":"0b2c9b6ec88ad2504a4e67aeed7f59cf200a96c11009abf2fa60bf7ce57511c7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:38:02.263852Z","signature_b64":"vsv2cRqydvRFwLMpqa/h45Ll+x35cGJdrd2cNpR0Lq0cxIdQfflAYxzgZEYLUysh4Mnostl0i52eVZmO9640CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0b2c9b6ec88ad2504a4e67aeed7f59cf200a96c11009abf2fa60bf7ce57511c7","last_reissued_at":"2026-05-18T03:38:02.263196Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:38:02.263196Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1212.5288","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-18T03:38:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AOsVNXqxQ0woBodF6HsHIatyB2FQcnBxgNQHi2N6VVCewkxixpEopL0oityx02h1EWGOUEBJCWwGefvlR0pQBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T06:56:41.460587Z"},"content_sha256":"f759e6385e23f6b0ba484ba65d94d22f035a63cbc85214a51f14bc2e69a297da","schema_version":"1.0","event_id":"sha256:f759e6385e23f6b0ba484ba65d94d22f035a63cbc85214a51f14bc2e69a297da"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:BMWJW3WIRLJFASSOM6XO272ZZ4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quantized Network Coding for Correlated Sources","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Fabrice Labeau, Mahdy Nabaee","submitted_at":"2012-12-20T22:28:43Z","abstract_excerpt":"Non-adaptive joint source network coding of correlated sources is discussed in this paper. By studying the information flow in the network, we propose quantized network coding as an alternative for packet forwarding. This technique has both network coding and distributed source coding advantages, simultaneously. Quantized network coding is a combination of random linear network coding in the (infinite) field of real numbers and quantization to cope with the limited capacity of links. With the aid of the results in the literature of compressed sensing, we discuss theoretical and practical feasi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.5288","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-18T03:38:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3cIv2cCVADAKp4xitChtHOq+EuDGBJxOaasvqTg10MtqwozCC8g2ed5RC2eA2L+j/niggqSmg18lwnQhtcRUDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T06:56:41.460964Z"},"content_sha256":"8a7c54bf49405d3e789e8d5eae1097013b39d468635a6af74e2112a23126212d","schema_version":"1.0","event_id":"sha256:8a7c54bf49405d3e789e8d5eae1097013b39d468635a6af74e2112a23126212d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BMWJW3WIRLJFASSOM6XO272ZZ4/bundle.json","state_url":"https://pith.science/pith/BMWJW3WIRLJFASSOM6XO272ZZ4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BMWJW3WIRLJFASSOM6XO272ZZ4/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-12T06:56:41Z","links":{"resolver":"https://pith.science/pith/BMWJW3WIRLJFASSOM6XO272ZZ4","bundle":"https://pith.science/pith/BMWJW3WIRLJFASSOM6XO272ZZ4/bundle.json","state":"https://pith.science/pith/BMWJW3WIRLJFASSOM6XO272ZZ4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BMWJW3WIRLJFASSOM6XO272ZZ4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:BMWJW3WIRLJFASSOM6XO272ZZ4","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":"c0e456d5bebe41d4f35e008a1c4a260ad0346f082e0f0cb5bf59536381c39b15","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-12-20T22:28:43Z","title_canon_sha256":"3fcbfe850e455db62ae4d7ff6edbc9b10be4534356c5ee401f2f617084dbe3c5"},"schema_version":"1.0","source":{"id":"1212.5288","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.5288","created_at":"2026-05-18T03:38:02Z"},{"alias_kind":"arxiv_version","alias_value":"1212.5288v1","created_at":"2026-05-18T03:38:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.5288","created_at":"2026-05-18T03:38:02Z"},{"alias_kind":"pith_short_12","alias_value":"BMWJW3WIRLJF","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"BMWJW3WIRLJFASSO","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"BMWJW3WI","created_at":"2026-05-18T12:27:01Z"}],"graph_snapshots":[{"event_id":"sha256:8a7c54bf49405d3e789e8d5eae1097013b39d468635a6af74e2112a23126212d","target":"graph","created_at":"2026-05-18T03:38:02Z","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":"Non-adaptive joint source network coding of correlated sources is discussed in this paper. By studying the information flow in the network, we propose quantized network coding as an alternative for packet forwarding. This technique has both network coding and distributed source coding advantages, simultaneously. Quantized network coding is a combination of random linear network coding in the (infinite) field of real numbers and quantization to cope with the limited capacity of links. With the aid of the results in the literature of compressed sensing, we discuss theoretical and practical feasi","authors_text":"Fabrice Labeau, Mahdy Nabaee","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-12-20T22:28:43Z","title":"Quantized Network Coding for Correlated Sources"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.5288","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:f759e6385e23f6b0ba484ba65d94d22f035a63cbc85214a51f14bc2e69a297da","target":"record","created_at":"2026-05-18T03:38:02Z","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":"c0e456d5bebe41d4f35e008a1c4a260ad0346f082e0f0cb5bf59536381c39b15","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-12-20T22:28:43Z","title_canon_sha256":"3fcbfe850e455db62ae4d7ff6edbc9b10be4534356c5ee401f2f617084dbe3c5"},"schema_version":"1.0","source":{"id":"1212.5288","kind":"arxiv","version":1}},"canonical_sha256":"0b2c9b6ec88ad2504a4e67aeed7f59cf200a96c11009abf2fa60bf7ce57511c7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0b2c9b6ec88ad2504a4e67aeed7f59cf200a96c11009abf2fa60bf7ce57511c7","first_computed_at":"2026-05-18T03:38:02.263196Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:38:02.263196Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vsv2cRqydvRFwLMpqa/h45Ll+x35cGJdrd2cNpR0Lq0cxIdQfflAYxzgZEYLUysh4Mnostl0i52eVZmO9640CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:38:02.263852Z","signed_message":"canonical_sha256_bytes"},"source_id":"1212.5288","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f759e6385e23f6b0ba484ba65d94d22f035a63cbc85214a51f14bc2e69a297da","sha256:8a7c54bf49405d3e789e8d5eae1097013b39d468635a6af74e2112a23126212d"],"state_sha256":"d034cff34f26f219e9f5b57018029e2754063b479e83802fcd4ff52da22a98be"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KnLBfQ2V96LlqL0oLRjXsfEkZNn87acRlI+H5IThSof74IrpeHSwRGRfzqncoD0qW9OcX9fTYPPKf+dz+rVGAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T06:56:41.463922Z","bundle_sha256":"f5aabff8e08c2e733804377e01630db7136fb69cc7ff7fed8e45f9ba6d5c9f2c"}}