{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:S7OO3IWK3MYUYNQUPR56EL54SC","short_pith_number":"pith:S7OO3IWK","canonical_record":{"source":{"id":"1806.09441","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2018-06-25T13:18:38Z","cross_cats_sorted":[],"title_canon_sha256":"f98e1e916818af27316d80f76a9cc62af0a00616c3283de9f024e0c95f5fcf8f","abstract_canon_sha256":"9ccd9a1566f48b40845531a14f5ea7c02db57f6caeb7fd085d7e7418562ca119"},"schema_version":"1.0"},"canonical_sha256":"97dceda2cadb314c36147c7be22fbc90864177da5a4ba31b7ebf37246442456f","source":{"kind":"arxiv","id":"1806.09441","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.09441","created_at":"2026-05-18T00:12:27Z"},{"alias_kind":"arxiv_version","alias_value":"1806.09441v1","created_at":"2026-05-18T00:12:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.09441","created_at":"2026-05-18T00:12:27Z"},{"alias_kind":"pith_short_12","alias_value":"S7OO3IWK3MYU","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"S7OO3IWK3MYUYNQU","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"S7OO3IWK","created_at":"2026-05-18T12:32:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:S7OO3IWK3MYUYNQUPR56EL54SC","target":"record","payload":{"canonical_record":{"source":{"id":"1806.09441","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2018-06-25T13:18:38Z","cross_cats_sorted":[],"title_canon_sha256":"f98e1e916818af27316d80f76a9cc62af0a00616c3283de9f024e0c95f5fcf8f","abstract_canon_sha256":"9ccd9a1566f48b40845531a14f5ea7c02db57f6caeb7fd085d7e7418562ca119"},"schema_version":"1.0"},"canonical_sha256":"97dceda2cadb314c36147c7be22fbc90864177da5a4ba31b7ebf37246442456f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:27.291188Z","signature_b64":"F8sfJKhjyZtHKq6Wjwug+NlmRG5E8PvX5O0KbcfS3gTPegt+20YZ87tXbrkPY+zLrHzAKLnZYgC3VeycHwCDDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"97dceda2cadb314c36147c7be22fbc90864177da5a4ba31b7ebf37246442456f","last_reissued_at":"2026-05-18T00:12:27.290669Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:27.290669Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.09441","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:12:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3vBAsk6SpGuZQ3rlJ+ZG2PchLiy6qRVPWDy5GIACrzd23IZE0kaMM5/wRH+PdqSinwWFNMXpzAVH+69F3K4xBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T03:35:35.200814Z"},"content_sha256":"40adb2c7b781e62224e3a72498cb77bd92691f282c2bc26e7e933befcfcf70af","schema_version":"1.0","event_id":"sha256:40adb2c7b781e62224e3a72498cb77bd92691f282c2bc26e7e933befcfcf70af"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:S7OO3IWK3MYUYNQUPR56EL54SC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Generalized Cullen Numbers in Linear Recurrence Sequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Alain Togb\\' e, Diego Marques, Yuri Bilu","submitted_at":"2018-06-25T13:18:38Z","abstract_excerpt":"A Cullen number is a number of the form $m2^m+1$, where $m$ is a positive integer. In 2004, Luca and St\\u anic\\u a proved, among other things, that the largest Fibonacci number in the Cullen sequence is $F_4=3$. Actually, they searched for generalized Cullen numbers among some binary recurrence sequences. In this paper, we will work on higher order recurrence sequences. For a given linear recurrence $(G_n)_n$, under weak assumptions, and a given polynomial $T(x)\\in \\mathbb{Z}[x]$, we shall prove that if $G_n=mx^m+T(x)$, then \\[ m\\ll\\log \\log |x|\\log^2(\\log \\log |x|)\\ \\mbox{and}\\ n\\ll\\log |x|\\l"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.09441","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:12:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b3xEkH+0sieEB5EKgrDpfkSnpHtT1SgbeNXmqjaHNtNaugStX/tWwkersZq1ctRMjCFsYh0K1doVH7Z/37+dCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T03:35:35.201454Z"},"content_sha256":"6a2b69cca1bac9733c9397b3f41a2d40b61dc39025c147eb1a5e7dfd4ab2a567","schema_version":"1.0","event_id":"sha256:6a2b69cca1bac9733c9397b3f41a2d40b61dc39025c147eb1a5e7dfd4ab2a567"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S7OO3IWK3MYUYNQUPR56EL54SC/bundle.json","state_url":"https://pith.science/pith/S7OO3IWK3MYUYNQUPR56EL54SC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S7OO3IWK3MYUYNQUPR56EL54SC/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-26T03:35:35Z","links":{"resolver":"https://pith.science/pith/S7OO3IWK3MYUYNQUPR56EL54SC","bundle":"https://pith.science/pith/S7OO3IWK3MYUYNQUPR56EL54SC/bundle.json","state":"https://pith.science/pith/S7OO3IWK3MYUYNQUPR56EL54SC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S7OO3IWK3MYUYNQUPR56EL54SC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:S7OO3IWK3MYUYNQUPR56EL54SC","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":"9ccd9a1566f48b40845531a14f5ea7c02db57f6caeb7fd085d7e7418562ca119","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2018-06-25T13:18:38Z","title_canon_sha256":"f98e1e916818af27316d80f76a9cc62af0a00616c3283de9f024e0c95f5fcf8f"},"schema_version":"1.0","source":{"id":"1806.09441","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.09441","created_at":"2026-05-18T00:12:27Z"},{"alias_kind":"arxiv_version","alias_value":"1806.09441v1","created_at":"2026-05-18T00:12:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.09441","created_at":"2026-05-18T00:12:27Z"},{"alias_kind":"pith_short_12","alias_value":"S7OO3IWK3MYU","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"S7OO3IWK3MYUYNQU","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"S7OO3IWK","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:6a2b69cca1bac9733c9397b3f41a2d40b61dc39025c147eb1a5e7dfd4ab2a567","target":"graph","created_at":"2026-05-18T00:12:27Z","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":"A Cullen number is a number of the form $m2^m+1$, where $m$ is a positive integer. In 2004, Luca and St\\u anic\\u a proved, among other things, that the largest Fibonacci number in the Cullen sequence is $F_4=3$. Actually, they searched for generalized Cullen numbers among some binary recurrence sequences. In this paper, we will work on higher order recurrence sequences. For a given linear recurrence $(G_n)_n$, under weak assumptions, and a given polynomial $T(x)\\in \\mathbb{Z}[x]$, we shall prove that if $G_n=mx^m+T(x)$, then \\[ m\\ll\\log \\log |x|\\log^2(\\log \\log |x|)\\ \\mbox{and}\\ n\\ll\\log |x|\\l","authors_text":"Alain Togb\\' e, Diego Marques, Yuri Bilu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2018-06-25T13:18:38Z","title":"Generalized Cullen Numbers in Linear Recurrence Sequences"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.09441","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:40adb2c7b781e62224e3a72498cb77bd92691f282c2bc26e7e933befcfcf70af","target":"record","created_at":"2026-05-18T00:12:27Z","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":"9ccd9a1566f48b40845531a14f5ea7c02db57f6caeb7fd085d7e7418562ca119","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2018-06-25T13:18:38Z","title_canon_sha256":"f98e1e916818af27316d80f76a9cc62af0a00616c3283de9f024e0c95f5fcf8f"},"schema_version":"1.0","source":{"id":"1806.09441","kind":"arxiv","version":1}},"canonical_sha256":"97dceda2cadb314c36147c7be22fbc90864177da5a4ba31b7ebf37246442456f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"97dceda2cadb314c36147c7be22fbc90864177da5a4ba31b7ebf37246442456f","first_computed_at":"2026-05-18T00:12:27.290669Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:12:27.290669Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"F8sfJKhjyZtHKq6Wjwug+NlmRG5E8PvX5O0KbcfS3gTPegt+20YZ87tXbrkPY+zLrHzAKLnZYgC3VeycHwCDDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:12:27.291188Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.09441","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:40adb2c7b781e62224e3a72498cb77bd92691f282c2bc26e7e933befcfcf70af","sha256:6a2b69cca1bac9733c9397b3f41a2d40b61dc39025c147eb1a5e7dfd4ab2a567"],"state_sha256":"5935ca24b72bdfd23b161534ee226077f7367b0558cabf5ca25c64fa3b905b05"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K8hkzE/dOSX6Mexa2OPh8INyKn4nE61tz6RJln921dZdWRLZJEvtTx02epppmwia3MYfyucrYPhZZHzEPUTvAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T03:35:35.205097Z","bundle_sha256":"2a08cff775e73cbd1515015bfc32f24fcac506910f7d92dd07803d2c20edc257"}}