{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:RAQ5XBROL72KBEKZQKGEU7JA5H","short_pith_number":"pith:RAQ5XBRO","canonical_record":{"source":{"id":"1702.08144","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2017-02-27T04:42:03Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"c3131e39082a722fe7a512363ed535a56908e6606523d04d9c9c01a634ff6394","abstract_canon_sha256":"c8fb7d8ed04a8f018f26c89041b5029d5d42adaa42ca2bbf4d73f7a7a396c961"},"schema_version":"1.0"},"canonical_sha256":"8821db862e5ff4a09159828c4a7d20e9d16d195cfbf494b6342569ee4e7231a0","source":{"kind":"arxiv","id":"1702.08144","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.08144","created_at":"2026-05-18T00:28:35Z"},{"alias_kind":"arxiv_version","alias_value":"1702.08144v2","created_at":"2026-05-18T00:28:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.08144","created_at":"2026-05-18T00:28:35Z"},{"alias_kind":"pith_short_12","alias_value":"RAQ5XBROL72K","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"RAQ5XBROL72KBEKZ","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"RAQ5XBRO","created_at":"2026-05-18T12:31:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:RAQ5XBROL72KBEKZQKGEU7JA5H","target":"record","payload":{"canonical_record":{"source":{"id":"1702.08144","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2017-02-27T04:42:03Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"c3131e39082a722fe7a512363ed535a56908e6606523d04d9c9c01a634ff6394","abstract_canon_sha256":"c8fb7d8ed04a8f018f26c89041b5029d5d42adaa42ca2bbf4d73f7a7a396c961"},"schema_version":"1.0"},"canonical_sha256":"8821db862e5ff4a09159828c4a7d20e9d16d195cfbf494b6342569ee4e7231a0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:28:35.661523Z","signature_b64":"c7YESRxLfDNbAvzcagoD4xZXcbfPaQrx4Y4QYsEy14jWREehMLQbFfDhTDmlS2EcyghEpBX2f7HbHPwc1f0kAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8821db862e5ff4a09159828c4a7d20e9d16d195cfbf494b6342569ee4e7231a0","last_reissued_at":"2026-05-18T00:28:35.660827Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:28:35.660827Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.08144","source_version":2,"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:28:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9YGb5zuw+QIxzfLRCKZ7P7qaHZLjbZ2JdmDXhlLOLa/Nt78iQdW69AzkB5Af0CHS8TLu7AYwsKD1RkesxTvpCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T17:42:52.200215Z"},"content_sha256":"ed042b1a51735378464573ed927b713b1a6133660027f46ad6d05e8dd684cd39","schema_version":"1.0","event_id":"sha256:ed042b1a51735378464573ed927b713b1a6133660027f46ad6d05e8dd684cd39"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:RAQ5XBROL72KBEKZQKGEU7JA5H","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Synchronization Problems in Automata without Non-trivial Cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.FL","authors_text":"Andrew Ryzhikov","submitted_at":"2017-02-27T04:42:03Z","abstract_excerpt":"We study the computational complexity of various problems related to synchronization of weakly acyclic automata, a subclass of widely studied aperiodic automata. We provide upper and lower bounds on the length of a shortest word synchronizing a weakly acyclic automaton or, more generally, a subset of its states, and show that the problem of approximating this length is hard. We investigate the complexity of finding a synchronizing set of states of maximum size. We also show inapproximability of the problem of computing the rank of a subset of states in a binary weakly acyclic automaton and pro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.08144","kind":"arxiv","version":2},"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:28:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rKBZj0C8xagV8AGh2HlboHSTsd0Qja0ZJMjOh5GcjQ9p5BNwqfxBCUpRrGXrkm0ZIrYRjtrS3LNpgBm+ssWsAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T17:42:52.200937Z"},"content_sha256":"ab045c27180802b9253bef5d61d04f33e9ad2b5b46d3dbe7fdbd5f916e3196b1","schema_version":"1.0","event_id":"sha256:ab045c27180802b9253bef5d61d04f33e9ad2b5b46d3dbe7fdbd5f916e3196b1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RAQ5XBROL72KBEKZQKGEU7JA5H/bundle.json","state_url":"https://pith.science/pith/RAQ5XBROL72KBEKZQKGEU7JA5H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RAQ5XBROL72KBEKZQKGEU7JA5H/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-08T17:42:52Z","links":{"resolver":"https://pith.science/pith/RAQ5XBROL72KBEKZQKGEU7JA5H","bundle":"https://pith.science/pith/RAQ5XBROL72KBEKZQKGEU7JA5H/bundle.json","state":"https://pith.science/pith/RAQ5XBROL72KBEKZQKGEU7JA5H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RAQ5XBROL72KBEKZQKGEU7JA5H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:RAQ5XBROL72KBEKZQKGEU7JA5H","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":"c8fb7d8ed04a8f018f26c89041b5029d5d42adaa42ca2bbf4d73f7a7a396c961","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2017-02-27T04:42:03Z","title_canon_sha256":"c3131e39082a722fe7a512363ed535a56908e6606523d04d9c9c01a634ff6394"},"schema_version":"1.0","source":{"id":"1702.08144","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.08144","created_at":"2026-05-18T00:28:35Z"},{"alias_kind":"arxiv_version","alias_value":"1702.08144v2","created_at":"2026-05-18T00:28:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.08144","created_at":"2026-05-18T00:28:35Z"},{"alias_kind":"pith_short_12","alias_value":"RAQ5XBROL72K","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"RAQ5XBROL72KBEKZ","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"RAQ5XBRO","created_at":"2026-05-18T12:31:39Z"}],"graph_snapshots":[{"event_id":"sha256:ab045c27180802b9253bef5d61d04f33e9ad2b5b46d3dbe7fdbd5f916e3196b1","target":"graph","created_at":"2026-05-18T00:28:35Z","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 computational complexity of various problems related to synchronization of weakly acyclic automata, a subclass of widely studied aperiodic automata. We provide upper and lower bounds on the length of a shortest word synchronizing a weakly acyclic automaton or, more generally, a subset of its states, and show that the problem of approximating this length is hard. We investigate the complexity of finding a synchronizing set of states of maximum size. We also show inapproximability of the problem of computing the rank of a subset of states in a binary weakly acyclic automaton and pro","authors_text":"Andrew Ryzhikov","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2017-02-27T04:42:03Z","title":"Synchronization Problems in Automata without Non-trivial Cycles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.08144","kind":"arxiv","version":2},"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:ed042b1a51735378464573ed927b713b1a6133660027f46ad6d05e8dd684cd39","target":"record","created_at":"2026-05-18T00:28:35Z","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":"c8fb7d8ed04a8f018f26c89041b5029d5d42adaa42ca2bbf4d73f7a7a396c961","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2017-02-27T04:42:03Z","title_canon_sha256":"c3131e39082a722fe7a512363ed535a56908e6606523d04d9c9c01a634ff6394"},"schema_version":"1.0","source":{"id":"1702.08144","kind":"arxiv","version":2}},"canonical_sha256":"8821db862e5ff4a09159828c4a7d20e9d16d195cfbf494b6342569ee4e7231a0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8821db862e5ff4a09159828c4a7d20e9d16d195cfbf494b6342569ee4e7231a0","first_computed_at":"2026-05-18T00:28:35.660827Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:28:35.660827Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"c7YESRxLfDNbAvzcagoD4xZXcbfPaQrx4Y4QYsEy14jWREehMLQbFfDhTDmlS2EcyghEpBX2f7HbHPwc1f0kAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:28:35.661523Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.08144","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ed042b1a51735378464573ed927b713b1a6133660027f46ad6d05e8dd684cd39","sha256:ab045c27180802b9253bef5d61d04f33e9ad2b5b46d3dbe7fdbd5f916e3196b1"],"state_sha256":"bcd6b7035e94bc735f72c9274054f4f536c8581e8a5c04a4312a5e35fda0707a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zJ3ZHtCY8g4RJQESv1rl9SESX23/XKC3vOhZPxotDL5BOEO3uVYfo8yJ+hnAaVcn49wwvM7PrueYB+aiABW8Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T17:42:52.205043Z","bundle_sha256":"52ef681eb309b6cc0ed190efcdec03b18426aef8095f7700224b8c3691a7e64b"}}