{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:5DXAXKWAGNTVCGKC7TQNTSPVCM","short_pith_number":"pith:5DXAXKWA","schema_version":"1.0","canonical_sha256":"e8ee0baac03367511942fce0d9c9f5132974cd6ecf0a6a464b398574518977e5","source":{"kind":"arxiv","id":"1307.0153","version":1},"attestation_state":"computed","paper":{"title":"Morphic Words and Nested Recurrence Relations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Frank Ruskey, Marcel Celaya","submitted_at":"2013-06-29T21:50:09Z","abstract_excerpt":"We explore a family of nested recurrence relations with arbitrary levels of nesting, which have an interpretation in terms of fixed points of morphisms over a countably infinite alphabet. Recurrences in this family are related to a number of well-known sequences, including Hofstadter's G sequence and the Conolly and Tanny sequences. For a recurrence a(n) in this family with only finitely terms, we provide necessary and sufficient conditions for the limit a(n)/n to exist."},"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":"1307.0153","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-06-29T21:50:09Z","cross_cats_sorted":[],"title_canon_sha256":"2d1bd5cde59d2efdc6cc7820d069a711cc55de9db5e81651c4f227442a4100f3","abstract_canon_sha256":"02672190ff8101a7a2e5f1aa14fb36f809424e61277b7aa67b87dee818f098e6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:19:34.167303Z","signature_b64":"G6KzIu8k7sV+CQ3HcvreM+qb8RjxrCBIqS3i/e1oyfVLunHQ/kDQpSckYan4ENELqzjbzzmWEp0dXXVCn/CgBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e8ee0baac03367511942fce0d9c9f5132974cd6ecf0a6a464b398574518977e5","last_reissued_at":"2026-05-18T03:19:34.166850Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:19:34.166850Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Morphic Words and Nested Recurrence Relations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Frank Ruskey, Marcel Celaya","submitted_at":"2013-06-29T21:50:09Z","abstract_excerpt":"We explore a family of nested recurrence relations with arbitrary levels of nesting, which have an interpretation in terms of fixed points of morphisms over a countably infinite alphabet. Recurrences in this family are related to a number of well-known sequences, including Hofstadter's G sequence and the Conolly and Tanny sequences. For a recurrence a(n) in this family with only finitely terms, we provide necessary and sufficient conditions for the limit a(n)/n to exist."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.0153","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":"1307.0153","created_at":"2026-05-18T03:19:34.166915+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.0153v1","created_at":"2026-05-18T03:19:34.166915+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.0153","created_at":"2026-05-18T03:19:34.166915+00:00"},{"alias_kind":"pith_short_12","alias_value":"5DXAXKWAGNTV","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_16","alias_value":"5DXAXKWAGNTVCGKC","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_8","alias_value":"5DXAXKWA","created_at":"2026-05-18T12:27:34.582898+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/5DXAXKWAGNTVCGKC7TQNTSPVCM","json":"https://pith.science/pith/5DXAXKWAGNTVCGKC7TQNTSPVCM.json","graph_json":"https://pith.science/api/pith-number/5DXAXKWAGNTVCGKC7TQNTSPVCM/graph.json","events_json":"https://pith.science/api/pith-number/5DXAXKWAGNTVCGKC7TQNTSPVCM/events.json","paper":"https://pith.science/paper/5DXAXKWA"},"agent_actions":{"view_html":"https://pith.science/pith/5DXAXKWAGNTVCGKC7TQNTSPVCM","download_json":"https://pith.science/pith/5DXAXKWAGNTVCGKC7TQNTSPVCM.json","view_paper":"https://pith.science/paper/5DXAXKWA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.0153&json=true","fetch_graph":"https://pith.science/api/pith-number/5DXAXKWAGNTVCGKC7TQNTSPVCM/graph.json","fetch_events":"https://pith.science/api/pith-number/5DXAXKWAGNTVCGKC7TQNTSPVCM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5DXAXKWAGNTVCGKC7TQNTSPVCM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5DXAXKWAGNTVCGKC7TQNTSPVCM/action/storage_attestation","attest_author":"https://pith.science/pith/5DXAXKWAGNTVCGKC7TQNTSPVCM/action/author_attestation","sign_citation":"https://pith.science/pith/5DXAXKWAGNTVCGKC7TQNTSPVCM/action/citation_signature","submit_replication":"https://pith.science/pith/5DXAXKWAGNTVCGKC7TQNTSPVCM/action/replication_record"}},"created_at":"2026-05-18T03:19:34.166915+00:00","updated_at":"2026-05-18T03:19:34.166915+00:00"}