{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:HJCSGXA6VODRKNNX3KJS5KZDIA","short_pith_number":"pith:HJCSGXA6","canonical_record":{"source":{"id":"1609.05490","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-09-18T14:14:52Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"4bc8880a3f7d11026b7d43fda5bc3f6a97d1b8ac39aa5c31564d7056aeede38e","abstract_canon_sha256":"2c93dbf9ab2cfb081a8f6021630bc5992ab66188dd974583c1389b87e2836bfb"},"schema_version":"1.0"},"canonical_sha256":"3a45235c1eab871535b7da932eab23401b99086679cf2472d16fdcd3b16889df","source":{"kind":"arxiv","id":"1609.05490","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.05490","created_at":"2026-05-18T00:58:09Z"},{"alias_kind":"arxiv_version","alias_value":"1609.05490v1","created_at":"2026-05-18T00:58:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.05490","created_at":"2026-05-18T00:58:09Z"},{"alias_kind":"pith_short_12","alias_value":"HJCSGXA6VODR","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"HJCSGXA6VODRKNNX","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"HJCSGXA6","created_at":"2026-05-18T12:30:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:HJCSGXA6VODRKNNX3KJS5KZDIA","target":"record","payload":{"canonical_record":{"source":{"id":"1609.05490","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-09-18T14:14:52Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"4bc8880a3f7d11026b7d43fda5bc3f6a97d1b8ac39aa5c31564d7056aeede38e","abstract_canon_sha256":"2c93dbf9ab2cfb081a8f6021630bc5992ab66188dd974583c1389b87e2836bfb"},"schema_version":"1.0"},"canonical_sha256":"3a45235c1eab871535b7da932eab23401b99086679cf2472d16fdcd3b16889df","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:09.189655Z","signature_b64":"5ZOq8ggOOGkyFb1ovxXpD1upc+BBhzUMBg0CQN0IMIp0H5kGOcDR+bQ9qg3ahXqHIuht3S2FCFKVWCDZR1KKCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3a45235c1eab871535b7da932eab23401b99086679cf2472d16fdcd3b16889df","last_reissued_at":"2026-05-18T00:58:09.189107Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:09.189107Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1609.05490","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:58:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gCI5+WfW/3EawlIvUh9jDIGKmVcU1ij6LAon8MhNzA18R1MBcqMyWJ98S57sS3kM+0gH2+CddrbXPk0kGlMcCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T06:48:03.588056Z"},"content_sha256":"e7d93cd1fbb478ea32c048c795a011e5834f1150f5a4bd7d35103a4826f36cd9","schema_version":"1.0","event_id":"sha256:e7d93cd1fbb478ea32c048c795a011e5834f1150f5a4bd7d35103a4826f36cd9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:HJCSGXA6VODRKNNX3KJS5KZDIA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Integer Coefficient Search for Compute-and-Forward","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Cong Ling, William Liu","submitted_at":"2016-09-18T14:14:52Z","abstract_excerpt":"Integer coefficient selection is an important decoding step in the implementation of compute-and-forward (C-F) relaying scheme. Choosing the optimal integer coefficients in C-F has been shown to be a shortest vector problem (SVP) which is known to be NP hard in its general form. Exhaustive search of the integer coefficients is only feasible in complexity for small number of users while approximation algorithms such as Lenstra-Lenstra-Lovasz (LLL) lattice reduction algorithm only find a vector within an exponential factor of the shortest vector. An optimal deterministic algorithm was proposed f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.05490","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:58:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dOEJOBCUB5ao7O92PuAh65HAKDldLOkG7Yjge2+rV6OBa1YzRj4Ok2bCqyHDfVgOWEAVKxF5hrqV1uAFcmQ4Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T06:48:03.588409Z"},"content_sha256":"9cf1fef37bcc7ee045923fc3bf8b4f1aef126448a8edf81c3fb85dbdef3ea54c","schema_version":"1.0","event_id":"sha256:9cf1fef37bcc7ee045923fc3bf8b4f1aef126448a8edf81c3fb85dbdef3ea54c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HJCSGXA6VODRKNNX3KJS5KZDIA/bundle.json","state_url":"https://pith.science/pith/HJCSGXA6VODRKNNX3KJS5KZDIA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HJCSGXA6VODRKNNX3KJS5KZDIA/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-01T06:48:03Z","links":{"resolver":"https://pith.science/pith/HJCSGXA6VODRKNNX3KJS5KZDIA","bundle":"https://pith.science/pith/HJCSGXA6VODRKNNX3KJS5KZDIA/bundle.json","state":"https://pith.science/pith/HJCSGXA6VODRKNNX3KJS5KZDIA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HJCSGXA6VODRKNNX3KJS5KZDIA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:HJCSGXA6VODRKNNX3KJS5KZDIA","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":"2c93dbf9ab2cfb081a8f6021630bc5992ab66188dd974583c1389b87e2836bfb","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-09-18T14:14:52Z","title_canon_sha256":"4bc8880a3f7d11026b7d43fda5bc3f6a97d1b8ac39aa5c31564d7056aeede38e"},"schema_version":"1.0","source":{"id":"1609.05490","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.05490","created_at":"2026-05-18T00:58:09Z"},{"alias_kind":"arxiv_version","alias_value":"1609.05490v1","created_at":"2026-05-18T00:58:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.05490","created_at":"2026-05-18T00:58:09Z"},{"alias_kind":"pith_short_12","alias_value":"HJCSGXA6VODR","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"HJCSGXA6VODRKNNX","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"HJCSGXA6","created_at":"2026-05-18T12:30:19Z"}],"graph_snapshots":[{"event_id":"sha256:9cf1fef37bcc7ee045923fc3bf8b4f1aef126448a8edf81c3fb85dbdef3ea54c","target":"graph","created_at":"2026-05-18T00:58: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":"Integer coefficient selection is an important decoding step in the implementation of compute-and-forward (C-F) relaying scheme. Choosing the optimal integer coefficients in C-F has been shown to be a shortest vector problem (SVP) which is known to be NP hard in its general form. Exhaustive search of the integer coefficients is only feasible in complexity for small number of users while approximation algorithms such as Lenstra-Lenstra-Lovasz (LLL) lattice reduction algorithm only find a vector within an exponential factor of the shortest vector. An optimal deterministic algorithm was proposed f","authors_text":"Cong Ling, William Liu","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-09-18T14:14:52Z","title":"Efficient Integer Coefficient Search for Compute-and-Forward"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.05490","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:e7d93cd1fbb478ea32c048c795a011e5834f1150f5a4bd7d35103a4826f36cd9","target":"record","created_at":"2026-05-18T00:58: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":"2c93dbf9ab2cfb081a8f6021630bc5992ab66188dd974583c1389b87e2836bfb","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-09-18T14:14:52Z","title_canon_sha256":"4bc8880a3f7d11026b7d43fda5bc3f6a97d1b8ac39aa5c31564d7056aeede38e"},"schema_version":"1.0","source":{"id":"1609.05490","kind":"arxiv","version":1}},"canonical_sha256":"3a45235c1eab871535b7da932eab23401b99086679cf2472d16fdcd3b16889df","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3a45235c1eab871535b7da932eab23401b99086679cf2472d16fdcd3b16889df","first_computed_at":"2026-05-18T00:58:09.189107Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:09.189107Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5ZOq8ggOOGkyFb1ovxXpD1upc+BBhzUMBg0CQN0IMIp0H5kGOcDR+bQ9qg3ahXqHIuht3S2FCFKVWCDZR1KKCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:09.189655Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.05490","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e7d93cd1fbb478ea32c048c795a011e5834f1150f5a4bd7d35103a4826f36cd9","sha256:9cf1fef37bcc7ee045923fc3bf8b4f1aef126448a8edf81c3fb85dbdef3ea54c"],"state_sha256":"70b5bf028c71a8a03aad07b18724130d190b89bea1f516a2604fd2d90e3d926b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ssYHckQVi5Lsq8gmW2rn241iY7YVc7A3u7n5YjAEV2NRT0JG5UF0Cpn3lv4Oag5bv6WFaefX3E+VdVcu+Ug2AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T06:48:03.590683Z","bundle_sha256":"87e1e091c769e5e81b11052c396c4c2d16648850a152aaacb56ef0e071fef42e"}}