{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:4M4A2KF74MBU5VOB5AI6CVQGIE","short_pith_number":"pith:4M4A2KF7","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"},"canonical_sha256":"e3380d28bfe3034ed5c1e811e156064125100881349dec988cd43dd2dd89524d","source":{"kind":"arxiv","id":"1509.04372","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.04372","created_at":"2026-05-18T01:33:07Z"},{"alias_kind":"arxiv_version","alias_value":"1509.04372v1","created_at":"2026-05-18T01:33:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.04372","created_at":"2026-05-18T01:33:07Z"},{"alias_kind":"pith_short_12","alias_value":"4M4A2KF74MBU","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"4M4A2KF74MBU5VOB","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"4M4A2KF7","created_at":"2026-05-18T12:29:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:4M4A2KF74MBU5VOB5AI6CVQGIE","target":"record","payload":{"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"},"canonical_sha256":"e3380d28bfe3034ed5c1e811e156064125100881349dec988cd43dd2dd89524d","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"},"source_kind":"arxiv","source_id":"1509.04372","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:33:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eY+vHNHludZUCTdWEfF9Gn5+/Aws3g2pB2Og2CVdWW/JUyZVLAGj5XVW/+sfptoNzlLDKFwMs9t/qK/rvifUDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T21:40:35.880728Z"},"content_sha256":"2ab82b9eb922d943fe38a81fff0bbac67f1b122455d72f8e62e8109f5bec22ce","schema_version":"1.0","event_id":"sha256:2ab82b9eb922d943fe38a81fff0bbac67f1b122455d72f8e62e8109f5bec22ce"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:4M4A2KF74MBU5VOB5AI6CVQGIE","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:33:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zUpUmvpqDUFtFLfaOkD6VGC32VsJwr0NPOiaR/V35QzfwUbBXXluoVrsK28X6+D4AjI8yea5S4Hq/7r/EPUiBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T21:40:35.881064Z"},"content_sha256":"6611d8dbff7fa740610aca9b9747591b560bebf046656d8aaa2e13a3bc00be24","schema_version":"1.0","event_id":"sha256:6611d8dbff7fa740610aca9b9747591b560bebf046656d8aaa2e13a3bc00be24"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4M4A2KF74MBU5VOB5AI6CVQGIE/bundle.json","state_url":"https://pith.science/pith/4M4A2KF74MBU5VOB5AI6CVQGIE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4M4A2KF74MBU5VOB5AI6CVQGIE/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-21T21:40:35Z","links":{"resolver":"https://pith.science/pith/4M4A2KF74MBU5VOB5AI6CVQGIE","bundle":"https://pith.science/pith/4M4A2KF74MBU5VOB5AI6CVQGIE/bundle.json","state":"https://pith.science/pith/4M4A2KF74MBU5VOB5AI6CVQGIE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4M4A2KF74MBU5VOB5AI6CVQGIE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:4M4A2KF74MBU5VOB5AI6CVQGIE","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"22c89dfa5f5ed39313b4966a2c6859fbcffbb687d8a2916b10ed27a93044c93d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-15T01:46:59Z","title_canon_sha256":"7dd2bef430f55801f1b9bad74d9db0fdf89b3b1bde81f5424fe26a2d5c43405f"},"schema_version":"1.0","source":{"id":"1509.04372","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.04372","created_at":"2026-05-18T01:33:07Z"},{"alias_kind":"arxiv_version","alias_value":"1509.04372v1","created_at":"2026-05-18T01:33:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.04372","created_at":"2026-05-18T01:33:07Z"},{"alias_kind":"pith_short_12","alias_value":"4M4A2KF74MBU","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"4M4A2KF74MBU5VOB","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"4M4A2KF7","created_at":"2026-05-18T12:29:05Z"}],"graph_snapshots":[{"event_id":"sha256:6611d8dbff7fa740610aca9b9747591b560bebf046656d8aaa2e13a3bc00be24","target":"graph","created_at":"2026-05-18T01:33:07Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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 ","authors_text":"Danny Rorabaugh","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-15T01:46:59Z","title":"Toward the Combinatorial Limit Theory of Free Words"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.04372","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:2ab82b9eb922d943fe38a81fff0bbac67f1b122455d72f8e62e8109f5bec22ce","target":"record","created_at":"2026-05-18T01:33:07Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"22c89dfa5f5ed39313b4966a2c6859fbcffbb687d8a2916b10ed27a93044c93d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-15T01:46:59Z","title_canon_sha256":"7dd2bef430f55801f1b9bad74d9db0fdf89b3b1bde81f5424fe26a2d5c43405f"},"schema_version":"1.0","source":{"id":"1509.04372","kind":"arxiv","version":1}},"canonical_sha256":"e3380d28bfe3034ed5c1e811e156064125100881349dec988cd43dd2dd89524d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e3380d28bfe3034ed5c1e811e156064125100881349dec988cd43dd2dd89524d","first_computed_at":"2026-05-18T01:33:07.346971Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:33:07.346971Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vZVSlGowX1V5f/pgNQGIrsJP2Rr+uwP13Mkop8JdzG98t9qrjOZp1L01rwI9i60GoKE9ECOillQH5BlR79oTCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:33:07.347360Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.04372","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2ab82b9eb922d943fe38a81fff0bbac67f1b122455d72f8e62e8109f5bec22ce","sha256:6611d8dbff7fa740610aca9b9747591b560bebf046656d8aaa2e13a3bc00be24"],"state_sha256":"ba94b793496726b50b77838b88d08d31478a498e770be7187d8dce54861c2457"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nYRJUlvN1heIjLkrwkckBzrkuBgdcW2u3OGgP2EmSyuAX6LyURODVdKDv7hUTs4kY6DGShNz2JtRA2+3bQ8SAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T21:40:35.882961Z","bundle_sha256":"b536ab6f9819db0269ec34f3892e55cdab234a07e5fe3fc0d7816bdea40de95f"}}