{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:M3ODX7H3NED4RRSNRY4WEYGXL3","short_pith_number":"pith:M3ODX7H3","canonical_record":{"source":{"id":"1307.0088","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"math.CO","submitted_at":"2013-06-29T11:11:06Z","cross_cats_sorted":[],"title_canon_sha256":"ca3972c97d92843c43a25f4dea926f30195e618c42470c419b0f2c3188491e1d","abstract_canon_sha256":"56736471e1a76c9bed1ed37348f75b357ef90f86804ed099d2530ebd9c79c4ac"},"schema_version":"1.0"},"canonical_sha256":"66dc3bfcfb6907c8c64d8e396260d75ef470fd0fb013bad61e814d823851988d","source":{"kind":"arxiv","id":"1307.0088","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.0088","created_at":"2026-05-18T02:26:01Z"},{"alias_kind":"arxiv_version","alias_value":"1307.0088v3","created_at":"2026-05-18T02:26:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.0088","created_at":"2026-05-18T02:26:01Z"},{"alias_kind":"pith_short_12","alias_value":"M3ODX7H3NED4","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"M3ODX7H3NED4RRSN","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"M3ODX7H3","created_at":"2026-05-18T12:27:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:M3ODX7H3NED4RRSNRY4WEYGXL3","target":"record","payload":{"canonical_record":{"source":{"id":"1307.0088","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"math.CO","submitted_at":"2013-06-29T11:11:06Z","cross_cats_sorted":[],"title_canon_sha256":"ca3972c97d92843c43a25f4dea926f30195e618c42470c419b0f2c3188491e1d","abstract_canon_sha256":"56736471e1a76c9bed1ed37348f75b357ef90f86804ed099d2530ebd9c79c4ac"},"schema_version":"1.0"},"canonical_sha256":"66dc3bfcfb6907c8c64d8e396260d75ef470fd0fb013bad61e814d823851988d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:26:01.104501Z","signature_b64":"y4/2me/BS4HzEmep04UdZ39SuDu3dJiqVdEQhhP+IMBnGSo4aRzZYD77Yh0redkB7GfcX6IfOFOlzuFPSzbkCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"66dc3bfcfb6907c8c64d8e396260d75ef470fd0fb013bad61e814d823851988d","last_reissued_at":"2026-05-18T02:26:01.103973Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:26:01.103973Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1307.0088","source_version":3,"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-18T02:26:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vSqP3t4zZOgmYC/qZs47ujacl28AG1g1lKcOZkUfLepXwWWfbMnfDoTTK2y0texP2aBJ0L1ekGYmzHbpZCaMBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T22:33:05.094030Z"},"content_sha256":"b850b5aa2aa02fcd20b1e91b49a55f5d724f4d55ba440ebdd829681394c7f046","schema_version":"1.0","event_id":"sha256:b850b5aa2aa02fcd20b1e91b49a55f5d724f4d55ba440ebdd829681394c7f046"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:M3ODX7H3NED4RRSNRY4WEYGXL3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Twins in words and long common subsequences in permutations","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Boris Bukh, Lidong Zhou","submitted_at":"2013-06-29T11:11:06Z","abstract_excerpt":"A large family of words must contain two words that are similar. We investigate several problems where the measure of similarity is the length of a common subsequence.\n  We construct a family of n^{1/3} permutations on n letters, such that LCS of any two of them is only cn^{1/3}, improving a construction of Beame, Blais, and Huynh-Ngoc. We relate the problem of constructing many permutations with small LCS to the twin word problem of Axenovich, Person and Puzynina. In particular, we show that every word of length n over a k-letter alphabet contains two disjoint equal subsequences of length cnk"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.0088","kind":"arxiv","version":3},"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-18T02:26:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rqS5qHoVAjBTXD8jfkpf/IPUzNM4jKViC5XdKAkCe8qsCPEkfjlBwswON8s/hugpyUNEQOH9JavuysXvztByDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T22:33:05.094873Z"},"content_sha256":"106badcab5ce4fa49acad74831177557fd67759ace788690c58319279dd06ccb","schema_version":"1.0","event_id":"sha256:106badcab5ce4fa49acad74831177557fd67759ace788690c58319279dd06ccb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/M3ODX7H3NED4RRSNRY4WEYGXL3/bundle.json","state_url":"https://pith.science/pith/M3ODX7H3NED4RRSNRY4WEYGXL3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/M3ODX7H3NED4RRSNRY4WEYGXL3/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-31T22:33:05Z","links":{"resolver":"https://pith.science/pith/M3ODX7H3NED4RRSNRY4WEYGXL3","bundle":"https://pith.science/pith/M3ODX7H3NED4RRSNRY4WEYGXL3/bundle.json","state":"https://pith.science/pith/M3ODX7H3NED4RRSNRY4WEYGXL3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/M3ODX7H3NED4RRSNRY4WEYGXL3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:M3ODX7H3NED4RRSNRY4WEYGXL3","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":"56736471e1a76c9bed1ed37348f75b357ef90f86804ed099d2530ebd9c79c4ac","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"math.CO","submitted_at":"2013-06-29T11:11:06Z","title_canon_sha256":"ca3972c97d92843c43a25f4dea926f30195e618c42470c419b0f2c3188491e1d"},"schema_version":"1.0","source":{"id":"1307.0088","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.0088","created_at":"2026-05-18T02:26:01Z"},{"alias_kind":"arxiv_version","alias_value":"1307.0088v3","created_at":"2026-05-18T02:26:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.0088","created_at":"2026-05-18T02:26:01Z"},{"alias_kind":"pith_short_12","alias_value":"M3ODX7H3NED4","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"M3ODX7H3NED4RRSN","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"M3ODX7H3","created_at":"2026-05-18T12:27:51Z"}],"graph_snapshots":[{"event_id":"sha256:106badcab5ce4fa49acad74831177557fd67759ace788690c58319279dd06ccb","target":"graph","created_at":"2026-05-18T02:26:01Z","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":"A large family of words must contain two words that are similar. We investigate several problems where the measure of similarity is the length of a common subsequence.\n  We construct a family of n^{1/3} permutations on n letters, such that LCS of any two of them is only cn^{1/3}, improving a construction of Beame, Blais, and Huynh-Ngoc. We relate the problem of constructing many permutations with small LCS to the twin word problem of Axenovich, Person and Puzynina. In particular, we show that every word of length n over a k-letter alphabet contains two disjoint equal subsequences of length cnk","authors_text":"Boris Bukh, Lidong Zhou","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"math.CO","submitted_at":"2013-06-29T11:11:06Z","title":"Twins in words and long common subsequences in permutations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.0088","kind":"arxiv","version":3},"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:b850b5aa2aa02fcd20b1e91b49a55f5d724f4d55ba440ebdd829681394c7f046","target":"record","created_at":"2026-05-18T02:26:01Z","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":"56736471e1a76c9bed1ed37348f75b357ef90f86804ed099d2530ebd9c79c4ac","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"math.CO","submitted_at":"2013-06-29T11:11:06Z","title_canon_sha256":"ca3972c97d92843c43a25f4dea926f30195e618c42470c419b0f2c3188491e1d"},"schema_version":"1.0","source":{"id":"1307.0088","kind":"arxiv","version":3}},"canonical_sha256":"66dc3bfcfb6907c8c64d8e396260d75ef470fd0fb013bad61e814d823851988d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"66dc3bfcfb6907c8c64d8e396260d75ef470fd0fb013bad61e814d823851988d","first_computed_at":"2026-05-18T02:26:01.103973Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:26:01.103973Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"y4/2me/BS4HzEmep04UdZ39SuDu3dJiqVdEQhhP+IMBnGSo4aRzZYD77Yh0redkB7GfcX6IfOFOlzuFPSzbkCg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:26:01.104501Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.0088","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b850b5aa2aa02fcd20b1e91b49a55f5d724f4d55ba440ebdd829681394c7f046","sha256:106badcab5ce4fa49acad74831177557fd67759ace788690c58319279dd06ccb"],"state_sha256":"7ca3e23b3a0847c100cb81382a986a6493dc6ceab9f1acb718c0b2fde745a40c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DDaG0EihXkTX2HPsBu/RtxL22cit5bfyYZ0A3TLxgVeQatboHkV9cDINs9Ay0vqEUcQRZrufHyP2guGxYi/YAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T22:33:05.099080Z","bundle_sha256":"bb0d520d6c0b6ac49cb813a5de329cec5dca68ae33e3a97f968dbc3f0fa39004"}}