{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:BDX4OTKRSUJTF752EV4WFI2AN2","short_pith_number":"pith:BDX4OTKR","canonical_record":{"source":{"id":"1806.06299","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2018-06-16T21:18:06Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"32f7c37d98e61e0d7bba5905f2957def1a9dd7e3881f79efe812d6a85ffc7ddc","abstract_canon_sha256":"a35eab01062f730c70b78b97abd0effbf2dcb38f7ba751424d23f4a5c9192d27"},"schema_version":"1.0"},"canonical_sha256":"08efc74d51951332ffba257962a3406e9617157a9ffeeb8e2fcaf689b4cb297a","source":{"kind":"arxiv","id":"1806.06299","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.06299","created_at":"2026-05-18T00:13:02Z"},{"alias_kind":"arxiv_version","alias_value":"1806.06299v1","created_at":"2026-05-18T00:13:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.06299","created_at":"2026-05-18T00:13:02Z"},{"alias_kind":"pith_short_12","alias_value":"BDX4OTKRSUJT","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"BDX4OTKRSUJTF752","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"BDX4OTKR","created_at":"2026-05-18T12:32:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:BDX4OTKRSUJTF752EV4WFI2AN2","target":"record","payload":{"canonical_record":{"source":{"id":"1806.06299","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2018-06-16T21:18:06Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"32f7c37d98e61e0d7bba5905f2957def1a9dd7e3881f79efe812d6a85ffc7ddc","abstract_canon_sha256":"a35eab01062f730c70b78b97abd0effbf2dcb38f7ba751424d23f4a5c9192d27"},"schema_version":"1.0"},"canonical_sha256":"08efc74d51951332ffba257962a3406e9617157a9ffeeb8e2fcaf689b4cb297a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:02.948388Z","signature_b64":"IEsLpVNd8HrxA8EgurjgCvBztg0H0x1JV98NFqoWiNO3oqrjUa95zk005gOhIusXJm9MJGFllR8GKFk7VxCKBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"08efc74d51951332ffba257962a3406e9617157a9ffeeb8e2fcaf689b4cb297a","last_reissued_at":"2026-05-18T00:13:02.947821Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:02.947821Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.06299","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-18T00:13:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mf7ecN+hasEhnjoXcl796UipKf/T9XzVub9bgpldqJ0ak0mncLEfhzeAXzItlPvpiR94D9P5Wl5/VH0lfgYZBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T00:58:07.667847Z"},"content_sha256":"26599b50fef81ba0a904c4d0529998a102c7a1151504bf5f27f7e83f549b3319","schema_version":"1.0","event_id":"sha256:26599b50fef81ba0a904c4d0529998a102c7a1151504bf5f27f7e83f549b3319"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:BDX4OTKRSUJTF752EV4WFI2AN2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Finding Short Synchronizing Words for Prefix Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.FL","authors_text":"Andrew Ryzhikov, Marek Szyku{\\l}a","submitted_at":"2018-06-16T21:18:06Z","abstract_excerpt":"We study the problems of finding a shortest synchronizing word and its length for a given prefix code. This is done in two different settings: when the code is defined by an arbitrary decoder recognizing its star and when the code is defined by its literal decoder (whose size is polynomially equivalent to the total length of all words in the code). For the first case for every $\\varepsilon > 0$ we prove $n^{1 - \\varepsilon}$-inapproximability for recognizable binary maximal prefix codes, $\\Theta(\\log n)$-inapproximability for finite binary maximal prefix codes and $n^{\\frac{1}{2} - \\varepsilon"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.06299","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-18T00:13:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/8JFXDmUOJLnKKOAX5+z5z4O6qi6Js6MvC78yss4wr2pdvGvGQoutiOEPQ+Mo/U184Ou8plV93H5KWuADNZcBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T00:58:07.668596Z"},"content_sha256":"1e590c8831e19cc24e1dff9a17e58b52b72525229663964b5c466631fe52867c","schema_version":"1.0","event_id":"sha256:1e590c8831e19cc24e1dff9a17e58b52b72525229663964b5c466631fe52867c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BDX4OTKRSUJTF752EV4WFI2AN2/bundle.json","state_url":"https://pith.science/pith/BDX4OTKRSUJTF752EV4WFI2AN2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BDX4OTKRSUJTF752EV4WFI2AN2/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-01T00:58:07Z","links":{"resolver":"https://pith.science/pith/BDX4OTKRSUJTF752EV4WFI2AN2","bundle":"https://pith.science/pith/BDX4OTKRSUJTF752EV4WFI2AN2/bundle.json","state":"https://pith.science/pith/BDX4OTKRSUJTF752EV4WFI2AN2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BDX4OTKRSUJTF752EV4WFI2AN2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:BDX4OTKRSUJTF752EV4WFI2AN2","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":"a35eab01062f730c70b78b97abd0effbf2dcb38f7ba751424d23f4a5c9192d27","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2018-06-16T21:18:06Z","title_canon_sha256":"32f7c37d98e61e0d7bba5905f2957def1a9dd7e3881f79efe812d6a85ffc7ddc"},"schema_version":"1.0","source":{"id":"1806.06299","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.06299","created_at":"2026-05-18T00:13:02Z"},{"alias_kind":"arxiv_version","alias_value":"1806.06299v1","created_at":"2026-05-18T00:13:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.06299","created_at":"2026-05-18T00:13:02Z"},{"alias_kind":"pith_short_12","alias_value":"BDX4OTKRSUJT","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"BDX4OTKRSUJTF752","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"BDX4OTKR","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:1e590c8831e19cc24e1dff9a17e58b52b72525229663964b5c466631fe52867c","target":"graph","created_at":"2026-05-18T00:13:02Z","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":"We study the problems of finding a shortest synchronizing word and its length for a given prefix code. This is done in two different settings: when the code is defined by an arbitrary decoder recognizing its star and when the code is defined by its literal decoder (whose size is polynomially equivalent to the total length of all words in the code). For the first case for every $\\varepsilon > 0$ we prove $n^{1 - \\varepsilon}$-inapproximability for recognizable binary maximal prefix codes, $\\Theta(\\log n)$-inapproximability for finite binary maximal prefix codes and $n^{\\frac{1}{2} - \\varepsilon","authors_text":"Andrew Ryzhikov, Marek Szyku{\\l}a","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2018-06-16T21:18:06Z","title":"Finding Short Synchronizing Words for Prefix Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.06299","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:26599b50fef81ba0a904c4d0529998a102c7a1151504bf5f27f7e83f549b3319","target":"record","created_at":"2026-05-18T00:13:02Z","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":"a35eab01062f730c70b78b97abd0effbf2dcb38f7ba751424d23f4a5c9192d27","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2018-06-16T21:18:06Z","title_canon_sha256":"32f7c37d98e61e0d7bba5905f2957def1a9dd7e3881f79efe812d6a85ffc7ddc"},"schema_version":"1.0","source":{"id":"1806.06299","kind":"arxiv","version":1}},"canonical_sha256":"08efc74d51951332ffba257962a3406e9617157a9ffeeb8e2fcaf689b4cb297a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"08efc74d51951332ffba257962a3406e9617157a9ffeeb8e2fcaf689b4cb297a","first_computed_at":"2026-05-18T00:13:02.947821Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:13:02.947821Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IEsLpVNd8HrxA8EgurjgCvBztg0H0x1JV98NFqoWiNO3oqrjUa95zk005gOhIusXJm9MJGFllR8GKFk7VxCKBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:13:02.948388Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.06299","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:26599b50fef81ba0a904c4d0529998a102c7a1151504bf5f27f7e83f549b3319","sha256:1e590c8831e19cc24e1dff9a17e58b52b72525229663964b5c466631fe52867c"],"state_sha256":"4badf2cce43a666d4433efe562f13defbfc4c4e75b7d33d3c3bd42ca92838f54"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"REOQqzNX0RyhOQabuVfDFeKddwbGLI8+IymSeOkEkImTUxxH8RrEykmy7VCMTvW/rIEc0wsAcMhm9YJWO9n2CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T00:58:07.672508Z","bundle_sha256":"53d10faae5b328ea6b591f090e7a2dfbf75692a43e80e5140128619057aef4b3"}}