{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:2TEK2DCDX6K6F6HHOY2X3YCJT4","short_pith_number":"pith:2TEK2DCD","schema_version":"1.0","canonical_sha256":"d4c8ad0c43bf95e2f8e776357de0499f1f79ba183b64742b1a8d6e5a1bb38c2f","source":{"kind":"arxiv","id":"1801.05391","version":1},"attestation_state":"computed","paper":{"title":"Using Sat solvers for synchronization issues in non-deterministic automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Hanan Shabana, Mikhail V. Volkov","submitted_at":"2018-01-16T17:53:56Z","abstract_excerpt":"We approach the problem of computing a $D_{3}$-synchronizing word of minimum length for a given nondeterministic automaton via its encoding as an instance of SAT and invoking a SAT solver. We also present some experimental results."},"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":"1801.05391","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2018-01-16T17:53:56Z","cross_cats_sorted":[],"title_canon_sha256":"b5d6928d79340a5ca8b43bc6e8e9f2145e22c6e750d9c56aecb155f0dc0786a4","abstract_canon_sha256":"ac1826a392ded624f99dd1c6e82af57ced2b8f9b493b8834a8d96aee5c702172"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:46.908187Z","signature_b64":"vn5Smm6XiqZFMPrEF9fLcVYGlkVYhYhQNZ/7OR0U9AxmJ0oSl2mQ4PHpqzLfP4ZlCyRLjLUwISTJmgDoqxHTAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d4c8ad0c43bf95e2f8e776357de0499f1f79ba183b64742b1a8d6e5a1bb38c2f","last_reissued_at":"2026-05-18T00:25:46.907601Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:46.907601Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Using Sat solvers for synchronization issues in non-deterministic automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Hanan Shabana, Mikhail V. Volkov","submitted_at":"2018-01-16T17:53:56Z","abstract_excerpt":"We approach the problem of computing a $D_{3}$-synchronizing word of minimum length for a given nondeterministic automaton via its encoding as an instance of SAT and invoking a SAT solver. We also present some experimental results."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.05391","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":"1801.05391","created_at":"2026-05-18T00:25:46.907694+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.05391v1","created_at":"2026-05-18T00:25:46.907694+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.05391","created_at":"2026-05-18T00:25:46.907694+00:00"},{"alias_kind":"pith_short_12","alias_value":"2TEK2DCDX6K6","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_16","alias_value":"2TEK2DCDX6K6F6HH","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_8","alias_value":"2TEK2DCD","created_at":"2026-05-18T12:32:02.567920+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/2TEK2DCDX6K6F6HHOY2X3YCJT4","json":"https://pith.science/pith/2TEK2DCDX6K6F6HHOY2X3YCJT4.json","graph_json":"https://pith.science/api/pith-number/2TEK2DCDX6K6F6HHOY2X3YCJT4/graph.json","events_json":"https://pith.science/api/pith-number/2TEK2DCDX6K6F6HHOY2X3YCJT4/events.json","paper":"https://pith.science/paper/2TEK2DCD"},"agent_actions":{"view_html":"https://pith.science/pith/2TEK2DCDX6K6F6HHOY2X3YCJT4","download_json":"https://pith.science/pith/2TEK2DCDX6K6F6HHOY2X3YCJT4.json","view_paper":"https://pith.science/paper/2TEK2DCD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.05391&json=true","fetch_graph":"https://pith.science/api/pith-number/2TEK2DCDX6K6F6HHOY2X3YCJT4/graph.json","fetch_events":"https://pith.science/api/pith-number/2TEK2DCDX6K6F6HHOY2X3YCJT4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2TEK2DCDX6K6F6HHOY2X3YCJT4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2TEK2DCDX6K6F6HHOY2X3YCJT4/action/storage_attestation","attest_author":"https://pith.science/pith/2TEK2DCDX6K6F6HHOY2X3YCJT4/action/author_attestation","sign_citation":"https://pith.science/pith/2TEK2DCDX6K6F6HHOY2X3YCJT4/action/citation_signature","submit_replication":"https://pith.science/pith/2TEK2DCDX6K6F6HHOY2X3YCJT4/action/replication_record"}},"created_at":"2026-05-18T00:25:46.907694+00:00","updated_at":"2026-05-18T00:25:46.907694+00:00"}