{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:WNEI75U5HDEKP35KTSWN6IMSVE","short_pith_number":"pith:WNEI75U5","canonical_record":{"source":{"id":"1410.3656","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-10-14T11:49:48Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a7bc813bc35167d468198f6abdb54ca8cca909e742cf1974d852787009c6fdf4","abstract_canon_sha256":"a79b2071af1026a60d66be3f6c1ab06a09771b27866ba9ca04a5055f89f80a1c"},"schema_version":"1.0"},"canonical_sha256":"b3488ff69d38c8a7efaa9cacdf2192a91707203014a10153330ab1f77e60b641","source":{"kind":"arxiv","id":"1410.3656","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.3656","created_at":"2026-05-18T02:40:09Z"},{"alias_kind":"arxiv_version","alias_value":"1410.3656v1","created_at":"2026-05-18T02:40:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.3656","created_at":"2026-05-18T02:40:09Z"},{"alias_kind":"pith_short_12","alias_value":"WNEI75U5HDEK","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"WNEI75U5HDEKP35K","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"WNEI75U5","created_at":"2026-05-18T12:28:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:WNEI75U5HDEKP35KTSWN6IMSVE","target":"record","payload":{"canonical_record":{"source":{"id":"1410.3656","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-10-14T11:49:48Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a7bc813bc35167d468198f6abdb54ca8cca909e742cf1974d852787009c6fdf4","abstract_canon_sha256":"a79b2071af1026a60d66be3f6c1ab06a09771b27866ba9ca04a5055f89f80a1c"},"schema_version":"1.0"},"canonical_sha256":"b3488ff69d38c8a7efaa9cacdf2192a91707203014a10153330ab1f77e60b641","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:40:09.257217Z","signature_b64":"M9FDmJPimWS2c93zQ06zt8CFO0un2DQgy+/Cqowh9D/Gq+iIfsWycwAzVhn5TEzKbO3m1sPCJhRq6Y18/acSBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b3488ff69d38c8a7efaa9cacdf2192a91707203014a10153330ab1f77e60b641","last_reissued_at":"2026-05-18T02:40:09.256772Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:40:09.256772Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1410.3656","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-18T02:40:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S997vAb+BY+bqUzk7+fcC7yelCIp221W38SxurMKKzC2MJtca1EQl8OMKVQf/CmynMksQj53wa/uO2pz3rlmDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T23:31:56.005024Z"},"content_sha256":"2725ca19439d8c9a42683b905a53b376a1a89c65c34f95299b9c234571bd005c","schema_version":"1.0","event_id":"sha256:2725ca19439d8c9a42683b905a53b376a1a89c65c34f95299b9c234571bd005c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:WNEI75U5HDEKP35KTSWN6IMSVE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Compute-and-Forward: Finding the Best Equation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Michael Gastpar, Saeid Sahraei","submitted_at":"2014-10-14T11:49:48Z","abstract_excerpt":"Compute-and-Forward is an emerging technique to deal with interference. It allows the receiver to decode a suitably chosen integer linear combination of the transmitted messages. The integer coefficients should be adapted to the channel fading state. Optimizing these coefficients is a Shortest Lattice Vector (SLV) problem. In general, the SLV problem is known to be prohibitively complex. In this paper, we show that the particular SLV instance resulting from the Compute-and-Forward problem can be solved in low polynomial complexity and give an explicit deterministic algorithm that is guaranteed"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.3656","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-18T02:40:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rBQ2BLTUq9HpftoMLP0iJiYqxNAzaPr8gIyR9ywEsHVWvl3CTtWSZD526td3JZndLZVOcEdCzQZDWE0+fpvIBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T23:31:56.005734Z"},"content_sha256":"f7ec9f48e9171de96777f6d152a1901f715d20ff1c037c9492c8f51861f46017","schema_version":"1.0","event_id":"sha256:f7ec9f48e9171de96777f6d152a1901f715d20ff1c037c9492c8f51861f46017"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WNEI75U5HDEKP35KTSWN6IMSVE/bundle.json","state_url":"https://pith.science/pith/WNEI75U5HDEKP35KTSWN6IMSVE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WNEI75U5HDEKP35KTSWN6IMSVE/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-04T23:31:56Z","links":{"resolver":"https://pith.science/pith/WNEI75U5HDEKP35KTSWN6IMSVE","bundle":"https://pith.science/pith/WNEI75U5HDEKP35KTSWN6IMSVE/bundle.json","state":"https://pith.science/pith/WNEI75U5HDEKP35KTSWN6IMSVE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WNEI75U5HDEKP35KTSWN6IMSVE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:WNEI75U5HDEKP35KTSWN6IMSVE","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":"a79b2071af1026a60d66be3f6c1ab06a09771b27866ba9ca04a5055f89f80a1c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-10-14T11:49:48Z","title_canon_sha256":"a7bc813bc35167d468198f6abdb54ca8cca909e742cf1974d852787009c6fdf4"},"schema_version":"1.0","source":{"id":"1410.3656","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.3656","created_at":"2026-05-18T02:40:09Z"},{"alias_kind":"arxiv_version","alias_value":"1410.3656v1","created_at":"2026-05-18T02:40:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.3656","created_at":"2026-05-18T02:40:09Z"},{"alias_kind":"pith_short_12","alias_value":"WNEI75U5HDEK","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"WNEI75U5HDEKP35K","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"WNEI75U5","created_at":"2026-05-18T12:28:54Z"}],"graph_snapshots":[{"event_id":"sha256:f7ec9f48e9171de96777f6d152a1901f715d20ff1c037c9492c8f51861f46017","target":"graph","created_at":"2026-05-18T02:40:09Z","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":"Compute-and-Forward is an emerging technique to deal with interference. It allows the receiver to decode a suitably chosen integer linear combination of the transmitted messages. The integer coefficients should be adapted to the channel fading state. Optimizing these coefficients is a Shortest Lattice Vector (SLV) problem. In general, the SLV problem is known to be prohibitively complex. In this paper, we show that the particular SLV instance resulting from the Compute-and-Forward problem can be solved in low polynomial complexity and give an explicit deterministic algorithm that is guaranteed","authors_text":"Michael Gastpar, Saeid Sahraei","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-10-14T11:49:48Z","title":"Compute-and-Forward: Finding the Best Equation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.3656","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:2725ca19439d8c9a42683b905a53b376a1a89c65c34f95299b9c234571bd005c","target":"record","created_at":"2026-05-18T02:40:09Z","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":"a79b2071af1026a60d66be3f6c1ab06a09771b27866ba9ca04a5055f89f80a1c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-10-14T11:49:48Z","title_canon_sha256":"a7bc813bc35167d468198f6abdb54ca8cca909e742cf1974d852787009c6fdf4"},"schema_version":"1.0","source":{"id":"1410.3656","kind":"arxiv","version":1}},"canonical_sha256":"b3488ff69d38c8a7efaa9cacdf2192a91707203014a10153330ab1f77e60b641","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b3488ff69d38c8a7efaa9cacdf2192a91707203014a10153330ab1f77e60b641","first_computed_at":"2026-05-18T02:40:09.256772Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:40:09.256772Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"M9FDmJPimWS2c93zQ06zt8CFO0un2DQgy+/Cqowh9D/Gq+iIfsWycwAzVhn5TEzKbO3m1sPCJhRq6Y18/acSBg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:40:09.257217Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.3656","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2725ca19439d8c9a42683b905a53b376a1a89c65c34f95299b9c234571bd005c","sha256:f7ec9f48e9171de96777f6d152a1901f715d20ff1c037c9492c8f51861f46017"],"state_sha256":"a1a331ea97cd2876401f4f161526a445f50d850d4d6f247c788c8404ebc44901"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jPTOUCtJwse7OQFz3wPRggHuEaOznzAodwMdO+lPsvCiA2xQbZRsB1v9ZTzORnT3NrH7VVFey5NN5r9ee3PbAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T23:31:56.009329Z","bundle_sha256":"4aedec1833f385e4e8ffb975ec96b5437b1dc1680d744817ef4ff8d8af6171be"}}