{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:ICYI7KT4MVSBUYLWOXYT6EKUVC","short_pith_number":"pith:ICYI7KT4","schema_version":"1.0","canonical_sha256":"40b08faa7c65641a617675f13f1154a8a33bd2cf5c64c7003d19aedb20e6a9ca","source":{"kind":"arxiv","id":"1301.1386","version":1},"attestation_state":"computed","paper":{"title":"SPARC - Sorted ASP with Consistency Restoring Rules","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.PL","authors_text":"Evgenii Balai, Michael Gelfond, Yuanlin Zhang","submitted_at":"2013-01-08T02:29:00Z","abstract_excerpt":"This is a preliminary report on the work aimed at making CR-Prolog -- a version of ASP with consistency restoring rules -- more suitable for use in teaching and large applications. First we describe a sorted version of CR-Prolog called SPARC. Second, we translate a basic version of the CR-Prolog into the language of DLV and compare the performance with the state of the art CR-Prolog solver. The results form the foundation for future more efficient and user friendly implementation of SPARC and shed some light on the relationship between two useful knowledge representation constructs: consistenc"},"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":"1301.1386","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2013-01-08T02:29:00Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"072ac76b9e25086c5a85c530a9787fe22d620342d6adfefb77bc48012efafa32","abstract_canon_sha256":"a9cc60f62f4c5f12437b084f7ac2c631dc5713b5f27fc73b602573a94323d558"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:36:57.667747Z","signature_b64":"6P1J3IFeIbEkpy6+tus9M2Bd0TPz6uF/4T4i0As7+phVq2aW6NFvjjGS62ICAd5+lfFGLrJqqoK+BBODmy1+Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"40b08faa7c65641a617675f13f1154a8a33bd2cf5c64c7003d19aedb20e6a9ca","last_reissued_at":"2026-05-18T03:36:57.667030Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:36:57.667030Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"SPARC - Sorted ASP with Consistency Restoring Rules","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.PL","authors_text":"Evgenii Balai, Michael Gelfond, Yuanlin Zhang","submitted_at":"2013-01-08T02:29:00Z","abstract_excerpt":"This is a preliminary report on the work aimed at making CR-Prolog -- a version of ASP with consistency restoring rules -- more suitable for use in teaching and large applications. First we describe a sorted version of CR-Prolog called SPARC. Second, we translate a basic version of the CR-Prolog into the language of DLV and compare the performance with the state of the art CR-Prolog solver. The results form the foundation for future more efficient and user friendly implementation of SPARC and shed some light on the relationship between two useful knowledge representation constructs: consistenc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.1386","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":"1301.1386","created_at":"2026-05-18T03:36:57.667143+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.1386v1","created_at":"2026-05-18T03:36:57.667143+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.1386","created_at":"2026-05-18T03:36:57.667143+00:00"},{"alias_kind":"pith_short_12","alias_value":"ICYI7KT4MVSB","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_16","alias_value":"ICYI7KT4MVSBUYLW","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_8","alias_value":"ICYI7KT4","created_at":"2026-05-18T12:27:46.883200+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/ICYI7KT4MVSBUYLWOXYT6EKUVC","json":"https://pith.science/pith/ICYI7KT4MVSBUYLWOXYT6EKUVC.json","graph_json":"https://pith.science/api/pith-number/ICYI7KT4MVSBUYLWOXYT6EKUVC/graph.json","events_json":"https://pith.science/api/pith-number/ICYI7KT4MVSBUYLWOXYT6EKUVC/events.json","paper":"https://pith.science/paper/ICYI7KT4"},"agent_actions":{"view_html":"https://pith.science/pith/ICYI7KT4MVSBUYLWOXYT6EKUVC","download_json":"https://pith.science/pith/ICYI7KT4MVSBUYLWOXYT6EKUVC.json","view_paper":"https://pith.science/paper/ICYI7KT4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.1386&json=true","fetch_graph":"https://pith.science/api/pith-number/ICYI7KT4MVSBUYLWOXYT6EKUVC/graph.json","fetch_events":"https://pith.science/api/pith-number/ICYI7KT4MVSBUYLWOXYT6EKUVC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ICYI7KT4MVSBUYLWOXYT6EKUVC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ICYI7KT4MVSBUYLWOXYT6EKUVC/action/storage_attestation","attest_author":"https://pith.science/pith/ICYI7KT4MVSBUYLWOXYT6EKUVC/action/author_attestation","sign_citation":"https://pith.science/pith/ICYI7KT4MVSBUYLWOXYT6EKUVC/action/citation_signature","submit_replication":"https://pith.science/pith/ICYI7KT4MVSBUYLWOXYT6EKUVC/action/replication_record"}},"created_at":"2026-05-18T03:36:57.667143+00:00","updated_at":"2026-05-18T03:36:57.667143+00:00"}