{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:WULOM6LZLZYV22YS3IF4MHYUHQ","short_pith_number":"pith:WULOM6LZ","canonical_record":{"source":{"id":"1812.06362","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-12-15T22:03:04Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"a151dcd4f5bab3c04a3edc4bbfb2363ec56d46fad5d303731e94683f528aa757","abstract_canon_sha256":"2809eea8fdc48459b7fda3477346a584e21f960f524b81c3c3e187886d11f866"},"schema_version":"1.0"},"canonical_sha256":"b516e679795e715d6b12da0bc61f143c00942377a47b808def9a66cb206e702d","source":{"kind":"arxiv","id":"1812.06362","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.06362","created_at":"2026-05-17T23:58:10Z"},{"alias_kind":"arxiv_version","alias_value":"1812.06362v1","created_at":"2026-05-17T23:58:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.06362","created_at":"2026-05-17T23:58:10Z"},{"alias_kind":"pith_short_12","alias_value":"WULOM6LZLZYV","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"WULOM6LZLZYV22YS","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"WULOM6LZ","created_at":"2026-05-18T12:33:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:WULOM6LZLZYV22YS3IF4MHYUHQ","target":"record","payload":{"canonical_record":{"source":{"id":"1812.06362","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-12-15T22:03:04Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"a151dcd4f5bab3c04a3edc4bbfb2363ec56d46fad5d303731e94683f528aa757","abstract_canon_sha256":"2809eea8fdc48459b7fda3477346a584e21f960f524b81c3c3e187886d11f866"},"schema_version":"1.0"},"canonical_sha256":"b516e679795e715d6b12da0bc61f143c00942377a47b808def9a66cb206e702d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:10.429279Z","signature_b64":"QcU32B/o3BdAsQESuOyrCxMMc8lYpQmP+pFYJRmBbv4WhszmdJX3KxoBNK8bkrPR2XLGZA+RTRlrtne9wj4JCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b516e679795e715d6b12da0bc61f143c00942377a47b808def9a66cb206e702d","last_reissued_at":"2026-05-17T23:58:10.428873Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:10.428873Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1812.06362","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-17T23:58:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lcMB82QB4y+XivkxpP7JVWsQmEJkaTfSAUUfTDdLAk4gK2quqj7fevlSN5vTcrLHV08/hsqYusZLb1Kn9HYPCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T18:05:11.895654Z"},"content_sha256":"422b3a8ae207a1504e2149f9861c3daa49c19e578ba08e48c93d89840d0700e8","schema_version":"1.0","event_id":"sha256:422b3a8ae207a1504e2149f9861c3daa49c19e578ba08e48c93d89840d0700e8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:WULOM6LZLZYV22YS3IF4MHYUHQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Low-rank semidefinite programming for the MAX2SAT problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"math.OC","authors_text":"J. Zico Kolter, Po-Wei Wang","submitted_at":"2018-12-15T22:03:04Z","abstract_excerpt":"This paper proposes a new algorithm for solving MAX2SAT problems based on combining search methods with semidefinite programming approaches. Semidefinite programming techniques are well-known as a theoretical tool for approximating maximum satisfiability problems, but their application has traditionally been very limited by their speed and randomized nature. Our approach overcomes this difficult by using a recent approach to low-rank semidefinite programming, specialized to work in an incremental fashion suitable for use in an exact search algorithm. The method can be used both within complete"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.06362","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-17T23:58:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UDseFwa7cjrzSc/W76VwopbXSHjh+dEfkTHS744DsygNEogKA9vCOBD6hKcQ4VQQBrBgnju2CaOES039EFexCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T18:05:11.896001Z"},"content_sha256":"48b7eb743111698e7831d245ce07aaad4b7e426076c397fdb42b2cdc2b8c9bbb","schema_version":"1.0","event_id":"sha256:48b7eb743111698e7831d245ce07aaad4b7e426076c397fdb42b2cdc2b8c9bbb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WULOM6LZLZYV22YS3IF4MHYUHQ/bundle.json","state_url":"https://pith.science/pith/WULOM6LZLZYV22YS3IF4MHYUHQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WULOM6LZLZYV22YS3IF4MHYUHQ/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-06T18:05:11Z","links":{"resolver":"https://pith.science/pith/WULOM6LZLZYV22YS3IF4MHYUHQ","bundle":"https://pith.science/pith/WULOM6LZLZYV22YS3IF4MHYUHQ/bundle.json","state":"https://pith.science/pith/WULOM6LZLZYV22YS3IF4MHYUHQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WULOM6LZLZYV22YS3IF4MHYUHQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:WULOM6LZLZYV22YS3IF4MHYUHQ","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":"2809eea8fdc48459b7fda3477346a584e21f960f524b81c3c3e187886d11f866","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-12-15T22:03:04Z","title_canon_sha256":"a151dcd4f5bab3c04a3edc4bbfb2363ec56d46fad5d303731e94683f528aa757"},"schema_version":"1.0","source":{"id":"1812.06362","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.06362","created_at":"2026-05-17T23:58:10Z"},{"alias_kind":"arxiv_version","alias_value":"1812.06362v1","created_at":"2026-05-17T23:58:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.06362","created_at":"2026-05-17T23:58:10Z"},{"alias_kind":"pith_short_12","alias_value":"WULOM6LZLZYV","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"WULOM6LZLZYV22YS","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"WULOM6LZ","created_at":"2026-05-18T12:33:01Z"}],"graph_snapshots":[{"event_id":"sha256:48b7eb743111698e7831d245ce07aaad4b7e426076c397fdb42b2cdc2b8c9bbb","target":"graph","created_at":"2026-05-17T23:58:10Z","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":"This paper proposes a new algorithm for solving MAX2SAT problems based on combining search methods with semidefinite programming approaches. Semidefinite programming techniques are well-known as a theoretical tool for approximating maximum satisfiability problems, but their application has traditionally been very limited by their speed and randomized nature. Our approach overcomes this difficult by using a recent approach to low-rank semidefinite programming, specialized to work in an incremental fashion suitable for use in an exact search algorithm. The method can be used both within complete","authors_text":"J. Zico Kolter, Po-Wei Wang","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-12-15T22:03:04Z","title":"Low-rank semidefinite programming for the MAX2SAT problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.06362","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:422b3a8ae207a1504e2149f9861c3daa49c19e578ba08e48c93d89840d0700e8","target":"record","created_at":"2026-05-17T23:58:10Z","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":"2809eea8fdc48459b7fda3477346a584e21f960f524b81c3c3e187886d11f866","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-12-15T22:03:04Z","title_canon_sha256":"a151dcd4f5bab3c04a3edc4bbfb2363ec56d46fad5d303731e94683f528aa757"},"schema_version":"1.0","source":{"id":"1812.06362","kind":"arxiv","version":1}},"canonical_sha256":"b516e679795e715d6b12da0bc61f143c00942377a47b808def9a66cb206e702d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b516e679795e715d6b12da0bc61f143c00942377a47b808def9a66cb206e702d","first_computed_at":"2026-05-17T23:58:10.428873Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:58:10.428873Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QcU32B/o3BdAsQESuOyrCxMMc8lYpQmP+pFYJRmBbv4WhszmdJX3KxoBNK8bkrPR2XLGZA+RTRlrtne9wj4JCA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:58:10.429279Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.06362","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:422b3a8ae207a1504e2149f9861c3daa49c19e578ba08e48c93d89840d0700e8","sha256:48b7eb743111698e7831d245ce07aaad4b7e426076c397fdb42b2cdc2b8c9bbb"],"state_sha256":"ab4086d003730458c3da44e4239bfd419f7dc5b7fd441f2facf145875f0c33c0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XrGVCZwEOE8l0ET/6rqmeCNJpQGjTwqhN71hl8ikKSXfNI9iW3LpzZ12NH9da2OP8RYhWoan3n5A5jMr/S7XAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T18:05:11.898221Z","bundle_sha256":"d94a9b5a24e631c6b999830fae46be101fa40237f0cb4afed5e9157cb51f4cf5"}}