{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:QORA5GTKRRWCNPDILB3KOGDVSY","short_pith_number":"pith:QORA5GTK","canonical_record":{"source":{"id":"1611.04115","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2016-11-13T11:09:13Z","cross_cats_sorted":["math.DS"],"title_canon_sha256":"3317acfa23570116b1b476e2e86297b8ac9bd329386c64b490c678473a26eaba","abstract_canon_sha256":"e98c63713ba2f56cae9e3f5926f0184a78fc70781b6c5074263b4560faeefd73"},"schema_version":"1.0"},"canonical_sha256":"83a20e9a6a8c6c26bc685876a718759631417d4694c37dc58abb8ef2f3fe5888","source":{"kind":"arxiv","id":"1611.04115","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.04115","created_at":"2026-05-18T00:59:17Z"},{"alias_kind":"arxiv_version","alias_value":"1611.04115v1","created_at":"2026-05-18T00:59:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.04115","created_at":"2026-05-18T00:59:17Z"},{"alias_kind":"pith_short_12","alias_value":"QORA5GTKRRWC","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"QORA5GTKRRWCNPDI","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"QORA5GTK","created_at":"2026-05-18T12:30:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:QORA5GTKRRWCNPDILB3KOGDVSY","target":"record","payload":{"canonical_record":{"source":{"id":"1611.04115","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2016-11-13T11:09:13Z","cross_cats_sorted":["math.DS"],"title_canon_sha256":"3317acfa23570116b1b476e2e86297b8ac9bd329386c64b490c678473a26eaba","abstract_canon_sha256":"e98c63713ba2f56cae9e3f5926f0184a78fc70781b6c5074263b4560faeefd73"},"schema_version":"1.0"},"canonical_sha256":"83a20e9a6a8c6c26bc685876a718759631417d4694c37dc58abb8ef2f3fe5888","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:17.489526Z","signature_b64":"zg84Kq/ib+vgXD8YNzn4XRVhzxxHNHaO77wh6eWAekFslw0N/0jgnTIFJ5o20M3hp3skRkf/A8cybzIp29oVCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"83a20e9a6a8c6c26bc685876a718759631417d4694c37dc58abb8ef2f3fe5888","last_reissued_at":"2026-05-18T00:59:17.488912Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:17.488912Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.04115","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:59:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rLhGCVgbN/dnrUMhmm3K6S8gmRQjdQpdQHPQKqCs2wkZ0gE9lM8Zzu/a5wXqBaqLHl7H7VSIX95pDNczS+TyDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T23:27:02.943962Z"},"content_sha256":"1709228d994f3a7cd2c146a43fad5d991b9647e4a4069317f22ed43ea3d112da","schema_version":"1.0","event_id":"sha256:1709228d994f3a7cd2c146a43fad5d991b9647e4a4069317f22ed43ea3d112da"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:QORA5GTKRRWCNPDILB3KOGDVSY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Greatest common divisors of iterates of polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.DS"],"primary_cat":"math.NT","authors_text":"Liang-Chung Hsia, Thomas J. Tucker","submitted_at":"2016-11-13T11:09:13Z","abstract_excerpt":"Following work of Bugeaud, Corvaja, and Zannier for integers, Ailon and Rudnick prove that for any multiplicatively independent polynomials, $a, b \\in {\\mathbb C}[x]$, there is a polynomial $h$ such that for all $n$, we have\n  \\[ \\gcd(a^n - 1, b^n - 1) \\mid h\\] We prove a compositional analog of this theorem, namely that if $f, g \\in {\\mathbb C}[x]$ are nonconstant compositionally independent polynomials and $c(x) \\in {\\mathbb C}[x]$, then there are at most finitely many $\\lambda$ with the property that there is an $n$ such that $(x - \\lambda)$ divides $\\gcd(f^{\\circ n}(x) - c(x), g^{\\circ n}("},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.04115","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:59:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lHaIx2xKZUZjP3NtQV7lBVs5ZXxK4kukzBuL6E+W5RmubEUNXdkJj4a4FwjpgBOChTxQFcpCUgjHD8DMx2fEAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T23:27:02.944729Z"},"content_sha256":"4dafb5c6ad623a20c6305da52cc212474e47afddf1e7fd3c917f0a5e196127e7","schema_version":"1.0","event_id":"sha256:4dafb5c6ad623a20c6305da52cc212474e47afddf1e7fd3c917f0a5e196127e7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QORA5GTKRRWCNPDILB3KOGDVSY/bundle.json","state_url":"https://pith.science/pith/QORA5GTKRRWCNPDILB3KOGDVSY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QORA5GTKRRWCNPDILB3KOGDVSY/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-09T23:27:02Z","links":{"resolver":"https://pith.science/pith/QORA5GTKRRWCNPDILB3KOGDVSY","bundle":"https://pith.science/pith/QORA5GTKRRWCNPDILB3KOGDVSY/bundle.json","state":"https://pith.science/pith/QORA5GTKRRWCNPDILB3KOGDVSY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QORA5GTKRRWCNPDILB3KOGDVSY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:QORA5GTKRRWCNPDILB3KOGDVSY","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":"e98c63713ba2f56cae9e3f5926f0184a78fc70781b6c5074263b4560faeefd73","cross_cats_sorted":["math.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2016-11-13T11:09:13Z","title_canon_sha256":"3317acfa23570116b1b476e2e86297b8ac9bd329386c64b490c678473a26eaba"},"schema_version":"1.0","source":{"id":"1611.04115","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.04115","created_at":"2026-05-18T00:59:17Z"},{"alias_kind":"arxiv_version","alias_value":"1611.04115v1","created_at":"2026-05-18T00:59:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.04115","created_at":"2026-05-18T00:59:17Z"},{"alias_kind":"pith_short_12","alias_value":"QORA5GTKRRWC","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"QORA5GTKRRWCNPDI","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"QORA5GTK","created_at":"2026-05-18T12:30:39Z"}],"graph_snapshots":[{"event_id":"sha256:4dafb5c6ad623a20c6305da52cc212474e47afddf1e7fd3c917f0a5e196127e7","target":"graph","created_at":"2026-05-18T00:59:17Z","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":"Following work of Bugeaud, Corvaja, and Zannier for integers, Ailon and Rudnick prove that for any multiplicatively independent polynomials, $a, b \\in {\\mathbb C}[x]$, there is a polynomial $h$ such that for all $n$, we have\n  \\[ \\gcd(a^n - 1, b^n - 1) \\mid h\\] We prove a compositional analog of this theorem, namely that if $f, g \\in {\\mathbb C}[x]$ are nonconstant compositionally independent polynomials and $c(x) \\in {\\mathbb C}[x]$, then there are at most finitely many $\\lambda$ with the property that there is an $n$ such that $(x - \\lambda)$ divides $\\gcd(f^{\\circ n}(x) - c(x), g^{\\circ n}(","authors_text":"Liang-Chung Hsia, Thomas J. Tucker","cross_cats":["math.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2016-11-13T11:09:13Z","title":"Greatest common divisors of iterates of polynomials"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.04115","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:1709228d994f3a7cd2c146a43fad5d991b9647e4a4069317f22ed43ea3d112da","target":"record","created_at":"2026-05-18T00:59:17Z","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":"e98c63713ba2f56cae9e3f5926f0184a78fc70781b6c5074263b4560faeefd73","cross_cats_sorted":["math.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2016-11-13T11:09:13Z","title_canon_sha256":"3317acfa23570116b1b476e2e86297b8ac9bd329386c64b490c678473a26eaba"},"schema_version":"1.0","source":{"id":"1611.04115","kind":"arxiv","version":1}},"canonical_sha256":"83a20e9a6a8c6c26bc685876a718759631417d4694c37dc58abb8ef2f3fe5888","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"83a20e9a6a8c6c26bc685876a718759631417d4694c37dc58abb8ef2f3fe5888","first_computed_at":"2026-05-18T00:59:17.488912Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:59:17.488912Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zg84Kq/ib+vgXD8YNzn4XRVhzxxHNHaO77wh6eWAekFslw0N/0jgnTIFJ5o20M3hp3skRkf/A8cybzIp29oVCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:59:17.489526Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.04115","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1709228d994f3a7cd2c146a43fad5d991b9647e4a4069317f22ed43ea3d112da","sha256:4dafb5c6ad623a20c6305da52cc212474e47afddf1e7fd3c917f0a5e196127e7"],"state_sha256":"d852c31521e695bf54a6b28b6b543ecc6795511cd9e791ce9f86a0339b979e41"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sq04xPB2CrfEhISVGAx5U9cQidDJ50CKThVJ5lQncrx07cdK827QtfjDIvsw/3arahw5oqOTPqMAdC4EckeQAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T23:27:02.948743Z","bundle_sha256":"103d6917744338c6746bfb673fc572eb22cd9e143318cdadafa4dc5cddbb44e7"}}