{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:ZA74GMJXEJVTCUWCQ2EMXZX3YZ","short_pith_number":"pith:ZA74GMJX","schema_version":"1.0","canonical_sha256":"c83fc33137226b3152c28688cbe6fbc65e9af5d6c73e086946f92d846425639f","source":{"kind":"arxiv","id":"1708.06461","version":1},"attestation_state":"computed","paper":{"title":"Dyck Words, Lattice Paths, and Abelian Borders","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"F. Blanchet-Sadri (Department of Computer Science, Kenneth Hawes (Department of Mathematics, Kun Chen (Department of Computer Science, University of North Carolina), University of Virginia)","submitted_at":"2017-08-22T00:48:32Z","abstract_excerpt":"We use results on Dyck words and lattice paths to derive a formula for the exact number of binary words of a given length with a given minimal abelian border length, tightening a bound on that number from Christodoulakis et al. (Discrete Applied Mathematics, 2014). We also extend to any number of distinct abelian borders a result of Rampersad et al. (Developments in Language Theory, 2013) on the exact number of binary words of a given length with no abelian borders. Furthermore, we generalize these results to partial words."},"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":"1708.06461","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2017-08-22T00:48:32Z","cross_cats_sorted":[],"title_canon_sha256":"9ca4cfaaca13f0ff894999071111cd34e4ed8fb7506317f19cbfd2c250f437c9","abstract_canon_sha256":"1f440e1c9b2c8d9a3edbb5da3b30bf50b4db88146d688e5cea52c3ff79385168"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:37:41.443849Z","signature_b64":"esJ3t2YCXCMzhcRM8aUliMKj6UlEAKqRFfszrEiUI5zd2WacG01x/lYeuX4sZHy7qzpeWIOX/NFCkU2ZDsw6Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c83fc33137226b3152c28688cbe6fbc65e9af5d6c73e086946f92d846425639f","last_reissued_at":"2026-05-18T00:37:41.443097Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:37:41.443097Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dyck Words, Lattice Paths, and Abelian Borders","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"F. Blanchet-Sadri (Department of Computer Science, Kenneth Hawes (Department of Mathematics, Kun Chen (Department of Computer Science, University of North Carolina), University of Virginia)","submitted_at":"2017-08-22T00:48:32Z","abstract_excerpt":"We use results on Dyck words and lattice paths to derive a formula for the exact number of binary words of a given length with a given minimal abelian border length, tightening a bound on that number from Christodoulakis et al. (Discrete Applied Mathematics, 2014). We also extend to any number of distinct abelian borders a result of Rampersad et al. (Developments in Language Theory, 2013) on the exact number of binary words of a given length with no abelian borders. Furthermore, we generalize these results to partial words."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.06461","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":"1708.06461","created_at":"2026-05-18T00:37:41.443229+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.06461v1","created_at":"2026-05-18T00:37:41.443229+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.06461","created_at":"2026-05-18T00:37:41.443229+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZA74GMJXEJVT","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZA74GMJXEJVTCUWC","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZA74GMJX","created_at":"2026-05-18T12:31:59.375834+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/ZA74GMJXEJVTCUWCQ2EMXZX3YZ","json":"https://pith.science/pith/ZA74GMJXEJVTCUWCQ2EMXZX3YZ.json","graph_json":"https://pith.science/api/pith-number/ZA74GMJXEJVTCUWCQ2EMXZX3YZ/graph.json","events_json":"https://pith.science/api/pith-number/ZA74GMJXEJVTCUWCQ2EMXZX3YZ/events.json","paper":"https://pith.science/paper/ZA74GMJX"},"agent_actions":{"view_html":"https://pith.science/pith/ZA74GMJXEJVTCUWCQ2EMXZX3YZ","download_json":"https://pith.science/pith/ZA74GMJXEJVTCUWCQ2EMXZX3YZ.json","view_paper":"https://pith.science/paper/ZA74GMJX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.06461&json=true","fetch_graph":"https://pith.science/api/pith-number/ZA74GMJXEJVTCUWCQ2EMXZX3YZ/graph.json","fetch_events":"https://pith.science/api/pith-number/ZA74GMJXEJVTCUWCQ2EMXZX3YZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZA74GMJXEJVTCUWCQ2EMXZX3YZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZA74GMJXEJVTCUWCQ2EMXZX3YZ/action/storage_attestation","attest_author":"https://pith.science/pith/ZA74GMJXEJVTCUWCQ2EMXZX3YZ/action/author_attestation","sign_citation":"https://pith.science/pith/ZA74GMJXEJVTCUWCQ2EMXZX3YZ/action/citation_signature","submit_replication":"https://pith.science/pith/ZA74GMJXEJVTCUWCQ2EMXZX3YZ/action/replication_record"}},"created_at":"2026-05-18T00:37:41.443229+00:00","updated_at":"2026-05-18T00:37:41.443229+00:00"}