{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:3ORUNDLRZEXRROPQBNWA7NJUOP","short_pith_number":"pith:3ORUNDLR","canonical_record":{"source":{"id":"1201.5273","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-01-25T13:58:40Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"96424449d1f647734861a4dd4186c05fde0dc07603b996ecc2446b517ed25b0d","abstract_canon_sha256":"027d3e668badc77a2b6e1c04eda83a78aaeb2600e9c67dd4591b594c0193b31a"},"schema_version":"1.0"},"canonical_sha256":"dba3468d71c92f18b9f00b6c0fb53473d24faaa2353927609b606464eedfa9da","source":{"kind":"arxiv","id":"1201.5273","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.5273","created_at":"2026-05-18T04:03:55Z"},{"alias_kind":"arxiv_version","alias_value":"1201.5273v1","created_at":"2026-05-18T04:03:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.5273","created_at":"2026-05-18T04:03:55Z"},{"alias_kind":"pith_short_12","alias_value":"3ORUNDLRZEXR","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"3ORUNDLRZEXRROPQ","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"3ORUNDLR","created_at":"2026-05-18T12:26:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:3ORUNDLRZEXRROPQBNWA7NJUOP","target":"record","payload":{"canonical_record":{"source":{"id":"1201.5273","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-01-25T13:58:40Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"96424449d1f647734861a4dd4186c05fde0dc07603b996ecc2446b517ed25b0d","abstract_canon_sha256":"027d3e668badc77a2b6e1c04eda83a78aaeb2600e9c67dd4591b594c0193b31a"},"schema_version":"1.0"},"canonical_sha256":"dba3468d71c92f18b9f00b6c0fb53473d24faaa2353927609b606464eedfa9da","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:03:55.135756Z","signature_b64":"pczYcKvYCZz6fKtr0x8fX3svNe6LMNNUwk5lTzjUI0CCqqC5ZvU/agdexR5Nn1sORnYn8v1WJnoXgZuSooxHBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dba3468d71c92f18b9f00b6c0fb53473d24faaa2353927609b606464eedfa9da","last_reissued_at":"2026-05-18T04:03:55.135274Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:03:55.135274Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1201.5273","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-18T04:03:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T04jnS1oxNIMVuy/HnhEuTrgZIOkVbh/Wp1itsJll+O57SKPWohRrf1MTJ/soS5b0nSsRSG9YtzcICvYjexUDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T01:08:45.619520Z"},"content_sha256":"012237f525235475b132285729220193f67ff65e944dc6cc8ee42cf79a3c2772","schema_version":"1.0","event_id":"sha256:012237f525235475b132285729220193f67ff65e944dc6cc8ee42cf79a3c2772"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:3ORUNDLRZEXRROPQBNWA7NJUOP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improvements in closest point search based on dual HKZ-bases","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"math.CO","authors_text":"Gerard Maze, Urs Wagner","submitted_at":"2012-01-25T13:58:40Z","abstract_excerpt":"In this paper we review the technique to solve the CVP based on dual HKZ-bases by J. Bloemer. The technique is based on the transference theorems given by Banaszczyk which imply some necessary conditions on the coefficients of the closest vectors with respect to a basis whose dual is HKZ reduced. Recursively, starting with the last coefficient, intervals of length i can be derived for the i-th coefficient of any closest vector. This leads to n! candidates for closest vectors. In this paper we refine the necessary conditions derived from the transference theorems, giving an exponential reductio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.5273","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-18T04:03:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"33OGfJUSXzzg7MoJe4XqYzmQpXrvdyP8ekL11RkAT3MIoOMQdQMKysL/4/Sx99L3Z8/iqcjFcnNRSxzsva+eAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T01:08:45.619859Z"},"content_sha256":"3b9fe4e57344f1a43d4298d07e71bac8d1360b9528b81141ba6cb07723d0b3b1","schema_version":"1.0","event_id":"sha256:3b9fe4e57344f1a43d4298d07e71bac8d1360b9528b81141ba6cb07723d0b3b1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3ORUNDLRZEXRROPQBNWA7NJUOP/bundle.json","state_url":"https://pith.science/pith/3ORUNDLRZEXRROPQBNWA7NJUOP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3ORUNDLRZEXRROPQBNWA7NJUOP/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-26T01:08:45Z","links":{"resolver":"https://pith.science/pith/3ORUNDLRZEXRROPQBNWA7NJUOP","bundle":"https://pith.science/pith/3ORUNDLRZEXRROPQBNWA7NJUOP/bundle.json","state":"https://pith.science/pith/3ORUNDLRZEXRROPQBNWA7NJUOP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3ORUNDLRZEXRROPQBNWA7NJUOP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:3ORUNDLRZEXRROPQBNWA7NJUOP","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":"027d3e668badc77a2b6e1c04eda83a78aaeb2600e9c67dd4591b594c0193b31a","cross_cats_sorted":["cs.CR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-01-25T13:58:40Z","title_canon_sha256":"96424449d1f647734861a4dd4186c05fde0dc07603b996ecc2446b517ed25b0d"},"schema_version":"1.0","source":{"id":"1201.5273","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.5273","created_at":"2026-05-18T04:03:55Z"},{"alias_kind":"arxiv_version","alias_value":"1201.5273v1","created_at":"2026-05-18T04:03:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.5273","created_at":"2026-05-18T04:03:55Z"},{"alias_kind":"pith_short_12","alias_value":"3ORUNDLRZEXR","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"3ORUNDLRZEXRROPQ","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"3ORUNDLR","created_at":"2026-05-18T12:26:53Z"}],"graph_snapshots":[{"event_id":"sha256:3b9fe4e57344f1a43d4298d07e71bac8d1360b9528b81141ba6cb07723d0b3b1","target":"graph","created_at":"2026-05-18T04:03:55Z","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":"In this paper we review the technique to solve the CVP based on dual HKZ-bases by J. Bloemer. The technique is based on the transference theorems given by Banaszczyk which imply some necessary conditions on the coefficients of the closest vectors with respect to a basis whose dual is HKZ reduced. Recursively, starting with the last coefficient, intervals of length i can be derived for the i-th coefficient of any closest vector. This leads to n! candidates for closest vectors. In this paper we refine the necessary conditions derived from the transference theorems, giving an exponential reductio","authors_text":"Gerard Maze, Urs Wagner","cross_cats":["cs.CR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-01-25T13:58:40Z","title":"Improvements in closest point search based on dual HKZ-bases"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.5273","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:012237f525235475b132285729220193f67ff65e944dc6cc8ee42cf79a3c2772","target":"record","created_at":"2026-05-18T04:03:55Z","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":"027d3e668badc77a2b6e1c04eda83a78aaeb2600e9c67dd4591b594c0193b31a","cross_cats_sorted":["cs.CR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-01-25T13:58:40Z","title_canon_sha256":"96424449d1f647734861a4dd4186c05fde0dc07603b996ecc2446b517ed25b0d"},"schema_version":"1.0","source":{"id":"1201.5273","kind":"arxiv","version":1}},"canonical_sha256":"dba3468d71c92f18b9f00b6c0fb53473d24faaa2353927609b606464eedfa9da","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dba3468d71c92f18b9f00b6c0fb53473d24faaa2353927609b606464eedfa9da","first_computed_at":"2026-05-18T04:03:55.135274Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:03:55.135274Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pczYcKvYCZz6fKtr0x8fX3svNe6LMNNUwk5lTzjUI0CCqqC5ZvU/agdexR5Nn1sORnYn8v1WJnoXgZuSooxHBw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:03:55.135756Z","signed_message":"canonical_sha256_bytes"},"source_id":"1201.5273","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:012237f525235475b132285729220193f67ff65e944dc6cc8ee42cf79a3c2772","sha256:3b9fe4e57344f1a43d4298d07e71bac8d1360b9528b81141ba6cb07723d0b3b1"],"state_sha256":"130650280091530f1e84294dd4ace5929932ce74dfe86eb5fbae53a0b606e01b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oJ2axPgj9mN5AqJoi97ikCqIHsbyrCslh4Vdafje6m6cnLgtMFE9T3UbK9ryG6I1GR7bEUOXcyubxJMKxenSAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T01:08:45.621786Z","bundle_sha256":"9d105c4b88872b297703aa7a9dde492c8e93f816096b3ddf42b93f5c0fd847f1"}}