{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:U63YS7R2UKSKIFHFSSXVSNORDB","short_pith_number":"pith:U63YS7R2","schema_version":"1.0","canonical_sha256":"a7b7897e3aa2a4a414e594af5935d118689f2e2e944249b6019a51562eacf076","source":{"kind":"arxiv","id":"2311.13854","version":1},"attestation_state":"computed","paper":{"title":"A diluted version of the problem of the existence of the Hofstadter sequence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.DS"],"primary_cat":"math.NT","authors_text":"Guido Gentile, Jonathan H.B. Deane","submitted_at":"2023-11-23T08:49:28Z","abstract_excerpt":"We investigate the conditions on an integer sequence f(n), n 2 N, with f(1) = 0, such that the sequence q(n), computed recursively via q(n) = q(n - q(n - 1)) + f(n), with q(1) = 1, exists. We prove that f(n + 1) - f(n) in {0,1}, n > 0, is a sufficient but not necessary condition for the existence of sequence q. Sequences q defined in this way typically display non-trivial dynamics: in particular, they are generally aperiodic with no obvious patterns. We discuss and illustrate this behaviour with some examples."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2311.13854","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2023-11-23T08:49:28Z","cross_cats_sorted":["math.DS"],"title_canon_sha256":"027832cc9478e9feeeeb04f8aec1ec66232d7b19b13ba8e1f6274f50d8cb903b","abstract_canon_sha256":"7c2c7a5d4d1a336af12fd4c204277eb3dba12ddecdb2b0fc523fe0cf24175d00"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:16:09.059254Z","signature_b64":"EsCZre2RPafSjVnU86DlJ30tTGUmS514TGWtp56fEZyyFdncOBzXIUq90ifZeBR6lpzPC2NT6Bi9ycdvUT62AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a7b7897e3aa2a4a414e594af5935d118689f2e2e944249b6019a51562eacf076","last_reissued_at":"2026-07-05T07:16:09.058702Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:16:09.058702Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A diluted version of the problem of the existence of the Hofstadter sequence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.DS"],"primary_cat":"math.NT","authors_text":"Guido Gentile, Jonathan H.B. Deane","submitted_at":"2023-11-23T08:49:28Z","abstract_excerpt":"We investigate the conditions on an integer sequence f(n), n 2 N, with f(1) = 0, such that the sequence q(n), computed recursively via q(n) = q(n - q(n - 1)) + f(n), with q(1) = 1, exists. We prove that f(n + 1) - f(n) in {0,1}, n > 0, is a sufficient but not necessary condition for the existence of sequence q. Sequences q defined in this way typically display non-trivial dynamics: in particular, they are generally aperiodic with no obvious patterns. We discuss and illustrate this behaviour with some examples."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.13854","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2311.13854/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2311.13854","created_at":"2026-07-05T07:16:09.058763+00:00"},{"alias_kind":"arxiv_version","alias_value":"2311.13854v1","created_at":"2026-07-05T07:16:09.058763+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.13854","created_at":"2026-07-05T07:16:09.058763+00:00"},{"alias_kind":"pith_short_12","alias_value":"U63YS7R2UKSK","created_at":"2026-07-05T07:16:09.058763+00:00"},{"alias_kind":"pith_short_16","alias_value":"U63YS7R2UKSKIFHF","created_at":"2026-07-05T07:16:09.058763+00:00"},{"alias_kind":"pith_short_8","alias_value":"U63YS7R2","created_at":"2026-07-05T07:16:09.058763+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.11250","citing_title":"Critical Slow Growth in Averaged Meta-Fibonacci Recursions","ref_index":6,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/U63YS7R2UKSKIFHFSSXVSNORDB","json":"https://pith.science/pith/U63YS7R2UKSKIFHFSSXVSNORDB.json","graph_json":"https://pith.science/api/pith-number/U63YS7R2UKSKIFHFSSXVSNORDB/graph.json","events_json":"https://pith.science/api/pith-number/U63YS7R2UKSKIFHFSSXVSNORDB/events.json","paper":"https://pith.science/paper/U63YS7R2"},"agent_actions":{"view_html":"https://pith.science/pith/U63YS7R2UKSKIFHFSSXVSNORDB","download_json":"https://pith.science/pith/U63YS7R2UKSKIFHFSSXVSNORDB.json","view_paper":"https://pith.science/paper/U63YS7R2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2311.13854&json=true","fetch_graph":"https://pith.science/api/pith-number/U63YS7R2UKSKIFHFSSXVSNORDB/graph.json","fetch_events":"https://pith.science/api/pith-number/U63YS7R2UKSKIFHFSSXVSNORDB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U63YS7R2UKSKIFHFSSXVSNORDB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U63YS7R2UKSKIFHFSSXVSNORDB/action/storage_attestation","attest_author":"https://pith.science/pith/U63YS7R2UKSKIFHFSSXVSNORDB/action/author_attestation","sign_citation":"https://pith.science/pith/U63YS7R2UKSKIFHFSSXVSNORDB/action/citation_signature","submit_replication":"https://pith.science/pith/U63YS7R2UKSKIFHFSSXVSNORDB/action/replication_record"}},"created_at":"2026-07-05T07:16:09.058763+00:00","updated_at":"2026-07-05T07:16:09.058763+00:00"}