{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:5GZHELDRHMWYRVIWFRUBN5436L","short_pith_number":"pith:5GZHELDR","schema_version":"1.0","canonical_sha256":"e9b2722c713b2d88d5162c6816f79bf2e2c7aa74cc856f021d899c85afdbfd60","source":{"kind":"arxiv","id":"1103.5689","version":1},"attestation_state":"computed","paper":{"title":"Binary words avoiding a pattern and marked succession rule","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Donatella Merlini, Elisa Pergola, Renzo Pinzani, Stefano Bilotta","submitted_at":"2011-03-29T15:49:14Z","abstract_excerpt":"In this paper we study the enumeration and the construction of particular binary words avoiding the pattern $1^{j+1}0^j$. By means of the theory of Riordan arrays, we solve the enumeration problem and we give a particular succession rule, called jumping and marked succession rule, which describes the growth of such words according to their number of ones. Moreover, the problem of associating a word to a path in the generating tree obtained by the succession rule is solved by introducing an algorithm which constructs all binary words and then kills those containing the forbidden pattern."},"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":"1103.5689","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-03-29T15:49:14Z","cross_cats_sorted":[],"title_canon_sha256":"94b5645bc0c71e25560ea3d6157379eaef5d73fefd15f3d6f65790bfa27ea050","abstract_canon_sha256":"4ee717e862a719f091ad15edab1dcbb456dc9179dbb7cd063071a1bf5c3f9395"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:25:29.063979Z","signature_b64":"TJCJ8foejXxMPjgnb0a8cDCE0Icgbc8mYSu3EX/vZTLZSn6CdNcSrZvL6MjeUratsxFd7MjvNFNV50jm9n3IDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e9b2722c713b2d88d5162c6816f79bf2e2c7aa74cc856f021d899c85afdbfd60","last_reissued_at":"2026-05-18T04:25:29.063508Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:25:29.063508Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Binary words avoiding a pattern and marked succession rule","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Donatella Merlini, Elisa Pergola, Renzo Pinzani, Stefano Bilotta","submitted_at":"2011-03-29T15:49:14Z","abstract_excerpt":"In this paper we study the enumeration and the construction of particular binary words avoiding the pattern $1^{j+1}0^j$. By means of the theory of Riordan arrays, we solve the enumeration problem and we give a particular succession rule, called jumping and marked succession rule, which describes the growth of such words according to their number of ones. Moreover, the problem of associating a word to a path in the generating tree obtained by the succession rule is solved by introducing an algorithm which constructs all binary words and then kills those containing the forbidden pattern."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.5689","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":"1103.5689","created_at":"2026-05-18T04:25:29.063573+00:00"},{"alias_kind":"arxiv_version","alias_value":"1103.5689v1","created_at":"2026-05-18T04:25:29.063573+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.5689","created_at":"2026-05-18T04:25:29.063573+00:00"},{"alias_kind":"pith_short_12","alias_value":"5GZHELDRHMWY","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_16","alias_value":"5GZHELDRHMWYRVIW","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_8","alias_value":"5GZHELDR","created_at":"2026-05-18T12:26:20.644004+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/5GZHELDRHMWYRVIWFRUBN5436L","json":"https://pith.science/pith/5GZHELDRHMWYRVIWFRUBN5436L.json","graph_json":"https://pith.science/api/pith-number/5GZHELDRHMWYRVIWFRUBN5436L/graph.json","events_json":"https://pith.science/api/pith-number/5GZHELDRHMWYRVIWFRUBN5436L/events.json","paper":"https://pith.science/paper/5GZHELDR"},"agent_actions":{"view_html":"https://pith.science/pith/5GZHELDRHMWYRVIWFRUBN5436L","download_json":"https://pith.science/pith/5GZHELDRHMWYRVIWFRUBN5436L.json","view_paper":"https://pith.science/paper/5GZHELDR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1103.5689&json=true","fetch_graph":"https://pith.science/api/pith-number/5GZHELDRHMWYRVIWFRUBN5436L/graph.json","fetch_events":"https://pith.science/api/pith-number/5GZHELDRHMWYRVIWFRUBN5436L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5GZHELDRHMWYRVIWFRUBN5436L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5GZHELDRHMWYRVIWFRUBN5436L/action/storage_attestation","attest_author":"https://pith.science/pith/5GZHELDRHMWYRVIWFRUBN5436L/action/author_attestation","sign_citation":"https://pith.science/pith/5GZHELDRHMWYRVIWFRUBN5436L/action/citation_signature","submit_replication":"https://pith.science/pith/5GZHELDRHMWYRVIWFRUBN5436L/action/replication_record"}},"created_at":"2026-05-18T04:25:29.063573+00:00","updated_at":"2026-05-18T04:25:29.063573+00:00"}