{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2004:EE3JJ4T5ZZ4EKOEFAEOATBO7Q6","short_pith_number":"pith:EE3JJ4T5","schema_version":"1.0","canonical_sha256":"213694f27dce78453885011c0985df8784104a7c90f8aebfecf7e2587b1b1c09","source":{"kind":"arxiv","id":"cs/0412006","version":1},"attestation_state":"computed","paper":{"title":"The Accelerated Euclidean Algorithm","license":"","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Sidi Mohamed Sedjelmaci (LIPN)","submitted_at":"2004-12-02T15:01:39Z","abstract_excerpt":"We present a new GCD algorithm of two integers or polynomials. The algorithm is iterative and its time complexity is still $O(n \\\\log^2 n ~ log \\\\log n)$ for $n$-bit inputs."},"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":"cs/0412006","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.DS","submitted_at":"2004-12-02T15:01:39Z","cross_cats_sorted":[],"title_canon_sha256":"a4af240b9798cbe6867dec4d402997d95cfdefe6ee1c0cac101bd126c88ad413","abstract_canon_sha256":"2a75d27434b0897c096e4369424b82c759c319ef59a34c60381584e42cc89cb0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:24:49.662500Z","signature_b64":"BSS2XuhZ3P0qw/+cak+Ewk0yoknh13r09PEDVrhjtYnCEHZT7xha5YRFI8QU9o4LDHs8tmP2ZKIaWAzgddmRCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"213694f27dce78453885011c0985df8784104a7c90f8aebfecf7e2587b1b1c09","last_reissued_at":"2026-07-04T14:24:49.661955Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:24:49.661955Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Accelerated Euclidean Algorithm","license":"","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Sidi Mohamed Sedjelmaci (LIPN)","submitted_at":"2004-12-02T15:01:39Z","abstract_excerpt":"We present a new GCD algorithm of two integers or polynomials. The algorithm is iterative and its time complexity is still $O(n \\\\log^2 n ~ log \\\\log n)$ for $n$-bit inputs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0412006","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/cs/0412006/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"cs/0412006","created_at":"2026-07-04T14:24:49.662039+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/0412006v1","created_at":"2026-07-04T14:24:49.662039+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0412006","created_at":"2026-07-04T14:24:49.662039+00:00"},{"alias_kind":"pith_short_12","alias_value":"EE3JJ4T5ZZ4E","created_at":"2026-07-04T14:24:49.662039+00:00"},{"alias_kind":"pith_short_16","alias_value":"EE3JJ4T5ZZ4EKOEF","created_at":"2026-07-04T14:24:49.662039+00:00"},{"alias_kind":"pith_short_8","alias_value":"EE3JJ4T5","created_at":"2026-07-04T14:24:49.662039+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/EE3JJ4T5ZZ4EKOEFAEOATBO7Q6","json":"https://pith.science/pith/EE3JJ4T5ZZ4EKOEFAEOATBO7Q6.json","graph_json":"https://pith.science/api/pith-number/EE3JJ4T5ZZ4EKOEFAEOATBO7Q6/graph.json","events_json":"https://pith.science/api/pith-number/EE3JJ4T5ZZ4EKOEFAEOATBO7Q6/events.json","paper":"https://pith.science/paper/EE3JJ4T5"},"agent_actions":{"view_html":"https://pith.science/pith/EE3JJ4T5ZZ4EKOEFAEOATBO7Q6","download_json":"https://pith.science/pith/EE3JJ4T5ZZ4EKOEFAEOATBO7Q6.json","view_paper":"https://pith.science/paper/EE3JJ4T5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/0412006&json=true","fetch_graph":"https://pith.science/api/pith-number/EE3JJ4T5ZZ4EKOEFAEOATBO7Q6/graph.json","fetch_events":"https://pith.science/api/pith-number/EE3JJ4T5ZZ4EKOEFAEOATBO7Q6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EE3JJ4T5ZZ4EKOEFAEOATBO7Q6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EE3JJ4T5ZZ4EKOEFAEOATBO7Q6/action/storage_attestation","attest_author":"https://pith.science/pith/EE3JJ4T5ZZ4EKOEFAEOATBO7Q6/action/author_attestation","sign_citation":"https://pith.science/pith/EE3JJ4T5ZZ4EKOEFAEOATBO7Q6/action/citation_signature","submit_replication":"https://pith.science/pith/EE3JJ4T5ZZ4EKOEFAEOATBO7Q6/action/replication_record"}},"created_at":"2026-07-04T14:24:49.662039+00:00","updated_at":"2026-07-04T14:24:49.662039+00:00"}