{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2007:WU4IBYZNMYQQK7D54HLCWNVFOP","short_pith_number":"pith:WU4IBYZN","schema_version":"1.0","canonical_sha256":"b53880e32d6621057c7de1d62b36a573eef45cd3023ca0beba6dcc8c15692a8c","source":{"kind":"arxiv","id":"0710.3332","version":4},"attestation_state":"computed","paper":{"title":"Model and Program Repair via SAT Solving","license":"","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Jad Saklawi, Paul C. Attie","submitted_at":"2007-10-17T16:56:56Z","abstract_excerpt":"We consider the following \\emph{model repair problem}: given a finite Kripke structure $M$ and a specification formula $\\eta$ in some modal or temporal logic, determine if $M$ contains a substructure $M'$ (with the same initial state) that satisfies $\\eta$. Thus, $M$ can be ``repaired'' to satisfy the specification $\\eta$ by deleting some transitions.\n  We map an instance $(M, \\eta)$ of model repair to a boolean formula $\\repfor(M,\\eta)$ such that $(M, \\eta)$ has a solution iff $\\repfor(M,\\eta)$ is satisfiable. Furthermore, a satisfying assignment determines which transitions must be removed f"},"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":"0710.3332","kind":"arxiv","version":4},"metadata":{"license":"","primary_cat":"cs.LO","submitted_at":"2007-10-17T16:56:56Z","cross_cats_sorted":[],"title_canon_sha256":"2b68085acbe7f03219ee9eb78bb33294a90546e809fe2599a025858a44baf23c","abstract_canon_sha256":"b1511a3373cc10c72d67305f590ef7be8aaddf749951a9c0bbe817fbf758ea9c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:10:51.704301Z","signature_b64":"u/GeqThaF7rLVdhtPtSkHy6pkomznUkEQsUfWi53va+r9dmwU650W/JjwYaefDqFKhzY5oKtE11snFRY0PwBBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b53880e32d6621057c7de1d62b36a573eef45cd3023ca0beba6dcc8c15692a8c","last_reissued_at":"2026-07-04T15:10:51.703897Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:10:51.703897Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Model and Program Repair via SAT Solving","license":"","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Jad Saklawi, Paul C. Attie","submitted_at":"2007-10-17T16:56:56Z","abstract_excerpt":"We consider the following \\emph{model repair problem}: given a finite Kripke structure $M$ and a specification formula $\\eta$ in some modal or temporal logic, determine if $M$ contains a substructure $M'$ (with the same initial state) that satisfies $\\eta$. Thus, $M$ can be ``repaired'' to satisfy the specification $\\eta$ by deleting some transitions.\n  We map an instance $(M, \\eta)$ of model repair to a boolean formula $\\repfor(M,\\eta)$ such that $(M, \\eta)$ has a solution iff $\\repfor(M,\\eta)$ is satisfiable. Furthermore, a satisfying assignment determines which transitions must be removed f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0710.3332","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/0710.3332/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"0710.3332","created_at":"2026-07-04T15:10:51.703961+00:00"},{"alias_kind":"arxiv_version","alias_value":"0710.3332v4","created_at":"2026-07-04T15:10:51.703961+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0710.3332","created_at":"2026-07-04T15:10:51.703961+00:00"},{"alias_kind":"pith_short_12","alias_value":"WU4IBYZNMYQQ","created_at":"2026-07-04T15:10:51.703961+00:00"},{"alias_kind":"pith_short_16","alias_value":"WU4IBYZNMYQQK7D5","created_at":"2026-07-04T15:10:51.703961+00:00"},{"alias_kind":"pith_short_8","alias_value":"WU4IBYZN","created_at":"2026-07-04T15:10:51.703961+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/WU4IBYZNMYQQK7D54HLCWNVFOP","json":"https://pith.science/pith/WU4IBYZNMYQQK7D54HLCWNVFOP.json","graph_json":"https://pith.science/api/pith-number/WU4IBYZNMYQQK7D54HLCWNVFOP/graph.json","events_json":"https://pith.science/api/pith-number/WU4IBYZNMYQQK7D54HLCWNVFOP/events.json","paper":"https://pith.science/paper/WU4IBYZN"},"agent_actions":{"view_html":"https://pith.science/pith/WU4IBYZNMYQQK7D54HLCWNVFOP","download_json":"https://pith.science/pith/WU4IBYZNMYQQK7D54HLCWNVFOP.json","view_paper":"https://pith.science/paper/WU4IBYZN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0710.3332&json=true","fetch_graph":"https://pith.science/api/pith-number/WU4IBYZNMYQQK7D54HLCWNVFOP/graph.json","fetch_events":"https://pith.science/api/pith-number/WU4IBYZNMYQQK7D54HLCWNVFOP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WU4IBYZNMYQQK7D54HLCWNVFOP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WU4IBYZNMYQQK7D54HLCWNVFOP/action/storage_attestation","attest_author":"https://pith.science/pith/WU4IBYZNMYQQK7D54HLCWNVFOP/action/author_attestation","sign_citation":"https://pith.science/pith/WU4IBYZNMYQQK7D54HLCWNVFOP/action/citation_signature","submit_replication":"https://pith.science/pith/WU4IBYZNMYQQK7D54HLCWNVFOP/action/replication_record"}},"created_at":"2026-07-04T15:10:51.703961+00:00","updated_at":"2026-07-04T15:10:51.703961+00:00"}