{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:EFRADINULYHGJIFQ6WW4FRPX4O","short_pith_number":"pith:EFRADINU","schema_version":"1.0","canonical_sha256":"216201a1b45e0e64a0b0f5adc2c5f7e38fe1c16c1d91432929d8eba8c8e2272d","source":{"kind":"arxiv","id":"1210.6502","version":1},"attestation_state":"computed","paper":{"title":"Block Korkin-Zolotarev algorithm generalization and their practical implementation (Russian)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Vasiliy Usatyuk","submitted_at":"2012-10-24T12:00:44Z","abstract_excerpt":"We propose a practical algorithm for block Korkin-Zolotarev reduction, a concept introduced by Schnorr, using CPU arbitrary length Householder QR-decomposition for orthogonalization and double precision OpenCL GPU Finke-Post shortest vector enumeration. Empirical tests was used on random lattices in the sense of Goldstein and Mayer."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1210.6502","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-10-24T12:00:44Z","cross_cats_sorted":[],"title_canon_sha256":"8494e062f9c66663de021ed8618f3e4fb168e0afe0409f0fa5637a839d13a384","abstract_canon_sha256":"8e90c6391961eb2e0937c1e6119ce2d436db241c29f85c4674a6079ed1ead189"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:42:24.595454Z","signature_b64":"QqmgtjPlbzBdKzT88Ukl7/cPh5BwiC4+lfpXTNLxdF32RKg32HnFWilemeIOf7zBWPZ1GXG8PixUSeb2vi18Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"216201a1b45e0e64a0b0f5adc2c5f7e38fe1c16c1d91432929d8eba8c8e2272d","last_reissued_at":"2026-05-18T03:42:24.594520Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:42:24.594520Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Block Korkin-Zolotarev algorithm generalization and their practical implementation (Russian)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Vasiliy Usatyuk","submitted_at":"2012-10-24T12:00:44Z","abstract_excerpt":"We propose a practical algorithm for block Korkin-Zolotarev reduction, a concept introduced by Schnorr, using CPU arbitrary length Householder QR-decomposition for orthogonalization and double precision OpenCL GPU Finke-Post shortest vector enumeration. Empirical tests was used on random lattices in the sense of Goldstein and Mayer."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.6502","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1210.6502","created_at":"2026-05-18T03:42:24.594639+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.6502v1","created_at":"2026-05-18T03:42:24.594639+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.6502","created_at":"2026-05-18T03:42:24.594639+00:00"},{"alias_kind":"pith_short_12","alias_value":"EFRADINULYHG","created_at":"2026-05-18T12:27:04.183437+00:00"},{"alias_kind":"pith_short_16","alias_value":"EFRADINULYHGJIFQ","created_at":"2026-05-18T12:27:04.183437+00:00"},{"alias_kind":"pith_short_8","alias_value":"EFRADINU","created_at":"2026-05-18T12:27:04.183437+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EFRADINULYHGJIFQ6WW4FRPX4O","json":"https://pith.science/pith/EFRADINULYHGJIFQ6WW4FRPX4O.json","graph_json":"https://pith.science/api/pith-number/EFRADINULYHGJIFQ6WW4FRPX4O/graph.json","events_json":"https://pith.science/api/pith-number/EFRADINULYHGJIFQ6WW4FRPX4O/events.json","paper":"https://pith.science/paper/EFRADINU"},"agent_actions":{"view_html":"https://pith.science/pith/EFRADINULYHGJIFQ6WW4FRPX4O","download_json":"https://pith.science/pith/EFRADINULYHGJIFQ6WW4FRPX4O.json","view_paper":"https://pith.science/paper/EFRADINU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.6502&json=true","fetch_graph":"https://pith.science/api/pith-number/EFRADINULYHGJIFQ6WW4FRPX4O/graph.json","fetch_events":"https://pith.science/api/pith-number/EFRADINULYHGJIFQ6WW4FRPX4O/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EFRADINULYHGJIFQ6WW4FRPX4O/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EFRADINULYHGJIFQ6WW4FRPX4O/action/storage_attestation","attest_author":"https://pith.science/pith/EFRADINULYHGJIFQ6WW4FRPX4O/action/author_attestation","sign_citation":"https://pith.science/pith/EFRADINULYHGJIFQ6WW4FRPX4O/action/citation_signature","submit_replication":"https://pith.science/pith/EFRADINULYHGJIFQ6WW4FRPX4O/action/replication_record"}},"created_at":"2026-05-18T03:42:24.594639+00:00","updated_at":"2026-05-18T03:42:24.594639+00:00"}