{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:P33UNMI6SEMRIRHMODQSOT4YYK","short_pith_number":"pith:P33UNMI6","schema_version":"1.0","canonical_sha256":"7ef746b11e91191444ec70e1274f98c2a081ed6577bb2a56287f205cf673dbbc","source":{"kind":"arxiv","id":"1407.5898","version":1},"attestation_state":"computed","paper":{"title":"On degrees of modular common divisors and the Big prime gcd algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.RA"],"primary_cat":"math.NT","authors_text":"Vahagn H. Mikaelian","submitted_at":"2014-07-22T16:09:19Z","abstract_excerpt":"We consider a few modifications of the Big prime modular $\\gcd$ algorithm for polynomials in $\\Z[x]$. Our modifications are based on bounds of degrees of modular common divisors of polynomials, on estimates of the number of prime divisors of a resultant and on finding preliminary bounds on degrees of common divisors using auxiliary primes. These modifications are used to suggest improved algorithms for $\\gcd$ calculation and for coprime polynomials detection. To illustrate the ideas we apply the constructed algorithms on certain polynomials, in particular, on polynomials from Knuth's example o"},"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":"1407.5898","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2014-07-22T16:09:19Z","cross_cats_sorted":["math.RA"],"title_canon_sha256":"032deb7f241f577000829777ad7f17b8f85a33fb243e1a0cbeec3fb2c6bce131","abstract_canon_sha256":"a55994fb3a6b1b8723e6c4734ab1851c26b9b3b5dce4a0d1e8cbf6d6815b6508"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:47:06.425819Z","signature_b64":"sv+sTTEXh3AeD2n3vEoo07xVrVc5uRiglo+IRdr6lSN0R28NlV5MqqWZfAOhWimSsjeJj56rccBGSPxWcrMpBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7ef746b11e91191444ec70e1274f98c2a081ed6577bb2a56287f205cf673dbbc","last_reissued_at":"2026-05-18T02:47:06.425452Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:47:06.425452Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On degrees of modular common divisors and the Big prime gcd algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.RA"],"primary_cat":"math.NT","authors_text":"Vahagn H. Mikaelian","submitted_at":"2014-07-22T16:09:19Z","abstract_excerpt":"We consider a few modifications of the Big prime modular $\\gcd$ algorithm for polynomials in $\\Z[x]$. Our modifications are based on bounds of degrees of modular common divisors of polynomials, on estimates of the number of prime divisors of a resultant and on finding preliminary bounds on degrees of common divisors using auxiliary primes. These modifications are used to suggest improved algorithms for $\\gcd$ calculation and for coprime polynomials detection. To illustrate the ideas we apply the constructed algorithms on certain polynomials, in particular, on polynomials from Knuth's example o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.5898","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":"1407.5898","created_at":"2026-05-18T02:47:06.425516+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.5898v1","created_at":"2026-05-18T02:47:06.425516+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.5898","created_at":"2026-05-18T02:47:06.425516+00:00"},{"alias_kind":"pith_short_12","alias_value":"P33UNMI6SEMR","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_16","alias_value":"P33UNMI6SEMRIRHM","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_8","alias_value":"P33UNMI6","created_at":"2026-05-18T12:28:43.426989+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/P33UNMI6SEMRIRHMODQSOT4YYK","json":"https://pith.science/pith/P33UNMI6SEMRIRHMODQSOT4YYK.json","graph_json":"https://pith.science/api/pith-number/P33UNMI6SEMRIRHMODQSOT4YYK/graph.json","events_json":"https://pith.science/api/pith-number/P33UNMI6SEMRIRHMODQSOT4YYK/events.json","paper":"https://pith.science/paper/P33UNMI6"},"agent_actions":{"view_html":"https://pith.science/pith/P33UNMI6SEMRIRHMODQSOT4YYK","download_json":"https://pith.science/pith/P33UNMI6SEMRIRHMODQSOT4YYK.json","view_paper":"https://pith.science/paper/P33UNMI6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.5898&json=true","fetch_graph":"https://pith.science/api/pith-number/P33UNMI6SEMRIRHMODQSOT4YYK/graph.json","fetch_events":"https://pith.science/api/pith-number/P33UNMI6SEMRIRHMODQSOT4YYK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/P33UNMI6SEMRIRHMODQSOT4YYK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/P33UNMI6SEMRIRHMODQSOT4YYK/action/storage_attestation","attest_author":"https://pith.science/pith/P33UNMI6SEMRIRHMODQSOT4YYK/action/author_attestation","sign_citation":"https://pith.science/pith/P33UNMI6SEMRIRHMODQSOT4YYK/action/citation_signature","submit_replication":"https://pith.science/pith/P33UNMI6SEMRIRHMODQSOT4YYK/action/replication_record"}},"created_at":"2026-05-18T02:47:06.425516+00:00","updated_at":"2026-05-18T02:47:06.425516+00:00"}