{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:GJ26ZGECNK3P2Z23IGODEQCT4E","short_pith_number":"pith:GJ26ZGEC","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"},"canonical_sha256":"3275ec98826ab6fd675b419c324053e10e0c017c07d672a617db8205437d4cc7","source":{"kind":"arxiv","id":"1208.2481","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.2481","created_at":"2026-05-18T03:42:23Z"},{"alias_kind":"arxiv_version","alias_value":"1208.2481v3","created_at":"2026-05-18T03:42:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.2481","created_at":"2026-05-18T03:42:23Z"},{"alias_kind":"pith_short_12","alias_value":"GJ26ZGECNK3P","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"GJ26ZGECNK3P2Z23","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"GJ26ZGEC","created_at":"2026-05-18T12:27:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:GJ26ZGECNK3P2Z23IGODEQCT4E","target":"record","payload":{"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"},"canonical_sha256":"3275ec98826ab6fd675b419c324053e10e0c017c07d672a617db8205437d4cc7","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"},"source_kind":"arxiv","source_id":"1208.2481","source_version":3,"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-18T03:42:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QlYgGHPx9AmDa46OWYW40hiZobfIIh2KPYrc6/p/qG7Ppk0nYP9MBuoZT1KA2SQkZ+hcuPKG8rPvD8wGiuD9Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T13:39:06.820070Z"},"content_sha256":"cee31bcab9dba02f96225a8a5aebdfdaf5196f34eb6ac0f4fd44f6c6e949e5d8","schema_version":"1.0","event_id":"sha256:cee31bcab9dba02f96225a8a5aebdfdaf5196f34eb6ac0f4fd44f6c6e949e5d8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:GJ26ZGECNK3P2Z23IGODEQCT4E","target":"graph","payload":{"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"},"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-18T03:42:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MFfavqAtu8p1nliqaWHIcIsNa47iHjFA2uphCIXsj4ZKKUCywsnX9kaTguqGFTfa0QPCBWbj8bVRt7BEvn3nAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T13:39:06.820412Z"},"content_sha256":"6f509968be94743a7634284857e116dfb66cf1f1b0ff5ac92003adf40b94cfe6","schema_version":"1.0","event_id":"sha256:6f509968be94743a7634284857e116dfb66cf1f1b0ff5ac92003adf40b94cfe6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GJ26ZGECNK3P2Z23IGODEQCT4E/bundle.json","state_url":"https://pith.science/pith/GJ26ZGECNK3P2Z23IGODEQCT4E/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GJ26ZGECNK3P2Z23IGODEQCT4E/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-27T13:39:06Z","links":{"resolver":"https://pith.science/pith/GJ26ZGECNK3P2Z23IGODEQCT4E","bundle":"https://pith.science/pith/GJ26ZGECNK3P2Z23IGODEQCT4E/bundle.json","state":"https://pith.science/pith/GJ26ZGECNK3P2Z23IGODEQCT4E/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GJ26ZGECNK3P2Z23IGODEQCT4E/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:GJ26ZGECNK3P2Z23IGODEQCT4E","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":"5404b340d96126ea797868c4a01a0c1ff3413472616af4968c7930726496644c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2012-08-13T02:08:00Z","title_canon_sha256":"9e24ce8c2045b9b1e91963b3b6c7cea62dda3ec77f748d25bc2a75e4246254b9"},"schema_version":"1.0","source":{"id":"1208.2481","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.2481","created_at":"2026-05-18T03:42:23Z"},{"alias_kind":"arxiv_version","alias_value":"1208.2481v3","created_at":"2026-05-18T03:42:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.2481","created_at":"2026-05-18T03:42:23Z"},{"alias_kind":"pith_short_12","alias_value":"GJ26ZGECNK3P","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"GJ26ZGECNK3P2Z23","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"GJ26ZGEC","created_at":"2026-05-18T12:27:06Z"}],"graph_snapshots":[{"event_id":"sha256:6f509968be94743a7634284857e116dfb66cf1f1b0ff5ac92003adf40b94cfe6","target":"graph","created_at":"2026-05-18T03:42:23Z","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 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","authors_text":"Jonathan Hanke","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2012-08-13T02:08:00Z","title":"Algorithms for computing maximal lattices in bilinear (and quadratic) spaces over number fields"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.2481","kind":"arxiv","version":3},"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:cee31bcab9dba02f96225a8a5aebdfdaf5196f34eb6ac0f4fd44f6c6e949e5d8","target":"record","created_at":"2026-05-18T03:42:23Z","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":"5404b340d96126ea797868c4a01a0c1ff3413472616af4968c7930726496644c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2012-08-13T02:08:00Z","title_canon_sha256":"9e24ce8c2045b9b1e91963b3b6c7cea62dda3ec77f748d25bc2a75e4246254b9"},"schema_version":"1.0","source":{"id":"1208.2481","kind":"arxiv","version":3}},"canonical_sha256":"3275ec98826ab6fd675b419c324053e10e0c017c07d672a617db8205437d4cc7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3275ec98826ab6fd675b419c324053e10e0c017c07d672a617db8205437d4cc7","first_computed_at":"2026-05-18T03:42:23.628443Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:42:23.628443Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zJfojyWtTFZ/oj5TDsIqpOHlw0cmnTJ0yDD31QQZHDGMx9kgxwgUawEJw8jJAloHb1wbUTETXi2cp3szUVGrCA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:42:23.628869Z","signed_message":"canonical_sha256_bytes"},"source_id":"1208.2481","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cee31bcab9dba02f96225a8a5aebdfdaf5196f34eb6ac0f4fd44f6c6e949e5d8","sha256:6f509968be94743a7634284857e116dfb66cf1f1b0ff5ac92003adf40b94cfe6"],"state_sha256":"8aad396f3d21851324fb509e95e03312eeb1c8a20a164638ca50ef421580545d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ImAPJofjKZwOQIjDSsnI7gYz6cBbO0TFfbtkKPGdvCb7qdbAYG5nRchEcc6ivuX1a1quQooX5NJbkMugx/2YBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T13:39:06.823727Z","bundle_sha256":"4b6b01cb3effeba81b369d1f063d972509ac938854d7e5f1df9baa6ce9ff6158"}}