{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:EGO6YNTG7XZKABI7RWWGRBY2Q7","short_pith_number":"pith:EGO6YNTG","schema_version":"1.0","canonical_sha256":"219dec3666fdf2a0051f8dac68871a87e474ea8629321fd5b5526b1d8fb26d4f","source":{"kind":"arxiv","id":"1501.00178","version":3},"attestation_state":"computed","paper":{"title":"Lattices with Symmetry","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"math.NT","authors_text":"A. Silverberg, H. W. Lenstra Jr.","submitted_at":"2014-12-31T17:32:08Z","abstract_excerpt":"For large ranks, there is no good algorithm that decides whether a given lattice has an orthonormal basis. But when the lattice is given with enough symmetry, we can construct a provably deterministic polynomial-time algorithm to accomplish this, based on the work of Gentry and Szydlo. The techniques involve algorithmic algebraic number theory, analytic number theory, commutative algebra, and lattice basis reduction."},"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":"1501.00178","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2014-12-31T17:32:08Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"21e165fded171144ebcf3407d2a68daab445503a333871e9e9aa32b6f1d60d01","abstract_canon_sha256":"6cc2069cc9527d2846909f20a809bb78fedd9ba4b1c34a343b96da1932d61f07"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:03:24.063338Z","signature_b64":"1bWJfM9I+F94N/AbsFNnoRuzyPqCgGfvrNuefDk7WUtDI36XYJF2WtIKATnXBIKB+1Xi5p5lQwYSiZcHyO4kAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"219dec3666fdf2a0051f8dac68871a87e474ea8629321fd5b5526b1d8fb26d4f","last_reissued_at":"2026-05-18T01:03:24.062875Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:03:24.062875Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lattices with Symmetry","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"math.NT","authors_text":"A. Silverberg, H. W. Lenstra Jr.","submitted_at":"2014-12-31T17:32:08Z","abstract_excerpt":"For large ranks, there is no good algorithm that decides whether a given lattice has an orthonormal basis. But when the lattice is given with enough symmetry, we can construct a provably deterministic polynomial-time algorithm to accomplish this, based on the work of Gentry and Szydlo. The techniques involve algorithmic algebraic number theory, analytic number theory, commutative algebra, and lattice basis reduction."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.00178","kind":"arxiv","version":3},"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":"1501.00178","created_at":"2026-05-18T01:03:24.062953+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.00178v3","created_at":"2026-05-18T01:03:24.062953+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.00178","created_at":"2026-05-18T01:03:24.062953+00:00"},{"alias_kind":"pith_short_12","alias_value":"EGO6YNTG7XZK","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_16","alias_value":"EGO6YNTG7XZKABI7","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_8","alias_value":"EGO6YNTG","created_at":"2026-05-18T12:28:25.294606+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/EGO6YNTG7XZKABI7RWWGRBY2Q7","json":"https://pith.science/pith/EGO6YNTG7XZKABI7RWWGRBY2Q7.json","graph_json":"https://pith.science/api/pith-number/EGO6YNTG7XZKABI7RWWGRBY2Q7/graph.json","events_json":"https://pith.science/api/pith-number/EGO6YNTG7XZKABI7RWWGRBY2Q7/events.json","paper":"https://pith.science/paper/EGO6YNTG"},"agent_actions":{"view_html":"https://pith.science/pith/EGO6YNTG7XZKABI7RWWGRBY2Q7","download_json":"https://pith.science/pith/EGO6YNTG7XZKABI7RWWGRBY2Q7.json","view_paper":"https://pith.science/paper/EGO6YNTG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.00178&json=true","fetch_graph":"https://pith.science/api/pith-number/EGO6YNTG7XZKABI7RWWGRBY2Q7/graph.json","fetch_events":"https://pith.science/api/pith-number/EGO6YNTG7XZKABI7RWWGRBY2Q7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EGO6YNTG7XZKABI7RWWGRBY2Q7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EGO6YNTG7XZKABI7RWWGRBY2Q7/action/storage_attestation","attest_author":"https://pith.science/pith/EGO6YNTG7XZKABI7RWWGRBY2Q7/action/author_attestation","sign_citation":"https://pith.science/pith/EGO6YNTG7XZKABI7RWWGRBY2Q7/action/citation_signature","submit_replication":"https://pith.science/pith/EGO6YNTG7XZKABI7RWWGRBY2Q7/action/replication_record"}},"created_at":"2026-05-18T01:03:24.062953+00:00","updated_at":"2026-05-18T01:03:24.062953+00:00"}