{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:HY55MUPDSDFAH5EX4NQMEHN7YV","short_pith_number":"pith:HY55MUPD","schema_version":"1.0","canonical_sha256":"3e3bd651e390ca03f497e360c21dbfc57533ec0b132e38b3c08cd011be7013b0","source":{"kind":"arxiv","id":"1103.2901","version":4},"attestation_state":"computed","paper":{"title":"An algorithm to compute relative cubic fields","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Anna Morra","submitted_at":"2011-03-15T13:30:17Z","abstract_excerpt":"Let k be an imaginary quadratic number field (with class number 1). We describe a new, essentially linear-time algorithm, to list all isomorphism classes of cubic extensions L/k up to a bound X on the norm of the relative discriminant ideal. The main tools are Taniguchi's generalization of Davenport-Heilbronn parametrisation of cubic extensions, and reduction theory for binary cubic forms over imaginary quadratic fields. Finally, we give numerical data for k=Q(i), and we compare our results with ray class field algorithm ones, and with asymptotic heuristics, based on a generalization of Robert"},"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":"1103.2901","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2011-03-15T13:30:17Z","cross_cats_sorted":[],"title_canon_sha256":"7abcf74f11f792342e7c6fe2903f140203bfbd8e0cf776506ba054aca1544022","abstract_canon_sha256":"5b8e7b2dff69a1fa626f11158666faee55e461d41ebbe4c6aaa0dee9f8490336"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:14:45.015070Z","signature_b64":"KmJ2aIf5AUqvo/ITfesFaZ41fJNfZxWHerAXTC4o9NHzMb75H/gojX8QuhEiSpiIzG0D+BVOOKiMtxEOT72iBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3e3bd651e390ca03f497e360c21dbfc57533ec0b132e38b3c08cd011be7013b0","last_reissued_at":"2026-05-18T04:14:45.014655Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:14:45.014655Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An algorithm to compute relative cubic fields","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Anna Morra","submitted_at":"2011-03-15T13:30:17Z","abstract_excerpt":"Let k be an imaginary quadratic number field (with class number 1). We describe a new, essentially linear-time algorithm, to list all isomorphism classes of cubic extensions L/k up to a bound X on the norm of the relative discriminant ideal. The main tools are Taniguchi's generalization of Davenport-Heilbronn parametrisation of cubic extensions, and reduction theory for binary cubic forms over imaginary quadratic fields. Finally, we give numerical data for k=Q(i), and we compare our results with ray class field algorithm ones, and with asymptotic heuristics, based on a generalization of Robert"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.2901","kind":"arxiv","version":4},"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":"1103.2901","created_at":"2026-05-18T04:14:45.014714+00:00"},{"alias_kind":"arxiv_version","alias_value":"1103.2901v4","created_at":"2026-05-18T04:14:45.014714+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.2901","created_at":"2026-05-18T04:14:45.014714+00:00"},{"alias_kind":"pith_short_12","alias_value":"HY55MUPDSDFA","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_16","alias_value":"HY55MUPDSDFAH5EX","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_8","alias_value":"HY55MUPD","created_at":"2026-05-18T12:26:30.835961+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/HY55MUPDSDFAH5EX4NQMEHN7YV","json":"https://pith.science/pith/HY55MUPDSDFAH5EX4NQMEHN7YV.json","graph_json":"https://pith.science/api/pith-number/HY55MUPDSDFAH5EX4NQMEHN7YV/graph.json","events_json":"https://pith.science/api/pith-number/HY55MUPDSDFAH5EX4NQMEHN7YV/events.json","paper":"https://pith.science/paper/HY55MUPD"},"agent_actions":{"view_html":"https://pith.science/pith/HY55MUPDSDFAH5EX4NQMEHN7YV","download_json":"https://pith.science/pith/HY55MUPDSDFAH5EX4NQMEHN7YV.json","view_paper":"https://pith.science/paper/HY55MUPD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1103.2901&json=true","fetch_graph":"https://pith.science/api/pith-number/HY55MUPDSDFAH5EX4NQMEHN7YV/graph.json","fetch_events":"https://pith.science/api/pith-number/HY55MUPDSDFAH5EX4NQMEHN7YV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HY55MUPDSDFAH5EX4NQMEHN7YV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HY55MUPDSDFAH5EX4NQMEHN7YV/action/storage_attestation","attest_author":"https://pith.science/pith/HY55MUPDSDFAH5EX4NQMEHN7YV/action/author_attestation","sign_citation":"https://pith.science/pith/HY55MUPDSDFAH5EX4NQMEHN7YV/action/citation_signature","submit_replication":"https://pith.science/pith/HY55MUPDSDFAH5EX4NQMEHN7YV/action/replication_record"}},"created_at":"2026-05-18T04:14:45.014714+00:00","updated_at":"2026-05-18T04:14:45.014714+00:00"}