{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:UZI4XYXDPQ4TBIU6P2OARYZJES","short_pith_number":"pith:UZI4XYXD","schema_version":"1.0","canonical_sha256":"a651cbe2e37c3930a29e7e9c08e3292498bd614e877bea1e11520329c2a0a10b","source":{"kind":"arxiv","id":"1202.6019","version":1},"attestation_state":"computed","paper":{"title":"The Euclidean Algorithm in Cubic Number Fields","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Franz Lemmermeyer, Stefania Cavallar","submitted_at":"2012-02-27T18:27:40Z","abstract_excerpt":"In this note we present algorithms for computing Euclidean minima of cubic number fields; in particular, we were able to find all norm-Euclidean cubic number fields with discriminants -999 < d < 10000."},"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":"1202.6019","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2012-02-27T18:27:40Z","cross_cats_sorted":[],"title_canon_sha256":"10890fef9b76b0a0c44c8bdb82007b41ebb9d5b6298bbfa0afa21b8638187ed9","abstract_canon_sha256":"aa33db8069983aa3211c223989c2a1b885e1aa796aac824bea55931a6b1f2b46"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:01:24.074655Z","signature_b64":"NcFo4t1knS9Nl66f3t81BbTQhwu5camOsR5L7hscXuFXqQmRJctIkt3rdRMq3aPa/GIybchrt8h8uzLMzKUVDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a651cbe2e37c3930a29e7e9c08e3292498bd614e877bea1e11520329c2a0a10b","last_reissued_at":"2026-05-18T04:01:24.073871Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:01:24.073871Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Euclidean Algorithm in Cubic Number Fields","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Franz Lemmermeyer, Stefania Cavallar","submitted_at":"2012-02-27T18:27:40Z","abstract_excerpt":"In this note we present algorithms for computing Euclidean minima of cubic number fields; in particular, we were able to find all norm-Euclidean cubic number fields with discriminants -999 < d < 10000."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.6019","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":"1202.6019","created_at":"2026-05-18T04:01:24.073993+00:00"},{"alias_kind":"arxiv_version","alias_value":"1202.6019v1","created_at":"2026-05-18T04:01:24.073993+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.6019","created_at":"2026-05-18T04:01:24.073993+00:00"},{"alias_kind":"pith_short_12","alias_value":"UZI4XYXDPQ4T","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_16","alias_value":"UZI4XYXDPQ4TBIU6","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_8","alias_value":"UZI4XYXD","created_at":"2026-05-18T12:27:25.539911+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/UZI4XYXDPQ4TBIU6P2OARYZJES","json":"https://pith.science/pith/UZI4XYXDPQ4TBIU6P2OARYZJES.json","graph_json":"https://pith.science/api/pith-number/UZI4XYXDPQ4TBIU6P2OARYZJES/graph.json","events_json":"https://pith.science/api/pith-number/UZI4XYXDPQ4TBIU6P2OARYZJES/events.json","paper":"https://pith.science/paper/UZI4XYXD"},"agent_actions":{"view_html":"https://pith.science/pith/UZI4XYXDPQ4TBIU6P2OARYZJES","download_json":"https://pith.science/pith/UZI4XYXDPQ4TBIU6P2OARYZJES.json","view_paper":"https://pith.science/paper/UZI4XYXD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1202.6019&json=true","fetch_graph":"https://pith.science/api/pith-number/UZI4XYXDPQ4TBIU6P2OARYZJES/graph.json","fetch_events":"https://pith.science/api/pith-number/UZI4XYXDPQ4TBIU6P2OARYZJES/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UZI4XYXDPQ4TBIU6P2OARYZJES/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UZI4XYXDPQ4TBIU6P2OARYZJES/action/storage_attestation","attest_author":"https://pith.science/pith/UZI4XYXDPQ4TBIU6P2OARYZJES/action/author_attestation","sign_citation":"https://pith.science/pith/UZI4XYXDPQ4TBIU6P2OARYZJES/action/citation_signature","submit_replication":"https://pith.science/pith/UZI4XYXDPQ4TBIU6P2OARYZJES/action/replication_record"}},"created_at":"2026-05-18T04:01:24.073993+00:00","updated_at":"2026-05-18T04:01:24.073993+00:00"}