{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:4M4A2KF74MBU5VOB5AI6CVQGIE","short_pith_number":"pith:4M4A2KF7","schema_version":"1.0","canonical_sha256":"e3380d28bfe3034ed5c1e811e156064125100881349dec988cd43dd2dd89524d","source":{"kind":"arxiv","id":"1509.04372","version":1},"attestation_state":"computed","paper":{"title":"Toward the Combinatorial Limit Theory of Free Words","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Danny Rorabaugh","submitted_at":"2015-09-15T01:46:59Z","abstract_excerpt":"Free words are elements of a free monoid, generated over an alphabet via the binary operation of concatenation. Casually speaking, a free word is a finite string of letters. Henceforth, we simply refer to them as words. Motivated by recent advances in the combinatorial limit theory of graphs-notably those involving flag algebras, graph homomorphisms, and graphons-we investigate the extremal and asymptotic theory of pattern containment and avoidance in words. Word V is a factor of word W provided V occurs as consecutive letters within W. W is an instance of V provided there exists a nonerasing "},"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":"1509.04372","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-15T01:46:59Z","cross_cats_sorted":[],"title_canon_sha256":"7dd2bef430f55801f1b9bad74d9db0fdf89b3b1bde81f5424fe26a2d5c43405f","abstract_canon_sha256":"22c89dfa5f5ed39313b4966a2c6859fbcffbb687d8a2916b10ed27a93044c93d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:33:07.347360Z","signature_b64":"vZVSlGowX1V5f/pgNQGIrsJP2Rr+uwP13Mkop8JdzG98t9qrjOZp1L01rwI9i60GoKE9ECOillQH5BlR79oTCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e3380d28bfe3034ed5c1e811e156064125100881349dec988cd43dd2dd89524d","last_reissued_at":"2026-05-18T01:33:07.346971Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:33:07.346971Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Toward the Combinatorial Limit Theory of Free Words","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Danny Rorabaugh","submitted_at":"2015-09-15T01:46:59Z","abstract_excerpt":"Free words are elements of a free monoid, generated over an alphabet via the binary operation of concatenation. Casually speaking, a free word is a finite string of letters. Henceforth, we simply refer to them as words. Motivated by recent advances in the combinatorial limit theory of graphs-notably those involving flag algebras, graph homomorphisms, and graphons-we investigate the extremal and asymptotic theory of pattern containment and avoidance in words. Word V is a factor of word W provided V occurs as consecutive letters within W. W is an instance of V provided there exists a nonerasing "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.04372","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":"1509.04372","created_at":"2026-05-18T01:33:07.347030+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.04372v1","created_at":"2026-05-18T01:33:07.347030+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.04372","created_at":"2026-05-18T01:33:07.347030+00:00"},{"alias_kind":"pith_short_12","alias_value":"4M4A2KF74MBU","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_16","alias_value":"4M4A2KF74MBU5VOB","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_8","alias_value":"4M4A2KF7","created_at":"2026-05-18T12:29:05.191682+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/4M4A2KF74MBU5VOB5AI6CVQGIE","json":"https://pith.science/pith/4M4A2KF74MBU5VOB5AI6CVQGIE.json","graph_json":"https://pith.science/api/pith-number/4M4A2KF74MBU5VOB5AI6CVQGIE/graph.json","events_json":"https://pith.science/api/pith-number/4M4A2KF74MBU5VOB5AI6CVQGIE/events.json","paper":"https://pith.science/paper/4M4A2KF7"},"agent_actions":{"view_html":"https://pith.science/pith/4M4A2KF74MBU5VOB5AI6CVQGIE","download_json":"https://pith.science/pith/4M4A2KF74MBU5VOB5AI6CVQGIE.json","view_paper":"https://pith.science/paper/4M4A2KF7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.04372&json=true","fetch_graph":"https://pith.science/api/pith-number/4M4A2KF74MBU5VOB5AI6CVQGIE/graph.json","fetch_events":"https://pith.science/api/pith-number/4M4A2KF74MBU5VOB5AI6CVQGIE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4M4A2KF74MBU5VOB5AI6CVQGIE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4M4A2KF74MBU5VOB5AI6CVQGIE/action/storage_attestation","attest_author":"https://pith.science/pith/4M4A2KF74MBU5VOB5AI6CVQGIE/action/author_attestation","sign_citation":"https://pith.science/pith/4M4A2KF74MBU5VOB5AI6CVQGIE/action/citation_signature","submit_replication":"https://pith.science/pith/4M4A2KF74MBU5VOB5AI6CVQGIE/action/replication_record"}},"created_at":"2026-05-18T01:33:07.347030+00:00","updated_at":"2026-05-18T01:33:07.347030+00:00"}