{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:HEVUO5FIVFD4TO4RLKMNOS6RGO","short_pith_number":"pith:HEVUO5FI","schema_version":"1.0","canonical_sha256":"392b4774a8a947c9bb915a98d74bd1339a12382ecd19f0c6a8b01926353ec8c3","source":{"kind":"arxiv","id":"1704.04775","version":1},"attestation_state":"computed","paper":{"title":"Approximating the Backbone in the Weighted Maximum Satisfiability Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"He Jiang, Jifeng Xuan, Yan Hu","submitted_at":"2017-04-16T13:23:14Z","abstract_excerpt":"The weighted Maximum Satisfiability problem (weighted MAX-SAT) is a NP-hard problem with numerous applications arising in artificial intelligence. As an efficient tool for heuristic design, the backbone has been applied to heuristics design for many NP-hard problems. In this paper, we investigated the computational complexity for retrieving the backbone in weighted MAX-SAT and developed a new algorithm for solving this problem. We showed that it is intractable to retrieve the full backbone under the assumption that . Moreover, it is intractable to retrieve a fixed fraction of the backbone as w"},"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":"1704.04775","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-04-16T13:23:14Z","cross_cats_sorted":[],"title_canon_sha256":"3dc2269f5efcfd8a1c4a1fe9e9bc011c23f60d55a507c42018889d85de1afeeb","abstract_canon_sha256":"0b39e95878579c3ae309f8a9b7f2382331e80f14f0cc1233e260e09a9714b665"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:17.764543Z","signature_b64":"33JRTusxJ3gU8MvzzQ1NQFpODHjCR5qu0ZDj83DG5MptQ0Wxb/lzDp4LkF7RCLlzY5OJ/GG/wr2z+KS3PKWPAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"392b4774a8a947c9bb915a98d74bd1339a12382ecd19f0c6a8b01926353ec8c3","last_reissued_at":"2026-05-18T00:46:17.764027Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:17.764027Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximating the Backbone in the Weighted Maximum Satisfiability Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"He Jiang, Jifeng Xuan, Yan Hu","submitted_at":"2017-04-16T13:23:14Z","abstract_excerpt":"The weighted Maximum Satisfiability problem (weighted MAX-SAT) is a NP-hard problem with numerous applications arising in artificial intelligence. As an efficient tool for heuristic design, the backbone has been applied to heuristics design for many NP-hard problems. In this paper, we investigated the computational complexity for retrieving the backbone in weighted MAX-SAT and developed a new algorithm for solving this problem. We showed that it is intractable to retrieve the full backbone under the assumption that . Moreover, it is intractable to retrieve a fixed fraction of the backbone as w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.04775","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":"1704.04775","created_at":"2026-05-18T00:46:17.764101+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.04775v1","created_at":"2026-05-18T00:46:17.764101+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.04775","created_at":"2026-05-18T00:46:17.764101+00:00"},{"alias_kind":"pith_short_12","alias_value":"HEVUO5FIVFD4","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_16","alias_value":"HEVUO5FIVFD4TO4R","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_8","alias_value":"HEVUO5FI","created_at":"2026-05-18T12:31:18.294218+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/HEVUO5FIVFD4TO4RLKMNOS6RGO","json":"https://pith.science/pith/HEVUO5FIVFD4TO4RLKMNOS6RGO.json","graph_json":"https://pith.science/api/pith-number/HEVUO5FIVFD4TO4RLKMNOS6RGO/graph.json","events_json":"https://pith.science/api/pith-number/HEVUO5FIVFD4TO4RLKMNOS6RGO/events.json","paper":"https://pith.science/paper/HEVUO5FI"},"agent_actions":{"view_html":"https://pith.science/pith/HEVUO5FIVFD4TO4RLKMNOS6RGO","download_json":"https://pith.science/pith/HEVUO5FIVFD4TO4RLKMNOS6RGO.json","view_paper":"https://pith.science/paper/HEVUO5FI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.04775&json=true","fetch_graph":"https://pith.science/api/pith-number/HEVUO5FIVFD4TO4RLKMNOS6RGO/graph.json","fetch_events":"https://pith.science/api/pith-number/HEVUO5FIVFD4TO4RLKMNOS6RGO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HEVUO5FIVFD4TO4RLKMNOS6RGO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HEVUO5FIVFD4TO4RLKMNOS6RGO/action/storage_attestation","attest_author":"https://pith.science/pith/HEVUO5FIVFD4TO4RLKMNOS6RGO/action/author_attestation","sign_citation":"https://pith.science/pith/HEVUO5FIVFD4TO4RLKMNOS6RGO/action/citation_signature","submit_replication":"https://pith.science/pith/HEVUO5FIVFD4TO4RLKMNOS6RGO/action/replication_record"}},"created_at":"2026-05-18T00:46:17.764101+00:00","updated_at":"2026-05-18T00:46:17.764101+00:00"}