{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:BRD35CJARZFYHBG7LRHQ5IRYDW","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":"43a61860bc6cc5bbf4493ecc920f3daba5255828a618257ef6cc7e28ce15ed4b","cross_cats_sorted":["cs.DM","math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-02-10T20:43:46Z","title_canon_sha256":"43be9911d491f4504a9041a1407c8fcf94bc140bfb4f1f6ffed19b6802e0b6e2"},"schema_version":"1.0","source":{"id":"1402.2266","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.2266","created_at":"2026-05-18T02:59:31Z"},{"alias_kind":"arxiv_version","alias_value":"1402.2266v1","created_at":"2026-05-18T02:59:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.2266","created_at":"2026-05-18T02:59:31Z"},{"alias_kind":"pith_short_12","alias_value":"BRD35CJARZFY","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"BRD35CJARZFYHBG7","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"BRD35CJA","created_at":"2026-05-18T12:28:22Z"}],"graph_snapshots":[{"event_id":"sha256:9cbf812a223639e82b4a7bd63f1f547fd7946d2bff359c61bef19d1bbe95d893","target":"graph","created_at":"2026-05-18T02:59:31Z","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":"The present paper analyses and presents several improvements to the algorithm for finding the $(a,b)$-pairs of integers used in the $k$-ary reduction of the right-shift $k$-ary integer GCD algorithm. While the worst-case complexity of Weber's \"Accelerated integer GCD algorithm\" is $\\cO\\l(\\log_\\phi(k)^2\\r)$, we show that the worst-case number of iterations of the while loop is exactly $\\tfrac 12 \\l\\lfloor \\log_{\\phi}(k)\\r\\rfloor$, where $\\phi := \\tfrac 12 \\l(1+\\sqrt{5}\\r)$.\\par We suggest improvements on the average complexity of the latter algorithm and also present two new faster residual alg","authors_text":"Christian Lavault (LIPN), Sidi Mohamed Sedjelmaci (LIPN)","cross_cats":["cs.DM","math.NT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-02-10T20:43:46Z","title":"Improvements on the accelerated integer GCD algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.2266","kind":"arxiv","version":1},"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:5f1bab2fb6fe1fb4d2b7f4e267ba584268e79654c561a2fba532e64703f0f6de","target":"record","created_at":"2026-05-18T02:59:31Z","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":"43a61860bc6cc5bbf4493ecc920f3daba5255828a618257ef6cc7e28ce15ed4b","cross_cats_sorted":["cs.DM","math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-02-10T20:43:46Z","title_canon_sha256":"43be9911d491f4504a9041a1407c8fcf94bc140bfb4f1f6ffed19b6802e0b6e2"},"schema_version":"1.0","source":{"id":"1402.2266","kind":"arxiv","version":1}},"canonical_sha256":"0c47be89208e4b8384df5c4f0ea2381dbe4e8f5f2baf91d1a6ef1436d11db993","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0c47be89208e4b8384df5c4f0ea2381dbe4e8f5f2baf91d1a6ef1436d11db993","first_computed_at":"2026-05-18T02:59:31.619204Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:59:31.619204Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"H/LnoJftGDSUSjis9M0Le6etdOkptPyValLVJvi7U5nVjRWHyJXDmQgbmwRb8SZzFrwrlGP9QnlBuG3p25BsBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:59:31.619961Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.2266","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5f1bab2fb6fe1fb4d2b7f4e267ba584268e79654c561a2fba532e64703f0f6de","sha256:9cbf812a223639e82b4a7bd63f1f547fd7946d2bff359c61bef19d1bbe95d893"],"state_sha256":"e1cb15f8c079645eb6e81ee9ba4494ad1eacdddde9bd927724e5d428c104fe78"}