{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:JWXPP4ZM4EKJOTGBUAKHORHISY","short_pith_number":"pith:JWXPP4ZM","canonical_record":{"source":{"id":"1209.1679","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-09-08T01:51:26Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"741362fe096427b685ae759457b7f792f3f26f882d2f23d65963a52aab400d0f","abstract_canon_sha256":"f66a5c4706b9408583758dc415a9ab42623c51c7f56fb39783bfa812f1b80ac6"},"schema_version":"1.0"},"canonical_sha256":"4daef7f32ce114974cc1a0147744e896065220e0b100a9fc1e835dd2b240536c","source":{"kind":"arxiv","id":"1209.1679","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.1679","created_at":"2026-05-18T03:44:13Z"},{"alias_kind":"arxiv_version","alias_value":"1209.1679v3","created_at":"2026-05-18T03:44:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.1679","created_at":"2026-05-18T03:44:13Z"},{"alias_kind":"pith_short_12","alias_value":"JWXPP4ZM4EKJ","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"JWXPP4ZM4EKJOTGB","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"JWXPP4ZM","created_at":"2026-05-18T12:27:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:JWXPP4ZM4EKJOTGBUAKHORHISY","target":"record","payload":{"canonical_record":{"source":{"id":"1209.1679","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-09-08T01:51:26Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"741362fe096427b685ae759457b7f792f3f26f882d2f23d65963a52aab400d0f","abstract_canon_sha256":"f66a5c4706b9408583758dc415a9ab42623c51c7f56fb39783bfa812f1b80ac6"},"schema_version":"1.0"},"canonical_sha256":"4daef7f32ce114974cc1a0147744e896065220e0b100a9fc1e835dd2b240536c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:44:13.388995Z","signature_b64":"HiTieyyXlK/6qCjRc8wf1b2MEgwXzeBhLmrVctRHKPezCcf4FByp+ley2K6Car77f9sX+VLcY5MsFbtY/Xc6Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4daef7f32ce114974cc1a0147744e896065220e0b100a9fc1e835dd2b240536c","last_reissued_at":"2026-05-18T03:44:13.388402Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:44:13.388402Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1209.1679","source_version":3,"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:44:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eTF9pk91IgFd7GB+s7u5UR+C41Uj6xZgj8Iw+fTraRTmQjc2lhCe5+2zTU82zSPIYHTCp4Iz0ZMQX56/8R6rBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T07:56:06.342894Z"},"content_sha256":"d868fb9471cc0f6751b14754aa8e0c796c6e76cb4d4f1ece26c7df0dc7cb3614","schema_version":"1.0","event_id":"sha256:d868fb9471cc0f6751b14754aa8e0c796c6e76cb4d4f1ece26c7df0dc7cb3614"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:JWXPP4ZM4EKJOTGBUAKHORHISY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bayesian Quantized Network Coding via Belief Propagation","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-09-08T01:51:26Z","abstract_excerpt":"In this paper, we propose an alternative for routing based packet forwarding, which uses network coding to increase transmission efficiency, in terms of both compression and error resilience. This non-adaptive encoding is called quantized network coding, which involves random linear mapping in the real field, followed by quantization to cope with the finite capacity of the links. At the gateway node, which collects received quantized network coder packets, minimum mean squared error decoding is performed, by using belief propagation in the factor graph representation. Our simulation results sh"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.1679","kind":"arxiv","version":3},"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:44:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lvI+a8d+U8IG1M038hj8cvqqLanVPPfnUmy75TBJFcTSz+aSytYsjzrQp+xmAwDUMFiPhAjqohHffM3DNhivCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T07:56:06.343243Z"},"content_sha256":"ce9218a462155f31687d8be0cf079e3f3889e7c90d8d7ed3dd09c8a94fe67388","schema_version":"1.0","event_id":"sha256:ce9218a462155f31687d8be0cf079e3f3889e7c90d8d7ed3dd09c8a94fe67388"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JWXPP4ZM4EKJOTGBUAKHORHISY/bundle.json","state_url":"https://pith.science/pith/JWXPP4ZM4EKJOTGBUAKHORHISY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JWXPP4ZM4EKJOTGBUAKHORHISY/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-27T07:56:06Z","links":{"resolver":"https://pith.science/pith/JWXPP4ZM4EKJOTGBUAKHORHISY","bundle":"https://pith.science/pith/JWXPP4ZM4EKJOTGBUAKHORHISY/bundle.json","state":"https://pith.science/pith/JWXPP4ZM4EKJOTGBUAKHORHISY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JWXPP4ZM4EKJOTGBUAKHORHISY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:JWXPP4ZM4EKJOTGBUAKHORHISY","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":"f66a5c4706b9408583758dc415a9ab42623c51c7f56fb39783bfa812f1b80ac6","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-09-08T01:51:26Z","title_canon_sha256":"741362fe096427b685ae759457b7f792f3f26f882d2f23d65963a52aab400d0f"},"schema_version":"1.0","source":{"id":"1209.1679","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.1679","created_at":"2026-05-18T03:44:13Z"},{"alias_kind":"arxiv_version","alias_value":"1209.1679v3","created_at":"2026-05-18T03:44:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.1679","created_at":"2026-05-18T03:44:13Z"},{"alias_kind":"pith_short_12","alias_value":"JWXPP4ZM4EKJ","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"JWXPP4ZM4EKJOTGB","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"JWXPP4ZM","created_at":"2026-05-18T12:27:11Z"}],"graph_snapshots":[{"event_id":"sha256:ce9218a462155f31687d8be0cf079e3f3889e7c90d8d7ed3dd09c8a94fe67388","target":"graph","created_at":"2026-05-18T03:44:13Z","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 propose an alternative for routing based packet forwarding, which uses network coding to increase transmission efficiency, in terms of both compression and error resilience. This non-adaptive encoding is called quantized network coding, which involves random linear mapping in the real field, followed by quantization to cope with the finite capacity of the links. At the gateway node, which collects received quantized network coder packets, minimum mean squared error decoding is performed, by using belief propagation in the factor graph representation. Our simulation results sh","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-09-08T01:51:26Z","title":"Bayesian Quantized Network Coding via Belief Propagation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.1679","kind":"arxiv","version":3},"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:d868fb9471cc0f6751b14754aa8e0c796c6e76cb4d4f1ece26c7df0dc7cb3614","target":"record","created_at":"2026-05-18T03:44:13Z","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":"f66a5c4706b9408583758dc415a9ab42623c51c7f56fb39783bfa812f1b80ac6","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-09-08T01:51:26Z","title_canon_sha256":"741362fe096427b685ae759457b7f792f3f26f882d2f23d65963a52aab400d0f"},"schema_version":"1.0","source":{"id":"1209.1679","kind":"arxiv","version":3}},"canonical_sha256":"4daef7f32ce114974cc1a0147744e896065220e0b100a9fc1e835dd2b240536c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4daef7f32ce114974cc1a0147744e896065220e0b100a9fc1e835dd2b240536c","first_computed_at":"2026-05-18T03:44:13.388402Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:44:13.388402Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HiTieyyXlK/6qCjRc8wf1b2MEgwXzeBhLmrVctRHKPezCcf4FByp+ley2K6Car77f9sX+VLcY5MsFbtY/Xc6Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:44:13.388995Z","signed_message":"canonical_sha256_bytes"},"source_id":"1209.1679","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d868fb9471cc0f6751b14754aa8e0c796c6e76cb4d4f1ece26c7df0dc7cb3614","sha256:ce9218a462155f31687d8be0cf079e3f3889e7c90d8d7ed3dd09c8a94fe67388"],"state_sha256":"e8e5dc1ad8fbb65957eb449fcb438ca1b81c5f2746d5126497fd600bbd5e5f1e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dMxKiH+4jp9lTzb1KLJ1vvoM14gG96wAyn1RHjs6ZxXFePAKwsph1U8Y9JTurhwLW63mULYGrzLCC8JJMPAsDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T07:56:06.345460Z","bundle_sha256":"7a24125d2fde101d6ed6cd5fa9841667d1ccb86d2a9ea2cf6b99ad2e54d7bc21"}}