{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:THK33GWSNHEM5CEWECLWNBMCNG","short_pith_number":"pith:THK33GWS","schema_version":"1.0","canonical_sha256":"99d5bd9ad269c8ce8896209766858269ae52d97a5f30f6bffda993db11ea9148","source":{"kind":"arxiv","id":"1402.6889","version":2},"attestation_state":"computed","paper":{"title":"Lazy Model Expansion: Interleaving Grounding with Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Broes De Cat, Marc Denecker, Maurice Bruynooghe, Peter Stuckey","submitted_at":"2014-02-27T12:35:41Z","abstract_excerpt":"Finding satisfying assignments for the variables involved in a set of constraints can be cast as a (bounded) model generation problem: search for (bounded) models of a theory in some logic. The state-of-the-art approach for bounded model generation for rich knowledge representation languages, like ASP, FO(.) and Zinc, is ground-and-solve: reduce the theory to a ground or propositional one and apply a search algorithm to the resulting theory.\n  An important bottleneck is the blowup of the size of the theory caused by the reduction phase. Lazily grounding the theory during search is a way to ove"},"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":"1402.6889","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-02-27T12:35:41Z","cross_cats_sorted":[],"title_canon_sha256":"3c096dd7ba04fa03f75f3f6b1bd4940ff22e7a625d3c41df5de310686da523fd","abstract_canon_sha256":"12443c7f255cb360bbddd77d389a56a1f708251d939f4ed1a90f615a7861bea7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:28:05.389896Z","signature_b64":"TPvXXJnfL5NiHZej3EdwoculqYvH/TXozREtiwRfPAY/ESotjvaDF9RC/LSf+FbaAN19sypLc3EaIMLyJpdaDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"99d5bd9ad269c8ce8896209766858269ae52d97a5f30f6bffda993db11ea9148","last_reissued_at":"2026-05-18T02:28:05.389469Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:28:05.389469Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lazy Model Expansion: Interleaving Grounding with Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Broes De Cat, Marc Denecker, Maurice Bruynooghe, Peter Stuckey","submitted_at":"2014-02-27T12:35:41Z","abstract_excerpt":"Finding satisfying assignments for the variables involved in a set of constraints can be cast as a (bounded) model generation problem: search for (bounded) models of a theory in some logic. The state-of-the-art approach for bounded model generation for rich knowledge representation languages, like ASP, FO(.) and Zinc, is ground-and-solve: reduce the theory to a ground or propositional one and apply a search algorithm to the resulting theory.\n  An important bottleneck is the blowup of the size of the theory caused by the reduction phase. Lazily grounding the theory during search is a way to ove"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.6889","kind":"arxiv","version":2},"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":"1402.6889","created_at":"2026-05-18T02:28:05.389523+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.6889v2","created_at":"2026-05-18T02:28:05.389523+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.6889","created_at":"2026-05-18T02:28:05.389523+00:00"},{"alias_kind":"pith_short_12","alias_value":"THK33GWSNHEM","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_16","alias_value":"THK33GWSNHEM5CEW","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_8","alias_value":"THK33GWS","created_at":"2026-05-18T12:28:49.207871+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/THK33GWSNHEM5CEWECLWNBMCNG","json":"https://pith.science/pith/THK33GWSNHEM5CEWECLWNBMCNG.json","graph_json":"https://pith.science/api/pith-number/THK33GWSNHEM5CEWECLWNBMCNG/graph.json","events_json":"https://pith.science/api/pith-number/THK33GWSNHEM5CEWECLWNBMCNG/events.json","paper":"https://pith.science/paper/THK33GWS"},"agent_actions":{"view_html":"https://pith.science/pith/THK33GWSNHEM5CEWECLWNBMCNG","download_json":"https://pith.science/pith/THK33GWSNHEM5CEWECLWNBMCNG.json","view_paper":"https://pith.science/paper/THK33GWS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.6889&json=true","fetch_graph":"https://pith.science/api/pith-number/THK33GWSNHEM5CEWECLWNBMCNG/graph.json","fetch_events":"https://pith.science/api/pith-number/THK33GWSNHEM5CEWECLWNBMCNG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/THK33GWSNHEM5CEWECLWNBMCNG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/THK33GWSNHEM5CEWECLWNBMCNG/action/storage_attestation","attest_author":"https://pith.science/pith/THK33GWSNHEM5CEWECLWNBMCNG/action/author_attestation","sign_citation":"https://pith.science/pith/THK33GWSNHEM5CEWECLWNBMCNG/action/citation_signature","submit_replication":"https://pith.science/pith/THK33GWSNHEM5CEWECLWNBMCNG/action/replication_record"}},"created_at":"2026-05-18T02:28:05.389523+00:00","updated_at":"2026-05-18T02:28:05.389523+00:00"}