{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:XMK7EI6XYTBIDKBU45BFD6THCD","short_pith_number":"pith:XMK7EI6X","schema_version":"1.0","canonical_sha256":"bb15f223d7c4c281a834e74251fa6710cf0ebac223ea40272aea5dee59cb35e6","source":{"kind":"arxiv","id":"1312.6113","version":1},"attestation_state":"computed","paper":{"title":"Aspartame: Solving Constraint Satisfaction Problems with Answer Set Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Katsumi Inoue, Martin Gebser, Matthias Weise, Mutsunori Banbara, Naoyuki Tamura, Takehide Soh, Torsten Schaub","submitted_at":"2013-12-20T20:57:28Z","abstract_excerpt":"Encoding finite linear CSPs as Boolean formulas and solving them by using modern SAT solvers has proven to be highly effective, as exemplified by the award-winning sugar system. We here develop an alternative approach based on ASP. This allows us to use first-order encodings providing us with a high degree of flexibility for easy experimentation with different implementations. The resulting system aspartame re-uses parts of sugar for parsing and normalizing CSPs. The obtained set of facts is then combined with an ASP encoding that can be grounded and solved by off-the-shelf ASP systems. We est"},"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":"1312.6113","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-12-20T20:57:28Z","cross_cats_sorted":[],"title_canon_sha256":"ef75681bfba19b1666ad9789bcbb866941181b69bdd896e8a71245e9b448820f","abstract_canon_sha256":"9f01669039d9f2eab6bce2fd8478b36adae496087d5e78341db3db299888ab74"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:04:07.119215Z","signature_b64":"qh+a0JeRQo0yFr/Um1DKMVlsvkCqUkIVtjNG33p9UGP8EPRQSjfOFavhPi7WgnsXK5ioDlpE3wyRMR10bJpoAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bb15f223d7c4c281a834e74251fa6710cf0ebac223ea40272aea5dee59cb35e6","last_reissued_at":"2026-05-18T03:04:07.118718Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:04:07.118718Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Aspartame: Solving Constraint Satisfaction Problems with Answer Set Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Katsumi Inoue, Martin Gebser, Matthias Weise, Mutsunori Banbara, Naoyuki Tamura, Takehide Soh, Torsten Schaub","submitted_at":"2013-12-20T20:57:28Z","abstract_excerpt":"Encoding finite linear CSPs as Boolean formulas and solving them by using modern SAT solvers has proven to be highly effective, as exemplified by the award-winning sugar system. We here develop an alternative approach based on ASP. This allows us to use first-order encodings providing us with a high degree of flexibility for easy experimentation with different implementations. The resulting system aspartame re-uses parts of sugar for parsing and normalizing CSPs. The obtained set of facts is then combined with an ASP encoding that can be grounded and solved by off-the-shelf ASP systems. We est"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.6113","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":"1312.6113","created_at":"2026-05-18T03:04:07.118789+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.6113v1","created_at":"2026-05-18T03:04:07.118789+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.6113","created_at":"2026-05-18T03:04:07.118789+00:00"},{"alias_kind":"pith_short_12","alias_value":"XMK7EI6XYTBI","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_16","alias_value":"XMK7EI6XYTBIDKBU","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_8","alias_value":"XMK7EI6X","created_at":"2026-05-18T12:28:06.772260+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/XMK7EI6XYTBIDKBU45BFD6THCD","json":"https://pith.science/pith/XMK7EI6XYTBIDKBU45BFD6THCD.json","graph_json":"https://pith.science/api/pith-number/XMK7EI6XYTBIDKBU45BFD6THCD/graph.json","events_json":"https://pith.science/api/pith-number/XMK7EI6XYTBIDKBU45BFD6THCD/events.json","paper":"https://pith.science/paper/XMK7EI6X"},"agent_actions":{"view_html":"https://pith.science/pith/XMK7EI6XYTBIDKBU45BFD6THCD","download_json":"https://pith.science/pith/XMK7EI6XYTBIDKBU45BFD6THCD.json","view_paper":"https://pith.science/paper/XMK7EI6X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.6113&json=true","fetch_graph":"https://pith.science/api/pith-number/XMK7EI6XYTBIDKBU45BFD6THCD/graph.json","fetch_events":"https://pith.science/api/pith-number/XMK7EI6XYTBIDKBU45BFD6THCD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XMK7EI6XYTBIDKBU45BFD6THCD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XMK7EI6XYTBIDKBU45BFD6THCD/action/storage_attestation","attest_author":"https://pith.science/pith/XMK7EI6XYTBIDKBU45BFD6THCD/action/author_attestation","sign_citation":"https://pith.science/pith/XMK7EI6XYTBIDKBU45BFD6THCD/action/citation_signature","submit_replication":"https://pith.science/pith/XMK7EI6XYTBIDKBU45BFD6THCD/action/replication_record"}},"created_at":"2026-05-18T03:04:07.118789+00:00","updated_at":"2026-05-18T03:04:07.118789+00:00"}