{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:JRIBUUF55LOE2HLQIFIFQXU2HP","short_pith_number":"pith:JRIBUUF5","schema_version":"1.0","canonical_sha256":"4c501a50bdeadc4d1d704150585e9a3bc67342063f233dc080912b9419077ea0","source":{"kind":"arxiv","id":"1812.10849","version":2},"attestation_state":"computed","paper":{"title":"The complete set of minimal simple graphs that support unsatisfiable 2-CNFs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.LO"],"primary_cat":"math.CO","authors_text":"Anil N. Hirani, Vaibhav Karve","submitted_at":"2018-12-28T00:13:14Z","abstract_excerpt":"A propositional logic sentence in conjunctive normal form that has clauses of length two (a 2-CNF) can be associated with a multigraph in which the vertices correspond to the variables and edges to clauses. We first show that every such sentence that has been reduced, that is, which is unchanged under application of certain tautologies, is equisatisfiable to a 2-CNF whose associated multigraph is, in fact, a simple graph. Our main result is a complete characterization of graphs that can support unsatisfiable 2-CNF sentences. We show that a simple graph can support an unsatisfiable reduced 2-CN"},"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":"1812.10849","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-12-28T00:13:14Z","cross_cats_sorted":["cs.DM","math.LO"],"title_canon_sha256":"d9e2c3e47f256a552d723130edaa683a679637919cfcfc20260a97ee4b316d3f","abstract_canon_sha256":"0e1b6b61b812121446e6e37d93ec6aefc8fd584bbeda8b6c4b70892b159eb974"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:09.413634Z","signature_b64":"asb+o9IPz5Hz0v10U8uNJxnGTgWtnbgHD4BUXhhWBgFeESMIhqVrG/RvxxDtGEMYYHL8eRjOVLdLHnrZuNMhAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4c501a50bdeadc4d1d704150585e9a3bc67342063f233dc080912b9419077ea0","last_reissued_at":"2026-05-17T23:51:09.413077Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:09.413077Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The complete set of minimal simple graphs that support unsatisfiable 2-CNFs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.LO"],"primary_cat":"math.CO","authors_text":"Anil N. Hirani, Vaibhav Karve","submitted_at":"2018-12-28T00:13:14Z","abstract_excerpt":"A propositional logic sentence in conjunctive normal form that has clauses of length two (a 2-CNF) can be associated with a multigraph in which the vertices correspond to the variables and edges to clauses. We first show that every such sentence that has been reduced, that is, which is unchanged under application of certain tautologies, is equisatisfiable to a 2-CNF whose associated multigraph is, in fact, a simple graph. Our main result is a complete characterization of graphs that can support unsatisfiable 2-CNF sentences. We show that a simple graph can support an unsatisfiable reduced 2-CN"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.10849","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":"1812.10849","created_at":"2026-05-17T23:51:09.413156+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.10849v2","created_at":"2026-05-17T23:51:09.413156+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.10849","created_at":"2026-05-17T23:51:09.413156+00:00"},{"alias_kind":"pith_short_12","alias_value":"JRIBUUF55LOE","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_16","alias_value":"JRIBUUF55LOE2HLQ","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_8","alias_value":"JRIBUUF5","created_at":"2026-05-18T12:32:31.084164+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/JRIBUUF55LOE2HLQIFIFQXU2HP","json":"https://pith.science/pith/JRIBUUF55LOE2HLQIFIFQXU2HP.json","graph_json":"https://pith.science/api/pith-number/JRIBUUF55LOE2HLQIFIFQXU2HP/graph.json","events_json":"https://pith.science/api/pith-number/JRIBUUF55LOE2HLQIFIFQXU2HP/events.json","paper":"https://pith.science/paper/JRIBUUF5"},"agent_actions":{"view_html":"https://pith.science/pith/JRIBUUF55LOE2HLQIFIFQXU2HP","download_json":"https://pith.science/pith/JRIBUUF55LOE2HLQIFIFQXU2HP.json","view_paper":"https://pith.science/paper/JRIBUUF5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.10849&json=true","fetch_graph":"https://pith.science/api/pith-number/JRIBUUF55LOE2HLQIFIFQXU2HP/graph.json","fetch_events":"https://pith.science/api/pith-number/JRIBUUF55LOE2HLQIFIFQXU2HP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JRIBUUF55LOE2HLQIFIFQXU2HP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JRIBUUF55LOE2HLQIFIFQXU2HP/action/storage_attestation","attest_author":"https://pith.science/pith/JRIBUUF55LOE2HLQIFIFQXU2HP/action/author_attestation","sign_citation":"https://pith.science/pith/JRIBUUF55LOE2HLQIFIFQXU2HP/action/citation_signature","submit_replication":"https://pith.science/pith/JRIBUUF55LOE2HLQIFIFQXU2HP/action/replication_record"}},"created_at":"2026-05-17T23:51:09.413156+00:00","updated_at":"2026-05-17T23:51:09.413156+00:00"}