{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:RS3FRO3YY742KEI7NDNQBVLU6L","short_pith_number":"pith:RS3FRO3Y","schema_version":"1.0","canonical_sha256":"8cb658bb78c7f9a5111f68db00d574f2e674f4fcfa794ae257856c5134320263","source":{"kind":"arxiv","id":"1610.04523","version":1},"attestation_state":"computed","paper":{"title":"On the computational complexity of read once resolution decidability in 2CNF formulas","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Hans Kleine B\\\"uning, K. Subramani, Piotr Wojciechowski","submitted_at":"2016-10-14T16:32:12Z","abstract_excerpt":"In this paper, we analyze 2CNF formulas from the perspectives of Read-Once resolution (ROR) refutation schemes. We focus on two types of ROR refutations, viz., variable-once refutation and clause-once refutation. In the former, each variable may be used at most once in the derivation of a refutation, while in the latter, each clause may be used at most once. We show that the problem of checking whether a given 2CNF formula has an ROR refutation under both schemes is NP-complete. This is surprising in light of the fact that there exist polynomial refutation schemes (tree-resolution and DAG-reso"},"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":"1610.04523","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-10-14T16:32:12Z","cross_cats_sorted":[],"title_canon_sha256":"304a3e004d20ad4780231ac1cbb8c7948237f473bbd5a08fb7d64a4611a9431d","abstract_canon_sha256":"931af69e962793fbfb73fe442bb60efb49cbd111743b8387be385c84b1bf5989"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:02:14.866635Z","signature_b64":"U9erZJ1F2LqQgnzd/O7tafA987SHAdYpS+7QeTXRbw4MsM2R/L332feFHl+xLiOr9cmDgb6sE4Nb7UBCb2WnDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8cb658bb78c7f9a5111f68db00d574f2e674f4fcfa794ae257856c5134320263","last_reissued_at":"2026-05-18T01:02:14.865948Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:02:14.865948Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the computational complexity of read once resolution decidability in 2CNF formulas","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Hans Kleine B\\\"uning, K. Subramani, Piotr Wojciechowski","submitted_at":"2016-10-14T16:32:12Z","abstract_excerpt":"In this paper, we analyze 2CNF formulas from the perspectives of Read-Once resolution (ROR) refutation schemes. We focus on two types of ROR refutations, viz., variable-once refutation and clause-once refutation. In the former, each variable may be used at most once in the derivation of a refutation, while in the latter, each clause may be used at most once. We show that the problem of checking whether a given 2CNF formula has an ROR refutation under both schemes is NP-complete. This is surprising in light of the fact that there exist polynomial refutation schemes (tree-resolution and DAG-reso"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.04523","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":"1610.04523","created_at":"2026-05-18T01:02:14.866038+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.04523v1","created_at":"2026-05-18T01:02:14.866038+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.04523","created_at":"2026-05-18T01:02:14.866038+00:00"},{"alias_kind":"pith_short_12","alias_value":"RS3FRO3YY742","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_16","alias_value":"RS3FRO3YY742KEI7","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_8","alias_value":"RS3FRO3Y","created_at":"2026-05-18T12:30:41.710351+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/RS3FRO3YY742KEI7NDNQBVLU6L","json":"https://pith.science/pith/RS3FRO3YY742KEI7NDNQBVLU6L.json","graph_json":"https://pith.science/api/pith-number/RS3FRO3YY742KEI7NDNQBVLU6L/graph.json","events_json":"https://pith.science/api/pith-number/RS3FRO3YY742KEI7NDNQBVLU6L/events.json","paper":"https://pith.science/paper/RS3FRO3Y"},"agent_actions":{"view_html":"https://pith.science/pith/RS3FRO3YY742KEI7NDNQBVLU6L","download_json":"https://pith.science/pith/RS3FRO3YY742KEI7NDNQBVLU6L.json","view_paper":"https://pith.science/paper/RS3FRO3Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.04523&json=true","fetch_graph":"https://pith.science/api/pith-number/RS3FRO3YY742KEI7NDNQBVLU6L/graph.json","fetch_events":"https://pith.science/api/pith-number/RS3FRO3YY742KEI7NDNQBVLU6L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RS3FRO3YY742KEI7NDNQBVLU6L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RS3FRO3YY742KEI7NDNQBVLU6L/action/storage_attestation","attest_author":"https://pith.science/pith/RS3FRO3YY742KEI7NDNQBVLU6L/action/author_attestation","sign_citation":"https://pith.science/pith/RS3FRO3YY742KEI7NDNQBVLU6L/action/citation_signature","submit_replication":"https://pith.science/pith/RS3FRO3YY742KEI7NDNQBVLU6L/action/replication_record"}},"created_at":"2026-05-18T01:02:14.866038+00:00","updated_at":"2026-05-18T01:02:14.866038+00:00"}