{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:MNLBXRGSZ3BEB7X6DODZTQC3OD","short_pith_number":"pith:MNLBXRGS","canonical_record":{"source":{"id":"1404.5009","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-04-20T04:47:04Z","cross_cats_sorted":["cs.LG","cs.NA"],"title_canon_sha256":"28d5c0378e492e4a16c84b9283b38eed759b73fb61bdda5cea51744aed14a24e","abstract_canon_sha256":"87e3472e7e409c28c5eab2cdc51cbf0503676e7af83ede76a02e6a14f38cb48b"},"schema_version":"1.0"},"canonical_sha256":"63561bc4d2cec240fefe1b8799c05b70e38bbc526e11d47550218431878ebe17","source":{"kind":"arxiv","id":"1404.5009","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.5009","created_at":"2026-05-18T01:33:35Z"},{"alias_kind":"arxiv_version","alias_value":"1404.5009v4","created_at":"2026-05-18T01:33:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.5009","created_at":"2026-05-18T01:33:35Z"},{"alias_kind":"pith_short_12","alias_value":"MNLBXRGSZ3BE","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"MNLBXRGSZ3BEB7X6","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"MNLBXRGS","created_at":"2026-05-18T12:28:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:MNLBXRGSZ3BEB7X6DODZTQC3OD","target":"record","payload":{"canonical_record":{"source":{"id":"1404.5009","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-04-20T04:47:04Z","cross_cats_sorted":["cs.LG","cs.NA"],"title_canon_sha256":"28d5c0378e492e4a16c84b9283b38eed759b73fb61bdda5cea51744aed14a24e","abstract_canon_sha256":"87e3472e7e409c28c5eab2cdc51cbf0503676e7af83ede76a02e6a14f38cb48b"},"schema_version":"1.0"},"canonical_sha256":"63561bc4d2cec240fefe1b8799c05b70e38bbc526e11d47550218431878ebe17","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:33:35.344296Z","signature_b64":"RNFw17EOaxukA7j0KSSMu65PrA75nAnY0QREJu4HY9k1Rx+ab0ZPzlp80hpbnQmNElmE4UfCupBP+51k/aWDCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"63561bc4d2cec240fefe1b8799c05b70e38bbc526e11d47550218431878ebe17","last_reissued_at":"2026-05-18T01:33:35.343564Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:33:35.343564Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1404.5009","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-18T01:33:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uwrs8j0rTOXqwOtbf5feHFOV1g8QbrGHVmVOV/uXyor7rKO85aKNOBaz7IzAm93W8AO7D488bTdSlNQSiFomDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T02:06:32.819755Z"},"content_sha256":"4b5c14d8e9b1c65101bff9d45f38d658b2ca74b479e3d11fb931ba88d7922313","schema_version":"1.0","event_id":"sha256:4b5c14d8e9b1c65101bff9d45f38d658b2ca74b479e3d11fb931ba88d7922313"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:MNLBXRGSZ3BEB7X6DODZTQC3OD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Semidefinite Branch-and-Cut for MAP-MRF Inference","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NA"],"primary_cat":"cs.CV","authors_text":"Anton van den Hengel, Chunhua Shen, Peng Wang, Philip Torr","submitted_at":"2014-04-20T04:47:04Z","abstract_excerpt":"We propose a Branch-and-Cut (B&C) method for solving general MAP-MRF inference problems. The core of our method is a very efficient bounding procedure, which combines scalable semidefinite programming (SDP) and a cutting-plane method for seeking violated constraints. In order to further speed up the computation, several strategies have been exploited, including model reduction, warm start and removal of inactive constraints.\n  We analyze the performance of the proposed method under different settings, and demonstrate that our method either outperforms or performs on par with state-of-the-art a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.5009","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-18T01:33:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Zf44fXSA4j+2zq6lI5ERfxOhnONRj1frsFKKVqMW2HORVH4pkR79mZCkJ/H+cj8ycpYXrY5PIeimvrAG2xMhBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T02:06:32.820276Z"},"content_sha256":"9effc2d76ec1e082f24688e8318b1e523575b96e6635d78538e80a9cd277dbf8","schema_version":"1.0","event_id":"sha256:9effc2d76ec1e082f24688e8318b1e523575b96e6635d78538e80a9cd277dbf8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MNLBXRGSZ3BEB7X6DODZTQC3OD/bundle.json","state_url":"https://pith.science/pith/MNLBXRGSZ3BEB7X6DODZTQC3OD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MNLBXRGSZ3BEB7X6DODZTQC3OD/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-26T02:06:32Z","links":{"resolver":"https://pith.science/pith/MNLBXRGSZ3BEB7X6DODZTQC3OD","bundle":"https://pith.science/pith/MNLBXRGSZ3BEB7X6DODZTQC3OD/bundle.json","state":"https://pith.science/pith/MNLBXRGSZ3BEB7X6DODZTQC3OD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MNLBXRGSZ3BEB7X6DODZTQC3OD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:MNLBXRGSZ3BEB7X6DODZTQC3OD","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":"87e3472e7e409c28c5eab2cdc51cbf0503676e7af83ede76a02e6a14f38cb48b","cross_cats_sorted":["cs.LG","cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-04-20T04:47:04Z","title_canon_sha256":"28d5c0378e492e4a16c84b9283b38eed759b73fb61bdda5cea51744aed14a24e"},"schema_version":"1.0","source":{"id":"1404.5009","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.5009","created_at":"2026-05-18T01:33:35Z"},{"alias_kind":"arxiv_version","alias_value":"1404.5009v4","created_at":"2026-05-18T01:33:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.5009","created_at":"2026-05-18T01:33:35Z"},{"alias_kind":"pith_short_12","alias_value":"MNLBXRGSZ3BE","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"MNLBXRGSZ3BEB7X6","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"MNLBXRGS","created_at":"2026-05-18T12:28:38Z"}],"graph_snapshots":[{"event_id":"sha256:9effc2d76ec1e082f24688e8318b1e523575b96e6635d78538e80a9cd277dbf8","target":"graph","created_at":"2026-05-18T01:33:35Z","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":"We propose a Branch-and-Cut (B&C) method for solving general MAP-MRF inference problems. The core of our method is a very efficient bounding procedure, which combines scalable semidefinite programming (SDP) and a cutting-plane method for seeking violated constraints. In order to further speed up the computation, several strategies have been exploited, including model reduction, warm start and removal of inactive constraints.\n  We analyze the performance of the proposed method under different settings, and demonstrate that our method either outperforms or performs on par with state-of-the-art a","authors_text":"Anton van den Hengel, Chunhua Shen, Peng Wang, Philip Torr","cross_cats":["cs.LG","cs.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-04-20T04:47:04Z","title":"Efficient Semidefinite Branch-and-Cut for MAP-MRF Inference"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.5009","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:4b5c14d8e9b1c65101bff9d45f38d658b2ca74b479e3d11fb931ba88d7922313","target":"record","created_at":"2026-05-18T01:33:35Z","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":"87e3472e7e409c28c5eab2cdc51cbf0503676e7af83ede76a02e6a14f38cb48b","cross_cats_sorted":["cs.LG","cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-04-20T04:47:04Z","title_canon_sha256":"28d5c0378e492e4a16c84b9283b38eed759b73fb61bdda5cea51744aed14a24e"},"schema_version":"1.0","source":{"id":"1404.5009","kind":"arxiv","version":4}},"canonical_sha256":"63561bc4d2cec240fefe1b8799c05b70e38bbc526e11d47550218431878ebe17","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"63561bc4d2cec240fefe1b8799c05b70e38bbc526e11d47550218431878ebe17","first_computed_at":"2026-05-18T01:33:35.343564Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:33:35.343564Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RNFw17EOaxukA7j0KSSMu65PrA75nAnY0QREJu4HY9k1Rx+ab0ZPzlp80hpbnQmNElmE4UfCupBP+51k/aWDCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:33:35.344296Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.5009","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4b5c14d8e9b1c65101bff9d45f38d658b2ca74b479e3d11fb931ba88d7922313","sha256:9effc2d76ec1e082f24688e8318b1e523575b96e6635d78538e80a9cd277dbf8"],"state_sha256":"2308ebefba8aaf6661c3e534147bd9ac6a1038c0889e6ff46228af551a4da91c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hF6glhrdnqScT4VYW2PN39TdW4+hpg4aZQWm4j6HIlF+GhkTCkBSpbiIbdavNR+4mtiDg5aF7tFywTjgkhHPAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T02:06:32.823781Z","bundle_sha256":"6a3ac564027fec227f71e97b349530376d52e6c4533be6aa84413cc3c61d8168"}}