{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:S6YAD3JKSYNV5XMYQ3QGR2R3NK","short_pith_number":"pith:S6YAD3JK","schema_version":"1.0","canonical_sha256":"97b001ed2a961b5edd9886e068ea3b6a84f8178180071aa15350082bff699742","source":{"kind":"arxiv","id":"2506.08150","version":1},"attestation_state":"computed","paper":{"title":"Compiling Metric Temporal Answer Set Programming","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.AI","authors_text":"Arvid Becker, Javier Romero, Martin Di\\'eguez, Pedro Cabalar, Susana Hahn, Torsten Schaub","submitted_at":"2025-06-09T18:56:57Z","abstract_excerpt":"We develop a computational approach to Metric Answer Set Programming (ASP) to allow for expressing quantitative temporal constrains, like durations and deadlines. A central challenge is to maintain scalability when dealing with fine-grained timing constraints, which can significantly exacerbate ASP's grounding bottleneck. To address this issue, we leverage extensions of ASP with difference constraints, a simplified form of linear constraints, to handle time-related aspects externally. Our approach effectively decouples metric ASP from the granularity of time, resulting in a solution that is un"},"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":"2506.08150","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2025-06-09T18:56:57Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"d4f98e16e6e4bd88ab5e32f09e358fe0e2e5c7c3d0a2ab74b69854116da0b1af","abstract_canon_sha256":"ea5748a790a8ab6b94b79a8461a4dc0ac025a1abfdded2eb7a322fec4de91392"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:18:45.437630Z","signature_b64":"BN8ur/53oVjEGYx4pYAza83YCShK9sBZuhF1HNksCMqD3domtxb29iw6OMO4sEuCoFA3Qj4I2q7ruGqwCFfAAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"97b001ed2a961b5edd9886e068ea3b6a84f8178180071aa15350082bff699742","last_reissued_at":"2026-07-05T11:18:45.437155Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:18:45.437155Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Compiling Metric Temporal Answer Set Programming","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.AI","authors_text":"Arvid Becker, Javier Romero, Martin Di\\'eguez, Pedro Cabalar, Susana Hahn, Torsten Schaub","submitted_at":"2025-06-09T18:56:57Z","abstract_excerpt":"We develop a computational approach to Metric Answer Set Programming (ASP) to allow for expressing quantitative temporal constrains, like durations and deadlines. A central challenge is to maintain scalability when dealing with fine-grained timing constraints, which can significantly exacerbate ASP's grounding bottleneck. To address this issue, we leverage extensions of ASP with difference constraints, a simplified form of linear constraints, to handle time-related aspects externally. Our approach effectively decouples metric ASP from the granularity of time, resulting in a solution that is un"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.08150","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/2506.08150/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":"2506.08150","created_at":"2026-07-05T11:18:45.437208+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.08150v1","created_at":"2026-07-05T11:18:45.437208+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.08150","created_at":"2026-07-05T11:18:45.437208+00:00"},{"alias_kind":"pith_short_12","alias_value":"S6YAD3JKSYNV","created_at":"2026-07-05T11:18:45.437208+00:00"},{"alias_kind":"pith_short_16","alias_value":"S6YAD3JKSYNV5XMY","created_at":"2026-07-05T11:18:45.437208+00:00"},{"alias_kind":"pith_short_8","alias_value":"S6YAD3JK","created_at":"2026-07-05T11:18:45.437208+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/S6YAD3JKSYNV5XMYQ3QGR2R3NK","json":"https://pith.science/pith/S6YAD3JKSYNV5XMYQ3QGR2R3NK.json","graph_json":"https://pith.science/api/pith-number/S6YAD3JKSYNV5XMYQ3QGR2R3NK/graph.json","events_json":"https://pith.science/api/pith-number/S6YAD3JKSYNV5XMYQ3QGR2R3NK/events.json","paper":"https://pith.science/paper/S6YAD3JK"},"agent_actions":{"view_html":"https://pith.science/pith/S6YAD3JKSYNV5XMYQ3QGR2R3NK","download_json":"https://pith.science/pith/S6YAD3JKSYNV5XMYQ3QGR2R3NK.json","view_paper":"https://pith.science/paper/S6YAD3JK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.08150&json=true","fetch_graph":"https://pith.science/api/pith-number/S6YAD3JKSYNV5XMYQ3QGR2R3NK/graph.json","fetch_events":"https://pith.science/api/pith-number/S6YAD3JKSYNV5XMYQ3QGR2R3NK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S6YAD3JKSYNV5XMYQ3QGR2R3NK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S6YAD3JKSYNV5XMYQ3QGR2R3NK/action/storage_attestation","attest_author":"https://pith.science/pith/S6YAD3JKSYNV5XMYQ3QGR2R3NK/action/author_attestation","sign_citation":"https://pith.science/pith/S6YAD3JKSYNV5XMYQ3QGR2R3NK/action/citation_signature","submit_replication":"https://pith.science/pith/S6YAD3JKSYNV5XMYQ3QGR2R3NK/action/replication_record"}},"created_at":"2026-07-05T11:18:45.437208+00:00","updated_at":"2026-07-05T11:18:45.437208+00:00"}