{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:QVBHFAJUZ3K2ZSX5JP3A6N3WJX","short_pith_number":"pith:QVBHFAJU","schema_version":"1.0","canonical_sha256":"8542728134ced5accafd4bf60f37764dde940308aa2b57dfbc1bb8ee968e2bb3","source":{"kind":"arxiv","id":"1805.09028","version":2},"attestation_state":"computed","paper":{"title":"Efficient Relaxations for Dense CRFs with Sparse Higher Order Potentials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Alban Desmaison, Mathieu Salzmann, M. Pawan Kumar, Philip H.S. Torr, Pushmeet Kohli, Rudy Bunel, Thalaiyasingam Ajanthan, Thomas Joy","submitted_at":"2018-05-23T09:34:51Z","abstract_excerpt":"Dense conditional random fields (CRFs) have become a popular framework for modelling several problems in computer vision such as stereo correspondence and multi-class semantic segmentation. By modelling long-range interactions, dense CRFs provide a labelling that captures finer detail than their sparse counterparts. Currently, the state-of-the-art algorithm performs mean-field inference using a filter-based method but fails to provide a strong theoretical guarantee on the quality of the solution. A question naturally arises as to whether it is possible to obtain a maximum a posteriori (MAP) es"},"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":"1805.09028","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-05-23T09:34:51Z","cross_cats_sorted":[],"title_canon_sha256":"5e8230bb8fba3d4f044bc5b019d3e785154e0947f0d24c468c56e9eee9b5de2a","abstract_canon_sha256":"de608fd270ab4073e4e337b0ce8000a133bd8a371fe20c267f4a406f4ac792c2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:17.853734Z","signature_b64":"DKclAfJldpIfeYW/j030/EAmJtlgXRLiWKgz+rBf33zvGvDFpOti9duEygxnVKlpEC92yeP9XmEMAZYf9vP6CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8542728134ced5accafd4bf60f37764dde940308aa2b57dfbc1bb8ee968e2bb3","last_reissued_at":"2026-05-18T00:02:17.853294Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:17.853294Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Relaxations for Dense CRFs with Sparse Higher Order Potentials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Alban Desmaison, Mathieu Salzmann, M. Pawan Kumar, Philip H.S. Torr, Pushmeet Kohli, Rudy Bunel, Thalaiyasingam Ajanthan, Thomas Joy","submitted_at":"2018-05-23T09:34:51Z","abstract_excerpt":"Dense conditional random fields (CRFs) have become a popular framework for modelling several problems in computer vision such as stereo correspondence and multi-class semantic segmentation. By modelling long-range interactions, dense CRFs provide a labelling that captures finer detail than their sparse counterparts. Currently, the state-of-the-art algorithm performs mean-field inference using a filter-based method but fails to provide a strong theoretical guarantee on the quality of the solution. A question naturally arises as to whether it is possible to obtain a maximum a posteriori (MAP) es"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.09028","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":"1805.09028","created_at":"2026-05-18T00:02:17.853368+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.09028v2","created_at":"2026-05-18T00:02:17.853368+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.09028","created_at":"2026-05-18T00:02:17.853368+00:00"},{"alias_kind":"pith_short_12","alias_value":"QVBHFAJUZ3K2","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_16","alias_value":"QVBHFAJUZ3K2ZSX5","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_8","alias_value":"QVBHFAJU","created_at":"2026-05-18T12:32:46.962924+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/QVBHFAJUZ3K2ZSX5JP3A6N3WJX","json":"https://pith.science/pith/QVBHFAJUZ3K2ZSX5JP3A6N3WJX.json","graph_json":"https://pith.science/api/pith-number/QVBHFAJUZ3K2ZSX5JP3A6N3WJX/graph.json","events_json":"https://pith.science/api/pith-number/QVBHFAJUZ3K2ZSX5JP3A6N3WJX/events.json","paper":"https://pith.science/paper/QVBHFAJU"},"agent_actions":{"view_html":"https://pith.science/pith/QVBHFAJUZ3K2ZSX5JP3A6N3WJX","download_json":"https://pith.science/pith/QVBHFAJUZ3K2ZSX5JP3A6N3WJX.json","view_paper":"https://pith.science/paper/QVBHFAJU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.09028&json=true","fetch_graph":"https://pith.science/api/pith-number/QVBHFAJUZ3K2ZSX5JP3A6N3WJX/graph.json","fetch_events":"https://pith.science/api/pith-number/QVBHFAJUZ3K2ZSX5JP3A6N3WJX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QVBHFAJUZ3K2ZSX5JP3A6N3WJX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QVBHFAJUZ3K2ZSX5JP3A6N3WJX/action/storage_attestation","attest_author":"https://pith.science/pith/QVBHFAJUZ3K2ZSX5JP3A6N3WJX/action/author_attestation","sign_citation":"https://pith.science/pith/QVBHFAJUZ3K2ZSX5JP3A6N3WJX/action/citation_signature","submit_replication":"https://pith.science/pith/QVBHFAJUZ3K2ZSX5JP3A6N3WJX/action/replication_record"}},"created_at":"2026-05-18T00:02:17.853368+00:00","updated_at":"2026-05-18T00:02:17.853368+00:00"}