{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:FF7U5U5HYZGV5GS63Z63OYZ4JM","short_pith_number":"pith:FF7U5U5H","canonical_record":{"source":{"id":"1106.2029","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2011-06-10T12:11:41Z","cross_cats_sorted":[],"title_canon_sha256":"d48ba02173a32e5829666ae29dca748d09f9a4813c1d77a0586c0d33504cc435","abstract_canon_sha256":"3c8373593b207fd03a701aaad1e58e8b90e255a308aef02f21806d251ed0294f"},"schema_version":"1.0"},"canonical_sha256":"297f4ed3a7c64d5e9a5ede7db7633c4b0e1f25449a14021a6cd8ad1182fe16fc","source":{"kind":"arxiv","id":"1106.2029","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.2029","created_at":"2026-05-18T04:20:13Z"},{"alias_kind":"arxiv_version","alias_value":"1106.2029v1","created_at":"2026-05-18T04:20:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.2029","created_at":"2026-05-18T04:20:13Z"},{"alias_kind":"pith_short_12","alias_value":"FF7U5U5HYZGV","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"FF7U5U5HYZGV5GS6","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"FF7U5U5H","created_at":"2026-05-18T12:26:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:FF7U5U5HYZGV5GS63Z63OYZ4JM","target":"record","payload":{"canonical_record":{"source":{"id":"1106.2029","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2011-06-10T12:11:41Z","cross_cats_sorted":[],"title_canon_sha256":"d48ba02173a32e5829666ae29dca748d09f9a4813c1d77a0586c0d33504cc435","abstract_canon_sha256":"3c8373593b207fd03a701aaad1e58e8b90e255a308aef02f21806d251ed0294f"},"schema_version":"1.0"},"canonical_sha256":"297f4ed3a7c64d5e9a5ede7db7633c4b0e1f25449a14021a6cd8ad1182fe16fc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:20:13.831562Z","signature_b64":"H09QGu5RmWD4eOetQdHtJyBrVximIl58408Zg3QML5Xei3SH4kve3Ss43ByFkxwWnA7MflWGBrSPNz/pvjubCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"297f4ed3a7c64d5e9a5ede7db7633c4b0e1f25449a14021a6cd8ad1182fe16fc","last_reissued_at":"2026-05-18T04:20:13.831118Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:20:13.831118Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1106.2029","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-18T04:20:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ppJj+qbKE4PxK+rYB+HljUCe4lDxPEMhCNVvno4GoqAHXIxJB66y6QiKJLEerT4rAoIWIYhmX4pzZfnl3uYIBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T19:45:02.049140Z"},"content_sha256":"5a495e084ea3cb3da07796e09ef743babde03c9aac908ab1e9ffdaf71c4ec224","schema_version":"1.0","event_id":"sha256:5a495e084ea3cb3da07796e09ef743babde03c9aac908ab1e9ffdaf71c4ec224"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:FF7U5U5HYZGV5GS63Z63OYZ4JM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Using Lucas Sequences to Generalize a Theorem of Sierpi\\'nski","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Lenny Jones","submitted_at":"2011-06-10T12:11:41Z","abstract_excerpt":"In 1960, Sierpi\\'nski proved that there exist infinitely many odd positive integers $k$ such that $k\\cdot 2^n+1$ is composite for all positive integers $n$. In this paper, we prove some generalizations of Sierpi\\'nski's theorem with $2^n$ replaced by expressions involving certain Lucas sequences $U_n(\\alpha,\\beta)$. In particular, we show the existence of infinitely many Lucas pairs $(\\alpha,\\beta)$, for which there exist infinitely many positive integers $k$, such that $k (U_n(\\alpha,\\beta)+(\\alpha-\\beta)^2)+1$ is composite for all integers $n\\ge 1$. Sierpi\\'nski's theorem is the special case"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.2029","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-18T04:20:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/xwJslBadNj9l3MHRJxalotO7431kQ78bjcIvSL80jYiNp/zSJ5bCzMcDclduXe6TXrHO6m4PANXRS5yUtt1AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T19:45:02.049893Z"},"content_sha256":"caf12363f960e8371bbd57fba87c1102803a2a66777987c5e748d800dbfa43fd","schema_version":"1.0","event_id":"sha256:caf12363f960e8371bbd57fba87c1102803a2a66777987c5e748d800dbfa43fd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FF7U5U5HYZGV5GS63Z63OYZ4JM/bundle.json","state_url":"https://pith.science/pith/FF7U5U5HYZGV5GS63Z63OYZ4JM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FF7U5U5HYZGV5GS63Z63OYZ4JM/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-31T19:45:02Z","links":{"resolver":"https://pith.science/pith/FF7U5U5HYZGV5GS63Z63OYZ4JM","bundle":"https://pith.science/pith/FF7U5U5HYZGV5GS63Z63OYZ4JM/bundle.json","state":"https://pith.science/pith/FF7U5U5HYZGV5GS63Z63OYZ4JM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FF7U5U5HYZGV5GS63Z63OYZ4JM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:FF7U5U5HYZGV5GS63Z63OYZ4JM","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":"3c8373593b207fd03a701aaad1e58e8b90e255a308aef02f21806d251ed0294f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2011-06-10T12:11:41Z","title_canon_sha256":"d48ba02173a32e5829666ae29dca748d09f9a4813c1d77a0586c0d33504cc435"},"schema_version":"1.0","source":{"id":"1106.2029","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.2029","created_at":"2026-05-18T04:20:13Z"},{"alias_kind":"arxiv_version","alias_value":"1106.2029v1","created_at":"2026-05-18T04:20:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.2029","created_at":"2026-05-18T04:20:13Z"},{"alias_kind":"pith_short_12","alias_value":"FF7U5U5HYZGV","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"FF7U5U5HYZGV5GS6","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"FF7U5U5H","created_at":"2026-05-18T12:26:28Z"}],"graph_snapshots":[{"event_id":"sha256:caf12363f960e8371bbd57fba87c1102803a2a66777987c5e748d800dbfa43fd","target":"graph","created_at":"2026-05-18T04:20:13Z","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":"In 1960, Sierpi\\'nski proved that there exist infinitely many odd positive integers $k$ such that $k\\cdot 2^n+1$ is composite for all positive integers $n$. In this paper, we prove some generalizations of Sierpi\\'nski's theorem with $2^n$ replaced by expressions involving certain Lucas sequences $U_n(\\alpha,\\beta)$. In particular, we show the existence of infinitely many Lucas pairs $(\\alpha,\\beta)$, for which there exist infinitely many positive integers $k$, such that $k (U_n(\\alpha,\\beta)+(\\alpha-\\beta)^2)+1$ is composite for all integers $n\\ge 1$. Sierpi\\'nski's theorem is the special case","authors_text":"Lenny Jones","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2011-06-10T12:11:41Z","title":"Using Lucas Sequences to Generalize a Theorem of Sierpi\\'nski"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.2029","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:5a495e084ea3cb3da07796e09ef743babde03c9aac908ab1e9ffdaf71c4ec224","target":"record","created_at":"2026-05-18T04:20:13Z","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":"3c8373593b207fd03a701aaad1e58e8b90e255a308aef02f21806d251ed0294f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2011-06-10T12:11:41Z","title_canon_sha256":"d48ba02173a32e5829666ae29dca748d09f9a4813c1d77a0586c0d33504cc435"},"schema_version":"1.0","source":{"id":"1106.2029","kind":"arxiv","version":1}},"canonical_sha256":"297f4ed3a7c64d5e9a5ede7db7633c4b0e1f25449a14021a6cd8ad1182fe16fc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"297f4ed3a7c64d5e9a5ede7db7633c4b0e1f25449a14021a6cd8ad1182fe16fc","first_computed_at":"2026-05-18T04:20:13.831118Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:20:13.831118Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"H09QGu5RmWD4eOetQdHtJyBrVximIl58408Zg3QML5Xei3SH4kve3Ss43ByFkxwWnA7MflWGBrSPNz/pvjubCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:20:13.831562Z","signed_message":"canonical_sha256_bytes"},"source_id":"1106.2029","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5a495e084ea3cb3da07796e09ef743babde03c9aac908ab1e9ffdaf71c4ec224","sha256:caf12363f960e8371bbd57fba87c1102803a2a66777987c5e748d800dbfa43fd"],"state_sha256":"fb445400ef2804a5e293667c3003eb6956035d39ceec70ab75ca2edcd71623e5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3nKh2GOO19aY5IbtGvZ9rmtKhSwmB9BsIBNCULl5RTj1XwBC1BB6vv9YzBrQUTElRrtkSRAoquIMqrFQK0p+DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T19:45:02.053424Z","bundle_sha256":"c6f4e73ce8564b482511ecdafdceea683a04ca4267343db0fad98943b3e84881"}}