{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:HTYSEFUBVBI64E345IU4OMDZHF","short_pith_number":"pith:HTYSEFUB","schema_version":"1.0","canonical_sha256":"3cf1221681a851ee137cea29c73079397bf4bd7498d8d0db57c5a946190be9e3","source":{"kind":"arxiv","id":"1811.04800","version":1},"attestation_state":"computed","paper":{"title":"Strong Equivalence for Epistemic Logic Programs Made Easy (Extended Version)","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.LO","authors_text":"Michael Morak, Stefan Woltran, Wolfgang Faber","submitted_at":"2018-11-12T15:36:39Z","abstract_excerpt":"Epistemic Logic Programs (ELPs), that is, Answer Set Programming (ASP) extended with epistemic operators, have received renewed interest in recent years, which led to a flurry of new research, as well as efficient solvers. An important question is under which conditions a sub-program can be replaced by another one without changing the meaning, in any context. This problem is known as strong equivalence, and is well-studied for ASP. For ELPs, this question has been approached by embedding them into epistemic extensions of equilibrium logics. In this paper, we consider a simpler, more direct cha"},"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":"1811.04800","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.LO","submitted_at":"2018-11-12T15:36:39Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"50bc87961c7e675895ee47f048842e99bea6d5ab87e2399ad97541c0f5e46de6","abstract_canon_sha256":"34c3fbe52f1a0c4409b1e87d999a95ac47e28cdc1ba66532270c565f0b90fab3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:03.987094Z","signature_b64":"4FN9RzYmeK2peXL+jtH/NTQ2FuKeGwR3/jfzxKTXxrayrsC8hsow4G30W4jxwlMIFHQEZ0L5DcqGDzhkUeDYDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3cf1221681a851ee137cea29c73079397bf4bd7498d8d0db57c5a946190be9e3","last_reissued_at":"2026-05-18T00:01:03.986557Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:03.986557Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Strong Equivalence for Epistemic Logic Programs Made Easy (Extended Version)","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.LO","authors_text":"Michael Morak, Stefan Woltran, Wolfgang Faber","submitted_at":"2018-11-12T15:36:39Z","abstract_excerpt":"Epistemic Logic Programs (ELPs), that is, Answer Set Programming (ASP) extended with epistemic operators, have received renewed interest in recent years, which led to a flurry of new research, as well as efficient solvers. An important question is under which conditions a sub-program can be replaced by another one without changing the meaning, in any context. This problem is known as strong equivalence, and is well-studied for ASP. For ELPs, this question has been approached by embedding them into epistemic extensions of equilibrium logics. In this paper, we consider a simpler, more direct cha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.04800","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":"1811.04800","created_at":"2026-05-18T00:01:03.986656+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.04800v1","created_at":"2026-05-18T00:01:03.986656+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.04800","created_at":"2026-05-18T00:01:03.986656+00:00"},{"alias_kind":"pith_short_12","alias_value":"HTYSEFUBVBI6","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_16","alias_value":"HTYSEFUBVBI64E34","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_8","alias_value":"HTYSEFUB","created_at":"2026-05-18T12:32:28.185984+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/HTYSEFUBVBI64E345IU4OMDZHF","json":"https://pith.science/pith/HTYSEFUBVBI64E345IU4OMDZHF.json","graph_json":"https://pith.science/api/pith-number/HTYSEFUBVBI64E345IU4OMDZHF/graph.json","events_json":"https://pith.science/api/pith-number/HTYSEFUBVBI64E345IU4OMDZHF/events.json","paper":"https://pith.science/paper/HTYSEFUB"},"agent_actions":{"view_html":"https://pith.science/pith/HTYSEFUBVBI64E345IU4OMDZHF","download_json":"https://pith.science/pith/HTYSEFUBVBI64E345IU4OMDZHF.json","view_paper":"https://pith.science/paper/HTYSEFUB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.04800&json=true","fetch_graph":"https://pith.science/api/pith-number/HTYSEFUBVBI64E345IU4OMDZHF/graph.json","fetch_events":"https://pith.science/api/pith-number/HTYSEFUBVBI64E345IU4OMDZHF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HTYSEFUBVBI64E345IU4OMDZHF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HTYSEFUBVBI64E345IU4OMDZHF/action/storage_attestation","attest_author":"https://pith.science/pith/HTYSEFUBVBI64E345IU4OMDZHF/action/author_attestation","sign_citation":"https://pith.science/pith/HTYSEFUBVBI64E345IU4OMDZHF/action/citation_signature","submit_replication":"https://pith.science/pith/HTYSEFUBVBI64E345IU4OMDZHF/action/replication_record"}},"created_at":"2026-05-18T00:01:03.986656+00:00","updated_at":"2026-05-18T00:01:03.986656+00:00"}