{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:EWJHHC3KHRUJY6YZYMZNE4GXJL","short_pith_number":"pith:EWJHHC3K","canonical_record":{"source":{"id":"1712.01054","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2017-12-04T13:10:38Z","cross_cats_sorted":["math.AC"],"title_canon_sha256":"89e8880f3ebae9e7278bcf1c6e49899325649e16517f7b23c814c3881f4ecda6","abstract_canon_sha256":"a22e4d53c14009da066b64dcf9e233f84f199c08587ba89da4abcf7061d7ec18"},"schema_version":"1.0"},"canonical_sha256":"2592738b6a3c689c7b19c332d270d74aca48a4ba0bc6d4c0f8af3e7897ce0b7f","source":{"kind":"arxiv","id":"1712.01054","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.01054","created_at":"2026-05-18T00:13:45Z"},{"alias_kind":"arxiv_version","alias_value":"1712.01054v1","created_at":"2026-05-18T00:13:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.01054","created_at":"2026-05-18T00:13:45Z"},{"alias_kind":"pith_short_12","alias_value":"EWJHHC3KHRUJ","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"EWJHHC3KHRUJY6YZ","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"EWJHHC3K","created_at":"2026-05-18T12:31:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:EWJHHC3KHRUJY6YZYMZNE4GXJL","target":"record","payload":{"canonical_record":{"source":{"id":"1712.01054","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2017-12-04T13:10:38Z","cross_cats_sorted":["math.AC"],"title_canon_sha256":"89e8880f3ebae9e7278bcf1c6e49899325649e16517f7b23c814c3881f4ecda6","abstract_canon_sha256":"a22e4d53c14009da066b64dcf9e233f84f199c08587ba89da4abcf7061d7ec18"},"schema_version":"1.0"},"canonical_sha256":"2592738b6a3c689c7b19c332d270d74aca48a4ba0bc6d4c0f8af3e7897ce0b7f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:45.252639Z","signature_b64":"vblEVy1tFry8VzZLxk/yPQNMRjwVI9CnIGulJsVOZIylTvYHzTNRpJatqgx8cvXVvOz/NHS5f7MqUzYbNiCmDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2592738b6a3c689c7b19c332d270d74aca48a4ba0bc6d4c0f8af3e7897ce0b7f","last_reissued_at":"2026-05-18T00:13:45.251918Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:45.251918Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.01054","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-18T00:13:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"At/Tx5yS/7O7/z1piiC1W2pr3cxms5psSwmWf384J2k02gFF8ZaPfsCg8PLHf8Q15A0TdIv9tZY6suyFOeIsBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T04:28:49.151253Z"},"content_sha256":"870636262c8bc0b3ba933496ac456acef49ec063662880c90ace7db1cef4ee93","schema_version":"1.0","event_id":"sha256:870636262c8bc0b3ba933496ac456acef49ec063662880c90ace7db1cef4ee93"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:EWJHHC3KHRUJY6YZYMZNE4GXJL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Estimating the greatest common divisor of the value of two polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AC"],"primary_cat":"math.NT","authors_text":"Gergely Z\\'abr\\'adi, P\\'eter E. Frenkel","submitted_at":"2017-12-04T13:10:38Z","abstract_excerpt":"Let $p$ be a fixed prime, and let $v(a)$ stand for the exponent of $p$ in the prime factorization of the integer $a$. Let $f$ and $g$ be two monic polynomials with integer coefficients and nonzero resultant $r$. Write $S$ for the maximum of $v(\\gcd (f(n), g(n)))$ over all integers $n$. It is known that $S \\le v(r)$. We give various lower and upper bounds for the least possible value of $v(r)-S$ provided that a given power $p^s$ divides both $f(n)$ and $g(n)$ for all $n$. In particular, the least possible value is $ps^2-s$ for $s\\le p$ and is asymptotically $(p-1)s^2$ for large $s$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.01054","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-18T00:13:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+4PHQyNFf6O6hPlIUV8V9RAUbxqk81uNmH6XnvFcy1iUA55ZhIoM2tlXuSefTOfx2yGvaEMvLgY8C0YR6DefDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T04:28:49.151617Z"},"content_sha256":"f9315236e87dfe9ca296679423321ef7fe456b1b0e86cfa5b2c3b953ac8444fa","schema_version":"1.0","event_id":"sha256:f9315236e87dfe9ca296679423321ef7fe456b1b0e86cfa5b2c3b953ac8444fa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EWJHHC3KHRUJY6YZYMZNE4GXJL/bundle.json","state_url":"https://pith.science/pith/EWJHHC3KHRUJY6YZYMZNE4GXJL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EWJHHC3KHRUJY6YZYMZNE4GXJL/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-21T04:28:49Z","links":{"resolver":"https://pith.science/pith/EWJHHC3KHRUJY6YZYMZNE4GXJL","bundle":"https://pith.science/pith/EWJHHC3KHRUJY6YZYMZNE4GXJL/bundle.json","state":"https://pith.science/pith/EWJHHC3KHRUJY6YZYMZNE4GXJL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EWJHHC3KHRUJY6YZYMZNE4GXJL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:EWJHHC3KHRUJY6YZYMZNE4GXJL","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":"a22e4d53c14009da066b64dcf9e233f84f199c08587ba89da4abcf7061d7ec18","cross_cats_sorted":["math.AC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2017-12-04T13:10:38Z","title_canon_sha256":"89e8880f3ebae9e7278bcf1c6e49899325649e16517f7b23c814c3881f4ecda6"},"schema_version":"1.0","source":{"id":"1712.01054","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.01054","created_at":"2026-05-18T00:13:45Z"},{"alias_kind":"arxiv_version","alias_value":"1712.01054v1","created_at":"2026-05-18T00:13:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.01054","created_at":"2026-05-18T00:13:45Z"},{"alias_kind":"pith_short_12","alias_value":"EWJHHC3KHRUJ","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"EWJHHC3KHRUJY6YZ","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"EWJHHC3K","created_at":"2026-05-18T12:31:12Z"}],"graph_snapshots":[{"event_id":"sha256:f9315236e87dfe9ca296679423321ef7fe456b1b0e86cfa5b2c3b953ac8444fa","target":"graph","created_at":"2026-05-18T00:13:45Z","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":"Let $p$ be a fixed prime, and let $v(a)$ stand for the exponent of $p$ in the prime factorization of the integer $a$. Let $f$ and $g$ be two monic polynomials with integer coefficients and nonzero resultant $r$. Write $S$ for the maximum of $v(\\gcd (f(n), g(n)))$ over all integers $n$. It is known that $S \\le v(r)$. We give various lower and upper bounds for the least possible value of $v(r)-S$ provided that a given power $p^s$ divides both $f(n)$ and $g(n)$ for all $n$. In particular, the least possible value is $ps^2-s$ for $s\\le p$ and is asymptotically $(p-1)s^2$ for large $s$.","authors_text":"Gergely Z\\'abr\\'adi, P\\'eter E. Frenkel","cross_cats":["math.AC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2017-12-04T13:10:38Z","title":"Estimating the greatest common divisor of the value of two polynomials"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.01054","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:870636262c8bc0b3ba933496ac456acef49ec063662880c90ace7db1cef4ee93","target":"record","created_at":"2026-05-18T00:13:45Z","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":"a22e4d53c14009da066b64dcf9e233f84f199c08587ba89da4abcf7061d7ec18","cross_cats_sorted":["math.AC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2017-12-04T13:10:38Z","title_canon_sha256":"89e8880f3ebae9e7278bcf1c6e49899325649e16517f7b23c814c3881f4ecda6"},"schema_version":"1.0","source":{"id":"1712.01054","kind":"arxiv","version":1}},"canonical_sha256":"2592738b6a3c689c7b19c332d270d74aca48a4ba0bc6d4c0f8af3e7897ce0b7f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2592738b6a3c689c7b19c332d270d74aca48a4ba0bc6d4c0f8af3e7897ce0b7f","first_computed_at":"2026-05-18T00:13:45.251918Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:13:45.251918Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vblEVy1tFry8VzZLxk/yPQNMRjwVI9CnIGulJsVOZIylTvYHzTNRpJatqgx8cvXVvOz/NHS5f7MqUzYbNiCmDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:13:45.252639Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.01054","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:870636262c8bc0b3ba933496ac456acef49ec063662880c90ace7db1cef4ee93","sha256:f9315236e87dfe9ca296679423321ef7fe456b1b0e86cfa5b2c3b953ac8444fa"],"state_sha256":"8a897cbb99358e0c2713c75dbb6794c620206bbbe38b3dce2487f665df977cf8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qZe3kba7noGoU3U5vsE/4gSPzVGVYJLw2CjQqDFK2SZz6qelTUuOb0lTk95hBVuIGF4I+OGz3Fx8636jOa8lBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T04:28:49.153515Z","bundle_sha256":"ffdf2a9dc34d24f735cd2dbfccb8fee57dc32e307271679ed69efa8e88685d76"}}