{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:RODLX4ENRNLDFR4KQXEEUCRYIK","short_pith_number":"pith:RODLX4EN","canonical_record":{"source":{"id":"1304.0840","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2013-04-03T04:31:10Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"14bf43a143e828f8ab326a03d9021f18fe5c390fd6d21f0bdd6f4ec6f29297c8","abstract_canon_sha256":"1846d1d75d7eedad9b8a5571ad5dfa2faeedf7c8189708c13d63e7c51219af84"},"schema_version":"1.0"},"canonical_sha256":"8b86bbf08d8b5632c78a85c84a0a38429babc3a214faa437237be83661a707d6","source":{"kind":"arxiv","id":"1304.0840","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.0840","created_at":"2026-05-18T00:57:56Z"},{"alias_kind":"arxiv_version","alias_value":"1304.0840v1","created_at":"2026-05-18T00:57:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.0840","created_at":"2026-05-18T00:57:56Z"},{"alias_kind":"pith_short_12","alias_value":"RODLX4ENRNLD","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"RODLX4ENRNLDFR4K","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"RODLX4EN","created_at":"2026-05-18T12:27:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:RODLX4ENRNLDFR4KQXEEUCRYIK","target":"record","payload":{"canonical_record":{"source":{"id":"1304.0840","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2013-04-03T04:31:10Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"14bf43a143e828f8ab326a03d9021f18fe5c390fd6d21f0bdd6f4ec6f29297c8","abstract_canon_sha256":"1846d1d75d7eedad9b8a5571ad5dfa2faeedf7c8189708c13d63e7c51219af84"},"schema_version":"1.0"},"canonical_sha256":"8b86bbf08d8b5632c78a85c84a0a38429babc3a214faa437237be83661a707d6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:56.445580Z","signature_b64":"TrEonNfMb1ZimvjAUeSRWx5EQrV05I5pNo+urzkZqvg4GvOl/8x1QGyIDypMMkH4PrS1/e5EzL726tePGKQhAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8b86bbf08d8b5632c78a85c84a0a38429babc3a214faa437237be83661a707d6","last_reissued_at":"2026-05-18T00:57:56.445217Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:56.445217Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1304.0840","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:57:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eLNjSQSM2u3pg9J3v4rPRpKyLPZiHriBvtAQOO8i7LMw/8SmXLF8AradQiuQG+ItXzy1HnsN25Zkp0iO/21nAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T16:59:41.833536Z"},"content_sha256":"eab6747cc3f322ff0854ed22b01228f3b38732f1c279cfa7f8f23c9579ab544a","schema_version":"1.0","event_id":"sha256:eab6747cc3f322ff0854ed22b01228f3b38732f1c279cfa7f8f23c9579ab544a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:RODLX4ENRNLDFR4KQXEEUCRYIK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Fast Semidefinite Approach to Solving Binary Quadratic Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CV","authors_text":"Anton van den Hengel, Chunhua Shen, Peng Wang","submitted_at":"2013-04-03T04:31:10Z","abstract_excerpt":"Many computer vision problems can be formulated as binary quadratic programs (BQPs). Two classic relaxation methods are widely used for solving BQPs, namely, spectral methods and semidefinite programming (SDP), each with their own advantages and disadvantages. Spectral relaxation is simple and easy to implement, but its bound is loose. Semidefinite relaxation has a tighter bound, but its computational complexity is high for large scale problems. We present a new SDP formulation for BQPs, with two desirable properties. First, it has a similar relaxation bound to conventional SDP formulations. S"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.0840","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:57:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HbTh8GspY9Xd8Xm6SWTEmAHAnVU+v3rg/DylexWkfQpyHwTm+ZaNIUBfmHp9Yo8Q+B2NjzBgNRpdbVKeDa7IBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T16:59:41.834143Z"},"content_sha256":"e0c43732d624b72f170612bbf970011837931bf6172983803859e64c5ada1fd5","schema_version":"1.0","event_id":"sha256:e0c43732d624b72f170612bbf970011837931bf6172983803859e64c5ada1fd5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RODLX4ENRNLDFR4KQXEEUCRYIK/bundle.json","state_url":"https://pith.science/pith/RODLX4ENRNLDFR4KQXEEUCRYIK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RODLX4ENRNLDFR4KQXEEUCRYIK/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-05-26T16:59:41Z","links":{"resolver":"https://pith.science/pith/RODLX4ENRNLDFR4KQXEEUCRYIK","bundle":"https://pith.science/pith/RODLX4ENRNLDFR4KQXEEUCRYIK/bundle.json","state":"https://pith.science/pith/RODLX4ENRNLDFR4KQXEEUCRYIK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RODLX4ENRNLDFR4KQXEEUCRYIK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:RODLX4ENRNLDFR4KQXEEUCRYIK","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":"1846d1d75d7eedad9b8a5571ad5dfa2faeedf7c8189708c13d63e7c51219af84","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2013-04-03T04:31:10Z","title_canon_sha256":"14bf43a143e828f8ab326a03d9021f18fe5c390fd6d21f0bdd6f4ec6f29297c8"},"schema_version":"1.0","source":{"id":"1304.0840","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.0840","created_at":"2026-05-18T00:57:56Z"},{"alias_kind":"arxiv_version","alias_value":"1304.0840v1","created_at":"2026-05-18T00:57:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.0840","created_at":"2026-05-18T00:57:56Z"},{"alias_kind":"pith_short_12","alias_value":"RODLX4ENRNLD","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"RODLX4ENRNLDFR4K","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"RODLX4EN","created_at":"2026-05-18T12:27:59Z"}],"graph_snapshots":[{"event_id":"sha256:e0c43732d624b72f170612bbf970011837931bf6172983803859e64c5ada1fd5","target":"graph","created_at":"2026-05-18T00:57:56Z","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":"Many computer vision problems can be formulated as binary quadratic programs (BQPs). Two classic relaxation methods are widely used for solving BQPs, namely, spectral methods and semidefinite programming (SDP), each with their own advantages and disadvantages. Spectral relaxation is simple and easy to implement, but its bound is loose. Semidefinite relaxation has a tighter bound, but its computational complexity is high for large scale problems. We present a new SDP formulation for BQPs, with two desirable properties. First, it has a similar relaxation bound to conventional SDP formulations. S","authors_text":"Anton van den Hengel, Chunhua Shen, Peng Wang","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2013-04-03T04:31:10Z","title":"A Fast Semidefinite Approach to Solving Binary Quadratic Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.0840","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:eab6747cc3f322ff0854ed22b01228f3b38732f1c279cfa7f8f23c9579ab544a","target":"record","created_at":"2026-05-18T00:57:56Z","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":"1846d1d75d7eedad9b8a5571ad5dfa2faeedf7c8189708c13d63e7c51219af84","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2013-04-03T04:31:10Z","title_canon_sha256":"14bf43a143e828f8ab326a03d9021f18fe5c390fd6d21f0bdd6f4ec6f29297c8"},"schema_version":"1.0","source":{"id":"1304.0840","kind":"arxiv","version":1}},"canonical_sha256":"8b86bbf08d8b5632c78a85c84a0a38429babc3a214faa437237be83661a707d6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8b86bbf08d8b5632c78a85c84a0a38429babc3a214faa437237be83661a707d6","first_computed_at":"2026-05-18T00:57:56.445217Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:57:56.445217Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TrEonNfMb1ZimvjAUeSRWx5EQrV05I5pNo+urzkZqvg4GvOl/8x1QGyIDypMMkH4PrS1/e5EzL726tePGKQhAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:57:56.445580Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.0840","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eab6747cc3f322ff0854ed22b01228f3b38732f1c279cfa7f8f23c9579ab544a","sha256:e0c43732d624b72f170612bbf970011837931bf6172983803859e64c5ada1fd5"],"state_sha256":"74979ebc1a4a32358e97255abe9dbcd2bf06603f07b0f8401cf7d68dc687f452"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OCkevIVARIjJwHk3SpaywuB8CedbB/8FJUk+5szn0Tz56SVt+mPtkLjxAEwwwCvy4jyarAeVeF8bzL4io7OuCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T16:59:41.837675Z","bundle_sha256":"6d7869e40e3dee46545d0b44d30d3bff7da06c68aca09c9a27821f22b7dd4b5c"}}