{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:43KH4SSWTNSR63KEWOOY2HI4J5","short_pith_number":"pith:43KH4SSW","schema_version":"1.0","canonical_sha256":"e6d47e4a569b651f6d44b39d8d1d1c4f6a2c35f425f25221d7d64588e8fb2bcd","source":{"kind":"arxiv","id":"1712.06020","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1712.06020","created_at":"2026-05-18T00:20:37.882844+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.06020v2","created_at":"2026-05-18T00:20:37.882844+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.06020","created_at":"2026-05-18T00:20:37.882844+00:00"},{"alias_kind":"pith_short_12","alias_value":"43KH4SSWTNSR","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_16","alias_value":"43KH4SSWTNSR63KE","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_8","alias_value":"43KH4SSW","created_at":"2026-05-18T12:30:58.224056+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/43KH4SSWTNSR63KEWOOY2HI4J5","json":"https://pith.science/pith/43KH4SSWTNSR63KEWOOY2HI4J5.json","graph_json":"https://pith.science/api/pith-number/43KH4SSWTNSR63KEWOOY2HI4J5/graph.json","events_json":"https://pith.science/api/pith-number/43KH4SSWTNSR63KEWOOY2HI4J5/events.json","paper":"https://pith.science/paper/43KH4SSW"},"agent_actions":{"view_html":"https://pith.science/pith/43KH4SSWTNSR63KEWOOY2HI4J5","download_json":"https://pith.science/pith/43KH4SSWTNSR63KEWOOY2HI4J5.json","view_paper":"https://pith.science/paper/43KH4SSW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.06020&json=true","fetch_graph":"https://pith.science/api/pith-number/43KH4SSWTNSR63KEWOOY2HI4J5/graph.json","fetch_events":"https://pith.science/api/pith-number/43KH4SSWTNSR63KEWOOY2HI4J5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/43KH4SSWTNSR63KEWOOY2HI4J5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/43KH4SSWTNSR63KEWOOY2HI4J5/action/storage_attestation","attest_author":"https://pith.science/pith/43KH4SSWTNSR63KEWOOY2HI4J5/action/author_attestation","sign_citation":"https://pith.science/pith/43KH4SSWTNSR63KEWOOY2HI4J5/action/citation_signature","submit_replication":"https://pith.science/pith/43KH4SSWTNSR63KEWOOY2HI4J5/action/replication_record"}},"created_at":"2026-05-18T00:20:37.882844+00:00","updated_at":"2026-05-18T00:20:37.882844+00:00"}