{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:RQFUAXBIEOTGWVE7LIOPHRMNX5","short_pith_number":"pith:RQFUAXBI","canonical_record":{"source":{"id":"1611.00485","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2016-11-02T07:14:17Z","cross_cats_sorted":[],"title_canon_sha256":"81533a03076d2b15013659078b15521dd5d5f64bb804c2cdda40970721605d8c","abstract_canon_sha256":"3f257f33344173265ac73456940ca7fab60e516d47bfaa752089eb5e24673239"},"schema_version":"1.0"},"canonical_sha256":"8c0b405c2823a66b549f5a1cf3c58dbf758624b041883df8ec6a141da6b77f94","source":{"kind":"arxiv","id":"1611.00485","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.00485","created_at":"2026-05-18T01:00:32Z"},{"alias_kind":"arxiv_version","alias_value":"1611.00485v1","created_at":"2026-05-18T01:00:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.00485","created_at":"2026-05-18T01:00:32Z"},{"alias_kind":"pith_short_12","alias_value":"RQFUAXBIEOTG","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"RQFUAXBIEOTGWVE7","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"RQFUAXBI","created_at":"2026-05-18T12:30:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:RQFUAXBIEOTGWVE7LIOPHRMNX5","target":"record","payload":{"canonical_record":{"source":{"id":"1611.00485","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2016-11-02T07:14:17Z","cross_cats_sorted":[],"title_canon_sha256":"81533a03076d2b15013659078b15521dd5d5f64bb804c2cdda40970721605d8c","abstract_canon_sha256":"3f257f33344173265ac73456940ca7fab60e516d47bfaa752089eb5e24673239"},"schema_version":"1.0"},"canonical_sha256":"8c0b405c2823a66b549f5a1cf3c58dbf758624b041883df8ec6a141da6b77f94","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:32.693185Z","signature_b64":"PMkwP+gtsd+Iue3WstGLfB1cZuqd6ZmqVScIqypDyYgZ62/I9OtOvGbUD8RR82R6NdlyVeVKc5FvWC4xKp5+Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8c0b405c2823a66b549f5a1cf3c58dbf758624b041883df8ec6a141da6b77f94","last_reissued_at":"2026-05-18T01:00:32.692530Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:32.692530Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.00485","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-18T01:00:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QU0nVuWWr6o+wKHIDLq7TFkYghqific5CXxUJbxU/jYmRVS7W8OVwYkp6Fc4JIBspmiEJ7T3Ygr7q0opMfARCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T11:37:34.569520Z"},"content_sha256":"8f5bcc24ad869943e59286d3eb7a1764762a279ef92059e9a39a5551a9b32a55","schema_version":"1.0","event_id":"sha256:8f5bcc24ad869943e59286d3eb7a1764762a279ef92059e9a39a5551a9b32a55"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:RQFUAXBIEOTGWVE7LIOPHRMNX5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"$S$-parts of terms of integer linear recurrence sequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Jan-Hendrik Evertse, Yann Bugeaud","submitted_at":"2016-11-02T07:14:17Z","abstract_excerpt":"Let $S = \\{q_1, \\ldots , q_s\\}$ be a finite, non-empty set of distinct prime numbers. For a non-zero integer $m$, write $m = q_1^{r_1} \\ldots q_s^{r_s} M$, where $r_1, \\ldots , r_s$ are non-negative integers and $M$ is an integer relatively prime to $q_1 \\ldots q_s$. We define the $S$-part $[m]_S$ of $m$ by $[m]_S := q_1^{r_1} \\ldots q_s^{r_s}$. Let $(u_n)_{n \\ge 0}$ be a linear recurrence sequence of integers. Under certain necessary conditions, we establish that for every $\\varepsilon > 0$, there exists an integer $n_0$ such that $[u_n]_S\\leq |u_n|^{\\varepsilon}$ holds for $n > n_0$. Our pro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.00485","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-18T01:00:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3FWOjttZR9pgT4NLRjLDseU8P6mXyIyqccM0fgqNqVNX8vofL+ycVgFxUz/RH0mYQHJKrplJho1DCTSWXhmlAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T11:37:34.570214Z"},"content_sha256":"b7b231dcf48557e53b0211d79b128b13980523ffb3ebbda1ad80d48f0426cd81","schema_version":"1.0","event_id":"sha256:b7b231dcf48557e53b0211d79b128b13980523ffb3ebbda1ad80d48f0426cd81"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RQFUAXBIEOTGWVE7LIOPHRMNX5/bundle.json","state_url":"https://pith.science/pith/RQFUAXBIEOTGWVE7LIOPHRMNX5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RQFUAXBIEOTGWVE7LIOPHRMNX5/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-05-24T11:37:34Z","links":{"resolver":"https://pith.science/pith/RQFUAXBIEOTGWVE7LIOPHRMNX5","bundle":"https://pith.science/pith/RQFUAXBIEOTGWVE7LIOPHRMNX5/bundle.json","state":"https://pith.science/pith/RQFUAXBIEOTGWVE7LIOPHRMNX5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RQFUAXBIEOTGWVE7LIOPHRMNX5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:RQFUAXBIEOTGWVE7LIOPHRMNX5","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":"3f257f33344173265ac73456940ca7fab60e516d47bfaa752089eb5e24673239","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2016-11-02T07:14:17Z","title_canon_sha256":"81533a03076d2b15013659078b15521dd5d5f64bb804c2cdda40970721605d8c"},"schema_version":"1.0","source":{"id":"1611.00485","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.00485","created_at":"2026-05-18T01:00:32Z"},{"alias_kind":"arxiv_version","alias_value":"1611.00485v1","created_at":"2026-05-18T01:00:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.00485","created_at":"2026-05-18T01:00:32Z"},{"alias_kind":"pith_short_12","alias_value":"RQFUAXBIEOTG","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"RQFUAXBIEOTGWVE7","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"RQFUAXBI","created_at":"2026-05-18T12:30:41Z"}],"graph_snapshots":[{"event_id":"sha256:b7b231dcf48557e53b0211d79b128b13980523ffb3ebbda1ad80d48f0426cd81","target":"graph","created_at":"2026-05-18T01:00:32Z","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 $S = \\{q_1, \\ldots , q_s\\}$ be a finite, non-empty set of distinct prime numbers. For a non-zero integer $m$, write $m = q_1^{r_1} \\ldots q_s^{r_s} M$, where $r_1, \\ldots , r_s$ are non-negative integers and $M$ is an integer relatively prime to $q_1 \\ldots q_s$. We define the $S$-part $[m]_S$ of $m$ by $[m]_S := q_1^{r_1} \\ldots q_s^{r_s}$. Let $(u_n)_{n \\ge 0}$ be a linear recurrence sequence of integers. Under certain necessary conditions, we establish that for every $\\varepsilon > 0$, there exists an integer $n_0$ such that $[u_n]_S\\leq |u_n|^{\\varepsilon}$ holds for $n > n_0$. Our pro","authors_text":"Jan-Hendrik Evertse, Yann Bugeaud","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2016-11-02T07:14:17Z","title":"$S$-parts of terms of integer linear recurrence sequences"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.00485","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:8f5bcc24ad869943e59286d3eb7a1764762a279ef92059e9a39a5551a9b32a55","target":"record","created_at":"2026-05-18T01:00:32Z","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":"3f257f33344173265ac73456940ca7fab60e516d47bfaa752089eb5e24673239","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2016-11-02T07:14:17Z","title_canon_sha256":"81533a03076d2b15013659078b15521dd5d5f64bb804c2cdda40970721605d8c"},"schema_version":"1.0","source":{"id":"1611.00485","kind":"arxiv","version":1}},"canonical_sha256":"8c0b405c2823a66b549f5a1cf3c58dbf758624b041883df8ec6a141da6b77f94","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8c0b405c2823a66b549f5a1cf3c58dbf758624b041883df8ec6a141da6b77f94","first_computed_at":"2026-05-18T01:00:32.692530Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:00:32.692530Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PMkwP+gtsd+Iue3WstGLfB1cZuqd6ZmqVScIqypDyYgZ62/I9OtOvGbUD8RR82R6NdlyVeVKc5FvWC4xKp5+Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:00:32.693185Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.00485","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8f5bcc24ad869943e59286d3eb7a1764762a279ef92059e9a39a5551a9b32a55","sha256:b7b231dcf48557e53b0211d79b128b13980523ffb3ebbda1ad80d48f0426cd81"],"state_sha256":"2ae94b3556667b794df4a45c2a237083a60c2b9ef6144412dc5b8cf4b6a6504c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dkE6Vze7+2YVDn6aPs8BZK0U9R+5oZDpiXB57u8CD2nfKuMdUzouwpWvRwv0DaKjxE7iOnpt8c+t5qHOX+ZKDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T11:37:34.573488Z","bundle_sha256":"0121d775439c94f6aa7183accfba08975a142e62ca11fbe7e323b8b0bfc47b81"}}