{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:Y3VGECX7IP5TU2Z42MPF7O3FJZ","short_pith_number":"pith:Y3VGECX7","canonical_record":{"source":{"id":"1105.0650","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-05-03T18:29:58Z","cross_cats_sorted":[],"title_canon_sha256":"2aefa3a5e713a4e30790a91b63d2cb3702beb6cee0d01fb9edcc34899aa19095","abstract_canon_sha256":"f6aaac1d5f6b55f5ac74ce8e45b9e2a0f1ff3ca15d0a16490876c0b0ed86c764"},"schema_version":"1.0"},"canonical_sha256":"c6ea620aff43fb3a6b3cd31e5fbb654e7a9c38a4900f39578d659d34d7aece3b","source":{"kind":"arxiv","id":"1105.0650","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.0650","created_at":"2026-05-18T02:41:01Z"},{"alias_kind":"arxiv_version","alias_value":"1105.0650v1","created_at":"2026-05-18T02:41:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.0650","created_at":"2026-05-18T02:41:01Z"},{"alias_kind":"pith_short_12","alias_value":"Y3VGECX7IP5T","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"Y3VGECX7IP5TU2Z4","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"Y3VGECX7","created_at":"2026-05-18T12:26:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:Y3VGECX7IP5TU2Z42MPF7O3FJZ","target":"record","payload":{"canonical_record":{"source":{"id":"1105.0650","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-05-03T18:29:58Z","cross_cats_sorted":[],"title_canon_sha256":"2aefa3a5e713a4e30790a91b63d2cb3702beb6cee0d01fb9edcc34899aa19095","abstract_canon_sha256":"f6aaac1d5f6b55f5ac74ce8e45b9e2a0f1ff3ca15d0a16490876c0b0ed86c764"},"schema_version":"1.0"},"canonical_sha256":"c6ea620aff43fb3a6b3cd31e5fbb654e7a9c38a4900f39578d659d34d7aece3b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:41:01.374868Z","signature_b64":"+jcR90KZ3bh5sE417Pk7kp7nHjYMaPKSqXIzqu2ewk1BHb7gHxxxMJYuyJb2pO4gPIbGd1Jk7Gcn4J3zyNmkBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c6ea620aff43fb3a6b3cd31e5fbb654e7a9c38a4900f39578d659d34d7aece3b","last_reissued_at":"2026-05-18T02:41:01.374391Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:41:01.374391Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1105.0650","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-18T02:41:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dYj0HEVTdeujAKBF2zyIg32H+ofEVv9+dEMXpeRgzrq1fWqkhpTgX3Xq9EI92WHsKbo/1Zvbj3UEOufRA9uFCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T06:18:47.993973Z"},"content_sha256":"d1a92d0c7452dbed470710e9b5dcbc9c6fe098317028aee0cbcdd300218e16b7","schema_version":"1.0","event_id":"sha256:d1a92d0c7452dbed470710e9b5dcbc9c6fe098317028aee0cbcdd300218e16b7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:Y3VGECX7IP5TU2Z42MPF7O3FJZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Transition Systems for Model Generators - A Unifying Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Miroslaw Truszczynski, Yuliya Lierler","submitted_at":"2011-05-03T18:29:58Z","abstract_excerpt":"A fundamental task for propositional logic is to compute models of propositional formulas. Programs developed for this task are called satisfiability solvers. We show that transition systems introduced by Nieuwenhuis, Oliveras, and Tinelli to model and analyze satisfiability solvers can be adapted for solvers developed for two other propositional formalisms: logic programming under the answer-set semantics, and the logic PC(ID). We show that in each case the task of computing models can be seen as \"satisfiability modulo answer-set programming,\" where the goal is to find a model of a theory tha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.0650","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-18T02:41:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AxFKCTbZo90kizJaCd+DnB+75YR1bZp2QPmMcrnkzSmGjbbB4DXV7xx/70wgArd+DCqC2LzxPW5XkvfACBHhCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T06:18:47.994324Z"},"content_sha256":"014103ee266e62a88e2e0d9ff271efd561d6ef7b894ed57bed5a0ac33295c246","schema_version":"1.0","event_id":"sha256:014103ee266e62a88e2e0d9ff271efd561d6ef7b894ed57bed5a0ac33295c246"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Y3VGECX7IP5TU2Z42MPF7O3FJZ/bundle.json","state_url":"https://pith.science/pith/Y3VGECX7IP5TU2Z42MPF7O3FJZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Y3VGECX7IP5TU2Z42MPF7O3FJZ/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-06-01T06:18:47Z","links":{"resolver":"https://pith.science/pith/Y3VGECX7IP5TU2Z42MPF7O3FJZ","bundle":"https://pith.science/pith/Y3VGECX7IP5TU2Z42MPF7O3FJZ/bundle.json","state":"https://pith.science/pith/Y3VGECX7IP5TU2Z42MPF7O3FJZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Y3VGECX7IP5TU2Z42MPF7O3FJZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:Y3VGECX7IP5TU2Z42MPF7O3FJZ","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":"f6aaac1d5f6b55f5ac74ce8e45b9e2a0f1ff3ca15d0a16490876c0b0ed86c764","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-05-03T18:29:58Z","title_canon_sha256":"2aefa3a5e713a4e30790a91b63d2cb3702beb6cee0d01fb9edcc34899aa19095"},"schema_version":"1.0","source":{"id":"1105.0650","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.0650","created_at":"2026-05-18T02:41:01Z"},{"alias_kind":"arxiv_version","alias_value":"1105.0650v1","created_at":"2026-05-18T02:41:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.0650","created_at":"2026-05-18T02:41:01Z"},{"alias_kind":"pith_short_12","alias_value":"Y3VGECX7IP5T","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"Y3VGECX7IP5TU2Z4","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"Y3VGECX7","created_at":"2026-05-18T12:26:47Z"}],"graph_snapshots":[{"event_id":"sha256:014103ee266e62a88e2e0d9ff271efd561d6ef7b894ed57bed5a0ac33295c246","target":"graph","created_at":"2026-05-18T02:41:01Z","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":"A fundamental task for propositional logic is to compute models of propositional formulas. Programs developed for this task are called satisfiability solvers. We show that transition systems introduced by Nieuwenhuis, Oliveras, and Tinelli to model and analyze satisfiability solvers can be adapted for solvers developed for two other propositional formalisms: logic programming under the answer-set semantics, and the logic PC(ID). We show that in each case the task of computing models can be seen as \"satisfiability modulo answer-set programming,\" where the goal is to find a model of a theory tha","authors_text":"Miroslaw Truszczynski, Yuliya Lierler","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-05-03T18:29:58Z","title":"Transition Systems for Model Generators - A Unifying Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.0650","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:d1a92d0c7452dbed470710e9b5dcbc9c6fe098317028aee0cbcdd300218e16b7","target":"record","created_at":"2026-05-18T02:41:01Z","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":"f6aaac1d5f6b55f5ac74ce8e45b9e2a0f1ff3ca15d0a16490876c0b0ed86c764","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-05-03T18:29:58Z","title_canon_sha256":"2aefa3a5e713a4e30790a91b63d2cb3702beb6cee0d01fb9edcc34899aa19095"},"schema_version":"1.0","source":{"id":"1105.0650","kind":"arxiv","version":1}},"canonical_sha256":"c6ea620aff43fb3a6b3cd31e5fbb654e7a9c38a4900f39578d659d34d7aece3b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c6ea620aff43fb3a6b3cd31e5fbb654e7a9c38a4900f39578d659d34d7aece3b","first_computed_at":"2026-05-18T02:41:01.374391Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:41:01.374391Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+jcR90KZ3bh5sE417Pk7kp7nHjYMaPKSqXIzqu2ewk1BHb7gHxxxMJYuyJb2pO4gPIbGd1Jk7Gcn4J3zyNmkBg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:41:01.374868Z","signed_message":"canonical_sha256_bytes"},"source_id":"1105.0650","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d1a92d0c7452dbed470710e9b5dcbc9c6fe098317028aee0cbcdd300218e16b7","sha256:014103ee266e62a88e2e0d9ff271efd561d6ef7b894ed57bed5a0ac33295c246"],"state_sha256":"ae0ed009f03ae25e94c3ba2285a1860e2f3949695560fdeb48b896f3eeb4315a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bB7YsYt5ooBI/8KxQYpAJoI1LJNF+C76LEJsUvMj8o3hNznVXHUcwzQRUGHrvtk/YYirI59Y40VsfkS/7dbdCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T06:18:47.996694Z","bundle_sha256":"23f397e2699f95be2835fce09f34d036478b313f59fd6f487de439cb0438977d"}}