{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:CZE72USFJJWYQJA7BSKX5TMWNZ","short_pith_number":"pith:CZE72USF","schema_version":"1.0","canonical_sha256":"1649fd52454a6d88241f0c957ecd966e69112a69dea6fd64058843b8f3640937","source":{"kind":"arxiv","id":"1405.3367","version":1},"attestation_state":"computed","paper":{"title":"Bound Founded Answer Set Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Rehan Abdul Aziz","submitted_at":"2014-05-14T05:40:16Z","abstract_excerpt":"Answer Set Programming (ASP) is a powerful modelling formalism that is very efficient in solving combinatorial problems. ASP solvers implement the stable model semantics that eliminates circular derivations between Boolean variables from the solutions of a logic program. Due to this, ASP solvers are better suited than propositional satisfiability (SAT) and Constraint Programming (CP) solvers to solve a certain class of problems whose specification includes inductive definitions such as reachability in a graph. On the other hand, ASP solvers suffer from the grounding bottleneck that occurs due "},"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":"1405.3367","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-05-14T05:40:16Z","cross_cats_sorted":[],"title_canon_sha256":"c757ed3ca640e40afc2154da57762fc3854f5bf934504780124f646dc7835f22","abstract_canon_sha256":"6a2d12ddf1ba9f820952b85959f8e50d7ab197a94de2fafd3e8c55d3e5a50cd8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:51:56.236458Z","signature_b64":"UpsnkxFkHiDXasGOo5OFPtI1YZSYh3xf2smNlzlgsvQdM2Fd8bT9XXobdcmShjYdrgCxW9ZjYYjh96ma4oGzCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1649fd52454a6d88241f0c957ecd966e69112a69dea6fd64058843b8f3640937","last_reissued_at":"2026-05-18T02:51:56.235928Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:51:56.235928Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bound Founded Answer Set Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Rehan Abdul Aziz","submitted_at":"2014-05-14T05:40:16Z","abstract_excerpt":"Answer Set Programming (ASP) is a powerful modelling formalism that is very efficient in solving combinatorial problems. ASP solvers implement the stable model semantics that eliminates circular derivations between Boolean variables from the solutions of a logic program. Due to this, ASP solvers are better suited than propositional satisfiability (SAT) and Constraint Programming (CP) solvers to solve a certain class of problems whose specification includes inductive definitions such as reachability in a graph. On the other hand, ASP solvers suffer from the grounding bottleneck that occurs due "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.3367","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1405.3367","created_at":"2026-05-18T02:51:56.236000+00:00"},{"alias_kind":"arxiv_version","alias_value":"1405.3367v1","created_at":"2026-05-18T02:51:56.236000+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.3367","created_at":"2026-05-18T02:51:56.236000+00:00"},{"alias_kind":"pith_short_12","alias_value":"CZE72USFJJWY","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_16","alias_value":"CZE72USFJJWYQJA7","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_8","alias_value":"CZE72USF","created_at":"2026-05-18T12:28:25.294606+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/CZE72USFJJWYQJA7BSKX5TMWNZ","json":"https://pith.science/pith/CZE72USFJJWYQJA7BSKX5TMWNZ.json","graph_json":"https://pith.science/api/pith-number/CZE72USFJJWYQJA7BSKX5TMWNZ/graph.json","events_json":"https://pith.science/api/pith-number/CZE72USFJJWYQJA7BSKX5TMWNZ/events.json","paper":"https://pith.science/paper/CZE72USF"},"agent_actions":{"view_html":"https://pith.science/pith/CZE72USFJJWYQJA7BSKX5TMWNZ","download_json":"https://pith.science/pith/CZE72USFJJWYQJA7BSKX5TMWNZ.json","view_paper":"https://pith.science/paper/CZE72USF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1405.3367&json=true","fetch_graph":"https://pith.science/api/pith-number/CZE72USFJJWYQJA7BSKX5TMWNZ/graph.json","fetch_events":"https://pith.science/api/pith-number/CZE72USFJJWYQJA7BSKX5TMWNZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CZE72USFJJWYQJA7BSKX5TMWNZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CZE72USFJJWYQJA7BSKX5TMWNZ/action/storage_attestation","attest_author":"https://pith.science/pith/CZE72USFJJWYQJA7BSKX5TMWNZ/action/author_attestation","sign_citation":"https://pith.science/pith/CZE72USFJJWYQJA7BSKX5TMWNZ/action/citation_signature","submit_replication":"https://pith.science/pith/CZE72USFJJWYQJA7BSKX5TMWNZ/action/replication_record"}},"created_at":"2026-05-18T02:51:56.236000+00:00","updated_at":"2026-05-18T02:51:56.236000+00:00"}