{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:XJHRXG4CFNULKZBMRLMV4YIR6B","short_pith_number":"pith:XJHRXG4C","schema_version":"1.0","canonical_sha256":"ba4f1b9b822b68b5642c8ad95e6111f07816de16795179b8f193fad9496fba06","source":{"kind":"arxiv","id":"1608.06910","version":2},"attestation_state":"computed","paper":{"title":"A Parallel Memory-efficient Epistemic Logic Program Solver: Harder, Better, Faster","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Anthony P. Leclerc, Patrick Thor Kahl, Tran Cao Son","submitted_at":"2016-08-24T18:18:08Z","abstract_excerpt":"As the practical use of answer set programming (ASP) has grown with the development of efficient solvers, we expect a growing interest in extensions of ASP as their semantics stabilize and solvers supporting them mature. Epistemic Specifications, which adds modal operators K and M to the language of ASP, is one such extension. We call a program in this language an epistemic logic program (ELP). Solvers have thus far been practical for only the simplest ELPs due to exponential growth of the search space. We describe a solver that is able to solve harder problems better (e.g., without exponentia"},"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":"1608.06910","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-08-24T18:18:08Z","cross_cats_sorted":[],"title_canon_sha256":"bc29da1768e5f10fc5aa22dda702f0e042258fb05e1c346bcffc917a896569b7","abstract_canon_sha256":"30b898437e2773b28100ebb599cb90b91f375bb82119d06746da5ad0a69c39f4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:02:22.006516Z","signature_b64":"IIxg6iOmpq2P7ai0pTVsX4XZMOSF1R7EgxfowTqAeSUWSquycEIliV6ma/26rMDhsvMFXxdvwyTXwkw6K63pDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ba4f1b9b822b68b5642c8ad95e6111f07816de16795179b8f193fad9496fba06","last_reissued_at":"2026-05-18T01:02:22.005816Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:02:22.005816Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Parallel Memory-efficient Epistemic Logic Program Solver: Harder, Better, Faster","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Anthony P. Leclerc, Patrick Thor Kahl, Tran Cao Son","submitted_at":"2016-08-24T18:18:08Z","abstract_excerpt":"As the practical use of answer set programming (ASP) has grown with the development of efficient solvers, we expect a growing interest in extensions of ASP as their semantics stabilize and solvers supporting them mature. Epistemic Specifications, which adds modal operators K and M to the language of ASP, is one such extension. We call a program in this language an epistemic logic program (ELP). Solvers have thus far been practical for only the simplest ELPs due to exponential growth of the search space. We describe a solver that is able to solve harder problems better (e.g., without exponentia"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.06910","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":"1608.06910","created_at":"2026-05-18T01:02:22.005972+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.06910v2","created_at":"2026-05-18T01:02:22.005972+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.06910","created_at":"2026-05-18T01:02:22.005972+00:00"},{"alias_kind":"pith_short_12","alias_value":"XJHRXG4CFNUL","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_16","alias_value":"XJHRXG4CFNULKZBM","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_8","alias_value":"XJHRXG4C","created_at":"2026-05-18T12:30:51.357362+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/XJHRXG4CFNULKZBMRLMV4YIR6B","json":"https://pith.science/pith/XJHRXG4CFNULKZBMRLMV4YIR6B.json","graph_json":"https://pith.science/api/pith-number/XJHRXG4CFNULKZBMRLMV4YIR6B/graph.json","events_json":"https://pith.science/api/pith-number/XJHRXG4CFNULKZBMRLMV4YIR6B/events.json","paper":"https://pith.science/paper/XJHRXG4C"},"agent_actions":{"view_html":"https://pith.science/pith/XJHRXG4CFNULKZBMRLMV4YIR6B","download_json":"https://pith.science/pith/XJHRXG4CFNULKZBMRLMV4YIR6B.json","view_paper":"https://pith.science/paper/XJHRXG4C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.06910&json=true","fetch_graph":"https://pith.science/api/pith-number/XJHRXG4CFNULKZBMRLMV4YIR6B/graph.json","fetch_events":"https://pith.science/api/pith-number/XJHRXG4CFNULKZBMRLMV4YIR6B/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XJHRXG4CFNULKZBMRLMV4YIR6B/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XJHRXG4CFNULKZBMRLMV4YIR6B/action/storage_attestation","attest_author":"https://pith.science/pith/XJHRXG4CFNULKZBMRLMV4YIR6B/action/author_attestation","sign_citation":"https://pith.science/pith/XJHRXG4CFNULKZBMRLMV4YIR6B/action/citation_signature","submit_replication":"https://pith.science/pith/XJHRXG4CFNULKZBMRLMV4YIR6B/action/replication_record"}},"created_at":"2026-05-18T01:02:22.005972+00:00","updated_at":"2026-05-18T01:02:22.005972+00:00"}