{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:A77R255GGYQ3ZGCPSLQZBJKIMG","short_pith_number":"pith:A77R255G","canonical_record":{"source":{"id":"1803.09963","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-03-27T08:50:35Z","cross_cats_sorted":[],"title_canon_sha256":"5abd5b29f7e6358c1dc6c4062c9f8d8614587c4a6d524ece364b247a97a528aa","abstract_canon_sha256":"cd529dd553224bb1e6a2fe34cede418ca739f35a1f8ad2ffd69ad896b7be68dd"},"schema_version":"1.0"},"canonical_sha256":"07ff1d77a63621bc984f92e190a548618fcd34cad0c17d99dde868a48fd08a41","source":{"kind":"arxiv","id":"1803.09963","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.09963","created_at":"2026-05-18T00:20:00Z"},{"alias_kind":"arxiv_version","alias_value":"1803.09963v1","created_at":"2026-05-18T00:20:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.09963","created_at":"2026-05-18T00:20:00Z"},{"alias_kind":"pith_short_12","alias_value":"A77R255GGYQ3","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"A77R255GGYQ3ZGCP","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"A77R255G","created_at":"2026-05-18T12:32:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:A77R255GGYQ3ZGCPSLQZBJKIMG","target":"record","payload":{"canonical_record":{"source":{"id":"1803.09963","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-03-27T08:50:35Z","cross_cats_sorted":[],"title_canon_sha256":"5abd5b29f7e6358c1dc6c4062c9f8d8614587c4a6d524ece364b247a97a528aa","abstract_canon_sha256":"cd529dd553224bb1e6a2fe34cede418ca739f35a1f8ad2ffd69ad896b7be68dd"},"schema_version":"1.0"},"canonical_sha256":"07ff1d77a63621bc984f92e190a548618fcd34cad0c17d99dde868a48fd08a41","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:00.913598Z","signature_b64":"ZN0mw9v2G21gcQe1vyh7tIsZk9K0w5dHfX8sfYoeq9l2SkszG305qbC9XUIkF7/V5JBgX00XenFcrS310XiBCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"07ff1d77a63621bc984f92e190a548618fcd34cad0c17d99dde868a48fd08a41","last_reissued_at":"2026-05-18T00:20:00.912975Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:00.912975Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.09963","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:20:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+VXEqMCxDsFQ0D8x/B5EdbTdkGan5xf+y61pUcOXcTKe9YTAawsmAcr5EsB6Vqw49wMolZ2+FE4lnchVC9M3AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T17:53:46.998067Z"},"content_sha256":"a318a34008923302e3ae332c21785fe848583aed285614e478c107d010d0c417","schema_version":"1.0","event_id":"sha256:a318a34008923302e3ae332c21785fe848583aed285614e478c107d010d0c417"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:A77R255GGYQ3ZGCPSLQZBJKIMG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Efficient Method to Transform SAT problems to Binary Integer Linear Programming Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Jin Wang, Majun He, Qingxian Wang, Wenhong Tian, Wenxia Guo, Xiaoqin Ren","submitted_at":"2018-03-27T08:50:35Z","abstract_excerpt":"In computational complexity theory, a decision problem is NP-complete when it is both in NP and NP-hard. Although a solution to a NP-complete can be verified quickly, there is no known algorithm to solve it in polynomial time. There exists a method to reduce a SAT (Satifiability) problem to Subset Sum Problem (SSP) in the literature, however, it can only be applied to small or medium size problems. Our study is to find an efficient method to transform a SAT problem to a mixed integer linear programming problem in larger size. Observing the feature of variable-clauses constraints in SAT, we app"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.09963","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:20:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2VSkFNENYB5DiyNmkAJ51OZjeOX93n69Ov8Q6otl26Jn+pF8CViq0OhRt1/A6k/UyLQ9aGQkcaEEUvcIjyAiCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T17:53:46.998720Z"},"content_sha256":"d827b25cd6c1dfbf556051a3936724786fe7195a55227474d6fab1adfa789b06","schema_version":"1.0","event_id":"sha256:d827b25cd6c1dfbf556051a3936724786fe7195a55227474d6fab1adfa789b06"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/A77R255GGYQ3ZGCPSLQZBJKIMG/bundle.json","state_url":"https://pith.science/pith/A77R255GGYQ3ZGCPSLQZBJKIMG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/A77R255GGYQ3ZGCPSLQZBJKIMG/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-07T17:53:47Z","links":{"resolver":"https://pith.science/pith/A77R255GGYQ3ZGCPSLQZBJKIMG","bundle":"https://pith.science/pith/A77R255GGYQ3ZGCPSLQZBJKIMG/bundle.json","state":"https://pith.science/pith/A77R255GGYQ3ZGCPSLQZBJKIMG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/A77R255GGYQ3ZGCPSLQZBJKIMG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:A77R255GGYQ3ZGCPSLQZBJKIMG","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":"cd529dd553224bb1e6a2fe34cede418ca739f35a1f8ad2ffd69ad896b7be68dd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-03-27T08:50:35Z","title_canon_sha256":"5abd5b29f7e6358c1dc6c4062c9f8d8614587c4a6d524ece364b247a97a528aa"},"schema_version":"1.0","source":{"id":"1803.09963","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.09963","created_at":"2026-05-18T00:20:00Z"},{"alias_kind":"arxiv_version","alias_value":"1803.09963v1","created_at":"2026-05-18T00:20:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.09963","created_at":"2026-05-18T00:20:00Z"},{"alias_kind":"pith_short_12","alias_value":"A77R255GGYQ3","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"A77R255GGYQ3ZGCP","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"A77R255G","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:d827b25cd6c1dfbf556051a3936724786fe7195a55227474d6fab1adfa789b06","target":"graph","created_at":"2026-05-18T00:20:00Z","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":"In computational complexity theory, a decision problem is NP-complete when it is both in NP and NP-hard. Although a solution to a NP-complete can be verified quickly, there is no known algorithm to solve it in polynomial time. There exists a method to reduce a SAT (Satifiability) problem to Subset Sum Problem (SSP) in the literature, however, it can only be applied to small or medium size problems. Our study is to find an efficient method to transform a SAT problem to a mixed integer linear programming problem in larger size. Observing the feature of variable-clauses constraints in SAT, we app","authors_text":"Jin Wang, Majun He, Qingxian Wang, Wenhong Tian, Wenxia Guo, Xiaoqin Ren","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-03-27T08:50:35Z","title":"An Efficient Method to Transform SAT problems to Binary Integer Linear Programming Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.09963","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:a318a34008923302e3ae332c21785fe848583aed285614e478c107d010d0c417","target":"record","created_at":"2026-05-18T00:20:00Z","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":"cd529dd553224bb1e6a2fe34cede418ca739f35a1f8ad2ffd69ad896b7be68dd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-03-27T08:50:35Z","title_canon_sha256":"5abd5b29f7e6358c1dc6c4062c9f8d8614587c4a6d524ece364b247a97a528aa"},"schema_version":"1.0","source":{"id":"1803.09963","kind":"arxiv","version":1}},"canonical_sha256":"07ff1d77a63621bc984f92e190a548618fcd34cad0c17d99dde868a48fd08a41","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"07ff1d77a63621bc984f92e190a548618fcd34cad0c17d99dde868a48fd08a41","first_computed_at":"2026-05-18T00:20:00.912975Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:20:00.912975Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZN0mw9v2G21gcQe1vyh7tIsZk9K0w5dHfX8sfYoeq9l2SkszG305qbC9XUIkF7/V5JBgX00XenFcrS310XiBCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:20:00.913598Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.09963","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a318a34008923302e3ae332c21785fe848583aed285614e478c107d010d0c417","sha256:d827b25cd6c1dfbf556051a3936724786fe7195a55227474d6fab1adfa789b06"],"state_sha256":"3bf61b016609c7c70a392ee654d8481c0a90938f42d617d0a297f04197e8105f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jCQ+emTCdZhwMGyvvRG0gQcLKLyVIDS2xl5sRySBaVpExGUyYhohCTRr2/1KfSK5KNIhOG0Ik9AJ11zwzj5WCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T17:53:47.002370Z","bundle_sha256":"eb4f13984381ff60da43cd8cc60b513f442467ebc3816dff9f6528f965e4204d"}}