{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:MCOTD5OGGL5RFZWSTOWQDL66PI","short_pith_number":"pith:MCOTD5OG","canonical_record":{"source":{"id":"1406.1413","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-05T15:26:56Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"51cee9ad7ded26423ac0a40efe632615bf5884660a7f2636e79a17f3890dbcdd","abstract_canon_sha256":"cd7e5927104e9658d1ea8114bf40f0b2ac930f09527fc4cefce3cb6b52dbe0ab"},"schema_version":"1.0"},"canonical_sha256":"609d31f5c632fb12e6d29bad01afde7a3786eb0bfde3379e6a396ff0db31f48b","source":{"kind":"arxiv","id":"1406.1413","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.1413","created_at":"2026-05-18T01:35:20Z"},{"alias_kind":"arxiv_version","alias_value":"1406.1413v3","created_at":"2026-05-18T01:35:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.1413","created_at":"2026-05-18T01:35:20Z"},{"alias_kind":"pith_short_12","alias_value":"MCOTD5OGGL5R","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"MCOTD5OGGL5RFZWS","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"MCOTD5OG","created_at":"2026-05-18T12:28:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:MCOTD5OGGL5RFZWSTOWQDL66PI","target":"record","payload":{"canonical_record":{"source":{"id":"1406.1413","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-05T15:26:56Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"51cee9ad7ded26423ac0a40efe632615bf5884660a7f2636e79a17f3890dbcdd","abstract_canon_sha256":"cd7e5927104e9658d1ea8114bf40f0b2ac930f09527fc4cefce3cb6b52dbe0ab"},"schema_version":"1.0"},"canonical_sha256":"609d31f5c632fb12e6d29bad01afde7a3786eb0bfde3379e6a396ff0db31f48b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:20.718074Z","signature_b64":"0b9CQriyv2ZKRqmuPFD63cLQhbC3bNHKqeWX/NZn7ydxfYMykC+vTSwXkO2Du944c7IC0MKq1NWyX1PjQEZ2CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"609d31f5c632fb12e6d29bad01afde7a3786eb0bfde3379e6a396ff0db31f48b","last_reissued_at":"2026-05-18T01:35:20.717334Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:20.717334Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1406.1413","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-18T01:35:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6USc0X+c51Dw5F2xtdrnPBg1Q8mpBa7lsC8Af11sjnXAhaUZMTov1LcFZBdi3Xh/gUlrnccoqabeD9IviCh8DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T01:24:38.943716Z"},"content_sha256":"afb3be63fafaff06f65839cba8c6e57ca7785ad5648bc2421b898b9bfa1d4bfc","schema_version":"1.0","event_id":"sha256:afb3be63fafaff06f65839cba8c6e57ca7785ad5648bc2421b898b9bfa1d4bfc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:MCOTD5OGGL5RFZWSTOWQDL66PI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Composing short 3-compressing words on a 2 letter alphabet","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"math.CO","authors_text":"Achille Frigeri, Alessandra Cherubini, Zuhua Liu","submitted_at":"2014-06-05T15:26:56Z","abstract_excerpt":"A finite deterministic (semi)automaton $\\mathcal{A} =(Q,\\Sigma,\\delta)$ is $k$-compressible if there is some word $w\\in \\Sigma^+$ such that the image of its state set $Q$ under the natural action of $w$ is reduced by at least $k$ states. Such word, if it exists, is called a $k$-compressing word for $\\mathcal{A}$. A word is $k$-collapsing if it is $k$-compressing for each $k$-compressible automaton. We compute a set $W$ of short words such that each $3$-compressible automata on a two letter alphabet is $3$-compressed at least by a word in $W$. Then we construct a shortest common superstring of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.1413","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-18T01:35:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TkWwAR9/rm9Me5/gBkczljVAYQgpVW1vQ0kyPqni1TfVCFnWVk3cm2zEtDACgnEZ9HIm6PYBSpSHEIPw2taSDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T01:24:38.944070Z"},"content_sha256":"ea5b97e39ab35c9933540243940e67cac89eb8ca605fcd5af02b29c8658095b4","schema_version":"1.0","event_id":"sha256:ea5b97e39ab35c9933540243940e67cac89eb8ca605fcd5af02b29c8658095b4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MCOTD5OGGL5RFZWSTOWQDL66PI/bundle.json","state_url":"https://pith.science/pith/MCOTD5OGGL5RFZWSTOWQDL66PI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MCOTD5OGGL5RFZWSTOWQDL66PI/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-12T01:24:38Z","links":{"resolver":"https://pith.science/pith/MCOTD5OGGL5RFZWSTOWQDL66PI","bundle":"https://pith.science/pith/MCOTD5OGGL5RFZWSTOWQDL66PI/bundle.json","state":"https://pith.science/pith/MCOTD5OGGL5RFZWSTOWQDL66PI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MCOTD5OGGL5RFZWSTOWQDL66PI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:MCOTD5OGGL5RFZWSTOWQDL66PI","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":"cd7e5927104e9658d1ea8114bf40f0b2ac930f09527fc4cefce3cb6b52dbe0ab","cross_cats_sorted":["cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-05T15:26:56Z","title_canon_sha256":"51cee9ad7ded26423ac0a40efe632615bf5884660a7f2636e79a17f3890dbcdd"},"schema_version":"1.0","source":{"id":"1406.1413","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.1413","created_at":"2026-05-18T01:35:20Z"},{"alias_kind":"arxiv_version","alias_value":"1406.1413v3","created_at":"2026-05-18T01:35:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.1413","created_at":"2026-05-18T01:35:20Z"},{"alias_kind":"pith_short_12","alias_value":"MCOTD5OGGL5R","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"MCOTD5OGGL5RFZWS","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"MCOTD5OG","created_at":"2026-05-18T12:28:38Z"}],"graph_snapshots":[{"event_id":"sha256:ea5b97e39ab35c9933540243940e67cac89eb8ca605fcd5af02b29c8658095b4","target":"graph","created_at":"2026-05-18T01:35:20Z","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 finite deterministic (semi)automaton $\\mathcal{A} =(Q,\\Sigma,\\delta)$ is $k$-compressible if there is some word $w\\in \\Sigma^+$ such that the image of its state set $Q$ under the natural action of $w$ is reduced by at least $k$ states. Such word, if it exists, is called a $k$-compressing word for $\\mathcal{A}$. A word is $k$-collapsing if it is $k$-compressing for each $k$-compressible automaton. We compute a set $W$ of short words such that each $3$-compressible automata on a two letter alphabet is $3$-compressed at least by a word in $W$. Then we construct a shortest common superstring of ","authors_text":"Achille Frigeri, Alessandra Cherubini, Zuhua Liu","cross_cats":["cs.FL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-05T15:26:56Z","title":"Composing short 3-compressing words on a 2 letter alphabet"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.1413","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:afb3be63fafaff06f65839cba8c6e57ca7785ad5648bc2421b898b9bfa1d4bfc","target":"record","created_at":"2026-05-18T01:35:20Z","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":"cd7e5927104e9658d1ea8114bf40f0b2ac930f09527fc4cefce3cb6b52dbe0ab","cross_cats_sorted":["cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-05T15:26:56Z","title_canon_sha256":"51cee9ad7ded26423ac0a40efe632615bf5884660a7f2636e79a17f3890dbcdd"},"schema_version":"1.0","source":{"id":"1406.1413","kind":"arxiv","version":3}},"canonical_sha256":"609d31f5c632fb12e6d29bad01afde7a3786eb0bfde3379e6a396ff0db31f48b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"609d31f5c632fb12e6d29bad01afde7a3786eb0bfde3379e6a396ff0db31f48b","first_computed_at":"2026-05-18T01:35:20.717334Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:35:20.717334Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0b9CQriyv2ZKRqmuPFD63cLQhbC3bNHKqeWX/NZn7ydxfYMykC+vTSwXkO2Du944c7IC0MKq1NWyX1PjQEZ2CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:35:20.718074Z","signed_message":"canonical_sha256_bytes"},"source_id":"1406.1413","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:afb3be63fafaff06f65839cba8c6e57ca7785ad5648bc2421b898b9bfa1d4bfc","sha256:ea5b97e39ab35c9933540243940e67cac89eb8ca605fcd5af02b29c8658095b4"],"state_sha256":"b2fed3773e732d9d7ac201e674432a15fdf8dbb5e20f7cb53ee9447b3f651b7f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3Cd4JDUPrIuqJskGgtPYjfrPUjzGSLEJbGzcOa0yhFzaOdq/XCcHKyzZ9tihdqHU/4APVH6Itg/5xWFbSvzRAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T01:24:38.946187Z","bundle_sha256":"de8adb118ef4875454227106ff92165a5fd3525e9d30fd85046f68ca415fce26"}}