{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:W6RF6T7A72XL3SDXBNVKJDSIX3","short_pith_number":"pith:W6RF6T7A","canonical_record":{"source":{"id":"1204.2180","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-04-10T15:16:18Z","cross_cats_sorted":["cs.DM","q-bio.QM"],"title_canon_sha256":"e2dfe492d760df9ef2a35f0c1232bbee677f935aa106c7ef571ebe9f8c000c16","abstract_canon_sha256":"981eba4d753061eb30f547825a8d2350c7e417c10c20a4021d1eec7ac4d07266"},"schema_version":"1.0"},"canonical_sha256":"b7a25f4fe0feaebdc8770b6aa48e48bef450e368dafb1c78f1acca15b3b15b64","source":{"kind":"arxiv","id":"1204.2180","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.2180","created_at":"2026-05-18T03:58:13Z"},{"alias_kind":"arxiv_version","alias_value":"1204.2180v1","created_at":"2026-05-18T03:58:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.2180","created_at":"2026-05-18T03:58:13Z"},{"alias_kind":"pith_short_12","alias_value":"W6RF6T7A72XL","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"W6RF6T7A72XL3SDX","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"W6RF6T7A","created_at":"2026-05-18T12:27:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:W6RF6T7A72XL3SDXBNVKJDSIX3","target":"record","payload":{"canonical_record":{"source":{"id":"1204.2180","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-04-10T15:16:18Z","cross_cats_sorted":["cs.DM","q-bio.QM"],"title_canon_sha256":"e2dfe492d760df9ef2a35f0c1232bbee677f935aa106c7ef571ebe9f8c000c16","abstract_canon_sha256":"981eba4d753061eb30f547825a8d2350c7e417c10c20a4021d1eec7ac4d07266"},"schema_version":"1.0"},"canonical_sha256":"b7a25f4fe0feaebdc8770b6aa48e48bef450e368dafb1c78f1acca15b3b15b64","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:58:13.091597Z","signature_b64":"hgRIaj4Y8/r7Q7Q83jxqUWnUEsBqc3dVPVILMdBzjj9TX8KYq0Mrp1MdwWYKsaHLD6NS0gf4zyW0eh8c5pG3CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b7a25f4fe0feaebdc8770b6aa48e48bef450e368dafb1c78f1acca15b3b15b64","last_reissued_at":"2026-05-18T03:58:13.090768Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:58:13.090768Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1204.2180","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-18T03:58:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y8MShrxtixYoTJjUFXeER/f4GdmthinW2/3mvCuhwhZr9cDUpf+Ol1CycmkAQ32WjESYs5e9LRDA8WfDEVvGAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T15:01:04.273233Z"},"content_sha256":"4a994c01307a6d26ad5f4159297923bdc343ece08c82caa2932da9fef15ae547","schema_version":"1.0","event_id":"sha256:4a994c01307a6d26ad5f4159297923bdc343ece08c82caa2932da9fef15ae547"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:W6RF6T7A72XL3SDXBNVKJDSIX3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A regularity lemma and twins in words","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","q-bio.QM"],"primary_cat":"math.CO","authors_text":"Maria Axenovich, Svetlana Puzynina, Yury Person","submitted_at":"2012-04-10T15:16:18Z","abstract_excerpt":"For a word $S$, let $f(S)$ be the largest integer $m$ such that there are two disjoints identical (scattered) subwords of length $m$. Let $f(n, \\Sigma) = \\min \\{f(S): S \\text{is of length} n, \\text{over alphabet} \\Sigma \\}$. Here, it is shown that \\[2f(n, \\{0,1\\}) = n-o(n)\\] using the regularity lemma for words.\n  I.e., any binary word of length $n$ can be split into two identical subwords (referred to as twins) and, perhaps, a remaining subword of length $o(n)$. A similar result is proven for $k$ identical subwords of a word over an alphabet with at most $k$ letters."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.2180","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-18T03:58:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3h9H8EdoC9aMewd+V7CMk1+IdPpuWLxIaRfChacUhYBuVR66ZAXuTA4PqwVIDQJc4p4A0GXMksb7Yrp6/5cAAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T15:01:04.273629Z"},"content_sha256":"e09abe06b7d8914327b3275e2c05e15ff73fee8693416c99ed0aa1b31152f80b","schema_version":"1.0","event_id":"sha256:e09abe06b7d8914327b3275e2c05e15ff73fee8693416c99ed0aa1b31152f80b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/W6RF6T7A72XL3SDXBNVKJDSIX3/bundle.json","state_url":"https://pith.science/pith/W6RF6T7A72XL3SDXBNVKJDSIX3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/W6RF6T7A72XL3SDXBNVKJDSIX3/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-05-27T15:01:04Z","links":{"resolver":"https://pith.science/pith/W6RF6T7A72XL3SDXBNVKJDSIX3","bundle":"https://pith.science/pith/W6RF6T7A72XL3SDXBNVKJDSIX3/bundle.json","state":"https://pith.science/pith/W6RF6T7A72XL3SDXBNVKJDSIX3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/W6RF6T7A72XL3SDXBNVKJDSIX3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:W6RF6T7A72XL3SDXBNVKJDSIX3","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":"981eba4d753061eb30f547825a8d2350c7e417c10c20a4021d1eec7ac4d07266","cross_cats_sorted":["cs.DM","q-bio.QM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-04-10T15:16:18Z","title_canon_sha256":"e2dfe492d760df9ef2a35f0c1232bbee677f935aa106c7ef571ebe9f8c000c16"},"schema_version":"1.0","source":{"id":"1204.2180","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.2180","created_at":"2026-05-18T03:58:13Z"},{"alias_kind":"arxiv_version","alias_value":"1204.2180v1","created_at":"2026-05-18T03:58:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.2180","created_at":"2026-05-18T03:58:13Z"},{"alias_kind":"pith_short_12","alias_value":"W6RF6T7A72XL","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"W6RF6T7A72XL3SDX","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"W6RF6T7A","created_at":"2026-05-18T12:27:25Z"}],"graph_snapshots":[{"event_id":"sha256:e09abe06b7d8914327b3275e2c05e15ff73fee8693416c99ed0aa1b31152f80b","target":"graph","created_at":"2026-05-18T03:58:13Z","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":"For a word $S$, let $f(S)$ be the largest integer $m$ such that there are two disjoints identical (scattered) subwords of length $m$. Let $f(n, \\Sigma) = \\min \\{f(S): S \\text{is of length} n, \\text{over alphabet} \\Sigma \\}$. Here, it is shown that \\[2f(n, \\{0,1\\}) = n-o(n)\\] using the regularity lemma for words.\n  I.e., any binary word of length $n$ can be split into two identical subwords (referred to as twins) and, perhaps, a remaining subword of length $o(n)$. A similar result is proven for $k$ identical subwords of a word over an alphabet with at most $k$ letters.","authors_text":"Maria Axenovich, Svetlana Puzynina, Yury Person","cross_cats":["cs.DM","q-bio.QM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-04-10T15:16:18Z","title":"A regularity lemma and twins in words"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.2180","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:4a994c01307a6d26ad5f4159297923bdc343ece08c82caa2932da9fef15ae547","target":"record","created_at":"2026-05-18T03:58:13Z","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":"981eba4d753061eb30f547825a8d2350c7e417c10c20a4021d1eec7ac4d07266","cross_cats_sorted":["cs.DM","q-bio.QM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-04-10T15:16:18Z","title_canon_sha256":"e2dfe492d760df9ef2a35f0c1232bbee677f935aa106c7ef571ebe9f8c000c16"},"schema_version":"1.0","source":{"id":"1204.2180","kind":"arxiv","version":1}},"canonical_sha256":"b7a25f4fe0feaebdc8770b6aa48e48bef450e368dafb1c78f1acca15b3b15b64","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b7a25f4fe0feaebdc8770b6aa48e48bef450e368dafb1c78f1acca15b3b15b64","first_computed_at":"2026-05-18T03:58:13.090768Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:58:13.090768Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hgRIaj4Y8/r7Q7Q83jxqUWnUEsBqc3dVPVILMdBzjj9TX8KYq0Mrp1MdwWYKsaHLD6NS0gf4zyW0eh8c5pG3CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:58:13.091597Z","signed_message":"canonical_sha256_bytes"},"source_id":"1204.2180","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4a994c01307a6d26ad5f4159297923bdc343ece08c82caa2932da9fef15ae547","sha256:e09abe06b7d8914327b3275e2c05e15ff73fee8693416c99ed0aa1b31152f80b"],"state_sha256":"1bf5b994a81b0932345cd6469fb702b3213d19f5cc36f9e45c93b434348d1643"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1/bR+Sy0+6lNr0RdkFngI6UIdAFJcVW4BPQcyarHcKR2+5wFOVlkAUBGXJpq0AZIkx91T60uj78KYIawwuIcDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T15:01:04.276705Z","bundle_sha256":"d87160348770f01ff5439f9d8f7acd7264ddc8e189c33a7c8c8fefae96992eeb"}}