{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:HEVUO5FIVFD4TO4RLKMNOS6RGO","short_pith_number":"pith:HEVUO5FI","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"},"canonical_sha256":"392b4774a8a947c9bb915a98d74bd1339a12382ecd19f0c6a8b01926353ec8c3","source":{"kind":"arxiv","id":"1704.04775","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.04775","created_at":"2026-05-18T00:46:17Z"},{"alias_kind":"arxiv_version","alias_value":"1704.04775v1","created_at":"2026-05-18T00:46:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.04775","created_at":"2026-05-18T00:46:17Z"},{"alias_kind":"pith_short_12","alias_value":"HEVUO5FIVFD4","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"HEVUO5FIVFD4TO4R","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"HEVUO5FI","created_at":"2026-05-18T12:31:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:HEVUO5FIVFD4TO4RLKMNOS6RGO","target":"record","payload":{"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"},"canonical_sha256":"392b4774a8a947c9bb915a98d74bd1339a12382ecd19f0c6a8b01926353ec8c3","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"},"source_kind":"arxiv","source_id":"1704.04775","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:46:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kX9lvC2apW9T6+IUmj2R38UtUZnNWn7qWzjiOaBUGT96wjzNlkLBbFlri1sPk4oI6WCb5ZLoDr73L0BjP0McBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T21:15:27.519729Z"},"content_sha256":"6e4a124759eca8ca1ec327e77eaef6164fca9e7551a81d4453c25b2538bd8655","schema_version":"1.0","event_id":"sha256:6e4a124759eca8ca1ec327e77eaef6164fca9e7551a81d4453c25b2538bd8655"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:HEVUO5FIVFD4TO4RLKMNOS6RGO","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:46:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zlDoJJkdW3AOgiFUURw2iqX/JgP2FZhICqgwGBrTPxKzw2sSWwdaFH7eJvE+Yp/PlxF1WEwhZjYoNOk3G4JdBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T21:15:27.520445Z"},"content_sha256":"8f3ab8b3690d0b8ab0c4d49d1c03e0b301e074f0c36a46c8e758a0746f9c2b85","schema_version":"1.0","event_id":"sha256:8f3ab8b3690d0b8ab0c4d49d1c03e0b301e074f0c36a46c8e758a0746f9c2b85"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HEVUO5FIVFD4TO4RLKMNOS6RGO/bundle.json","state_url":"https://pith.science/pith/HEVUO5FIVFD4TO4RLKMNOS6RGO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HEVUO5FIVFD4TO4RLKMNOS6RGO/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-09T21:15:27Z","links":{"resolver":"https://pith.science/pith/HEVUO5FIVFD4TO4RLKMNOS6RGO","bundle":"https://pith.science/pith/HEVUO5FIVFD4TO4RLKMNOS6RGO/bundle.json","state":"https://pith.science/pith/HEVUO5FIVFD4TO4RLKMNOS6RGO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HEVUO5FIVFD4TO4RLKMNOS6RGO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:HEVUO5FIVFD4TO4RLKMNOS6RGO","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"0b39e95878579c3ae309f8a9b7f2382331e80f14f0cc1233e260e09a9714b665","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-04-16T13:23:14Z","title_canon_sha256":"3dc2269f5efcfd8a1c4a1fe9e9bc011c23f60d55a507c42018889d85de1afeeb"},"schema_version":"1.0","source":{"id":"1704.04775","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.04775","created_at":"2026-05-18T00:46:17Z"},{"alias_kind":"arxiv_version","alias_value":"1704.04775v1","created_at":"2026-05-18T00:46:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.04775","created_at":"2026-05-18T00:46:17Z"},{"alias_kind":"pith_short_12","alias_value":"HEVUO5FIVFD4","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"HEVUO5FIVFD4TO4R","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"HEVUO5FI","created_at":"2026-05-18T12:31:18Z"}],"graph_snapshots":[{"event_id":"sha256:8f3ab8b3690d0b8ab0c4d49d1c03e0b301e074f0c36a46c8e758a0746f9c2b85","target":"graph","created_at":"2026-05-18T00:46:17Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"He Jiang, Jifeng Xuan, Yan Hu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-04-16T13:23:14Z","title":"Approximating the Backbone in the Weighted Maximum Satisfiability Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.04775","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:6e4a124759eca8ca1ec327e77eaef6164fca9e7551a81d4453c25b2538bd8655","target":"record","created_at":"2026-05-18T00:46:17Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"0b39e95878579c3ae309f8a9b7f2382331e80f14f0cc1233e260e09a9714b665","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-04-16T13:23:14Z","title_canon_sha256":"3dc2269f5efcfd8a1c4a1fe9e9bc011c23f60d55a507c42018889d85de1afeeb"},"schema_version":"1.0","source":{"id":"1704.04775","kind":"arxiv","version":1}},"canonical_sha256":"392b4774a8a947c9bb915a98d74bd1339a12382ecd19f0c6a8b01926353ec8c3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"392b4774a8a947c9bb915a98d74bd1339a12382ecd19f0c6a8b01926353ec8c3","first_computed_at":"2026-05-18T00:46:17.764027Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:17.764027Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"33JRTusxJ3gU8MvzzQ1NQFpODHjCR5qu0ZDj83DG5MptQ0Wxb/lzDp4LkF7RCLlzY5OJ/GG/wr2z+KS3PKWPAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:17.764543Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.04775","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6e4a124759eca8ca1ec327e77eaef6164fca9e7551a81d4453c25b2538bd8655","sha256:8f3ab8b3690d0b8ab0c4d49d1c03e0b301e074f0c36a46c8e758a0746f9c2b85"],"state_sha256":"b81e518873a57cf009cb41646db23b49816d768dbd3d7f8e2549a5e262f0d8c2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EEelqw+ww6CKyKSxtptcddKoWyEQ+SXGG47dPS6/6soY48Z+5M1YKC3lxZc0XRJ/vf2uS7zCnShXS/70w+ohDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T21:15:27.524619Z","bundle_sha256":"931990995bb32c0520f560e8f863203ec8eb7f972c9552f4ff00f88e29a7da5f"}}