{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:43KH4SSWTNSR63KEWOOY2HI4J5","short_pith_number":"pith:43KH4SSW","canonical_record":{"source":{"id":"1712.06020","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-12-16T21:19:44Z","cross_cats_sorted":[],"title_canon_sha256":"5373295efc7924e0d74d1fefac5fa07678e3c85347ef1a58aad72a9178cd5c4a","abstract_canon_sha256":"c3b05ff078515ce6256bce0e6549a4c4639b04db328b4299fff6232038273a5b"},"schema_version":"1.0"},"canonical_sha256":"e6d47e4a569b651f6d44b39d8d1d1c4f6a2c35f425f25221d7d64588e8fb2bcd","source":{"kind":"arxiv","id":"1712.06020","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.06020","created_at":"2026-05-18T00:20:37Z"},{"alias_kind":"arxiv_version","alias_value":"1712.06020v2","created_at":"2026-05-18T00:20:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.06020","created_at":"2026-05-18T00:20:37Z"},{"alias_kind":"pith_short_12","alias_value":"43KH4SSWTNSR","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"43KH4SSWTNSR63KE","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"43KH4SSW","created_at":"2026-05-18T12:30:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:43KH4SSWTNSR63KEWOOY2HI4J5","target":"record","payload":{"canonical_record":{"source":{"id":"1712.06020","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-12-16T21:19:44Z","cross_cats_sorted":[],"title_canon_sha256":"5373295efc7924e0d74d1fefac5fa07678e3c85347ef1a58aad72a9178cd5c4a","abstract_canon_sha256":"c3b05ff078515ce6256bce0e6549a4c4639b04db328b4299fff6232038273a5b"},"schema_version":"1.0"},"canonical_sha256":"e6d47e4a569b651f6d44b39d8d1d1c4f6a2c35f425f25221d7d64588e8fb2bcd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:37.884677Z","signature_b64":"4BuIv/x7q7rnKkXmp5BuAaDdnkyg8M9U2n2XcM5mrUXGLzBNEIEicyD0SKmZKaPtv/0P9TjshFykZtVNX03IDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e6d47e4a569b651f6d44b39d8d1d1c4f6a2c35f425f25221d7d64588e8fb2bcd","last_reissued_at":"2026-05-18T00:20:37.882763Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:37.882763Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.06020","source_version":2,"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:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NWBJp+tpxMDNSVAjcpOZbKwSQo0YOxzHp9pnE5KK3gnQxEPI3MQNzfuISSvoEJIJB2U4N+UQqDte+zUsINf5AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T08:35:32.553308Z"},"content_sha256":"6ce9e112533abc6e2663421a651f76ed72b2e36b4ff4d0e09d025f59058cca0b","schema_version":"1.0","event_id":"sha256:6ce9e112533abc6e2663421a651f76ed72b2e36b4ff4d0e09d025f59058cca0b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:43KH4SSWTNSR63KEWOOY2HI4J5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An ILP Solver for Multi-label MRFs with Connectivity Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Andrea Lodi, Andrea Tramontani, Eric Kendinibilir, Gerhard Reinelt, Ismail Ben Ayed, Ruobing Shen","submitted_at":"2017-12-16T21:19:44Z","abstract_excerpt":"Integer Linear Programming (ILP) formulations of Markov random fields (MRFs) models with global connectivity priors were investigated previously in computer vision, e.g., \\cite{globalinter,globalconn}. In these works, only Linear Programing (LP) relaxations \\cite{globalinter,globalconn} or simplified versions \\cite{graphcutbase} of the problem were solved. This paper investigates the ILP of multi-label MRF with exact connectivity priors via a branch-and-cut method, which provably finds globally optimal solutions. The method enforces connectivity priors iteratively by a cutting plane method, an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.06020","kind":"arxiv","version":2},"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:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RXUKkrxOcs0gDjndt2jtSHM2r3a3xtCQFH/H7lEbe8h3z+hyotdX8GRonxctvSfonPdCHSbg708qCo2EGZM6Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T08:35:32.553667Z"},"content_sha256":"c206d38483250fc9676e41533bcce510d8b24efe667fe3dfc8b4b571a1148573","schema_version":"1.0","event_id":"sha256:c206d38483250fc9676e41533bcce510d8b24efe667fe3dfc8b4b571a1148573"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/43KH4SSWTNSR63KEWOOY2HI4J5/bundle.json","state_url":"https://pith.science/pith/43KH4SSWTNSR63KEWOOY2HI4J5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/43KH4SSWTNSR63KEWOOY2HI4J5/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-02T08:35:32Z","links":{"resolver":"https://pith.science/pith/43KH4SSWTNSR63KEWOOY2HI4J5","bundle":"https://pith.science/pith/43KH4SSWTNSR63KEWOOY2HI4J5/bundle.json","state":"https://pith.science/pith/43KH4SSWTNSR63KEWOOY2HI4J5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/43KH4SSWTNSR63KEWOOY2HI4J5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:43KH4SSWTNSR63KEWOOY2HI4J5","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":"c3b05ff078515ce6256bce0e6549a4c4639b04db328b4299fff6232038273a5b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-12-16T21:19:44Z","title_canon_sha256":"5373295efc7924e0d74d1fefac5fa07678e3c85347ef1a58aad72a9178cd5c4a"},"schema_version":"1.0","source":{"id":"1712.06020","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.06020","created_at":"2026-05-18T00:20:37Z"},{"alias_kind":"arxiv_version","alias_value":"1712.06020v2","created_at":"2026-05-18T00:20:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.06020","created_at":"2026-05-18T00:20:37Z"},{"alias_kind":"pith_short_12","alias_value":"43KH4SSWTNSR","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"43KH4SSWTNSR63KE","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"43KH4SSW","created_at":"2026-05-18T12:30:58Z"}],"graph_snapshots":[{"event_id":"sha256:c206d38483250fc9676e41533bcce510d8b24efe667fe3dfc8b4b571a1148573","target":"graph","created_at":"2026-05-18T00:20:37Z","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":"Integer Linear Programming (ILP) formulations of Markov random fields (MRFs) models with global connectivity priors were investigated previously in computer vision, e.g., \\cite{globalinter,globalconn}. In these works, only Linear Programing (LP) relaxations \\cite{globalinter,globalconn} or simplified versions \\cite{graphcutbase} of the problem were solved. This paper investigates the ILP of multi-label MRF with exact connectivity priors via a branch-and-cut method, which provably finds globally optimal solutions. The method enforces connectivity priors iteratively by a cutting plane method, an","authors_text":"Andrea Lodi, Andrea Tramontani, Eric Kendinibilir, Gerhard Reinelt, Ismail Ben Ayed, Ruobing Shen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-12-16T21:19:44Z","title":"An ILP Solver for Multi-label MRFs with Connectivity Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.06020","kind":"arxiv","version":2},"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:6ce9e112533abc6e2663421a651f76ed72b2e36b4ff4d0e09d025f59058cca0b","target":"record","created_at":"2026-05-18T00:20:37Z","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":"c3b05ff078515ce6256bce0e6549a4c4639b04db328b4299fff6232038273a5b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-12-16T21:19:44Z","title_canon_sha256":"5373295efc7924e0d74d1fefac5fa07678e3c85347ef1a58aad72a9178cd5c4a"},"schema_version":"1.0","source":{"id":"1712.06020","kind":"arxiv","version":2}},"canonical_sha256":"e6d47e4a569b651f6d44b39d8d1d1c4f6a2c35f425f25221d7d64588e8fb2bcd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e6d47e4a569b651f6d44b39d8d1d1c4f6a2c35f425f25221d7d64588e8fb2bcd","first_computed_at":"2026-05-18T00:20:37.882763Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:20:37.882763Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4BuIv/x7q7rnKkXmp5BuAaDdnkyg8M9U2n2XcM5mrUXGLzBNEIEicyD0SKmZKaPtv/0P9TjshFykZtVNX03IDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:20:37.884677Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.06020","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6ce9e112533abc6e2663421a651f76ed72b2e36b4ff4d0e09d025f59058cca0b","sha256:c206d38483250fc9676e41533bcce510d8b24efe667fe3dfc8b4b571a1148573"],"state_sha256":"6befa9fb3eead7693b61551a8a2b0377fca89ee234fb8518807ec3f352a34ff3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gzaThUqrte4sb5mnJOiQNvFjoOb3b0xuk6GEix+Wi3Sg28RRYLZu0wVI1e7197JCXUlkd+4uUYeKcJ3UM46QBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T08:35:32.555581Z","bundle_sha256":"552217dbe389298901d4fde0e9d6b0842c7d1ded15a28a7014028d916fde8d9f"}}