{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:6X2KHNI5JSDGAUUK4GI77RUXUU","short_pith_number":"pith:6X2KHNI5","canonical_record":{"source":{"id":"1602.00169","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-30T22:40:59Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"cd92087914b1c59b93ae96017dd574d09e06a771f5abbf6bb56a741249e208ea","abstract_canon_sha256":"513c028e41457d37e39c9264fa4432d8d39c8e72be28c49c1bd564d298a65753"},"schema_version":"1.0"},"canonical_sha256":"f5f4a3b51d4c8660528ae191ffc697a52608d6260483ab6fdc6c48cb53304cb3","source":{"kind":"arxiv","id":"1602.00169","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.00169","created_at":"2026-05-18T01:21:36Z"},{"alias_kind":"arxiv_version","alias_value":"1602.00169v1","created_at":"2026-05-18T01:21:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.00169","created_at":"2026-05-18T01:21:36Z"},{"alias_kind":"pith_short_12","alias_value":"6X2KHNI5JSDG","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"6X2KHNI5JSDGAUUK","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"6X2KHNI5","created_at":"2026-05-18T12:30:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:6X2KHNI5JSDGAUUK4GI77RUXUU","target":"record","payload":{"canonical_record":{"source":{"id":"1602.00169","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-30T22:40:59Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"cd92087914b1c59b93ae96017dd574d09e06a771f5abbf6bb56a741249e208ea","abstract_canon_sha256":"513c028e41457d37e39c9264fa4432d8d39c8e72be28c49c1bd564d298a65753"},"schema_version":"1.0"},"canonical_sha256":"f5f4a3b51d4c8660528ae191ffc697a52608d6260483ab6fdc6c48cb53304cb3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:36.130025Z","signature_b64":"os0nOFrwdTyn+13N51kzpf+qutaGSdg2wdxVcyCfa6NZECjCWj7TJj9sRHc21Jzq19BdrHx/vF8YU0nPRDlqAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f5f4a3b51d4c8660528ae191ffc697a52608d6260483ab6fdc6c48cb53304cb3","last_reissued_at":"2026-05-18T01:21:36.129304Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:36.129304Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.00169","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-18T01:21:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RuOvjfIg9uDpcquh6SkT2HiCNsjC4EOAXEVDzWlP/tAOSJWfgDw85v1mpXuqgpy8yw9eoBk9AGlFigNiaZ+1Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T21:20:10.712594Z"},"content_sha256":"6944dab9cc6a0ba30c4ff0ce9ff0759c8056d9115701fbf5f47f4c9207ea9b19","schema_version":"1.0","event_id":"sha256:6944dab9cc6a0ba30c4ff0ce9ff0759c8056d9115701fbf5f47f4c9207ea9b19"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:6X2KHNI5JSDGAUUK4GI77RUXUU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Linearithmic Time Algorithm for a Shortest Vector Problem in Compute-and-Forward Design","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jinming Wen, Xiao-Wen Chang","submitted_at":"2016-01-30T22:40:59Z","abstract_excerpt":"We propose an algorithm with expected complexity of $\\bigO(n\\log n)$ arithmetic operations to solve a special shortest vector problem arising in computer-and-forward design, where $n$ is the dimension of the channel vector. This algorithm is more efficient than the best known algorithms with proved complexity."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.00169","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-18T01:21:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7Jl2ZUGFJVlwALMS2UhvlHhK6cRW9IoKrVHQf3CXeYPVt6xinllxhfyuJ6Z44gW9NvzkOdqA2hDYx81X2e+nBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T21:20:10.712944Z"},"content_sha256":"43a7775718b909874c17ed8de7b7bd7b10c9f57cc0982d09bf0661fb18ab4949","schema_version":"1.0","event_id":"sha256:43a7775718b909874c17ed8de7b7bd7b10c9f57cc0982d09bf0661fb18ab4949"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6X2KHNI5JSDGAUUK4GI77RUXUU/bundle.json","state_url":"https://pith.science/pith/6X2KHNI5JSDGAUUK4GI77RUXUU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6X2KHNI5JSDGAUUK4GI77RUXUU/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-10T21:20:10Z","links":{"resolver":"https://pith.science/pith/6X2KHNI5JSDGAUUK4GI77RUXUU","bundle":"https://pith.science/pith/6X2KHNI5JSDGAUUK4GI77RUXUU/bundle.json","state":"https://pith.science/pith/6X2KHNI5JSDGAUUK4GI77RUXUU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6X2KHNI5JSDGAUUK4GI77RUXUU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:6X2KHNI5JSDGAUUK4GI77RUXUU","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":"513c028e41457d37e39c9264fa4432d8d39c8e72be28c49c1bd564d298a65753","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-30T22:40:59Z","title_canon_sha256":"cd92087914b1c59b93ae96017dd574d09e06a771f5abbf6bb56a741249e208ea"},"schema_version":"1.0","source":{"id":"1602.00169","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.00169","created_at":"2026-05-18T01:21:36Z"},{"alias_kind":"arxiv_version","alias_value":"1602.00169v1","created_at":"2026-05-18T01:21:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.00169","created_at":"2026-05-18T01:21:36Z"},{"alias_kind":"pith_short_12","alias_value":"6X2KHNI5JSDG","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"6X2KHNI5JSDGAUUK","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"6X2KHNI5","created_at":"2026-05-18T12:30:04Z"}],"graph_snapshots":[{"event_id":"sha256:43a7775718b909874c17ed8de7b7bd7b10c9f57cc0982d09bf0661fb18ab4949","target":"graph","created_at":"2026-05-18T01:21:36Z","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 propose an algorithm with expected complexity of $\\bigO(n\\log n)$ arithmetic operations to solve a special shortest vector problem arising in computer-and-forward design, where $n$ is the dimension of the channel vector. This algorithm is more efficient than the best known algorithms with proved complexity.","authors_text":"Jinming Wen, Xiao-Wen Chang","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-30T22:40:59Z","title":"A Linearithmic Time Algorithm for a Shortest Vector Problem in Compute-and-Forward Design"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.00169","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:6944dab9cc6a0ba30c4ff0ce9ff0759c8056d9115701fbf5f47f4c9207ea9b19","target":"record","created_at":"2026-05-18T01:21:36Z","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":"513c028e41457d37e39c9264fa4432d8d39c8e72be28c49c1bd564d298a65753","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-30T22:40:59Z","title_canon_sha256":"cd92087914b1c59b93ae96017dd574d09e06a771f5abbf6bb56a741249e208ea"},"schema_version":"1.0","source":{"id":"1602.00169","kind":"arxiv","version":1}},"canonical_sha256":"f5f4a3b51d4c8660528ae191ffc697a52608d6260483ab6fdc6c48cb53304cb3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f5f4a3b51d4c8660528ae191ffc697a52608d6260483ab6fdc6c48cb53304cb3","first_computed_at":"2026-05-18T01:21:36.129304Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:21:36.129304Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"os0nOFrwdTyn+13N51kzpf+qutaGSdg2wdxVcyCfa6NZECjCWj7TJj9sRHc21Jzq19BdrHx/vF8YU0nPRDlqAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:21:36.130025Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.00169","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6944dab9cc6a0ba30c4ff0ce9ff0759c8056d9115701fbf5f47f4c9207ea9b19","sha256:43a7775718b909874c17ed8de7b7bd7b10c9f57cc0982d09bf0661fb18ab4949"],"state_sha256":"135fb257bfc6068104e5e311687518762e480da653ce29be6ad471ef8316090d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EwjXieZ53U8oNqpZpUXqsI+FnijDGKFbaApCOQqCKpUsHN2Qqo2pTUqWtVZijc0LWXHAMEvyVn4+5V5j8dv5Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T21:20:10.715034Z","bundle_sha256":"d85bec23d3e017cc1c751a08f16172034d2d0a72b11844c820e6e5d6d7fdb48f"}}