{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:HFABOT6CYRJBB6TER5YHHSNLXN","short_pith_number":"pith:HFABOT6C","schema_version":"1.0","canonical_sha256":"3940174fc2c45210fa648f7073c9abbb442387c330d7a67e657805b07ee8a23d","source":{"kind":"arxiv","id":"1903.09475","version":1},"attestation_state":"computed","paper":{"title":"Using SMT Solvers to Validate Models for AI Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.AI","authors_text":"Andrei Arusoaie, Ionut Pistol","submitted_at":"2019-03-22T12:45:23Z","abstract_excerpt":"Artificial Intelligence problems, ranging form planning/scheduling up to game control, include an essential crucial step: describing a model which accurately defines the problem's required data, requirements, allowed transitions and established goals. The ways in which a model can fail are numerous and often lead to a failure of search strategies to provide a quick, optimal, or even any solution. This paper proposes using SMT (Satisfiability Modulo Theories) solvers, such as Z3, to check the validity of a model. We propose two tests: checking whether a final(goal) state exists in the model's d"},"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":"1903.09475","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-03-22T12:45:23Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"3c2800337ebb18612cfbc76b2225a8defa1d7dede6958c120b934df5e1d2ed15","abstract_canon_sha256":"e52f31d21d71acccc02ec085a0b29744bc4fba299bdc4dfe143589353287fed7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:50:39.542183Z","signature_b64":"w25nleSDYmTTONMPm5mkW7v/8xXOkfFyiphhopxzmPMylMfqimtFCljaxLxktKscA4Ae/KfzEyeq+l3QpE1xCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3940174fc2c45210fa648f7073c9abbb442387c330d7a67e657805b07ee8a23d","last_reissued_at":"2026-05-17T23:50:39.541665Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:50:39.541665Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Using SMT Solvers to Validate Models for AI Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.AI","authors_text":"Andrei Arusoaie, Ionut Pistol","submitted_at":"2019-03-22T12:45:23Z","abstract_excerpt":"Artificial Intelligence problems, ranging form planning/scheduling up to game control, include an essential crucial step: describing a model which accurately defines the problem's required data, requirements, allowed transitions and established goals. The ways in which a model can fail are numerous and often lead to a failure of search strategies to provide a quick, optimal, or even any solution. This paper proposes using SMT (Satisfiability Modulo Theories) solvers, such as Z3, to check the validity of a model. We propose two tests: checking whether a final(goal) state exists in the model's d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.09475","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":"1903.09475","created_at":"2026-05-17T23:50:39.541751+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.09475v1","created_at":"2026-05-17T23:50:39.541751+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.09475","created_at":"2026-05-17T23:50:39.541751+00:00"},{"alias_kind":"pith_short_12","alias_value":"HFABOT6CYRJB","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"HFABOT6CYRJBB6TE","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"HFABOT6C","created_at":"2026-05-18T12:33:18.533446+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/HFABOT6CYRJBB6TER5YHHSNLXN","json":"https://pith.science/pith/HFABOT6CYRJBB6TER5YHHSNLXN.json","graph_json":"https://pith.science/api/pith-number/HFABOT6CYRJBB6TER5YHHSNLXN/graph.json","events_json":"https://pith.science/api/pith-number/HFABOT6CYRJBB6TER5YHHSNLXN/events.json","paper":"https://pith.science/paper/HFABOT6C"},"agent_actions":{"view_html":"https://pith.science/pith/HFABOT6CYRJBB6TER5YHHSNLXN","download_json":"https://pith.science/pith/HFABOT6CYRJBB6TER5YHHSNLXN.json","view_paper":"https://pith.science/paper/HFABOT6C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.09475&json=true","fetch_graph":"https://pith.science/api/pith-number/HFABOT6CYRJBB6TER5YHHSNLXN/graph.json","fetch_events":"https://pith.science/api/pith-number/HFABOT6CYRJBB6TER5YHHSNLXN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HFABOT6CYRJBB6TER5YHHSNLXN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HFABOT6CYRJBB6TER5YHHSNLXN/action/storage_attestation","attest_author":"https://pith.science/pith/HFABOT6CYRJBB6TER5YHHSNLXN/action/author_attestation","sign_citation":"https://pith.science/pith/HFABOT6CYRJBB6TER5YHHSNLXN/action/citation_signature","submit_replication":"https://pith.science/pith/HFABOT6CYRJBB6TER5YHHSNLXN/action/replication_record"}},"created_at":"2026-05-17T23:50:39.541751+00:00","updated_at":"2026-05-17T23:50:39.541751+00:00"}