{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:GTTWW66LGQJ4OG5P7Y7R66HHDU","short_pith_number":"pith:GTTWW66L","schema_version":"1.0","canonical_sha256":"34e76b7bcb3413c71baffe3f1f78e71d375226f21193ecd8a2b8116986618050","source":{"kind":"arxiv","id":"1905.03196","version":1},"attestation_state":"computed","paper":{"title":"Discovering and Proving Invariants in Answer Set Programming and Planning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Patrick L\\\"uhne","submitted_at":"2019-05-08T16:32:52Z","abstract_excerpt":"Answer set programming (ASP) and planning are two widely used paradigms for solving logic programs with declarative programming. In both cases, the quality of the input programs has a major influence on the quality and performance of the solving or planning process. Hence, programmers need to understand how to make their programs efficient and still correct. In my PhD studies, I explore how input programs can be improved and verified automatically as a means to support programmers. One of my research directions consists in discovering invariants in planning programs without human support, whic"},"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":"1905.03196","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2019-05-08T16:32:52Z","cross_cats_sorted":[],"title_canon_sha256":"9a1ce13500909ec6342a50250b66402c1b66daeb5c756fb7f72f460aba95f4c0","abstract_canon_sha256":"46d6600493f2cc259d8dd56d1e0cdda3fc0dbd5712fe7b530c2f630232c8dfe3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:42.585438Z","signature_b64":"PZryFua8b+bLz0Vzy2Hm80YGlm5XV/xQW/96SSAkF+a8ZkaSgCK/flHlSgzHWDfgnsLNgtuz/m4DbDydod8iCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"34e76b7bcb3413c71baffe3f1f78e71d375226f21193ecd8a2b8116986618050","last_reissued_at":"2026-05-17T23:46:42.584818Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:42.584818Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Discovering and Proving Invariants in Answer Set Programming and Planning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Patrick L\\\"uhne","submitted_at":"2019-05-08T16:32:52Z","abstract_excerpt":"Answer set programming (ASP) and planning are two widely used paradigms for solving logic programs with declarative programming. In both cases, the quality of the input programs has a major influence on the quality and performance of the solving or planning process. Hence, programmers need to understand how to make their programs efficient and still correct. In my PhD studies, I explore how input programs can be improved and verified automatically as a means to support programmers. One of my research directions consists in discovering invariants in planning programs without human support, whic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.03196","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":"1905.03196","created_at":"2026-05-17T23:46:42.584923+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.03196v1","created_at":"2026-05-17T23:46:42.584923+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.03196","created_at":"2026-05-17T23:46:42.584923+00:00"},{"alias_kind":"pith_short_12","alias_value":"GTTWW66LGQJ4","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"GTTWW66LGQJ4OG5P","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"GTTWW66L","created_at":"2026-05-18T12:33:18.533446+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/GTTWW66LGQJ4OG5P7Y7R66HHDU","json":"https://pith.science/pith/GTTWW66LGQJ4OG5P7Y7R66HHDU.json","graph_json":"https://pith.science/api/pith-number/GTTWW66LGQJ4OG5P7Y7R66HHDU/graph.json","events_json":"https://pith.science/api/pith-number/GTTWW66LGQJ4OG5P7Y7R66HHDU/events.json","paper":"https://pith.science/paper/GTTWW66L"},"agent_actions":{"view_html":"https://pith.science/pith/GTTWW66LGQJ4OG5P7Y7R66HHDU","download_json":"https://pith.science/pith/GTTWW66LGQJ4OG5P7Y7R66HHDU.json","view_paper":"https://pith.science/paper/GTTWW66L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.03196&json=true","fetch_graph":"https://pith.science/api/pith-number/GTTWW66LGQJ4OG5P7Y7R66HHDU/graph.json","fetch_events":"https://pith.science/api/pith-number/GTTWW66LGQJ4OG5P7Y7R66HHDU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GTTWW66LGQJ4OG5P7Y7R66HHDU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GTTWW66LGQJ4OG5P7Y7R66HHDU/action/storage_attestation","attest_author":"https://pith.science/pith/GTTWW66LGQJ4OG5P7Y7R66HHDU/action/author_attestation","sign_citation":"https://pith.science/pith/GTTWW66LGQJ4OG5P7Y7R66HHDU/action/citation_signature","submit_replication":"https://pith.science/pith/GTTWW66LGQJ4OG5P7Y7R66HHDU/action/replication_record"}},"created_at":"2026-05-17T23:46:42.584923+00:00","updated_at":"2026-05-17T23:46:42.584923+00:00"}