{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:KDQLK6DOYJE5STHRXWB24GHF2R","short_pith_number":"pith:KDQLK6DO","canonical_record":{"source":{"id":"1209.4679","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-09-20T22:39:09Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"903c0df639e806c0bc7d3b9862667a67632c1a91fd6e2a30b1a5d56fb22d96e5","abstract_canon_sha256":"844a2f02c734002953f44af97c6cde535027903129491fece565ec16434cea47"},"schema_version":"1.0"},"canonical_sha256":"50e0b5786ec249d94cf1bd83ae18e5d44a46b8585bd4eeb81d572dbf71104052","source":{"kind":"arxiv","id":"1209.4679","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.4679","created_at":"2026-05-18T03:42:23Z"},{"alias_kind":"arxiv_version","alias_value":"1209.4679v1","created_at":"2026-05-18T03:42:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.4679","created_at":"2026-05-18T03:42:23Z"},{"alias_kind":"pith_short_12","alias_value":"KDQLK6DOYJE5","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"KDQLK6DOYJE5STHR","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"KDQLK6DO","created_at":"2026-05-18T12:27:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:KDQLK6DOYJE5STHRXWB24GHF2R","target":"record","payload":{"canonical_record":{"source":{"id":"1209.4679","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-09-20T22:39:09Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"903c0df639e806c0bc7d3b9862667a67632c1a91fd6e2a30b1a5d56fb22d96e5","abstract_canon_sha256":"844a2f02c734002953f44af97c6cde535027903129491fece565ec16434cea47"},"schema_version":"1.0"},"canonical_sha256":"50e0b5786ec249d94cf1bd83ae18e5d44a46b8585bd4eeb81d572dbf71104052","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:42:23.569197Z","signature_b64":"7bbGgV/Ww4J175G5/C4Di2JgCem2KVyV8kV9AjZP7FyxxkbU4RfP4ohPUPwh68TBRQfntjOqePUNBWWTrY0yDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"50e0b5786ec249d94cf1bd83ae18e5d44a46b8585bd4eeb81d572dbf71104052","last_reissued_at":"2026-05-18T03:42:23.568484Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:42:23.568484Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1209.4679","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:42:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LXLZfzC6QK5SJwwZbR5C18zwmBRTnUFeAwO6rYLCwTzUxpxLU4J0TPxasFpE+5G1O3vuyQp5lmrMb2aj++DaCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T02:16:54.269505Z"},"content_sha256":"fa4ed38c635bc9baaadfa05e057adc5c0cab21f41765b8987260c70dd7f183a0","schema_version":"1.0","event_id":"sha256:fa4ed38c635bc9baaadfa05e057adc5c0cab21f41765b8987260c70dd7f183a0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:KDQLK6DOYJE5STHRXWB24GHF2R","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Coding and System Design for Quantize-Map-and-Forward Relaying","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Borivoje Nikolic, David Tse, I-Hsiang Wang, Milos Jorgovanovic, Vinayak Nagpal","submitted_at":"2012-09-20T22:39:09Z","abstract_excerpt":"In this paper we develop a low-complexity coding scheme and system design framework for the half duplex relay channel based on the Quantize-Map-and-Forward (QMF) relay- ing scheme. The proposed framework allows linear complexity operations at all network terminals. We propose the use of binary LDPC codes for encoding at the source and LDGM codes for mapping at the relay. We express joint decoding at the destination as a belief propagation algorithm over a factor graph. This graph has the LDPC and LDGM codes as subgraphs connected via probabilistic constraints that model the QMF relay operation"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.4679","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:42:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Nb/XUfAafksf8XY9TJb1MLARsZ6oXVi46lAXAY/uzz+YafxmzfK0fBuNT27427os9hgZUxXu8N/k7hi2GY0YBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T02:16:54.269854Z"},"content_sha256":"f746207240c810a057e17abc2c92a1faa5eea90c82dde75d14a3fcb734894d91","schema_version":"1.0","event_id":"sha256:f746207240c810a057e17abc2c92a1faa5eea90c82dde75d14a3fcb734894d91"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KDQLK6DOYJE5STHRXWB24GHF2R/bundle.json","state_url":"https://pith.science/pith/KDQLK6DOYJE5STHRXWB24GHF2R/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KDQLK6DOYJE5STHRXWB24GHF2R/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-28T02:16:54Z","links":{"resolver":"https://pith.science/pith/KDQLK6DOYJE5STHRXWB24GHF2R","bundle":"https://pith.science/pith/KDQLK6DOYJE5STHRXWB24GHF2R/bundle.json","state":"https://pith.science/pith/KDQLK6DOYJE5STHRXWB24GHF2R/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KDQLK6DOYJE5STHRXWB24GHF2R/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:KDQLK6DOYJE5STHRXWB24GHF2R","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":"844a2f02c734002953f44af97c6cde535027903129491fece565ec16434cea47","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-09-20T22:39:09Z","title_canon_sha256":"903c0df639e806c0bc7d3b9862667a67632c1a91fd6e2a30b1a5d56fb22d96e5"},"schema_version":"1.0","source":{"id":"1209.4679","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.4679","created_at":"2026-05-18T03:42:23Z"},{"alias_kind":"arxiv_version","alias_value":"1209.4679v1","created_at":"2026-05-18T03:42:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.4679","created_at":"2026-05-18T03:42:23Z"},{"alias_kind":"pith_short_12","alias_value":"KDQLK6DOYJE5","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"KDQLK6DOYJE5STHR","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"KDQLK6DO","created_at":"2026-05-18T12:27:11Z"}],"graph_snapshots":[{"event_id":"sha256:f746207240c810a057e17abc2c92a1faa5eea90c82dde75d14a3fcb734894d91","target":"graph","created_at":"2026-05-18T03:42:23Z","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 develop a low-complexity coding scheme and system design framework for the half duplex relay channel based on the Quantize-Map-and-Forward (QMF) relay- ing scheme. The proposed framework allows linear complexity operations at all network terminals. We propose the use of binary LDPC codes for encoding at the source and LDGM codes for mapping at the relay. We express joint decoding at the destination as a belief propagation algorithm over a factor graph. This graph has the LDPC and LDGM codes as subgraphs connected via probabilistic constraints that model the QMF relay operation","authors_text":"Borivoje Nikolic, David Tse, I-Hsiang Wang, Milos Jorgovanovic, Vinayak Nagpal","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-09-20T22:39:09Z","title":"Coding and System Design for Quantize-Map-and-Forward Relaying"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.4679","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:fa4ed38c635bc9baaadfa05e057adc5c0cab21f41765b8987260c70dd7f183a0","target":"record","created_at":"2026-05-18T03:42:23Z","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":"844a2f02c734002953f44af97c6cde535027903129491fece565ec16434cea47","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-09-20T22:39:09Z","title_canon_sha256":"903c0df639e806c0bc7d3b9862667a67632c1a91fd6e2a30b1a5d56fb22d96e5"},"schema_version":"1.0","source":{"id":"1209.4679","kind":"arxiv","version":1}},"canonical_sha256":"50e0b5786ec249d94cf1bd83ae18e5d44a46b8585bd4eeb81d572dbf71104052","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"50e0b5786ec249d94cf1bd83ae18e5d44a46b8585bd4eeb81d572dbf71104052","first_computed_at":"2026-05-18T03:42:23.568484Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:42:23.568484Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7bbGgV/Ww4J175G5/C4Di2JgCem2KVyV8kV9AjZP7FyxxkbU4RfP4ohPUPwh68TBRQfntjOqePUNBWWTrY0yDw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:42:23.569197Z","signed_message":"canonical_sha256_bytes"},"source_id":"1209.4679","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fa4ed38c635bc9baaadfa05e057adc5c0cab21f41765b8987260c70dd7f183a0","sha256:f746207240c810a057e17abc2c92a1faa5eea90c82dde75d14a3fcb734894d91"],"state_sha256":"00d22813d0186f729f63df76a968e22cef646915a3642c2f1d66f0785c0bb0cf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lsBrvsR+KRYjgAFREHUh6QGgZM1w51em4PbkZQ2Pz7iPlJtysotIUrG31u/IrOg9vnBiFbreAi8NBJXK7UlPDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T02:16:54.271781Z","bundle_sha256":"38958aa8646d1e924d7aa7a36c4107721482d020a14d3336656dd690c57769b6"}}