{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:WFP7XIEZ5MGT6UVFMN6UDREYVM","short_pith_number":"pith:WFP7XIEZ","schema_version":"1.0","canonical_sha256":"b15ffba099eb0d3f52a5637d41c498ab33f14b49fadd3ae4bcfd671e5b4bf77c","source":{"kind":"arxiv","id":"1810.11396","version":1},"attestation_state":"computed","paper":{"title":"On the complexity of class group computations for large degree number fields","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SC"],"primary_cat":"math.NT","authors_text":"Alexandre G\\'elin","submitted_at":"2018-10-26T15:45:50Z","abstract_excerpt":"In this paper, we examine the general algorithm for class group computations, when we do not have a small defining polynomial for the number field. Based on a result of Biasse and Fieker, we simplify their algorithm, improve the complexity analysis and identify the optimal parameters to reduce the runtime. We make use of the classes $\\mathcal D$ defined in [GJ16] for classifying the fields according to the size of the extension degree and prove that they enable to describe all the number fields."},"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":"1810.11396","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2018-10-26T15:45:50Z","cross_cats_sorted":["cs.SC"],"title_canon_sha256":"aa97ea15e083b00311aee374cec66bdc44a29c971f16b78d2dfad92498163061","abstract_canon_sha256":"33dbd13cbd91f60d4686cf9906e23a15bf8bddd9fab660b297eb153c072240bf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:14.242060Z","signature_b64":"Ud3y5L2Giys/f0W4d6c96pkWQAk+KdckbOh3lDq9l7Lr/oMNBOmOhc7zwyUUd3HJoKwGGx82MKtcRhDMn3F9AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b15ffba099eb0d3f52a5637d41c498ab33f14b49fadd3ae4bcfd671e5b4bf77c","last_reissued_at":"2026-05-18T00:02:14.241491Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:14.241491Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the complexity of class group computations for large degree number fields","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SC"],"primary_cat":"math.NT","authors_text":"Alexandre G\\'elin","submitted_at":"2018-10-26T15:45:50Z","abstract_excerpt":"In this paper, we examine the general algorithm for class group computations, when we do not have a small defining polynomial for the number field. Based on a result of Biasse and Fieker, we simplify their algorithm, improve the complexity analysis and identify the optimal parameters to reduce the runtime. We make use of the classes $\\mathcal D$ defined in [GJ16] for classifying the fields according to the size of the extension degree and prove that they enable to describe all the number fields."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.11396","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":"1810.11396","created_at":"2026-05-18T00:02:14.241599+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.11396v1","created_at":"2026-05-18T00:02:14.241599+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.11396","created_at":"2026-05-18T00:02:14.241599+00:00"},{"alias_kind":"pith_short_12","alias_value":"WFP7XIEZ5MGT","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_16","alias_value":"WFP7XIEZ5MGT6UVF","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_8","alias_value":"WFP7XIEZ","created_at":"2026-05-18T12:32:59.047623+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/WFP7XIEZ5MGT6UVFMN6UDREYVM","json":"https://pith.science/pith/WFP7XIEZ5MGT6UVFMN6UDREYVM.json","graph_json":"https://pith.science/api/pith-number/WFP7XIEZ5MGT6UVFMN6UDREYVM/graph.json","events_json":"https://pith.science/api/pith-number/WFP7XIEZ5MGT6UVFMN6UDREYVM/events.json","paper":"https://pith.science/paper/WFP7XIEZ"},"agent_actions":{"view_html":"https://pith.science/pith/WFP7XIEZ5MGT6UVFMN6UDREYVM","download_json":"https://pith.science/pith/WFP7XIEZ5MGT6UVFMN6UDREYVM.json","view_paper":"https://pith.science/paper/WFP7XIEZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.11396&json=true","fetch_graph":"https://pith.science/api/pith-number/WFP7XIEZ5MGT6UVFMN6UDREYVM/graph.json","fetch_events":"https://pith.science/api/pith-number/WFP7XIEZ5MGT6UVFMN6UDREYVM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WFP7XIEZ5MGT6UVFMN6UDREYVM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WFP7XIEZ5MGT6UVFMN6UDREYVM/action/storage_attestation","attest_author":"https://pith.science/pith/WFP7XIEZ5MGT6UVFMN6UDREYVM/action/author_attestation","sign_citation":"https://pith.science/pith/WFP7XIEZ5MGT6UVFMN6UDREYVM/action/citation_signature","submit_replication":"https://pith.science/pith/WFP7XIEZ5MGT6UVFMN6UDREYVM/action/replication_record"}},"created_at":"2026-05-18T00:02:14.241599+00:00","updated_at":"2026-05-18T00:02:14.241599+00:00"}