{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:VA3UKCT53XLSUKJKU33NG5Z6EE","short_pith_number":"pith:VA3UKCT5","schema_version":"1.0","canonical_sha256":"a837450a7dddd72a292aa6f6d3773e211586827db710fa89d2020143b619b101","source":{"kind":"arxiv","id":"1210.7620","version":1},"attestation_state":"computed","paper":{"title":"Generation of binary words avoiding alternating patterns","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Elisabetta Grazzini, Elisa Pergola, Renzo Pinzani, Stefano Bilotta","submitted_at":"2012-10-29T11:07:42Z","abstract_excerpt":"In this paper we propose an algorithm to generate binary words with no more 0's than 1's having a fixed number of 1's and avoiding the pattern $(10)^j1$ for any fixed $j \\geq 1$. We will prove that this generation is exhaustive, that is, all such binary words are generated."},"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":"1210.7620","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-10-29T11:07:42Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"c054beeef3949ef24e8caed2fea5bf4b2d1f8349e7d7f74b24b7da44e35e6f39","abstract_canon_sha256":"7565c1f7aaeb7e5dace3db3bbe58bbd427530ebe2ef8e528c8c85a2c86414a39"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:42:09.326658Z","signature_b64":"E2LdCajowoocj6xi1zk9MqXHRrO1Hn2c/VUdTkIXvo0C9J1RkMmuYDZYJ2JF5xut9miIQmCp/tI9HpOdjmGZCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a837450a7dddd72a292aa6f6d3773e211586827db710fa89d2020143b619b101","last_reissued_at":"2026-05-18T03:42:09.325753Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:42:09.325753Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generation of binary words avoiding alternating patterns","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Elisabetta Grazzini, Elisa Pergola, Renzo Pinzani, Stefano Bilotta","submitted_at":"2012-10-29T11:07:42Z","abstract_excerpt":"In this paper we propose an algorithm to generate binary words with no more 0's than 1's having a fixed number of 1's and avoiding the pattern $(10)^j1$ for any fixed $j \\geq 1$. We will prove that this generation is exhaustive, that is, all such binary words are generated."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.7620","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":"1210.7620","created_at":"2026-05-18T03:42:09.325895+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.7620v1","created_at":"2026-05-18T03:42:09.325895+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.7620","created_at":"2026-05-18T03:42:09.325895+00:00"},{"alias_kind":"pith_short_12","alias_value":"VA3UKCT53XLS","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_16","alias_value":"VA3UKCT53XLSUKJK","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_8","alias_value":"VA3UKCT5","created_at":"2026-05-18T12:27:25.539911+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/VA3UKCT53XLSUKJKU33NG5Z6EE","json":"https://pith.science/pith/VA3UKCT53XLSUKJKU33NG5Z6EE.json","graph_json":"https://pith.science/api/pith-number/VA3UKCT53XLSUKJKU33NG5Z6EE/graph.json","events_json":"https://pith.science/api/pith-number/VA3UKCT53XLSUKJKU33NG5Z6EE/events.json","paper":"https://pith.science/paper/VA3UKCT5"},"agent_actions":{"view_html":"https://pith.science/pith/VA3UKCT53XLSUKJKU33NG5Z6EE","download_json":"https://pith.science/pith/VA3UKCT53XLSUKJKU33NG5Z6EE.json","view_paper":"https://pith.science/paper/VA3UKCT5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.7620&json=true","fetch_graph":"https://pith.science/api/pith-number/VA3UKCT53XLSUKJKU33NG5Z6EE/graph.json","fetch_events":"https://pith.science/api/pith-number/VA3UKCT53XLSUKJKU33NG5Z6EE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VA3UKCT53XLSUKJKU33NG5Z6EE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VA3UKCT53XLSUKJKU33NG5Z6EE/action/storage_attestation","attest_author":"https://pith.science/pith/VA3UKCT53XLSUKJKU33NG5Z6EE/action/author_attestation","sign_citation":"https://pith.science/pith/VA3UKCT53XLSUKJKU33NG5Z6EE/action/citation_signature","submit_replication":"https://pith.science/pith/VA3UKCT53XLSUKJKU33NG5Z6EE/action/replication_record"}},"created_at":"2026-05-18T03:42:09.325895+00:00","updated_at":"2026-05-18T03:42:09.325895+00:00"}