{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:ECNAS6XW66CSDYT76EJRBMT3RN","short_pith_number":"pith:ECNAS6XW","schema_version":"1.0","canonical_sha256":"209a097af6f78521e27ff11310b27b8b701a72096d0c15d7dd193894e9aab50d","source":{"kind":"arxiv","id":"1705.08343","version":1},"attestation_state":"computed","paper":{"title":"Counting the number of non-zero coefficients in rows of generalized Pascal triangles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Julien Leroy, Manon Stipulanti, Michel Rigo","submitted_at":"2017-05-23T15:03:04Z","abstract_excerpt":"This paper is about counting the number of distinct (scattered) subwords occurring in a given word. More precisely, we consider the generalization of the Pascal triangle to binomial coefficients of words and the sequence $(S(n))_{n\\ge 0}$ counting the number of positive entries on each row. By introducing a convenient tree structure, we provide a recurrence relation for $(S(n))_{n\\ge 0}$. This leads to a connection with the $2$-regular Stern-Brocot sequence and the sequence of denominators occurring in the Farey tree. Then we extend our construction to the Zeckendorf numeration system based on"},"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":"1705.08343","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-23T15:03:04Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"3571d4856feb041e327ba532254793a143a70347b6b2b57658a76f04e5431056","abstract_canon_sha256":"02817e72256992a524bcc7dc8b4a9fe2991a0f0517f9ea039cd345a67c1018d0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:48.518687Z","signature_b64":"eGoz8HbQOuVxGYD36LhmvCriDzsmugBOIsBSZJKzdA529YDo1Xl7VUABqE1zdqCzsvhB4X26LHThWaNAL6FTBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"209a097af6f78521e27ff11310b27b8b701a72096d0c15d7dd193894e9aab50d","last_reissued_at":"2026-05-18T00:43:48.517990Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:48.517990Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Counting the number of non-zero coefficients in rows of generalized Pascal triangles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Julien Leroy, Manon Stipulanti, Michel Rigo","submitted_at":"2017-05-23T15:03:04Z","abstract_excerpt":"This paper is about counting the number of distinct (scattered) subwords occurring in a given word. More precisely, we consider the generalization of the Pascal triangle to binomial coefficients of words and the sequence $(S(n))_{n\\ge 0}$ counting the number of positive entries on each row. By introducing a convenient tree structure, we provide a recurrence relation for $(S(n))_{n\\ge 0}$. This leads to a connection with the $2$-regular Stern-Brocot sequence and the sequence of denominators occurring in the Farey tree. Then we extend our construction to the Zeckendorf numeration system based on"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.08343","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":"1705.08343","created_at":"2026-05-18T00:43:48.518110+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.08343v1","created_at":"2026-05-18T00:43:48.518110+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.08343","created_at":"2026-05-18T00:43:48.518110+00:00"},{"alias_kind":"pith_short_12","alias_value":"ECNAS6XW66CS","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_16","alias_value":"ECNAS6XW66CSDYT7","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_8","alias_value":"ECNAS6XW","created_at":"2026-05-18T12:31:12.930513+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/ECNAS6XW66CSDYT76EJRBMT3RN","json":"https://pith.science/pith/ECNAS6XW66CSDYT76EJRBMT3RN.json","graph_json":"https://pith.science/api/pith-number/ECNAS6XW66CSDYT76EJRBMT3RN/graph.json","events_json":"https://pith.science/api/pith-number/ECNAS6XW66CSDYT76EJRBMT3RN/events.json","paper":"https://pith.science/paper/ECNAS6XW"},"agent_actions":{"view_html":"https://pith.science/pith/ECNAS6XW66CSDYT76EJRBMT3RN","download_json":"https://pith.science/pith/ECNAS6XW66CSDYT76EJRBMT3RN.json","view_paper":"https://pith.science/paper/ECNAS6XW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.08343&json=true","fetch_graph":"https://pith.science/api/pith-number/ECNAS6XW66CSDYT76EJRBMT3RN/graph.json","fetch_events":"https://pith.science/api/pith-number/ECNAS6XW66CSDYT76EJRBMT3RN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ECNAS6XW66CSDYT76EJRBMT3RN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ECNAS6XW66CSDYT76EJRBMT3RN/action/storage_attestation","attest_author":"https://pith.science/pith/ECNAS6XW66CSDYT76EJRBMT3RN/action/author_attestation","sign_citation":"https://pith.science/pith/ECNAS6XW66CSDYT76EJRBMT3RN/action/citation_signature","submit_replication":"https://pith.science/pith/ECNAS6XW66CSDYT76EJRBMT3RN/action/replication_record"}},"created_at":"2026-05-18T00:43:48.518110+00:00","updated_at":"2026-05-18T00:43:48.518110+00:00"}