{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:QH2PNRLGHG32UINWUQYH2TCIRM","short_pith_number":"pith:QH2PNRLG","schema_version":"1.0","canonical_sha256":"81f4f6c56639b7aa21b6a4307d4c488b3cc935117f2e9632469380cf2691989a","source":{"kind":"arxiv","id":"1201.5154","version":1},"attestation_state":"computed","paper":{"title":"Finding short vectors in a lattice of Voronoi's first kind","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.IT"],"primary_cat":"cs.IT","authors_text":"Alex Grant, Robby McKilliam","submitted_at":"2012-01-24T23:17:18Z","abstract_excerpt":"We show that for those lattices of Voronoi's first kind, a vector of shortest nonzero Euclidean length can computed in polynomial time by computing a minimum cut in a graph."},"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":"1201.5154","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-01-24T23:17:18Z","cross_cats_sorted":["cs.DS","math.IT"],"title_canon_sha256":"209639040a4b0160e2d4810b384cee63b7191ad06fa5bde0657fe2c554eb52bd","abstract_canon_sha256":"52c98d4fe6f1481357bfd3354a5bcceb5d4a06f8857d30a4797c7996e4f954d0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:03:55.464303Z","signature_b64":"hyW9frKP2WA0e6JFEVgAycgDrUmNLOby4ugpTH3phujw5WduI6OIYqDKV7d7GTdM2OBQL62ya66pW/GBsttCCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"81f4f6c56639b7aa21b6a4307d4c488b3cc935117f2e9632469380cf2691989a","last_reissued_at":"2026-05-18T04:03:55.463845Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:03:55.463845Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Finding short vectors in a lattice of Voronoi's first kind","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.IT"],"primary_cat":"cs.IT","authors_text":"Alex Grant, Robby McKilliam","submitted_at":"2012-01-24T23:17:18Z","abstract_excerpt":"We show that for those lattices of Voronoi's first kind, a vector of shortest nonzero Euclidean length can computed in polynomial time by computing a minimum cut in a graph."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.5154","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":"1201.5154","created_at":"2026-05-18T04:03:55.463912+00:00"},{"alias_kind":"arxiv_version","alias_value":"1201.5154v1","created_at":"2026-05-18T04:03:55.463912+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.5154","created_at":"2026-05-18T04:03:55.463912+00:00"},{"alias_kind":"pith_short_12","alias_value":"QH2PNRLGHG32","created_at":"2026-05-18T12:27:18.751474+00:00"},{"alias_kind":"pith_short_16","alias_value":"QH2PNRLGHG32UINW","created_at":"2026-05-18T12:27:18.751474+00:00"},{"alias_kind":"pith_short_8","alias_value":"QH2PNRLG","created_at":"2026-05-18T12:27:18.751474+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/QH2PNRLGHG32UINWUQYH2TCIRM","json":"https://pith.science/pith/QH2PNRLGHG32UINWUQYH2TCIRM.json","graph_json":"https://pith.science/api/pith-number/QH2PNRLGHG32UINWUQYH2TCIRM/graph.json","events_json":"https://pith.science/api/pith-number/QH2PNRLGHG32UINWUQYH2TCIRM/events.json","paper":"https://pith.science/paper/QH2PNRLG"},"agent_actions":{"view_html":"https://pith.science/pith/QH2PNRLGHG32UINWUQYH2TCIRM","download_json":"https://pith.science/pith/QH2PNRLGHG32UINWUQYH2TCIRM.json","view_paper":"https://pith.science/paper/QH2PNRLG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1201.5154&json=true","fetch_graph":"https://pith.science/api/pith-number/QH2PNRLGHG32UINWUQYH2TCIRM/graph.json","fetch_events":"https://pith.science/api/pith-number/QH2PNRLGHG32UINWUQYH2TCIRM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QH2PNRLGHG32UINWUQYH2TCIRM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QH2PNRLGHG32UINWUQYH2TCIRM/action/storage_attestation","attest_author":"https://pith.science/pith/QH2PNRLGHG32UINWUQYH2TCIRM/action/author_attestation","sign_citation":"https://pith.science/pith/QH2PNRLGHG32UINWUQYH2TCIRM/action/citation_signature","submit_replication":"https://pith.science/pith/QH2PNRLGHG32UINWUQYH2TCIRM/action/replication_record"}},"created_at":"2026-05-18T04:03:55.463912+00:00","updated_at":"2026-05-18T04:03:55.463912+00:00"}