{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:UCKCZUQCXS57EGS2BBZ4I676P5","short_pith_number":"pith:UCKCZUQC","canonical_record":{"source":{"id":"1404.0564","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-02T14:22:27Z","cross_cats_sorted":[],"title_canon_sha256":"e2bfa8f39ae852acf3a7f110625d5968668b9429883e7b60fdfe932290a62a18","abstract_canon_sha256":"490e4c2bb6cb6260d8fae34cbd3341ba932899810aca6e0bb9b1657a5b93fe5b"},"schema_version":"1.0"},"canonical_sha256":"a0942cd202bcbbf21a5a0873c47bfe7f5cf448dccf40772a02a403ee18fecd47","source":{"kind":"arxiv","id":"1404.0564","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.0564","created_at":"2026-05-18T02:55:03Z"},{"alias_kind":"arxiv_version","alias_value":"1404.0564v1","created_at":"2026-05-18T02:55:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.0564","created_at":"2026-05-18T02:55:03Z"},{"alias_kind":"pith_short_12","alias_value":"UCKCZUQCXS57","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"UCKCZUQCXS57EGS2","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"UCKCZUQC","created_at":"2026-05-18T12:28:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:UCKCZUQCXS57EGS2BBZ4I676P5","target":"record","payload":{"canonical_record":{"source":{"id":"1404.0564","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-02T14:22:27Z","cross_cats_sorted":[],"title_canon_sha256":"e2bfa8f39ae852acf3a7f110625d5968668b9429883e7b60fdfe932290a62a18","abstract_canon_sha256":"490e4c2bb6cb6260d8fae34cbd3341ba932899810aca6e0bb9b1657a5b93fe5b"},"schema_version":"1.0"},"canonical_sha256":"a0942cd202bcbbf21a5a0873c47bfe7f5cf448dccf40772a02a403ee18fecd47","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:55:03.050192Z","signature_b64":"QIBKo+/ntQKOD1fHp6ctHnswVb+X2D9C1+SoSx6HUbjCdwRtJiYOBu41LV/VEKq7cKPkWpUt14UeNyZwbeOjDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a0942cd202bcbbf21a5a0873c47bfe7f5cf448dccf40772a02a403ee18fecd47","last_reissued_at":"2026-05-18T02:55:03.049813Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:55:03.049813Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1404.0564","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:55:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QGfzwJzcr/UcRRuXiY22QF5YVBy1TmcQgCTDZTHVVMzpH702DGTmMEVZiQdAi3dcHKJuVHuSbzR3weOrikypAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T06:10:08.404730Z"},"content_sha256":"2ac1babd7b44c058cf8cadb8f7fd361de31c4dbfc1fc26d1578f7fb07bccfdbd","schema_version":"1.0","event_id":"sha256:2ac1babd7b44c058cf8cadb8f7fd361de31c4dbfc1fc26d1578f7fb07bccfdbd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:UCKCZUQCXS57EGS2BBZ4I676P5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"New Shortest Lattice Vector Problems of Polynomial Complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Michael C. Gastpar, Saeid Sahraei","submitted_at":"2014-04-02T14:22:27Z","abstract_excerpt":"The Shortest Lattice Vector (SLV) problem is in general hard to solve, except for special cases (such as root lattices and lattices for which an obtuse superbase is known). In this paper, we present a new class of SLV problems that can be solved efficiently. Specifically, if for an $n$-dimensional lattice, a Gram matrix is known that can be written as the difference of a diagonal matrix and a positive semidefinite matrix of rank $k$ (for some constant $k$), we show that the SLV problem can be reduced to a $k$-dimensional optimization problem with countably many candidate points. Moreover, we s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.0564","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:55:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QloEXGrbyjK+GtiMKL6j6cV9GFETGSdrSY79zVLfFWyL41EqwRNK/Oq3wWbvkj8H+p047BwQPT7L/mgnKrdABQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T06:10:08.405403Z"},"content_sha256":"81b90d4929a46eeccc54291a892acc2100c1a150f33ad3eed5762962f874b7c3","schema_version":"1.0","event_id":"sha256:81b90d4929a46eeccc54291a892acc2100c1a150f33ad3eed5762962f874b7c3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UCKCZUQCXS57EGS2BBZ4I676P5/bundle.json","state_url":"https://pith.science/pith/UCKCZUQCXS57EGS2BBZ4I676P5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UCKCZUQCXS57EGS2BBZ4I676P5/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-05T06:10:08Z","links":{"resolver":"https://pith.science/pith/UCKCZUQCXS57EGS2BBZ4I676P5","bundle":"https://pith.science/pith/UCKCZUQCXS57EGS2BBZ4I676P5/bundle.json","state":"https://pith.science/pith/UCKCZUQCXS57EGS2BBZ4I676P5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UCKCZUQCXS57EGS2BBZ4I676P5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:UCKCZUQCXS57EGS2BBZ4I676P5","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":"490e4c2bb6cb6260d8fae34cbd3341ba932899810aca6e0bb9b1657a5b93fe5b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-02T14:22:27Z","title_canon_sha256":"e2bfa8f39ae852acf3a7f110625d5968668b9429883e7b60fdfe932290a62a18"},"schema_version":"1.0","source":{"id":"1404.0564","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.0564","created_at":"2026-05-18T02:55:03Z"},{"alias_kind":"arxiv_version","alias_value":"1404.0564v1","created_at":"2026-05-18T02:55:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.0564","created_at":"2026-05-18T02:55:03Z"},{"alias_kind":"pith_short_12","alias_value":"UCKCZUQCXS57","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"UCKCZUQCXS57EGS2","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"UCKCZUQC","created_at":"2026-05-18T12:28:52Z"}],"graph_snapshots":[{"event_id":"sha256:81b90d4929a46eeccc54291a892acc2100c1a150f33ad3eed5762962f874b7c3","target":"graph","created_at":"2026-05-18T02:55: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":"The Shortest Lattice Vector (SLV) problem is in general hard to solve, except for special cases (such as root lattices and lattices for which an obtuse superbase is known). In this paper, we present a new class of SLV problems that can be solved efficiently. Specifically, if for an $n$-dimensional lattice, a Gram matrix is known that can be written as the difference of a diagonal matrix and a positive semidefinite matrix of rank $k$ (for some constant $k$), we show that the SLV problem can be reduced to a $k$-dimensional optimization problem with countably many candidate points. Moreover, we s","authors_text":"Michael C. Gastpar, Saeid Sahraei","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-02T14:22:27Z","title":"New Shortest Lattice Vector Problems of Polynomial Complexity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.0564","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:2ac1babd7b44c058cf8cadb8f7fd361de31c4dbfc1fc26d1578f7fb07bccfdbd","target":"record","created_at":"2026-05-18T02:55: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":"490e4c2bb6cb6260d8fae34cbd3341ba932899810aca6e0bb9b1657a5b93fe5b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-02T14:22:27Z","title_canon_sha256":"e2bfa8f39ae852acf3a7f110625d5968668b9429883e7b60fdfe932290a62a18"},"schema_version":"1.0","source":{"id":"1404.0564","kind":"arxiv","version":1}},"canonical_sha256":"a0942cd202bcbbf21a5a0873c47bfe7f5cf448dccf40772a02a403ee18fecd47","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a0942cd202bcbbf21a5a0873c47bfe7f5cf448dccf40772a02a403ee18fecd47","first_computed_at":"2026-05-18T02:55:03.049813Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:55:03.049813Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QIBKo+/ntQKOD1fHp6ctHnswVb+X2D9C1+SoSx6HUbjCdwRtJiYOBu41LV/VEKq7cKPkWpUt14UeNyZwbeOjDw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:55:03.050192Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.0564","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2ac1babd7b44c058cf8cadb8f7fd361de31c4dbfc1fc26d1578f7fb07bccfdbd","sha256:81b90d4929a46eeccc54291a892acc2100c1a150f33ad3eed5762962f874b7c3"],"state_sha256":"1bd1888733372ccf86a66166bd4e41524b20f859eaafe139b7c1d26962041f6b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1x3zzSYLPX8CWj4tx/1onOxcqgkq4PJkcyrEGjwBJMbYF5XHwyPKpnbp2T8eIi9+0ICHcC/nDqBW0zs+MCXDDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T06:10:08.408762Z","bundle_sha256":"08db6dfb275c2bc1412339d4ada1f8c5dca51ee2c60b13045393b37d02f7a870"}}