{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:747AD5CHMSSZL4EP3SG753QLZ4","short_pith_number":"pith:747AD5CH","schema_version":"1.0","canonical_sha256":"ff3e01f44764a595f08fdc8dfeee0bcf2cfb164cfdc0efeaad105ef45b8e1049","source":{"kind":"arxiv","id":"2605.22716","version":1},"attestation_state":"computed","paper":{"title":"Parametric Modular Answer Set Programs Made Declarative","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.AI","authors_text":"Jorge Fandinno, Torsten Schaub, Yuliya Lierler","submitted_at":"2026-05-21T16:52:18Z","abstract_excerpt":"In this paper, we explore the concept of modularity in first-order answer set programming (ASP). We introduce a new formalism called parametric modular logic programs, which allows defining subprograms with parameters and intensionality statements. We demonstrate how this formalism can capture the semantics of clingo-programs with collective control, a feature that enables structuring and instantiating subprograms. We provide theoretical foundations for modular ASP, illustrate its usefulness, and connect to traditional non-modular ASP."},"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.22716","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-05-21T16:52:18Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"f704ba907e95b19cabaa33a4b3e9d838c8d150fbae69c9c467e3956a02d5bd81","abstract_canon_sha256":"da7de732eeb29e684df9279ea9e1211a6b597cd95c4ea28168720c7542756756"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-22T02:04:51.683735Z","signature_b64":"7dxayzrlGnL/1Q0fx+WPW49b35yGMpF9CJ5K2tGjD16nY6DdeWubOFSJcyfzkb3D9AtoYOUKdYFcJF6au5FZCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ff3e01f44764a595f08fdc8dfeee0bcf2cfb164cfdc0efeaad105ef45b8e1049","last_reissued_at":"2026-05-22T02:04:51.683067Z","signature_status":"signed_v1","first_computed_at":"2026-05-22T02:04:51.683067Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parametric Modular Answer Set Programs Made Declarative","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.AI","authors_text":"Jorge Fandinno, Torsten Schaub, Yuliya Lierler","submitted_at":"2026-05-21T16:52:18Z","abstract_excerpt":"In this paper, we explore the concept of modularity in first-order answer set programming (ASP). We introduce a new formalism called parametric modular logic programs, which allows defining subprograms with parameters and intensionality statements. We demonstrate how this formalism can capture the semantics of clingo-programs with collective control, a feature that enables structuring and instantiating subprograms. We provide theoretical foundations for modular ASP, illustrate its usefulness, and connect to traditional non-modular ASP."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.22716","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.22716/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.22716","created_at":"2026-05-22T02:04:51.683181+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.22716v1","created_at":"2026-05-22T02:04:51.683181+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.22716","created_at":"2026-05-22T02:04:51.683181+00:00"},{"alias_kind":"pith_short_12","alias_value":"747AD5CHMSSZ","created_at":"2026-05-22T02:04:51.683181+00:00"},{"alias_kind":"pith_short_16","alias_value":"747AD5CHMSSZL4EP","created_at":"2026-05-22T02:04:51.683181+00:00"},{"alias_kind":"pith_short_8","alias_value":"747AD5CH","created_at":"2026-05-22T02:04:51.683181+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/747AD5CHMSSZL4EP3SG753QLZ4","json":"https://pith.science/pith/747AD5CHMSSZL4EP3SG753QLZ4.json","graph_json":"https://pith.science/api/pith-number/747AD5CHMSSZL4EP3SG753QLZ4/graph.json","events_json":"https://pith.science/api/pith-number/747AD5CHMSSZL4EP3SG753QLZ4/events.json","paper":"https://pith.science/paper/747AD5CH"},"agent_actions":{"view_html":"https://pith.science/pith/747AD5CHMSSZL4EP3SG753QLZ4","download_json":"https://pith.science/pith/747AD5CHMSSZL4EP3SG753QLZ4.json","view_paper":"https://pith.science/paper/747AD5CH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.22716&json=true","fetch_graph":"https://pith.science/api/pith-number/747AD5CHMSSZL4EP3SG753QLZ4/graph.json","fetch_events":"https://pith.science/api/pith-number/747AD5CHMSSZL4EP3SG753QLZ4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/747AD5CHMSSZL4EP3SG753QLZ4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/747AD5CHMSSZL4EP3SG753QLZ4/action/storage_attestation","attest_author":"https://pith.science/pith/747AD5CHMSSZL4EP3SG753QLZ4/action/author_attestation","sign_citation":"https://pith.science/pith/747AD5CHMSSZL4EP3SG753QLZ4/action/citation_signature","submit_replication":"https://pith.science/pith/747AD5CHMSSZL4EP3SG753QLZ4/action/replication_record"}},"created_at":"2026-05-22T02:04:51.683181+00:00","updated_at":"2026-05-22T02:04:51.683181+00:00"}