{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:P33UNMI6SEMRIRHMODQSOT4YYK","short_pith_number":"pith:P33UNMI6","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"},"canonical_sha256":"7ef746b11e91191444ec70e1274f98c2a081ed6577bb2a56287f205cf673dbbc","source":{"kind":"arxiv","id":"1407.5898","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.5898","created_at":"2026-05-18T02:47:06Z"},{"alias_kind":"arxiv_version","alias_value":"1407.5898v1","created_at":"2026-05-18T02:47:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.5898","created_at":"2026-05-18T02:47:06Z"},{"alias_kind":"pith_short_12","alias_value":"P33UNMI6SEMR","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"P33UNMI6SEMRIRHM","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"P33UNMI6","created_at":"2026-05-18T12:28:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:P33UNMI6SEMRIRHMODQSOT4YYK","target":"record","payload":{"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"},"canonical_sha256":"7ef746b11e91191444ec70e1274f98c2a081ed6577bb2a56287f205cf673dbbc","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"},"source_kind":"arxiv","source_id":"1407.5898","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:47:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h0fPjtp+uI4QOh4d3gJjkeTwvGkf/FaWOsE2PAuBCQ6iUiC3DlEGCVKBRS4PbkfucZj91HyJajIG+9BoNx/ZDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T06:30:44.228064Z"},"content_sha256":"0b5660b9e51226cd21c4f0ec6eb696b5639ca601856a91a16f3ad34d8bbf5ba9","schema_version":"1.0","event_id":"sha256:0b5660b9e51226cd21c4f0ec6eb696b5639ca601856a91a16f3ad34d8bbf5ba9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:P33UNMI6SEMRIRHMODQSOT4YYK","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:47:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KHiKufLoIuQwhNxZvgXqQEeXuvW7xnHIerRUhr4x6nJtYYJTZK+qvAvyUsUGJzBRCOpBrPnfNUhZrKKsEjEBAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T06:30:44.228424Z"},"content_sha256":"3b434c45c50906d63e5c237e6ef21689fa30a69acda2dd3b8d08eca79767649a","schema_version":"1.0","event_id":"sha256:3b434c45c50906d63e5c237e6ef21689fa30a69acda2dd3b8d08eca79767649a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/P33UNMI6SEMRIRHMODQSOT4YYK/bundle.json","state_url":"https://pith.science/pith/P33UNMI6SEMRIRHMODQSOT4YYK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/P33UNMI6SEMRIRHMODQSOT4YYK/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-24T06:30:44Z","links":{"resolver":"https://pith.science/pith/P33UNMI6SEMRIRHMODQSOT4YYK","bundle":"https://pith.science/pith/P33UNMI6SEMRIRHMODQSOT4YYK/bundle.json","state":"https://pith.science/pith/P33UNMI6SEMRIRHMODQSOT4YYK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/P33UNMI6SEMRIRHMODQSOT4YYK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:P33UNMI6SEMRIRHMODQSOT4YYK","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":"a55994fb3a6b1b8723e6c4734ab1851c26b9b3b5dce4a0d1e8cbf6d6815b6508","cross_cats_sorted":["math.RA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2014-07-22T16:09:19Z","title_canon_sha256":"032deb7f241f577000829777ad7f17b8f85a33fb243e1a0cbeec3fb2c6bce131"},"schema_version":"1.0","source":{"id":"1407.5898","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.5898","created_at":"2026-05-18T02:47:06Z"},{"alias_kind":"arxiv_version","alias_value":"1407.5898v1","created_at":"2026-05-18T02:47:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.5898","created_at":"2026-05-18T02:47:06Z"},{"alias_kind":"pith_short_12","alias_value":"P33UNMI6SEMR","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"P33UNMI6SEMRIRHM","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"P33UNMI6","created_at":"2026-05-18T12:28:43Z"}],"graph_snapshots":[{"event_id":"sha256:3b434c45c50906d63e5c237e6ef21689fa30a69acda2dd3b8d08eca79767649a","target":"graph","created_at":"2026-05-18T02:47:06Z","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":"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","authors_text":"Vahagn H. Mikaelian","cross_cats":["math.RA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2014-07-22T16:09:19Z","title":"On degrees of modular common divisors and the Big prime gcd algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.5898","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:0b5660b9e51226cd21c4f0ec6eb696b5639ca601856a91a16f3ad34d8bbf5ba9","target":"record","created_at":"2026-05-18T02:47:06Z","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":"a55994fb3a6b1b8723e6c4734ab1851c26b9b3b5dce4a0d1e8cbf6d6815b6508","cross_cats_sorted":["math.RA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2014-07-22T16:09:19Z","title_canon_sha256":"032deb7f241f577000829777ad7f17b8f85a33fb243e1a0cbeec3fb2c6bce131"},"schema_version":"1.0","source":{"id":"1407.5898","kind":"arxiv","version":1}},"canonical_sha256":"7ef746b11e91191444ec70e1274f98c2a081ed6577bb2a56287f205cf673dbbc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7ef746b11e91191444ec70e1274f98c2a081ed6577bb2a56287f205cf673dbbc","first_computed_at":"2026-05-18T02:47:06.425452Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:47:06.425452Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sv+sTTEXh3AeD2n3vEoo07xVrVc5uRiglo+IRdr6lSN0R28NlV5MqqWZfAOhWimSsjeJj56rccBGSPxWcrMpBg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:47:06.425819Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.5898","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0b5660b9e51226cd21c4f0ec6eb696b5639ca601856a91a16f3ad34d8bbf5ba9","sha256:3b434c45c50906d63e5c237e6ef21689fa30a69acda2dd3b8d08eca79767649a"],"state_sha256":"6842e7429053cb497b2a060ff50e1ecf42888f12939d695288c52776d04e993f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ndWwvsaqzsjOekWtLqGzYl8UdJ57VtF+C3954Z5JsvpFSxvmDpyoe6vxxa+rcrGWwaCkWCSSY2k0FjWZGd87Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T06:30:44.230385Z","bundle_sha256":"90ae856dfe7b590a96dcb53a275355ac9c4bc1989d0cae189a7256d4f6055400"}}