{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:M26CAQQTD52USLREBIEUT2DPES","short_pith_number":"pith:M26CAQQT","schema_version":"1.0","canonical_sha256":"66bc2042131f75492e240a0949e86f249dfcc1d25da1faac74f48f4237754a29","source":{"kind":"arxiv","id":"2602.15208","version":2},"attestation_state":"computed","paper":{"title":"Self-Convolutions of Generalized Narayana Numbers","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Greg Dresden, Guanzhang Zhou, Yuechen Xiao","submitted_at":"2026-02-16T21:37:17Z","abstract_excerpt":"For the Fibonacci numbers $F_n$, we have the self-convolution formula $5 \\sum_{i=0}^n F_i F_{n-i} = (2n)F_{n+1} - (n+1)F_n$. We find the corresponding self-convolution formula for the Narayana numbers $R_n$ which satisfy $R_n = R_{n-1} + R_{n-3}$, and then generalize it to the $k$-step Narayana numbers $\\mathcal{R}_n$ with order-$k$ recurrence formula $\\mathcal{R}_n = \\mathcal{R}_{n-1} + \\mathcal{R}_{n-k}$."},"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":"2602.15208","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2026-02-16T21:37:17Z","cross_cats_sorted":[],"title_canon_sha256":"1f5916192ff2e06439fde3d5d2028def8d75295d34f76aeea99c6343404bade8","abstract_canon_sha256":"79522c4c41ab5fa499da65c88e3d82d8f0e62e3548ab02593bd4bfaf226ab0e2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-22T01:03:18.112141Z","signature_b64":"FQDBAAwtGQ801mFlqVoQYiQtyz8fz98+yk/ZSv53io1t4/nCPQPRG3pgF0B0AfbagyRldDncYBQ33Ww6pOjLCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"66bc2042131f75492e240a0949e86f249dfcc1d25da1faac74f48f4237754a29","last_reissued_at":"2026-05-22T01:03:18.111291Z","signature_status":"signed_v1","first_computed_at":"2026-05-22T01:03:18.111291Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Self-Convolutions of Generalized Narayana Numbers","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Greg Dresden, Guanzhang Zhou, Yuechen Xiao","submitted_at":"2026-02-16T21:37:17Z","abstract_excerpt":"For the Fibonacci numbers $F_n$, we have the self-convolution formula $5 \\sum_{i=0}^n F_i F_{n-i} = (2n)F_{n+1} - (n+1)F_n$. We find the corresponding self-convolution formula for the Narayana numbers $R_n$ which satisfy $R_n = R_{n-1} + R_{n-3}$, and then generalize it to the $k$-step Narayana numbers $\\mathcal{R}_n$ with order-$k$ recurrence formula $\\mathcal{R}_n = \\mathcal{R}_{n-1} + \\mathcal{R}_{n-k}$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2602.15208","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2602.15208/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":"2602.15208","created_at":"2026-05-22T01:03:18.111420+00:00"},{"alias_kind":"arxiv_version","alias_value":"2602.15208v2","created_at":"2026-05-22T01:03:18.111420+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.15208","created_at":"2026-05-22T01:03:18.111420+00:00"},{"alias_kind":"pith_short_12","alias_value":"M26CAQQTD52U","created_at":"2026-05-22T01:03:18.111420+00:00"},{"alias_kind":"pith_short_16","alias_value":"M26CAQQTD52USLRE","created_at":"2026-05-22T01:03:18.111420+00:00"},{"alias_kind":"pith_short_8","alias_value":"M26CAQQT","created_at":"2026-05-22T01:03:18.111420+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/M26CAQQTD52USLREBIEUT2DPES","json":"https://pith.science/pith/M26CAQQTD52USLREBIEUT2DPES.json","graph_json":"https://pith.science/api/pith-number/M26CAQQTD52USLREBIEUT2DPES/graph.json","events_json":"https://pith.science/api/pith-number/M26CAQQTD52USLREBIEUT2DPES/events.json","paper":"https://pith.science/paper/M26CAQQT"},"agent_actions":{"view_html":"https://pith.science/pith/M26CAQQTD52USLREBIEUT2DPES","download_json":"https://pith.science/pith/M26CAQQTD52USLREBIEUT2DPES.json","view_paper":"https://pith.science/paper/M26CAQQT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2602.15208&json=true","fetch_graph":"https://pith.science/api/pith-number/M26CAQQTD52USLREBIEUT2DPES/graph.json","fetch_events":"https://pith.science/api/pith-number/M26CAQQTD52USLREBIEUT2DPES/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M26CAQQTD52USLREBIEUT2DPES/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M26CAQQTD52USLREBIEUT2DPES/action/storage_attestation","attest_author":"https://pith.science/pith/M26CAQQTD52USLREBIEUT2DPES/action/author_attestation","sign_citation":"https://pith.science/pith/M26CAQQTD52USLREBIEUT2DPES/action/citation_signature","submit_replication":"https://pith.science/pith/M26CAQQTD52USLREBIEUT2DPES/action/replication_record"}},"created_at":"2026-05-22T01:03:18.111420+00:00","updated_at":"2026-05-22T01:03:18.111420+00:00"}