{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:HFABOT6CYRJBB6TER5YHHSNLXN","short_pith_number":"pith:HFABOT6C","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"},"canonical_sha256":"3940174fc2c45210fa648f7073c9abbb442387c330d7a67e657805b07ee8a23d","source":{"kind":"arxiv","id":"1903.09475","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.09475","created_at":"2026-05-17T23:50:39Z"},{"alias_kind":"arxiv_version","alias_value":"1903.09475v1","created_at":"2026-05-17T23:50:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.09475","created_at":"2026-05-17T23:50:39Z"},{"alias_kind":"pith_short_12","alias_value":"HFABOT6CYRJB","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"HFABOT6CYRJBB6TE","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"HFABOT6C","created_at":"2026-05-18T12:33:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:HFABOT6CYRJBB6TER5YHHSNLXN","target":"record","payload":{"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"},"canonical_sha256":"3940174fc2c45210fa648f7073c9abbb442387c330d7a67e657805b07ee8a23d","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"},"source_kind":"arxiv","source_id":"1903.09475","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-17T23:50:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2N/hp99UJAsLnsQk5w/jQr0dbwljTSuEdqmmyUcdOEdNAmMTLqVnBK+jj5+M2XYnMJEk923hPN5DCnkWEQfqBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T13:30:51.385280Z"},"content_sha256":"d7a364fb8185971941eabc0edd4e6cc18e46ff86ea07037c674267b741ca2dcd","schema_version":"1.0","event_id":"sha256:d7a364fb8185971941eabc0edd4e6cc18e46ff86ea07037c674267b741ca2dcd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:HFABOT6CYRJBB6TER5YHHSNLXN","target":"graph","payload":{"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"},"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-17T23:50:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o6Of6HwsAL0HdZBmlJHzrgdm7yaAZ6TF9dzES2KuSTBzOAg7tOpeOixOnkflzo8Ah48Cj1dFLYiKEI3AZdEbAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T13:30:51.385857Z"},"content_sha256":"999d205d9abae4c167c8fe5b2847aecdf9ff25a6a7ff21b1a51a56321044dd70","schema_version":"1.0","event_id":"sha256:999d205d9abae4c167c8fe5b2847aecdf9ff25a6a7ff21b1a51a56321044dd70"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HFABOT6CYRJBB6TER5YHHSNLXN/bundle.json","state_url":"https://pith.science/pith/HFABOT6CYRJBB6TER5YHHSNLXN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HFABOT6CYRJBB6TER5YHHSNLXN/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-05-24T13:30:51Z","links":{"resolver":"https://pith.science/pith/HFABOT6CYRJBB6TER5YHHSNLXN","bundle":"https://pith.science/pith/HFABOT6CYRJBB6TER5YHHSNLXN/bundle.json","state":"https://pith.science/pith/HFABOT6CYRJBB6TER5YHHSNLXN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HFABOT6CYRJBB6TER5YHHSNLXN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:HFABOT6CYRJBB6TER5YHHSNLXN","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":"e52f31d21d71acccc02ec085a0b29744bc4fba299bdc4dfe143589353287fed7","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-03-22T12:45:23Z","title_canon_sha256":"3c2800337ebb18612cfbc76b2225a8defa1d7dede6958c120b934df5e1d2ed15"},"schema_version":"1.0","source":{"id":"1903.09475","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.09475","created_at":"2026-05-17T23:50:39Z"},{"alias_kind":"arxiv_version","alias_value":"1903.09475v1","created_at":"2026-05-17T23:50:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.09475","created_at":"2026-05-17T23:50:39Z"},{"alias_kind":"pith_short_12","alias_value":"HFABOT6CYRJB","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"HFABOT6CYRJBB6TE","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"HFABOT6C","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:999d205d9abae4c167c8fe5b2847aecdf9ff25a6a7ff21b1a51a56321044dd70","target":"graph","created_at":"2026-05-17T23:50:39Z","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":"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","authors_text":"Andrei Arusoaie, Ionut Pistol","cross_cats":["cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-03-22T12:45:23Z","title":"Using SMT Solvers to Validate Models for AI Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.09475","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:d7a364fb8185971941eabc0edd4e6cc18e46ff86ea07037c674267b741ca2dcd","target":"record","created_at":"2026-05-17T23:50:39Z","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":"e52f31d21d71acccc02ec085a0b29744bc4fba299bdc4dfe143589353287fed7","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-03-22T12:45:23Z","title_canon_sha256":"3c2800337ebb18612cfbc76b2225a8defa1d7dede6958c120b934df5e1d2ed15"},"schema_version":"1.0","source":{"id":"1903.09475","kind":"arxiv","version":1}},"canonical_sha256":"3940174fc2c45210fa648f7073c9abbb442387c330d7a67e657805b07ee8a23d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3940174fc2c45210fa648f7073c9abbb442387c330d7a67e657805b07ee8a23d","first_computed_at":"2026-05-17T23:50:39.541665Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:50:39.541665Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"w25nleSDYmTTONMPm5mkW7v/8xXOkfFyiphhopxzmPMylMfqimtFCljaxLxktKscA4Ae/KfzEyeq+l3QpE1xCw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:50:39.542183Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.09475","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d7a364fb8185971941eabc0edd4e6cc18e46ff86ea07037c674267b741ca2dcd","sha256:999d205d9abae4c167c8fe5b2847aecdf9ff25a6a7ff21b1a51a56321044dd70"],"state_sha256":"657f628486a6d487c9426de5a311a476fe8f472db5d22f5cf8c7934efff99017"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+TFHqtdiNWmtVMPo65wv79TH20CwmW6SfNULQTSw6Kowj3Kd9wRKnKa2pC5uyQ4dAkxdBKiyovIDpugACFkdAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T13:30:51.388331Z","bundle_sha256":"345add850dde6993f865e1d6975b3a4ca476104918c1ab1bf30a2e0ea1ba8b82"}}