{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:CY6DCJGGRJYAYLAAZHI732MUE7","short_pith_number":"pith:CY6DCJGG","canonical_record":{"source":{"id":"1512.06667","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-12-21T15:34:51Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"645ca6911922905a790c9f80a9aa2edbad0f63a824e2735286378ab5dc2a42e4","abstract_canon_sha256":"e7e51a7dbfac1c1ae02fd12e0391c8ae78e664fd5318db8c6a906d3d6b5a61fd"},"schema_version":"1.0"},"canonical_sha256":"163c3124c68a700c2c00c9d1fde99427f01984d325c06f69a42fc30f1bb4f2ba","source":{"kind":"arxiv","id":"1512.06667","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.06667","created_at":"2026-05-18T00:29:39Z"},{"alias_kind":"arxiv_version","alias_value":"1512.06667v2","created_at":"2026-05-18T00:29:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.06667","created_at":"2026-05-18T00:29:39Z"},{"alias_kind":"pith_short_12","alias_value":"CY6DCJGGRJYA","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"CY6DCJGGRJYAYLAA","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"CY6DCJGG","created_at":"2026-05-18T12:29:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:CY6DCJGGRJYAYLAAZHI732MUE7","target":"record","payload":{"canonical_record":{"source":{"id":"1512.06667","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-12-21T15:34:51Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"645ca6911922905a790c9f80a9aa2edbad0f63a824e2735286378ab5dc2a42e4","abstract_canon_sha256":"e7e51a7dbfac1c1ae02fd12e0391c8ae78e664fd5318db8c6a906d3d6b5a61fd"},"schema_version":"1.0"},"canonical_sha256":"163c3124c68a700c2c00c9d1fde99427f01984d325c06f69a42fc30f1bb4f2ba","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:39.685308Z","signature_b64":"E8jx10xh73bei1MiV0nterUXKwrSvRuAW9blAbz2PZMgsUsT/iEdtgqqfF8pu5AwKlm+xRE2mZK+eSTrDPpwDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"163c3124c68a700c2c00c9d1fde99427f01984d325c06f69a42fc30f1bb4f2ba","last_reissued_at":"2026-05-18T00:29:39.684781Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:39.684781Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1512.06667","source_version":2,"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:29:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7cILXwddByyYpi30o0KeLL9ryLERpnJp1QXWy/d6UrEZ+ukP+JAeFHpyEJAPB1mbep0if7LpnhyFSaB1Vy23Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T00:22:13.098204Z"},"content_sha256":"ded8f06b029fd7696493012eb76fc8a8494724553c889dcee29b2c840005a076","schema_version":"1.0","event_id":"sha256:ded8f06b029fd7696493012eb76fc8a8494724553c889dcee29b2c840005a076"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:CY6DCJGGRJYAYLAAZHI732MUE7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Polynomially Solvable Instances of the Shortest and Closest Vector Problems with Applications to Compute-and-Forward","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":"2015-12-21T15:34:51Z","abstract_excerpt":"A particular instance of the Shortest Vector Problem (SVP) appears in the context of Compute-and-Forward. Despite the NP-hardness of the SVP, we will show that this certain instance can be solved in complexity order $O(n\\psi\\log(n\\psi))$ where $\\psi = \\sqrt{P\\|{\\bf h}\\|^2+1}$ depends on the transmission power and the norm of the channel vector. We will then extend our results to Integer-Forcing and finally, introduce a more general class of lattices for which the SVP and the and the Closest Vector Problem (CVP) can be approximated within a constant factor."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.06667","kind":"arxiv","version":2},"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:29:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DlYif4l+Lg0u89pf4K/2ojgKwyrdybMKezgiJgFwyUDaEl+SpeaBysbZhO++w7ZTx0PGJF6tOM71T+I932dsBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T00:22:13.098562Z"},"content_sha256":"31e1cbe3f7082ffbce5fdeb782431ddd28d2ebf52916ac5efa798dade8762f9e","schema_version":"1.0","event_id":"sha256:31e1cbe3f7082ffbce5fdeb782431ddd28d2ebf52916ac5efa798dade8762f9e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CY6DCJGGRJYAYLAAZHI732MUE7/bundle.json","state_url":"https://pith.science/pith/CY6DCJGGRJYAYLAAZHI732MUE7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CY6DCJGGRJYAYLAAZHI732MUE7/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-05T00:22:13Z","links":{"resolver":"https://pith.science/pith/CY6DCJGGRJYAYLAAZHI732MUE7","bundle":"https://pith.science/pith/CY6DCJGGRJYAYLAAZHI732MUE7/bundle.json","state":"https://pith.science/pith/CY6DCJGGRJYAYLAAZHI732MUE7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CY6DCJGGRJYAYLAAZHI732MUE7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:CY6DCJGGRJYAYLAAZHI732MUE7","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":"e7e51a7dbfac1c1ae02fd12e0391c8ae78e664fd5318db8c6a906d3d6b5a61fd","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-12-21T15:34:51Z","title_canon_sha256":"645ca6911922905a790c9f80a9aa2edbad0f63a824e2735286378ab5dc2a42e4"},"schema_version":"1.0","source":{"id":"1512.06667","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.06667","created_at":"2026-05-18T00:29:39Z"},{"alias_kind":"arxiv_version","alias_value":"1512.06667v2","created_at":"2026-05-18T00:29:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.06667","created_at":"2026-05-18T00:29:39Z"},{"alias_kind":"pith_short_12","alias_value":"CY6DCJGGRJYA","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"CY6DCJGGRJYAYLAA","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"CY6DCJGG","created_at":"2026-05-18T12:29:17Z"}],"graph_snapshots":[{"event_id":"sha256:31e1cbe3f7082ffbce5fdeb782431ddd28d2ebf52916ac5efa798dade8762f9e","target":"graph","created_at":"2026-05-18T00:29:39Z","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":"A particular instance of the Shortest Vector Problem (SVP) appears in the context of Compute-and-Forward. Despite the NP-hardness of the SVP, we will show that this certain instance can be solved in complexity order $O(n\\psi\\log(n\\psi))$ where $\\psi = \\sqrt{P\\|{\\bf h}\\|^2+1}$ depends on the transmission power and the norm of the channel vector. We will then extend our results to Integer-Forcing and finally, introduce a more general class of lattices for which the SVP and the and the Closest Vector Problem (CVP) can be approximated within a constant factor.","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":"2015-12-21T15:34:51Z","title":"Polynomially Solvable Instances of the Shortest and Closest Vector Problems with Applications to Compute-and-Forward"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.06667","kind":"arxiv","version":2},"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:ded8f06b029fd7696493012eb76fc8a8494724553c889dcee29b2c840005a076","target":"record","created_at":"2026-05-18T00:29:39Z","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":"e7e51a7dbfac1c1ae02fd12e0391c8ae78e664fd5318db8c6a906d3d6b5a61fd","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-12-21T15:34:51Z","title_canon_sha256":"645ca6911922905a790c9f80a9aa2edbad0f63a824e2735286378ab5dc2a42e4"},"schema_version":"1.0","source":{"id":"1512.06667","kind":"arxiv","version":2}},"canonical_sha256":"163c3124c68a700c2c00c9d1fde99427f01984d325c06f69a42fc30f1bb4f2ba","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"163c3124c68a700c2c00c9d1fde99427f01984d325c06f69a42fc30f1bb4f2ba","first_computed_at":"2026-05-18T00:29:39.684781Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:29:39.684781Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"E8jx10xh73bei1MiV0nterUXKwrSvRuAW9blAbz2PZMgsUsT/iEdtgqqfF8pu5AwKlm+xRE2mZK+eSTrDPpwDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:29:39.685308Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.06667","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ded8f06b029fd7696493012eb76fc8a8494724553c889dcee29b2c840005a076","sha256:31e1cbe3f7082ffbce5fdeb782431ddd28d2ebf52916ac5efa798dade8762f9e"],"state_sha256":"ed4515dc7e2bd58e4524c3940f44e30531836f635d6de2396125bd201126f72f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N41Qs8AgGtc6/w+2iwgOkbMG9bU4+rJAiddqWNHNmItv3jbd2llSWLR+iF/+58PI74ERC+GhrPw/3W0CO1oSAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T00:22:13.100668Z","bundle_sha256":"04c595ec9345ebe6497f67502f26e18907d731900f5a2515346c348b5dcf030d"}}