{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:VMVVWSEYTNT5VXCNKAJPFQWKJ3","short_pith_number":"pith:VMVVWSEY","schema_version":"1.0","canonical_sha256":"ab2b5b48989b67dadc4d5012f2c2ca4eefaa57cda8b35d7c4919cf7f199d4daa","source":{"kind":"arxiv","id":"1807.01365","version":1},"attestation_state":"computed","paper":{"title":"A New Approach to the Hofstadter $Q$-Recurrence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.NT","authors_text":"Nathan Fox","submitted_at":"2018-07-03T20:40:23Z","abstract_excerpt":"Nested recurrence relations are highly sensitive to their initial conditions. The best-known nested recurrence, the Hofstadter $Q$-recurrence, generates sequences displaying a wide variety of behaviors. Most famous among these is the Hofstadter $Q$-sequence, which appears to be structured at a macro level and chaotic at a micro level. Other choices of initial conditions can lead to more predictable solutions, frequently interleavings of simple sequences. Previous work has focused on the form of a desired solution and on describing an initial condition that generates such a solution. In this pa"},"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":"1807.01365","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2018-07-03T20:40:23Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"f46592b659552917d5d2ea727892037cbe293608f8464fece4f75f0a083b559c","abstract_canon_sha256":"33f5134ae8da64ca5b07ff088ef4026499c839e7cf9c272513f920dd1be3e57b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:11:29.826654Z","signature_b64":"ObdV157cbVF1XRlKPWzh4HvCSv/FiuswcfZGVYsKSsz7oTXb7CmIU70oLPV24AX2g/mUK5bpW7KYRYoXYQauCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ab2b5b48989b67dadc4d5012f2c2ca4eefaa57cda8b35d7c4919cf7f199d4daa","last_reissued_at":"2026-05-18T00:11:29.826276Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:11:29.826276Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A New Approach to the Hofstadter $Q$-Recurrence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.NT","authors_text":"Nathan Fox","submitted_at":"2018-07-03T20:40:23Z","abstract_excerpt":"Nested recurrence relations are highly sensitive to their initial conditions. The best-known nested recurrence, the Hofstadter $Q$-recurrence, generates sequences displaying a wide variety of behaviors. Most famous among these is the Hofstadter $Q$-sequence, which appears to be structured at a macro level and chaotic at a micro level. Other choices of initial conditions can lead to more predictable solutions, frequently interleavings of simple sequences. Previous work has focused on the form of a desired solution and on describing an initial condition that generates such a solution. In this pa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.01365","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1807.01365","created_at":"2026-05-18T00:11:29.826344+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.01365v1","created_at":"2026-05-18T00:11:29.826344+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.01365","created_at":"2026-05-18T00:11:29.826344+00:00"},{"alias_kind":"pith_short_12","alias_value":"VMVVWSEYTNT5","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_16","alias_value":"VMVVWSEYTNT5VXCN","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_8","alias_value":"VMVVWSEY","created_at":"2026-05-18T12:32:59.047623+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VMVVWSEYTNT5VXCNKAJPFQWKJ3","json":"https://pith.science/pith/VMVVWSEYTNT5VXCNKAJPFQWKJ3.json","graph_json":"https://pith.science/api/pith-number/VMVVWSEYTNT5VXCNKAJPFQWKJ3/graph.json","events_json":"https://pith.science/api/pith-number/VMVVWSEYTNT5VXCNKAJPFQWKJ3/events.json","paper":"https://pith.science/paper/VMVVWSEY"},"agent_actions":{"view_html":"https://pith.science/pith/VMVVWSEYTNT5VXCNKAJPFQWKJ3","download_json":"https://pith.science/pith/VMVVWSEYTNT5VXCNKAJPFQWKJ3.json","view_paper":"https://pith.science/paper/VMVVWSEY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.01365&json=true","fetch_graph":"https://pith.science/api/pith-number/VMVVWSEYTNT5VXCNKAJPFQWKJ3/graph.json","fetch_events":"https://pith.science/api/pith-number/VMVVWSEYTNT5VXCNKAJPFQWKJ3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VMVVWSEYTNT5VXCNKAJPFQWKJ3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VMVVWSEYTNT5VXCNKAJPFQWKJ3/action/storage_attestation","attest_author":"https://pith.science/pith/VMVVWSEYTNT5VXCNKAJPFQWKJ3/action/author_attestation","sign_citation":"https://pith.science/pith/VMVVWSEYTNT5VXCNKAJPFQWKJ3/action/citation_signature","submit_replication":"https://pith.science/pith/VMVVWSEYTNT5VXCNKAJPFQWKJ3/action/replication_record"}},"created_at":"2026-05-18T00:11:29.826344+00:00","updated_at":"2026-05-18T00:11:29.826344+00:00"}