{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:E77FKORVLZYK75S6BPNMTVNQ4R","short_pith_number":"pith:E77FKORV","schema_version":"1.0","canonical_sha256":"27fe553a355e70aff65e0bdac9d5b0e4471d6afdd5099651fbc89dd1e0df035a","source":{"kind":"arxiv","id":"1606.09449","version":2},"attestation_state":"computed","paper":{"title":"Clique-Width and Directed Width Measures for Answer-Set Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS"],"primary_cat":"cs.AI","authors_text":"Bernhard Bliem, Sebastian Ordyniak, Stefan Woltran","submitted_at":"2016-06-30T12:14:33Z","abstract_excerpt":"Disjunctive Answer Set Programming (ASP) is a powerful declarative programming paradigm whose main decision problems are located on the second level of the polynomial hierarchy. Identifying tractable fragments and developing efficient algorithms for such fragments are thus important objectives in order to complement the sophisticated ASP systems available to date. Hard problems can become tractable if some problem parameter is bounded by a fixed constant; such problems are then called fixed-parameter tractable (FPT). While several FPT results for ASP exist, parameters that relate to directed o"},"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":"1606.09449","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-06-30T12:14:33Z","cross_cats_sorted":["cs.CC","cs.DS"],"title_canon_sha256":"dd74179ffea77635262c4854e38c842ccc68a879e5d103d08d05e8df0162bb25","abstract_canon_sha256":"c701fd97b40a48e11f8269d298a73d09ec13c380c3cc006c3e211d7ca7fc02dd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:45.293498Z","signature_b64":"OjYESZKf1wAog6PuyoKAJDRqXCoUhhhewCjFFR3V0rnO6qXETSnvBwvg9HRQjlWJOphF6XWt5jfysCpTmj1JAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"27fe553a355e70aff65e0bdac9d5b0e4471d6afdd5099651fbc89dd1e0df035a","last_reissued_at":"2026-05-18T00:53:45.292951Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:45.292951Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Clique-Width and Directed Width Measures for Answer-Set Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS"],"primary_cat":"cs.AI","authors_text":"Bernhard Bliem, Sebastian Ordyniak, Stefan Woltran","submitted_at":"2016-06-30T12:14:33Z","abstract_excerpt":"Disjunctive Answer Set Programming (ASP) is a powerful declarative programming paradigm whose main decision problems are located on the second level of the polynomial hierarchy. Identifying tractable fragments and developing efficient algorithms for such fragments are thus important objectives in order to complement the sophisticated ASP systems available to date. Hard problems can become tractable if some problem parameter is bounded by a fixed constant; such problems are then called fixed-parameter tractable (FPT). While several FPT results for ASP exist, parameters that relate to directed o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.09449","kind":"arxiv","version":2},"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":"1606.09449","created_at":"2026-05-18T00:53:45.293032+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.09449v2","created_at":"2026-05-18T00:53:45.293032+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.09449","created_at":"2026-05-18T00:53:45.293032+00:00"},{"alias_kind":"pith_short_12","alias_value":"E77FKORVLZYK","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_16","alias_value":"E77FKORVLZYK75S6","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_8","alias_value":"E77FKORV","created_at":"2026-05-18T12:30:12.583610+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/E77FKORVLZYK75S6BPNMTVNQ4R","json":"https://pith.science/pith/E77FKORVLZYK75S6BPNMTVNQ4R.json","graph_json":"https://pith.science/api/pith-number/E77FKORVLZYK75S6BPNMTVNQ4R/graph.json","events_json":"https://pith.science/api/pith-number/E77FKORVLZYK75S6BPNMTVNQ4R/events.json","paper":"https://pith.science/paper/E77FKORV"},"agent_actions":{"view_html":"https://pith.science/pith/E77FKORVLZYK75S6BPNMTVNQ4R","download_json":"https://pith.science/pith/E77FKORVLZYK75S6BPNMTVNQ4R.json","view_paper":"https://pith.science/paper/E77FKORV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.09449&json=true","fetch_graph":"https://pith.science/api/pith-number/E77FKORVLZYK75S6BPNMTVNQ4R/graph.json","fetch_events":"https://pith.science/api/pith-number/E77FKORVLZYK75S6BPNMTVNQ4R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E77FKORVLZYK75S6BPNMTVNQ4R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E77FKORVLZYK75S6BPNMTVNQ4R/action/storage_attestation","attest_author":"https://pith.science/pith/E77FKORVLZYK75S6BPNMTVNQ4R/action/author_attestation","sign_citation":"https://pith.science/pith/E77FKORVLZYK75S6BPNMTVNQ4R/action/citation_signature","submit_replication":"https://pith.science/pith/E77FKORVLZYK75S6BPNMTVNQ4R/action/replication_record"}},"created_at":"2026-05-18T00:53:45.293032+00:00","updated_at":"2026-05-18T00:53:45.293032+00:00"}