{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:SSTDIIGAFKFO62MKEV4BXID4DH","short_pith_number":"pith:SSTDIIGA","canonical_record":{"source":{"id":"1611.09718","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-11-29T16:46:54Z","cross_cats_sorted":[],"title_canon_sha256":"b1f3309572166970c47a1b778a66982c173dd18f41fd6e2c1de12d02ac9a8f51","abstract_canon_sha256":"4ca548d7fa0b9f5cc1aac31e4d1417a68af04070739ebfa07a00a4775c75e456"},"schema_version":"1.0"},"canonical_sha256":"94a63420c02a8aef698a25781ba07c19e8d3ebbee17789bf638cffb438ba4b5f","source":{"kind":"arxiv","id":"1611.09718","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.09718","created_at":"2026-05-18T00:50:51Z"},{"alias_kind":"arxiv_version","alias_value":"1611.09718v2","created_at":"2026-05-18T00:50:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.09718","created_at":"2026-05-18T00:50:51Z"},{"alias_kind":"pith_short_12","alias_value":"SSTDIIGAFKFO","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"SSTDIIGAFKFO62MK","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"SSTDIIGA","created_at":"2026-05-18T12:30:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:SSTDIIGAFKFO62MKEV4BXID4DH","target":"record","payload":{"canonical_record":{"source":{"id":"1611.09718","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-11-29T16:46:54Z","cross_cats_sorted":[],"title_canon_sha256":"b1f3309572166970c47a1b778a66982c173dd18f41fd6e2c1de12d02ac9a8f51","abstract_canon_sha256":"4ca548d7fa0b9f5cc1aac31e4d1417a68af04070739ebfa07a00a4775c75e456"},"schema_version":"1.0"},"canonical_sha256":"94a63420c02a8aef698a25781ba07c19e8d3ebbee17789bf638cffb438ba4b5f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:51.848288Z","signature_b64":"WTN4c29mOLSQXPzeJrQvOWfOU1DTX1EEOnCQ+wvLPUUOtnEDfJzO2oiuyYHrlau/VwCWWpAEt3KpMQHejVZyCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"94a63420c02a8aef698a25781ba07c19e8d3ebbee17789bf638cffb438ba4b5f","last_reissued_at":"2026-05-18T00:50:51.847762Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:51.847762Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.09718","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:50:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iXss5UDriakHRTH69sGyJqfh1r5xkN/cwLS8zV8GstNGlTJtzvGv7yP/aWoxu1iRsClOElnTv62tvgcMMTNFCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T13:18:57.096578Z"},"content_sha256":"4a76e708d9c5711535878246b1732fe682294b8baeaa18bf9a3e2b71e2a464c5","schema_version":"1.0","event_id":"sha256:4a76e708d9c5711535878246b1732fe682294b8baeaa18bf9a3e2b71e2a464c5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:SSTDIIGAFKFO62MKEV4BXID4DH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Linear Programming for Dense CRFs","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, Rudy Bunel, Thalaiyasingam Ajanthan","submitted_at":"2016-11-29T16:46:54Z","abstract_excerpt":"The fully connected conditional random field (CRF) with Gaussian pairwise potentials has proven popular and effective for multi-class semantic segmentation. While the energy of a dense CRF can be minimized accurately using a linear programming (LP) relaxation, the state-of-the-art algorithm is too slow to be useful in practice. To alleviate this deficiency, we introduce an efficient LP minimization algorithm for dense CRFs. To this end, we develop a proximal minimization framework, where the dual of each proximal problem is optimized via block coordinate descent. We show that each block of var"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.09718","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:50:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WwMNSNAOGhmIJox41T3/DvTlYzAyXdV4glcA1MfmEeSKsnZ/KQepxTveJByDESE0MWFzqZQy8ZB4qpNBScgdDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T13:18:57.097415Z"},"content_sha256":"22209a0e82a1369f89042462da226d80f55120eddd9c47ed42be6b5bce5b7b63","schema_version":"1.0","event_id":"sha256:22209a0e82a1369f89042462da226d80f55120eddd9c47ed42be6b5bce5b7b63"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SSTDIIGAFKFO62MKEV4BXID4DH/bundle.json","state_url":"https://pith.science/pith/SSTDIIGAFKFO62MKEV4BXID4DH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SSTDIIGAFKFO62MKEV4BXID4DH/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-31T13:18:57Z","links":{"resolver":"https://pith.science/pith/SSTDIIGAFKFO62MKEV4BXID4DH","bundle":"https://pith.science/pith/SSTDIIGAFKFO62MKEV4BXID4DH/bundle.json","state":"https://pith.science/pith/SSTDIIGAFKFO62MKEV4BXID4DH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SSTDIIGAFKFO62MKEV4BXID4DH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:SSTDIIGAFKFO62MKEV4BXID4DH","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":"4ca548d7fa0b9f5cc1aac31e4d1417a68af04070739ebfa07a00a4775c75e456","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-11-29T16:46:54Z","title_canon_sha256":"b1f3309572166970c47a1b778a66982c173dd18f41fd6e2c1de12d02ac9a8f51"},"schema_version":"1.0","source":{"id":"1611.09718","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.09718","created_at":"2026-05-18T00:50:51Z"},{"alias_kind":"arxiv_version","alias_value":"1611.09718v2","created_at":"2026-05-18T00:50:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.09718","created_at":"2026-05-18T00:50:51Z"},{"alias_kind":"pith_short_12","alias_value":"SSTDIIGAFKFO","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"SSTDIIGAFKFO62MK","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"SSTDIIGA","created_at":"2026-05-18T12:30:44Z"}],"graph_snapshots":[{"event_id":"sha256:22209a0e82a1369f89042462da226d80f55120eddd9c47ed42be6b5bce5b7b63","target":"graph","created_at":"2026-05-18T00:50:51Z","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":"The fully connected conditional random field (CRF) with Gaussian pairwise potentials has proven popular and effective for multi-class semantic segmentation. While the energy of a dense CRF can be minimized accurately using a linear programming (LP) relaxation, the state-of-the-art algorithm is too slow to be useful in practice. To alleviate this deficiency, we introduce an efficient LP minimization algorithm for dense CRFs. To this end, we develop a proximal minimization framework, where the dual of each proximal problem is optimized via block coordinate descent. We show that each block of var","authors_text":"Alban Desmaison, Mathieu Salzmann, M. Pawan Kumar, Philip H.S. Torr, Rudy Bunel, Thalaiyasingam Ajanthan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-11-29T16:46:54Z","title":"Efficient Linear Programming for Dense CRFs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.09718","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:4a76e708d9c5711535878246b1732fe682294b8baeaa18bf9a3e2b71e2a464c5","target":"record","created_at":"2026-05-18T00:50:51Z","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":"4ca548d7fa0b9f5cc1aac31e4d1417a68af04070739ebfa07a00a4775c75e456","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-11-29T16:46:54Z","title_canon_sha256":"b1f3309572166970c47a1b778a66982c173dd18f41fd6e2c1de12d02ac9a8f51"},"schema_version":"1.0","source":{"id":"1611.09718","kind":"arxiv","version":2}},"canonical_sha256":"94a63420c02a8aef698a25781ba07c19e8d3ebbee17789bf638cffb438ba4b5f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"94a63420c02a8aef698a25781ba07c19e8d3ebbee17789bf638cffb438ba4b5f","first_computed_at":"2026-05-18T00:50:51.847762Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:50:51.847762Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WTN4c29mOLSQXPzeJrQvOWfOU1DTX1EEOnCQ+wvLPUUOtnEDfJzO2oiuyYHrlau/VwCWWpAEt3KpMQHejVZyCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:50:51.848288Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.09718","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4a76e708d9c5711535878246b1732fe682294b8baeaa18bf9a3e2b71e2a464c5","sha256:22209a0e82a1369f89042462da226d80f55120eddd9c47ed42be6b5bce5b7b63"],"state_sha256":"52b099a22adb188b4366db52cee19a08c391800e5dcefcf7dd4308f660efdf79"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zZ+JpENAPngWOUlpscURaK6ok2GpIaAC9/hMCuPLa96qJ1ma8agaHG5faiHwukLeE1i33XRWWIoq+DOGUttLDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T13:18:57.101646Z","bundle_sha256":"4a169785c5cc17209a2e8bfd599a97ebe130c0af98c762e9f0182d868dc30b20"}}