{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:IAOS2FLKI7Z3BNK6ZBAZJTILYG","short_pith_number":"pith:IAOS2FLK","schema_version":"1.0","canonical_sha256":"401d2d156a47f3b0b55ec84194cd0bc1be2715aac80dfd5f23f979e439b77595","source":{"kind":"arxiv","id":"1902.02929","version":1},"attestation_state":"computed","paper":{"title":"A Combinatorial Problem Solved by a Meta-Fibonacci Recurrence Relation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Eric Sundberg, Ramin Naimi","submitted_at":"2019-02-08T03:55:07Z","abstract_excerpt":"We present a natural, combinatorial problem whose solution is given by the meta-Fibonacci recurrence relation $a(n) = \\sum_{i=1}^p a(n-i+1 - a(n-i))$, where $p$ is prime. This combinatorial problem is less general than those given in [3] (B. Jackson, F. Ruskey, 2006) and [4] (F. Ruskey, C. Deugau, 2009), but it has the advantage of having a simpler statement."},"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":"1902.02929","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-02-08T03:55:07Z","cross_cats_sorted":[],"title_canon_sha256":"6f72314514b31946e95df66c7bf41005296dff769db15b9c7662473ae99063ad","abstract_canon_sha256":"12521e0ec5db14f543e5a391c494ff1e744819e0072b498f9075a5e6f25ee319"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:28.800356Z","signature_b64":"c5/vBqpzf0LkzBdFIEKc578c/vC8tvNE8zzVeNRiDNH7IUz8d8ZcgAhccr+k6+5JdIztBiknNqtozwDalk6SCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"401d2d156a47f3b0b55ec84194cd0bc1be2715aac80dfd5f23f979e439b77595","last_reissued_at":"2026-05-17T23:54:28.799620Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:28.799620Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Combinatorial Problem Solved by a Meta-Fibonacci Recurrence Relation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Eric Sundberg, Ramin Naimi","submitted_at":"2019-02-08T03:55:07Z","abstract_excerpt":"We present a natural, combinatorial problem whose solution is given by the meta-Fibonacci recurrence relation $a(n) = \\sum_{i=1}^p a(n-i+1 - a(n-i))$, where $p$ is prime. This combinatorial problem is less general than those given in [3] (B. Jackson, F. Ruskey, 2006) and [4] (F. Ruskey, C. Deugau, 2009), but it has the advantage of having a simpler statement."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.02929","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":"1902.02929","created_at":"2026-05-17T23:54:28.799751+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.02929v1","created_at":"2026-05-17T23:54:28.799751+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.02929","created_at":"2026-05-17T23:54:28.799751+00:00"},{"alias_kind":"pith_short_12","alias_value":"IAOS2FLKI7Z3","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"IAOS2FLKI7Z3BNK6","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"IAOS2FLK","created_at":"2026-05-18T12:33:18.533446+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/IAOS2FLKI7Z3BNK6ZBAZJTILYG","json":"https://pith.science/pith/IAOS2FLKI7Z3BNK6ZBAZJTILYG.json","graph_json":"https://pith.science/api/pith-number/IAOS2FLKI7Z3BNK6ZBAZJTILYG/graph.json","events_json":"https://pith.science/api/pith-number/IAOS2FLKI7Z3BNK6ZBAZJTILYG/events.json","paper":"https://pith.science/paper/IAOS2FLK"},"agent_actions":{"view_html":"https://pith.science/pith/IAOS2FLKI7Z3BNK6ZBAZJTILYG","download_json":"https://pith.science/pith/IAOS2FLKI7Z3BNK6ZBAZJTILYG.json","view_paper":"https://pith.science/paper/IAOS2FLK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.02929&json=true","fetch_graph":"https://pith.science/api/pith-number/IAOS2FLKI7Z3BNK6ZBAZJTILYG/graph.json","fetch_events":"https://pith.science/api/pith-number/IAOS2FLKI7Z3BNK6ZBAZJTILYG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IAOS2FLKI7Z3BNK6ZBAZJTILYG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IAOS2FLKI7Z3BNK6ZBAZJTILYG/action/storage_attestation","attest_author":"https://pith.science/pith/IAOS2FLKI7Z3BNK6ZBAZJTILYG/action/author_attestation","sign_citation":"https://pith.science/pith/IAOS2FLKI7Z3BNK6ZBAZJTILYG/action/citation_signature","submit_replication":"https://pith.science/pith/IAOS2FLKI7Z3BNK6ZBAZJTILYG/action/replication_record"}},"created_at":"2026-05-17T23:54:28.799751+00:00","updated_at":"2026-05-17T23:54:28.799751+00:00"}