{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:1998:SZVOQHCZ2DCDJR3UXB3TOMSYUS","short_pith_number":"pith:SZVOQHCZ","schema_version":"1.0","canonical_sha256":"966ae81c59d0c434c774b877373258a4a42d6f4760dc490eaf337f5d3cd9ab89","source":{"kind":"arxiv","id":"cs/9809017","version":1},"attestation_state":"computed","paper":{"title":"The Complexity of Planar Counting Problems","license":"","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.CC","authors_text":"Harry B. Hunt III, Madhav V. Marathe, Richard E. Stearns, Venkatesh Radhakrishnan","submitted_at":"1998-09-11T17:38:19Z","abstract_excerpt":"We prove the #P-hardness of the counting problems associated with various satisfiability, graph and combinatorial problems, when restricted to planar instances. These problems include \\begin{romannum} \\item[{}] {\\sc 3Sat, 1-3Sat, 1-Ex3Sat, Minimum Vertex Cover, Minimum Dominating Set, Minimum Feedback Vertex Set, X3C, Partition Into Triangles, and Clique Cover.} \\end{romannum} We also prove the {\\sf NP}-completeness of the {\\sc Ambiguous Satisfiability} problems \\cite{Sa80} and the {\\sf D$^P$}-completeness (with respect to random polynomial reducibility) of the unique satisfiability problems \\"},"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":"cs/9809017","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.CC","submitted_at":"1998-09-11T17:38:19Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"515575b0aec218102742525eafd549a0adc4cc7462af5595cdcaaf533f3bc594","abstract_canon_sha256":"36331f061c67c11390753718ef603bce7ba923ce0fa87d301e2caca6776b39c6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:49:25.345667Z","signature_b64":"FaejeHYUtlhgTtOu8AvYZ8EDXn3/7AfiHmw+7NF4IlGLXRMj9g9nEjFrHeD82ljRoYNs8BQhA0rKvQXSicOpAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"966ae81c59d0c434c774b877373258a4a42d6f4760dc490eaf337f5d3cd9ab89","last_reissued_at":"2026-07-04T14:49:25.345244Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:49:25.345244Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Complexity of Planar Counting Problems","license":"","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.CC","authors_text":"Harry B. Hunt III, Madhav V. Marathe, Richard E. Stearns, Venkatesh Radhakrishnan","submitted_at":"1998-09-11T17:38:19Z","abstract_excerpt":"We prove the #P-hardness of the counting problems associated with various satisfiability, graph and combinatorial problems, when restricted to planar instances. These problems include \\begin{romannum} \\item[{}] {\\sc 3Sat, 1-3Sat, 1-Ex3Sat, Minimum Vertex Cover, Minimum Dominating Set, Minimum Feedback Vertex Set, X3C, Partition Into Triangles, and Clique Cover.} \\end{romannum} We also prove the {\\sf NP}-completeness of the {\\sc Ambiguous Satisfiability} problems \\cite{Sa80} and the {\\sf D$^P$}-completeness (with respect to random polynomial reducibility) of the unique satisfiability problems \\"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/9809017","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/cs/9809017/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"cs/9809017","created_at":"2026-07-04T14:49:25.345301+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/9809017v1","created_at":"2026-07-04T14:49:25.345301+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/9809017","created_at":"2026-07-04T14:49:25.345301+00:00"},{"alias_kind":"pith_short_12","alias_value":"SZVOQHCZ2DCD","created_at":"2026-07-04T14:49:25.345301+00:00"},{"alias_kind":"pith_short_16","alias_value":"SZVOQHCZ2DCDJR3U","created_at":"2026-07-04T14:49:25.345301+00:00"},{"alias_kind":"pith_short_8","alias_value":"SZVOQHCZ","created_at":"2026-07-04T14:49:25.345301+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/SZVOQHCZ2DCDJR3UXB3TOMSYUS","json":"https://pith.science/pith/SZVOQHCZ2DCDJR3UXB3TOMSYUS.json","graph_json":"https://pith.science/api/pith-number/SZVOQHCZ2DCDJR3UXB3TOMSYUS/graph.json","events_json":"https://pith.science/api/pith-number/SZVOQHCZ2DCDJR3UXB3TOMSYUS/events.json","paper":"https://pith.science/paper/SZVOQHCZ"},"agent_actions":{"view_html":"https://pith.science/pith/SZVOQHCZ2DCDJR3UXB3TOMSYUS","download_json":"https://pith.science/pith/SZVOQHCZ2DCDJR3UXB3TOMSYUS.json","view_paper":"https://pith.science/paper/SZVOQHCZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/9809017&json=true","fetch_graph":"https://pith.science/api/pith-number/SZVOQHCZ2DCDJR3UXB3TOMSYUS/graph.json","fetch_events":"https://pith.science/api/pith-number/SZVOQHCZ2DCDJR3UXB3TOMSYUS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SZVOQHCZ2DCDJR3UXB3TOMSYUS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SZVOQHCZ2DCDJR3UXB3TOMSYUS/action/storage_attestation","attest_author":"https://pith.science/pith/SZVOQHCZ2DCDJR3UXB3TOMSYUS/action/author_attestation","sign_citation":"https://pith.science/pith/SZVOQHCZ2DCDJR3UXB3TOMSYUS/action/citation_signature","submit_replication":"https://pith.science/pith/SZVOQHCZ2DCDJR3UXB3TOMSYUS/action/replication_record"}},"created_at":"2026-07-04T14:49:25.345301+00:00","updated_at":"2026-07-04T14:49:25.345301+00:00"}