{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:GJ26ZGECNK3P2Z23IGODEQCT4E","short_pith_number":"pith:GJ26ZGEC","schema_version":"1.0","canonical_sha256":"3275ec98826ab6fd675b419c324053e10e0c017c07d672a617db8205437d4cc7","source":{"kind":"arxiv","id":"1208.2481","version":3},"attestation_state":"computed","paper":{"title":"Algorithms for computing maximal lattices in bilinear (and quadratic) spaces over number fields","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Jonathan Hanke","submitted_at":"2012-08-13T02:08:00Z","abstract_excerpt":"In this paper we describe an algorithm that quickly computes a maximal a-valued lattice in an F-vector space equipped with a non-degenerate bilinear form, where a is a fractional ideal in a number field F. We then apply this construction to give an algorithm to compute an a-maximal lattice in a quadratic space over any number field F where the prime 2 is unramified. We also develop the theory of p-neighbors for a-valued quadratic lattices at an arbitrary prime p of O_F (including when p | 2) and prove its close connection to the residual geometry of certain quadrics mod p. Finally we give a we"},"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":"1208.2481","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2012-08-13T02:08:00Z","cross_cats_sorted":[],"title_canon_sha256":"9e24ce8c2045b9b1e91963b3b6c7cea62dda3ec77f748d25bc2a75e4246254b9","abstract_canon_sha256":"5404b340d96126ea797868c4a01a0c1ff3413472616af4968c7930726496644c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:42:23.628869Z","signature_b64":"zJfojyWtTFZ/oj5TDsIqpOHlw0cmnTJ0yDD31QQZHDGMx9kgxwgUawEJw8jJAloHb1wbUTETXi2cp3szUVGrCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3275ec98826ab6fd675b419c324053e10e0c017c07d672a617db8205437d4cc7","last_reissued_at":"2026-05-18T03:42:23.628443Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:42:23.628443Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Algorithms for computing maximal lattices in bilinear (and quadratic) spaces over number fields","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Jonathan Hanke","submitted_at":"2012-08-13T02:08:00Z","abstract_excerpt":"In this paper we describe an algorithm that quickly computes a maximal a-valued lattice in an F-vector space equipped with a non-degenerate bilinear form, where a is a fractional ideal in a number field F. We then apply this construction to give an algorithm to compute an a-maximal lattice in a quadratic space over any number field F where the prime 2 is unramified. We also develop the theory of p-neighbors for a-valued quadratic lattices at an arbitrary prime p of O_F (including when p | 2) and prove its close connection to the residual geometry of certain quadrics mod p. Finally we give a we"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.2481","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":"1208.2481","created_at":"2026-05-18T03:42:23.628505+00:00"},{"alias_kind":"arxiv_version","alias_value":"1208.2481v3","created_at":"2026-05-18T03:42:23.628505+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.2481","created_at":"2026-05-18T03:42:23.628505+00:00"},{"alias_kind":"pith_short_12","alias_value":"GJ26ZGECNK3P","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_16","alias_value":"GJ26ZGECNK3P2Z23","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_8","alias_value":"GJ26ZGEC","created_at":"2026-05-18T12:27:06.952714+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/GJ26ZGECNK3P2Z23IGODEQCT4E","json":"https://pith.science/pith/GJ26ZGECNK3P2Z23IGODEQCT4E.json","graph_json":"https://pith.science/api/pith-number/GJ26ZGECNK3P2Z23IGODEQCT4E/graph.json","events_json":"https://pith.science/api/pith-number/GJ26ZGECNK3P2Z23IGODEQCT4E/events.json","paper":"https://pith.science/paper/GJ26ZGEC"},"agent_actions":{"view_html":"https://pith.science/pith/GJ26ZGECNK3P2Z23IGODEQCT4E","download_json":"https://pith.science/pith/GJ26ZGECNK3P2Z23IGODEQCT4E.json","view_paper":"https://pith.science/paper/GJ26ZGEC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1208.2481&json=true","fetch_graph":"https://pith.science/api/pith-number/GJ26ZGECNK3P2Z23IGODEQCT4E/graph.json","fetch_events":"https://pith.science/api/pith-number/GJ26ZGECNK3P2Z23IGODEQCT4E/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GJ26ZGECNK3P2Z23IGODEQCT4E/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GJ26ZGECNK3P2Z23IGODEQCT4E/action/storage_attestation","attest_author":"https://pith.science/pith/GJ26ZGECNK3P2Z23IGODEQCT4E/action/author_attestation","sign_citation":"https://pith.science/pith/GJ26ZGECNK3P2Z23IGODEQCT4E/action/citation_signature","submit_replication":"https://pith.science/pith/GJ26ZGECNK3P2Z23IGODEQCT4E/action/replication_record"}},"created_at":"2026-05-18T03:42:23.628505+00:00","updated_at":"2026-05-18T03:42:23.628505+00:00"}