{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:QASMK6E574H6O7L6NHVSB7UHVY","short_pith_number":"pith:QASMK6E5","schema_version":"1.0","canonical_sha256":"8024c5789dff0fe77d7e69eb20fe87ae37ecb799dffc888ae0b95ef36dd527f3","source":{"kind":"arxiv","id":"1312.6146","version":1},"attestation_state":"computed","paper":{"title":"Generating Shortest Synchronizing Sequences using Answer Set Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Canan G\\\"uni\\c{c}en, Esra Erdem, H\\\"usn\\\"u Yenig\\\"un","submitted_at":"2013-12-20T21:30:10Z","abstract_excerpt":"For a finite state automaton, a synchronizing sequence is an input sequence that takes all the states to the same state. Checking the existence of a synchronizing sequence and finding a synchronizing sequence, if one exists, can be performed in polynomial time. However, the problem of finding a shortest synchronizing sequence is known to be NP-hard. In this work, the usefulness of Answer Set Programming to solve this optimization problem is investigated, in comparison with brute-force algorithms and SAT-based approaches.\n  Keywords: finite automata, shortest synchronizing sequence, ASP"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1312.6146","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-12-20T21:30:10Z","cross_cats_sorted":[],"title_canon_sha256":"30e5dce72f8d84ad2bc53643cbac0e25eb3a41bdc4ae2ad2e5bc622f9c0fa0e7","abstract_canon_sha256":"0b6f6ee90bebe62a74879b24510b184ca5f4c4825563ccf4370295e2003df77e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:04:05.947802Z","signature_b64":"YHxB1EMtZB9NjSdK6OP5J79kgzYEW1JQgO/g/pEZcYggaoLULhkkV1xXV0WaNMkCi84CdHIorWHCE5tkQFQ9AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8024c5789dff0fe77d7e69eb20fe87ae37ecb799dffc888ae0b95ef36dd527f3","last_reissued_at":"2026-05-18T03:04:05.947329Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:04:05.947329Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generating Shortest Synchronizing Sequences using Answer Set Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Canan G\\\"uni\\c{c}en, Esra Erdem, H\\\"usn\\\"u Yenig\\\"un","submitted_at":"2013-12-20T21:30:10Z","abstract_excerpt":"For a finite state automaton, a synchronizing sequence is an input sequence that takes all the states to the same state. Checking the existence of a synchronizing sequence and finding a synchronizing sequence, if one exists, can be performed in polynomial time. However, the problem of finding a shortest synchronizing sequence is known to be NP-hard. In this work, the usefulness of Answer Set Programming to solve this optimization problem is investigated, in comparison with brute-force algorithms and SAT-based approaches.\n  Keywords: finite automata, shortest synchronizing sequence, ASP"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.6146","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1312.6146","created_at":"2026-05-18T03:04:05.947400+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.6146v1","created_at":"2026-05-18T03:04:05.947400+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.6146","created_at":"2026-05-18T03:04:05.947400+00:00"},{"alias_kind":"pith_short_12","alias_value":"QASMK6E574H6","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_16","alias_value":"QASMK6E574H6O7L6","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_8","alias_value":"QASMK6E5","created_at":"2026-05-18T12:27:57.521954+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QASMK6E574H6O7L6NHVSB7UHVY","json":"https://pith.science/pith/QASMK6E574H6O7L6NHVSB7UHVY.json","graph_json":"https://pith.science/api/pith-number/QASMK6E574H6O7L6NHVSB7UHVY/graph.json","events_json":"https://pith.science/api/pith-number/QASMK6E574H6O7L6NHVSB7UHVY/events.json","paper":"https://pith.science/paper/QASMK6E5"},"agent_actions":{"view_html":"https://pith.science/pith/QASMK6E574H6O7L6NHVSB7UHVY","download_json":"https://pith.science/pith/QASMK6E574H6O7L6NHVSB7UHVY.json","view_paper":"https://pith.science/paper/QASMK6E5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.6146&json=true","fetch_graph":"https://pith.science/api/pith-number/QASMK6E574H6O7L6NHVSB7UHVY/graph.json","fetch_events":"https://pith.science/api/pith-number/QASMK6E574H6O7L6NHVSB7UHVY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QASMK6E574H6O7L6NHVSB7UHVY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QASMK6E574H6O7L6NHVSB7UHVY/action/storage_attestation","attest_author":"https://pith.science/pith/QASMK6E574H6O7L6NHVSB7UHVY/action/author_attestation","sign_citation":"https://pith.science/pith/QASMK6E574H6O7L6NHVSB7UHVY/action/citation_signature","submit_replication":"https://pith.science/pith/QASMK6E574H6O7L6NHVSB7UHVY/action/replication_record"}},"created_at":"2026-05-18T03:04:05.947400+00:00","updated_at":"2026-05-18T03:04:05.947400+00:00"}