{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:WUHSIKC6UMK2LK34HFRDC3ZMJI","short_pith_number":"pith:WUHSIKC6","schema_version":"1.0","canonical_sha256":"b50f24285ea315a5ab7c3962316f2c4a319177a6f352e0bde59969fa17a7663a","source":{"kind":"arxiv","id":"2605.27338","version":1},"attestation_state":"computed","paper":{"title":"2-ASP(Q) programs with weak constraints: Complexity and efficient implementation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.CL","cs.LO"],"primary_cat":"cs.AI","authors_text":"Andrea Cuteri, Francesco Ricca, Giuseppe Mazzotta","submitted_at":"2026-05-26T17:44:39Z","abstract_excerpt":"ASP(Q) extends Answer Set Programming (ASP) with Quantifiers over answer sets. In this paper we focus on the class of ASP(Q) programs with two quantifiers and weak constraints, denoted as 2-ASP(Q)^w. 2-ASP(Q)^w is a practically relevant fragment of ASP(Q) that is expressive enough to capture optimization problems up to the class Delta_3^P. On the theoretical side, we provide a complete complexity characterization of the main computational tasks for 2-ASP(Q)^w programs, including tight completeness results and the analysis of nontrivial cases that have not been addressed in previous works. On t"},"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":"2605.27338","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2026-05-26T17:44:39Z","cross_cats_sorted":["cs.CC","cs.CL","cs.LO"],"title_canon_sha256":"4f39d1d155296c0ce58c82537eed56341c6c3deb01ab4a1d8eb86258b43a70d5","abstract_canon_sha256":"7f881bd0787731c4b5d835efcf9001e06e341fa11557187316b7fedae0083eb2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-27T02:06:18.786046Z","signature_b64":"KF88IAQEIQ+CPT2807CDaDrbe0Ni/mKItzdVDSqJdHeirSdHjfDEhQXSpCkgUQc1hs4AoLEX+vUcD1Dt09hyCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b50f24285ea315a5ab7c3962316f2c4a319177a6f352e0bde59969fa17a7663a","last_reissued_at":"2026-05-27T02:06:18.785410Z","signature_status":"signed_v1","first_computed_at":"2026-05-27T02:06:18.785410Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"2-ASP(Q) programs with weak constraints: Complexity and efficient implementation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.CL","cs.LO"],"primary_cat":"cs.AI","authors_text":"Andrea Cuteri, Francesco Ricca, Giuseppe Mazzotta","submitted_at":"2026-05-26T17:44:39Z","abstract_excerpt":"ASP(Q) extends Answer Set Programming (ASP) with Quantifiers over answer sets. In this paper we focus on the class of ASP(Q) programs with two quantifiers and weak constraints, denoted as 2-ASP(Q)^w. 2-ASP(Q)^w is a practically relevant fragment of ASP(Q) that is expressive enough to capture optimization problems up to the class Delta_3^P. On the theoretical side, we provide a complete complexity characterization of the main computational tasks for 2-ASP(Q)^w programs, including tight completeness results and the analysis of nontrivial cases that have not been addressed in previous works. On t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.27338","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.27338/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2605.27338","created_at":"2026-05-27T02:06:18.785525+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.27338v1","created_at":"2026-05-27T02:06:18.785525+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.27338","created_at":"2026-05-27T02:06:18.785525+00:00"},{"alias_kind":"pith_short_12","alias_value":"WUHSIKC6UMK2","created_at":"2026-05-27T02:06:18.785525+00:00"},{"alias_kind":"pith_short_16","alias_value":"WUHSIKC6UMK2LK34","created_at":"2026-05-27T02:06:18.785525+00:00"},{"alias_kind":"pith_short_8","alias_value":"WUHSIKC6","created_at":"2026-05-27T02:06:18.785525+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/WUHSIKC6UMK2LK34HFRDC3ZMJI","json":"https://pith.science/pith/WUHSIKC6UMK2LK34HFRDC3ZMJI.json","graph_json":"https://pith.science/api/pith-number/WUHSIKC6UMK2LK34HFRDC3ZMJI/graph.json","events_json":"https://pith.science/api/pith-number/WUHSIKC6UMK2LK34HFRDC3ZMJI/events.json","paper":"https://pith.science/paper/WUHSIKC6"},"agent_actions":{"view_html":"https://pith.science/pith/WUHSIKC6UMK2LK34HFRDC3ZMJI","download_json":"https://pith.science/pith/WUHSIKC6UMK2LK34HFRDC3ZMJI.json","view_paper":"https://pith.science/paper/WUHSIKC6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.27338&json=true","fetch_graph":"https://pith.science/api/pith-number/WUHSIKC6UMK2LK34HFRDC3ZMJI/graph.json","fetch_events":"https://pith.science/api/pith-number/WUHSIKC6UMK2LK34HFRDC3ZMJI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WUHSIKC6UMK2LK34HFRDC3ZMJI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WUHSIKC6UMK2LK34HFRDC3ZMJI/action/storage_attestation","attest_author":"https://pith.science/pith/WUHSIKC6UMK2LK34HFRDC3ZMJI/action/author_attestation","sign_citation":"https://pith.science/pith/WUHSIKC6UMK2LK34HFRDC3ZMJI/action/citation_signature","submit_replication":"https://pith.science/pith/WUHSIKC6UMK2LK34HFRDC3ZMJI/action/replication_record"}},"created_at":"2026-05-27T02:06:18.785525+00:00","updated_at":"2026-05-27T02:06:18.785525+00:00"}