{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:QVBHFAJUZ3K2ZSX5JP3A6N3WJX","short_pith_number":"pith:QVBHFAJU","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"},"canonical_sha256":"8542728134ced5accafd4bf60f37764dde940308aa2b57dfbc1bb8ee968e2bb3","source":{"kind":"arxiv","id":"1805.09028","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.09028","created_at":"2026-05-18T00:02:17Z"},{"alias_kind":"arxiv_version","alias_value":"1805.09028v2","created_at":"2026-05-18T00:02:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.09028","created_at":"2026-05-18T00:02:17Z"},{"alias_kind":"pith_short_12","alias_value":"QVBHFAJUZ3K2","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"QVBHFAJUZ3K2ZSX5","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"QVBHFAJU","created_at":"2026-05-18T12:32:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:QVBHFAJUZ3K2ZSX5JP3A6N3WJX","target":"record","payload":{"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"},"canonical_sha256":"8542728134ced5accafd4bf60f37764dde940308aa2b57dfbc1bb8ee968e2bb3","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"},"source_kind":"arxiv","source_id":"1805.09028","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:02:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p3JvJy7FpZuR1gXhd5rNmpRluRuPek5pyoeC9SxCDknY0dd/xZhVy0LmzWAKvgwRTyMHz5LDyvs+N6TaEADDCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T22:39:20.799174Z"},"content_sha256":"8c9dca3b96783c55c7a9dee0dfcebd264aa1fcc6945bbeb539cdcbc5733ba98f","schema_version":"1.0","event_id":"sha256:8c9dca3b96783c55c7a9dee0dfcebd264aa1fcc6945bbeb539cdcbc5733ba98f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:QVBHFAJUZ3K2ZSX5JP3A6N3WJX","target":"graph","payload":{"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"},"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:02:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OqNzZC95AtuWIo4rEslDQ6ymi3POds9zLLZOO8t0RdhIRNwl6UCM3tqUQZHvt2JLI7Cdz5sZ6rmsoj3I/yAYBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T22:39:20.799774Z"},"content_sha256":"9413f827c976ca2b4dd8591018eb3d8b285329130d067a4c44a8c8b485577a22","schema_version":"1.0","event_id":"sha256:9413f827c976ca2b4dd8591018eb3d8b285329130d067a4c44a8c8b485577a22"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QVBHFAJUZ3K2ZSX5JP3A6N3WJX/bundle.json","state_url":"https://pith.science/pith/QVBHFAJUZ3K2ZSX5JP3A6N3WJX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QVBHFAJUZ3K2ZSX5JP3A6N3WJX/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-31T22:39:20Z","links":{"resolver":"https://pith.science/pith/QVBHFAJUZ3K2ZSX5JP3A6N3WJX","bundle":"https://pith.science/pith/QVBHFAJUZ3K2ZSX5JP3A6N3WJX/bundle.json","state":"https://pith.science/pith/QVBHFAJUZ3K2ZSX5JP3A6N3WJX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QVBHFAJUZ3K2ZSX5JP3A6N3WJX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:QVBHFAJUZ3K2ZSX5JP3A6N3WJX","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":"de608fd270ab4073e4e337b0ce8000a133bd8a371fe20c267f4a406f4ac792c2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-05-23T09:34:51Z","title_canon_sha256":"5e8230bb8fba3d4f044bc5b019d3e785154e0947f0d24c468c56e9eee9b5de2a"},"schema_version":"1.0","source":{"id":"1805.09028","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.09028","created_at":"2026-05-18T00:02:17Z"},{"alias_kind":"arxiv_version","alias_value":"1805.09028v2","created_at":"2026-05-18T00:02:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.09028","created_at":"2026-05-18T00:02:17Z"},{"alias_kind":"pith_short_12","alias_value":"QVBHFAJUZ3K2","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"QVBHFAJUZ3K2ZSX5","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"QVBHFAJU","created_at":"2026-05-18T12:32:46Z"}],"graph_snapshots":[{"event_id":"sha256:9413f827c976ca2b4dd8591018eb3d8b285329130d067a4c44a8c8b485577a22","target":"graph","created_at":"2026-05-18T00:02:17Z","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":"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","authors_text":"Alban Desmaison, Mathieu Salzmann, M. Pawan Kumar, Philip H.S. Torr, Pushmeet Kohli, Rudy Bunel, Thalaiyasingam Ajanthan, Thomas Joy","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-05-23T09:34:51Z","title":"Efficient Relaxations for Dense CRFs with Sparse Higher Order Potentials"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.09028","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:8c9dca3b96783c55c7a9dee0dfcebd264aa1fcc6945bbeb539cdcbc5733ba98f","target":"record","created_at":"2026-05-18T00:02:17Z","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":"de608fd270ab4073e4e337b0ce8000a133bd8a371fe20c267f4a406f4ac792c2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-05-23T09:34:51Z","title_canon_sha256":"5e8230bb8fba3d4f044bc5b019d3e785154e0947f0d24c468c56e9eee9b5de2a"},"schema_version":"1.0","source":{"id":"1805.09028","kind":"arxiv","version":2}},"canonical_sha256":"8542728134ced5accafd4bf60f37764dde940308aa2b57dfbc1bb8ee968e2bb3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8542728134ced5accafd4bf60f37764dde940308aa2b57dfbc1bb8ee968e2bb3","first_computed_at":"2026-05-18T00:02:17.853294Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:02:17.853294Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DKclAfJldpIfeYW/j030/EAmJtlgXRLiWKgz+rBf33zvGvDFpOti9duEygxnVKlpEC92yeP9XmEMAZYf9vP6CA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:02:17.853734Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.09028","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8c9dca3b96783c55c7a9dee0dfcebd264aa1fcc6945bbeb539cdcbc5733ba98f","sha256:9413f827c976ca2b4dd8591018eb3d8b285329130d067a4c44a8c8b485577a22"],"state_sha256":"a03e8f0ef9d0f6cc2c172b627a0dd3b96376978468dbad0b1a670688df0b1eec"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sH5H3Z8mT5nxAHDLADFCmzGYroSX6hOwulqPVrSIBvw49zmKQYy0i4TaDgghRn6WnPlauzfK+7JvOdR4cXryCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T22:39:20.802869Z","bundle_sha256":"e41f263cdc55465a064cab2cdca0c45beddb0006aeec2e1e3a1e011faf876dc2"}}