{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:NIFE2PRVB6A2IVTWIAE6FKDW6T","short_pith_number":"pith:NIFE2PRV","canonical_record":{"source":{"id":"1712.10293","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2017-12-29T17:57:37Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"08bf02f4273e8cb12779c9bc31bed766d1de65830df7c470b4409940f98e573f","abstract_canon_sha256":"2d74ba73bdcba1d610466dad3b031827c4f0b197df7dac66e48118039001e41e"},"schema_version":"1.0"},"canonical_sha256":"6a0a4d3e350f81a456764009e2a876f4c298b9650cb638fe41fb80987dd58f4f","source":{"kind":"arxiv","id":"1712.10293","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.10293","created_at":"2026-05-18T00:27:03Z"},{"alias_kind":"arxiv_version","alias_value":"1712.10293v1","created_at":"2026-05-18T00:27:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.10293","created_at":"2026-05-18T00:27:03Z"},{"alias_kind":"pith_short_12","alias_value":"NIFE2PRVB6A2","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"NIFE2PRVB6A2IVTW","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"NIFE2PRV","created_at":"2026-05-18T12:31:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:NIFE2PRVB6A2IVTWIAE6FKDW6T","target":"record","payload":{"canonical_record":{"source":{"id":"1712.10293","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2017-12-29T17:57:37Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"08bf02f4273e8cb12779c9bc31bed766d1de65830df7c470b4409940f98e573f","abstract_canon_sha256":"2d74ba73bdcba1d610466dad3b031827c4f0b197df7dac66e48118039001e41e"},"schema_version":"1.0"},"canonical_sha256":"6a0a4d3e350f81a456764009e2a876f4c298b9650cb638fe41fb80987dd58f4f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:03.499823Z","signature_b64":"9tyfjR7hmZsmXzyYwfCiUx+Ii16rsLWn50khkgOvDYaJfcdhp3ZX8p3XeuW5FHIAfu90G8DFskBYFah3MXmlAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6a0a4d3e350f81a456764009e2a876f4c298b9650cb638fe41fb80987dd58f4f","last_reissued_at":"2026-05-18T00:27:03.499358Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:03.499358Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.10293","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-18T00:27:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OY24DaT5i1RUsFms7hXphnI35xORgDWVT1v3Qgo6oaQ2BzzYT3vhRdXtSpgD2FFOYZ4g35UQ0DiNFb2IDg6BAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T01:27:25.183270Z"},"content_sha256":"e1dff599e9c19aeee557e245b7d5b143a1027d58e8521612c8b6e91296e137ec","schema_version":"1.0","event_id":"sha256:e1dff599e9c19aeee557e245b7d5b143a1027d58e8521612c8b6e91296e137ec"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:NIFE2PRVB6A2IVTWIAE6FKDW6T","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Compute--Forward Multiple Access (CFMA): Practical Code Design","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Adriano Pastore, Erixhen Sula, Jingge Zhu, Michael Gastpar, Sung Hoon Lim","submitted_at":"2017-12-29T17:57:37Z","abstract_excerpt":"We present a practical strategy that aims to attain rate points on the dominant face of the multiple access channel capacity using a standard low complexity decoder. This technique is built upon recent theoretical developments of Zhu and Gastpar on compute-forward multiple access (CFMA) which achieves the capacity of the multiple access channel using a sequential decoder. We illustrate this strategy with off-the-shelf LDPC codes. In the first stage of decoding, the receiver first recovers a linear combination of the transmitted codewords using the sum-product algorithm (SPA). In the second sta"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.10293","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-18T00:27:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"odlMer8chOjwywpdQKIf14OIz0aHjnP3eXhuo9JQmXX/K0v7HLKfWNGzLyxrChp9dY4y47ZZ1D3tXoegE3A2Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T01:27:25.183936Z"},"content_sha256":"6bba94ad250e53f42a81d5ba6bbaa07b40eb1b23c5d0bf91f6d15ca98342bf74","schema_version":"1.0","event_id":"sha256:6bba94ad250e53f42a81d5ba6bbaa07b40eb1b23c5d0bf91f6d15ca98342bf74"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NIFE2PRVB6A2IVTWIAE6FKDW6T/bundle.json","state_url":"https://pith.science/pith/NIFE2PRVB6A2IVTWIAE6FKDW6T/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NIFE2PRVB6A2IVTWIAE6FKDW6T/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-25T01:27:25Z","links":{"resolver":"https://pith.science/pith/NIFE2PRVB6A2IVTWIAE6FKDW6T","bundle":"https://pith.science/pith/NIFE2PRVB6A2IVTWIAE6FKDW6T/bundle.json","state":"https://pith.science/pith/NIFE2PRVB6A2IVTWIAE6FKDW6T/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NIFE2PRVB6A2IVTWIAE6FKDW6T/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:NIFE2PRVB6A2IVTWIAE6FKDW6T","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":"2d74ba73bdcba1d610466dad3b031827c4f0b197df7dac66e48118039001e41e","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2017-12-29T17:57:37Z","title_canon_sha256":"08bf02f4273e8cb12779c9bc31bed766d1de65830df7c470b4409940f98e573f"},"schema_version":"1.0","source":{"id":"1712.10293","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.10293","created_at":"2026-05-18T00:27:03Z"},{"alias_kind":"arxiv_version","alias_value":"1712.10293v1","created_at":"2026-05-18T00:27:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.10293","created_at":"2026-05-18T00:27:03Z"},{"alias_kind":"pith_short_12","alias_value":"NIFE2PRVB6A2","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"NIFE2PRVB6A2IVTW","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"NIFE2PRV","created_at":"2026-05-18T12:31:31Z"}],"graph_snapshots":[{"event_id":"sha256:6bba94ad250e53f42a81d5ba6bbaa07b40eb1b23c5d0bf91f6d15ca98342bf74","target":"graph","created_at":"2026-05-18T00:27:03Z","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":"We present a practical strategy that aims to attain rate points on the dominant face of the multiple access channel capacity using a standard low complexity decoder. This technique is built upon recent theoretical developments of Zhu and Gastpar on compute-forward multiple access (CFMA) which achieves the capacity of the multiple access channel using a sequential decoder. We illustrate this strategy with off-the-shelf LDPC codes. In the first stage of decoding, the receiver first recovers a linear combination of the transmitted codewords using the sum-product algorithm (SPA). In the second sta","authors_text":"Adriano Pastore, Erixhen Sula, Jingge Zhu, Michael Gastpar, Sung Hoon Lim","cross_cats":["math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2017-12-29T17:57:37Z","title":"Compute--Forward Multiple Access (CFMA): Practical Code Design"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.10293","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:e1dff599e9c19aeee557e245b7d5b143a1027d58e8521612c8b6e91296e137ec","target":"record","created_at":"2026-05-18T00:27:03Z","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":"2d74ba73bdcba1d610466dad3b031827c4f0b197df7dac66e48118039001e41e","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2017-12-29T17:57:37Z","title_canon_sha256":"08bf02f4273e8cb12779c9bc31bed766d1de65830df7c470b4409940f98e573f"},"schema_version":"1.0","source":{"id":"1712.10293","kind":"arxiv","version":1}},"canonical_sha256":"6a0a4d3e350f81a456764009e2a876f4c298b9650cb638fe41fb80987dd58f4f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6a0a4d3e350f81a456764009e2a876f4c298b9650cb638fe41fb80987dd58f4f","first_computed_at":"2026-05-18T00:27:03.499358Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:27:03.499358Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9tyfjR7hmZsmXzyYwfCiUx+Ii16rsLWn50khkgOvDYaJfcdhp3ZX8p3XeuW5FHIAfu90G8DFskBYFah3MXmlAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:27:03.499823Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.10293","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e1dff599e9c19aeee557e245b7d5b143a1027d58e8521612c8b6e91296e137ec","sha256:6bba94ad250e53f42a81d5ba6bbaa07b40eb1b23c5d0bf91f6d15ca98342bf74"],"state_sha256":"3a9e035a8c860e60bed5e28b51b479b9aebb8311a1a036a9ac51c09cf80e8431"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nx1LOn61BQ6uVKJ4WzKpsst+ay9gL9LFj3EdkXbT2WSobv+4j9mhnrLKl45UHvPnIySiqtyWBRzhiYoCwUzyDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T01:27:25.186786Z","bundle_sha256":"2563bb166cab345cfda46bc805d7eab6c80e5c16f331ba56f2f047d2b539eeb1"}}