{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:LL43MEX5A25YB3YBHR5LIKDVIX","short_pith_number":"pith:LL43MEX5","schema_version":"1.0","canonical_sha256":"5af9b612fd06bb80ef013c7ab4287545d4958f66f3870a6cf78dedf41f1a2463","source":{"kind":"arxiv","id":"1312.1867","version":2},"attestation_state":"computed","paper":{"title":"Enumeration of $k$-Fibonacci Paths using Infinite Weighted Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jos\\'e L. Ram\\'irez, Rodrigo De Castro","submitted_at":"2013-12-06T13:58:00Z","abstract_excerpt":"In this paper, we introduce a new family of generalized colored Motzkin paths, where horizontal steps are colored by means of $F_{k,l}$ colors, where $F_{k,l}$ is the $l$th $k$-Fibonacci number. We study the enumeration of this family according to the length. For this, we use infinite weighted automata."},"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":"1312.1867","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-12-06T13:58:00Z","cross_cats_sorted":[],"title_canon_sha256":"6ed1fb2e6c126476f13cc49a383b3a75cb6f4b4b8228ec4f7412b60a1372e362","abstract_canon_sha256":"c0804b447098705fca87c853a2f1261bf3a2da580a06b3f27adc4730c290577c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:45:49.642446Z","signature_b64":"+zsKqxVaZ7cMId9sstmJjAd8aGP54qcXvgqKGD2kyEiG9KlxEWf+QIGVj6Qivyqpp69U+vrahoyO+A2AanXLAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5af9b612fd06bb80ef013c7ab4287545d4958f66f3870a6cf78dedf41f1a2463","last_reissued_at":"2026-05-18T02:45:49.641901Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:45:49.641901Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Enumeration of $k$-Fibonacci Paths using Infinite Weighted Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jos\\'e L. Ram\\'irez, Rodrigo De Castro","submitted_at":"2013-12-06T13:58:00Z","abstract_excerpt":"In this paper, we introduce a new family of generalized colored Motzkin paths, where horizontal steps are colored by means of $F_{k,l}$ colors, where $F_{k,l}$ is the $l$th $k$-Fibonacci number. We study the enumeration of this family according to the length. For this, we use infinite weighted automata."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.1867","kind":"arxiv","version":2},"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":"1312.1867","created_at":"2026-05-18T02:45:49.641996+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.1867v2","created_at":"2026-05-18T02:45:49.641996+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.1867","created_at":"2026-05-18T02:45:49.641996+00:00"},{"alias_kind":"pith_short_12","alias_value":"LL43MEX5A25Y","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_16","alias_value":"LL43MEX5A25YB3YB","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_8","alias_value":"LL43MEX5","created_at":"2026-05-18T12:27:51.066281+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/LL43MEX5A25YB3YBHR5LIKDVIX","json":"https://pith.science/pith/LL43MEX5A25YB3YBHR5LIKDVIX.json","graph_json":"https://pith.science/api/pith-number/LL43MEX5A25YB3YBHR5LIKDVIX/graph.json","events_json":"https://pith.science/api/pith-number/LL43MEX5A25YB3YBHR5LIKDVIX/events.json","paper":"https://pith.science/paper/LL43MEX5"},"agent_actions":{"view_html":"https://pith.science/pith/LL43MEX5A25YB3YBHR5LIKDVIX","download_json":"https://pith.science/pith/LL43MEX5A25YB3YBHR5LIKDVIX.json","view_paper":"https://pith.science/paper/LL43MEX5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.1867&json=true","fetch_graph":"https://pith.science/api/pith-number/LL43MEX5A25YB3YBHR5LIKDVIX/graph.json","fetch_events":"https://pith.science/api/pith-number/LL43MEX5A25YB3YBHR5LIKDVIX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LL43MEX5A25YB3YBHR5LIKDVIX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LL43MEX5A25YB3YBHR5LIKDVIX/action/storage_attestation","attest_author":"https://pith.science/pith/LL43MEX5A25YB3YBHR5LIKDVIX/action/author_attestation","sign_citation":"https://pith.science/pith/LL43MEX5A25YB3YBHR5LIKDVIX/action/citation_signature","submit_replication":"https://pith.science/pith/LL43MEX5A25YB3YBHR5LIKDVIX/action/replication_record"}},"created_at":"2026-05-18T02:45:49.641996+00:00","updated_at":"2026-05-18T02:45:49.641996+00:00"}