{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:Q5SL76X4ELMWFJLLIZICCHVY2D","short_pith_number":"pith:Q5SL76X4","canonical_record":{"source":{"id":"1411.7564","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-11-27T12:05:06Z","cross_cats_sorted":[],"title_canon_sha256":"ba5e4189e00588665934c009ca0fc40c82e8db1dd76b20891a26f3d17c3f07ec","abstract_canon_sha256":"dcbaeaac2aa9f02cfd0b437b2687104b391418dfcacc10a6beae566b88cd2cbc"},"schema_version":"1.0"},"canonical_sha256":"8764bffafc22d962a56b4650211eb8d0f261241d18682145af41e20645d15d62","source":{"kind":"arxiv","id":"1411.7564","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.7564","created_at":"2026-05-18T00:58:36Z"},{"alias_kind":"arxiv_version","alias_value":"1411.7564v4","created_at":"2026-05-18T00:58:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.7564","created_at":"2026-05-18T00:58:36Z"},{"alias_kind":"pith_short_12","alias_value":"Q5SL76X4ELMW","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"Q5SL76X4ELMWFJLL","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"Q5SL76X4","created_at":"2026-05-18T12:28:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:Q5SL76X4ELMWFJLLIZICCHVY2D","target":"record","payload":{"canonical_record":{"source":{"id":"1411.7564","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-11-27T12:05:06Z","cross_cats_sorted":[],"title_canon_sha256":"ba5e4189e00588665934c009ca0fc40c82e8db1dd76b20891a26f3d17c3f07ec","abstract_canon_sha256":"dcbaeaac2aa9f02cfd0b437b2687104b391418dfcacc10a6beae566b88cd2cbc"},"schema_version":"1.0"},"canonical_sha256":"8764bffafc22d962a56b4650211eb8d0f261241d18682145af41e20645d15d62","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:36.445057Z","signature_b64":"Aec/84GyE0pVvP1oUeCUwcHRzpNZxBSUTTKR24b2XVME8aPnDI43sRn7PUO7RJ+NKjIUr5GD2rGBVBsdbsLACA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8764bffafc22d962a56b4650211eb8d0f261241d18682145af41e20645d15d62","last_reissued_at":"2026-05-18T00:58:36.444558Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:36.444558Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1411.7564","source_version":4,"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:58:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r8St7d3jpkTXLqLDuVTv9yJBLH3QeqC8JTDdz71fJgTCfX4cpEWH6chGQaTkW4NB145fzB6769NkOiUjDSuWAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T12:42:38.937515Z"},"content_sha256":"4dd93929d8a867f96f92b2310c5fab5b439af8f8bbec8e0b71881086076c33d9","schema_version":"1.0","event_id":"sha256:4dd93929d8a867f96f92b2310c5fab5b439af8f8bbec8e0b71881086076c33d9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:Q5SL76X4ELMWFJLLIZICCHVY2D","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Large-scale Binary Quadratic Optimization Using Semidefinite Relaxation and Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Anton van den Hengel, Chunhua Shen, Peng Wang, Philip H. S. Torr","submitted_at":"2014-11-27T12:05:06Z","abstract_excerpt":"In computer vision, many problems such as image segmentation, pixel labelling, and scene parsing can be formulated as binary quadratic programs (BQPs). For submodular problems, cuts based methods can be employed to efficiently solve large-scale problems. However, general nonsubmodular problems are significantly more challenging to solve. Finding a solution when the problem is of large size to be of practical interest, however, typically requires relaxation. Two standard relaxation methods are widely used for solving general BQPs--spectral methods and semidefinite programming (SDP), each with t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.7564","kind":"arxiv","version":4},"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:58:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9k3dRf9LyUKfMdtP42Rgwjb3FqDEQCSMz5rwx5L1iE9tNOjOAmal/AgTz8bs46TLuM5ZKe/6WGS4024K4EqYAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T12:42:38.938179Z"},"content_sha256":"0802686385692c65e85e70f77e787fe3371e11c0bc48bb42c2de0c4dd369d4bc","schema_version":"1.0","event_id":"sha256:0802686385692c65e85e70f77e787fe3371e11c0bc48bb42c2de0c4dd369d4bc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Q5SL76X4ELMWFJLLIZICCHVY2D/bundle.json","state_url":"https://pith.science/pith/Q5SL76X4ELMWFJLLIZICCHVY2D/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Q5SL76X4ELMWFJLLIZICCHVY2D/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-26T12:42:38Z","links":{"resolver":"https://pith.science/pith/Q5SL76X4ELMWFJLLIZICCHVY2D","bundle":"https://pith.science/pith/Q5SL76X4ELMWFJLLIZICCHVY2D/bundle.json","state":"https://pith.science/pith/Q5SL76X4ELMWFJLLIZICCHVY2D/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Q5SL76X4ELMWFJLLIZICCHVY2D/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:Q5SL76X4ELMWFJLLIZICCHVY2D","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":"dcbaeaac2aa9f02cfd0b437b2687104b391418dfcacc10a6beae566b88cd2cbc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-11-27T12:05:06Z","title_canon_sha256":"ba5e4189e00588665934c009ca0fc40c82e8db1dd76b20891a26f3d17c3f07ec"},"schema_version":"1.0","source":{"id":"1411.7564","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.7564","created_at":"2026-05-18T00:58:36Z"},{"alias_kind":"arxiv_version","alias_value":"1411.7564v4","created_at":"2026-05-18T00:58:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.7564","created_at":"2026-05-18T00:58:36Z"},{"alias_kind":"pith_short_12","alias_value":"Q5SL76X4ELMW","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"Q5SL76X4ELMWFJLL","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"Q5SL76X4","created_at":"2026-05-18T12:28:43Z"}],"graph_snapshots":[{"event_id":"sha256:0802686385692c65e85e70f77e787fe3371e11c0bc48bb42c2de0c4dd369d4bc","target":"graph","created_at":"2026-05-18T00:58:36Z","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 computer vision, many problems such as image segmentation, pixel labelling, and scene parsing can be formulated as binary quadratic programs (BQPs). For submodular problems, cuts based methods can be employed to efficiently solve large-scale problems. However, general nonsubmodular problems are significantly more challenging to solve. Finding a solution when the problem is of large size to be of practical interest, however, typically requires relaxation. Two standard relaxation methods are widely used for solving general BQPs--spectral methods and semidefinite programming (SDP), each with t","authors_text":"Anton van den Hengel, Chunhua Shen, Peng Wang, Philip H. S. Torr","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-11-27T12:05:06Z","title":"Large-scale Binary Quadratic Optimization Using Semidefinite Relaxation and Applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.7564","kind":"arxiv","version":4},"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:4dd93929d8a867f96f92b2310c5fab5b439af8f8bbec8e0b71881086076c33d9","target":"record","created_at":"2026-05-18T00:58:36Z","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":"dcbaeaac2aa9f02cfd0b437b2687104b391418dfcacc10a6beae566b88cd2cbc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-11-27T12:05:06Z","title_canon_sha256":"ba5e4189e00588665934c009ca0fc40c82e8db1dd76b20891a26f3d17c3f07ec"},"schema_version":"1.0","source":{"id":"1411.7564","kind":"arxiv","version":4}},"canonical_sha256":"8764bffafc22d962a56b4650211eb8d0f261241d18682145af41e20645d15d62","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8764bffafc22d962a56b4650211eb8d0f261241d18682145af41e20645d15d62","first_computed_at":"2026-05-18T00:58:36.444558Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:36.444558Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Aec/84GyE0pVvP1oUeCUwcHRzpNZxBSUTTKR24b2XVME8aPnDI43sRn7PUO7RJ+NKjIUr5GD2rGBVBsdbsLACA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:36.445057Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.7564","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4dd93929d8a867f96f92b2310c5fab5b439af8f8bbec8e0b71881086076c33d9","sha256:0802686385692c65e85e70f77e787fe3371e11c0bc48bb42c2de0c4dd369d4bc"],"state_sha256":"1de4d3ef2fd94156774f42402888e79e45f7ef6005063ff6e2bcfbfad84adbd1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LWGxnlMM9PqRBiqaKd7prLmVjqonb0PBTaHOAbbMyd3B3Iev4TXkfxyZw1NdRqDR3Vm+uudgtwMxEGWshWhnCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T12:42:38.941745Z","bundle_sha256":"163f56b31cc5d1ac8b9b8c5d2e85aea589fc3477717b0047116d9703896d0982"}}