{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:RTGNPGIQSCYLR7LWGXXQ34CKDE","short_pith_number":"pith:RTGNPGIQ","schema_version":"1.0","canonical_sha256":"8cccd7991090b0b8fd7635ef0df04a191619338cfacca416c27e4aacab7f283d","source":{"kind":"arxiv","id":"2606.02387","version":1},"attestation_state":"computed","paper":{"title":"Equilibrium Semantics and Strong Equivalence for Higher-Order Logic Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Angelos Charalambidis, Babis Kostopoulos, Giannos Chatziagapis, Panos Rondogiannis","submitted_at":"2026-06-01T15:35:21Z","abstract_excerpt":"One of the most significant achievements of equilibrium logic was the characterization of strong equivalence, a property crucial for program transformation and optimization in Answer Set Programming (ASP). While ASP has recently been extended to a higher-order setting to enhance its expressive power, the lack of a comparable purely logical foundation has made verifying strong equivalence for higher-order programs or even proving the correctness of simple program transformations, a difficult challenge. This paper addresses this gap by developing a logical semantics for higher-order ASP by exten"},"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":"2606.02387","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2026-06-01T15:35:21Z","cross_cats_sorted":[],"title_canon_sha256":"727ee3fb4e57da24bfbc1956fe8f5c71fe016c14d2397d04fa898b10db587ef0","abstract_canon_sha256":"00de1538be9dfd96860273218459ddac34955f74474addbf5d78be5dff759e8e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-02T03:04:57.806214Z","signature_b64":"lfYoAg0wF9TS2EuZBuNGzfMq8+i+fpjETElQjINECRG4NLq/A6VmuDpM8FivVGy2Ve/DXyDDxrMfYUG3F6XsDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8cccd7991090b0b8fd7635ef0df04a191619338cfacca416c27e4aacab7f283d","last_reissued_at":"2026-06-02T03:04:57.805793Z","signature_status":"signed_v1","first_computed_at":"2026-06-02T03:04:57.805793Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Equilibrium Semantics and Strong Equivalence for Higher-Order Logic Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Angelos Charalambidis, Babis Kostopoulos, Giannos Chatziagapis, Panos Rondogiannis","submitted_at":"2026-06-01T15:35:21Z","abstract_excerpt":"One of the most significant achievements of equilibrium logic was the characterization of strong equivalence, a property crucial for program transformation and optimization in Answer Set Programming (ASP). While ASP has recently been extended to a higher-order setting to enhance its expressive power, the lack of a comparable purely logical foundation has made verifying strong equivalence for higher-order programs or even proving the correctness of simple program transformations, a difficult challenge. This paper addresses this gap by developing a logical semantics for higher-order ASP by exten"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.02387","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/2606.02387/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":"2606.02387","created_at":"2026-06-02T03:04:57.805847+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.02387v1","created_at":"2026-06-02T03:04:57.805847+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.02387","created_at":"2026-06-02T03:04:57.805847+00:00"},{"alias_kind":"pith_short_12","alias_value":"RTGNPGIQSCYL","created_at":"2026-06-02T03:04:57.805847+00:00"},{"alias_kind":"pith_short_16","alias_value":"RTGNPGIQSCYLR7LW","created_at":"2026-06-02T03:04:57.805847+00:00"},{"alias_kind":"pith_short_8","alias_value":"RTGNPGIQ","created_at":"2026-06-02T03:04:57.805847+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/RTGNPGIQSCYLR7LWGXXQ34CKDE","json":"https://pith.science/pith/RTGNPGIQSCYLR7LWGXXQ34CKDE.json","graph_json":"https://pith.science/api/pith-number/RTGNPGIQSCYLR7LWGXXQ34CKDE/graph.json","events_json":"https://pith.science/api/pith-number/RTGNPGIQSCYLR7LWGXXQ34CKDE/events.json","paper":"https://pith.science/paper/RTGNPGIQ"},"agent_actions":{"view_html":"https://pith.science/pith/RTGNPGIQSCYLR7LWGXXQ34CKDE","download_json":"https://pith.science/pith/RTGNPGIQSCYLR7LWGXXQ34CKDE.json","view_paper":"https://pith.science/paper/RTGNPGIQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.02387&json=true","fetch_graph":"https://pith.science/api/pith-number/RTGNPGIQSCYLR7LWGXXQ34CKDE/graph.json","fetch_events":"https://pith.science/api/pith-number/RTGNPGIQSCYLR7LWGXXQ34CKDE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RTGNPGIQSCYLR7LWGXXQ34CKDE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RTGNPGIQSCYLR7LWGXXQ34CKDE/action/storage_attestation","attest_author":"https://pith.science/pith/RTGNPGIQSCYLR7LWGXXQ34CKDE/action/author_attestation","sign_citation":"https://pith.science/pith/RTGNPGIQSCYLR7LWGXXQ34CKDE/action/citation_signature","submit_replication":"https://pith.science/pith/RTGNPGIQSCYLR7LWGXXQ34CKDE/action/replication_record"}},"created_at":"2026-06-02T03:04:57.805847+00:00","updated_at":"2026-06-02T03:04:57.805847+00:00"}