{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:UTOTLICAW24NB4MBSPWAJF4ACI","short_pith_number":"pith:UTOTLICA","schema_version":"1.0","canonical_sha256":"a4dd35a040b6b8d0f18193ec049780123e09edef5e47710f50963d257833c90b","source":{"kind":"arxiv","id":"1606.07230","version":2},"attestation_state":"computed","paper":{"title":"Deep Learning Markov Random Field for Semantic Segmentation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CV","authors_text":"Chen Change Loy, Ping Luo, Xiaoou Tang, Xiaoxiao Li, Ziwei Liu","submitted_at":"2016-06-23T08:52:39Z","abstract_excerpt":"Semantic segmentation tasks can be well modeled by Markov Random Field (MRF). This paper addresses semantic segmentation by incorporating high-order relations and mixture of label contexts into MRF. Unlike previous works that optimized MRFs using iterative algorithm, we solve MRF by proposing a Convolutional Neural Network (CNN), namely Deep Parsing Network (DPN), which enables deterministic end-to-end computation in a single forward pass. Specifically, DPN extends a contemporary CNN to model unary terms and additional layers are devised to approximate the mean field (MF) algorithm for pairwis"},"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":"1606.07230","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-06-23T08:52:39Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"9a544cb9566b42099d5e507a6223936d64c58adeb3aaf46c1fd5c0744f6af0ee","abstract_canon_sha256":"b77ea417e38af4a4dcd7eb6b93d41b471b69eb4dc7105e69262f433f5d42be80"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:31.278756Z","signature_b64":"8MGuQxS9A77FS/JpYsuU9sRPloKQeVJDEGc9u1fKk9uiETWl/OZaqbxEHFRBD3MsHNALBY6/lwZnWrr8BcoTBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a4dd35a040b6b8d0f18193ec049780123e09edef5e47710f50963d257833c90b","last_reissued_at":"2026-05-18T00:38:31.278193Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:31.278193Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deep Learning Markov Random Field for Semantic Segmentation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CV","authors_text":"Chen Change Loy, Ping Luo, Xiaoou Tang, Xiaoxiao Li, Ziwei Liu","submitted_at":"2016-06-23T08:52:39Z","abstract_excerpt":"Semantic segmentation tasks can be well modeled by Markov Random Field (MRF). This paper addresses semantic segmentation by incorporating high-order relations and mixture of label contexts into MRF. Unlike previous works that optimized MRFs using iterative algorithm, we solve MRF by proposing a Convolutional Neural Network (CNN), namely Deep Parsing Network (DPN), which enables deterministic end-to-end computation in a single forward pass. Specifically, DPN extends a contemporary CNN to model unary terms and additional layers are devised to approximate the mean field (MF) algorithm for pairwis"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.07230","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":"1606.07230","created_at":"2026-05-18T00:38:31.278281+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.07230v2","created_at":"2026-05-18T00:38:31.278281+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.07230","created_at":"2026-05-18T00:38:31.278281+00:00"},{"alias_kind":"pith_short_12","alias_value":"UTOTLICAW24N","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_16","alias_value":"UTOTLICAW24NB4MB","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_8","alias_value":"UTOTLICA","created_at":"2026-05-18T12:30:46.583412+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.07311","citing_title":"A Proposed Framework for Advanced (Multi)Linear Infrastructure in Engineering and Science (FAMLIES)","ref_index":67,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UTOTLICAW24NB4MBSPWAJF4ACI","json":"https://pith.science/pith/UTOTLICAW24NB4MBSPWAJF4ACI.json","graph_json":"https://pith.science/api/pith-number/UTOTLICAW24NB4MBSPWAJF4ACI/graph.json","events_json":"https://pith.science/api/pith-number/UTOTLICAW24NB4MBSPWAJF4ACI/events.json","paper":"https://pith.science/paper/UTOTLICA"},"agent_actions":{"view_html":"https://pith.science/pith/UTOTLICAW24NB4MBSPWAJF4ACI","download_json":"https://pith.science/pith/UTOTLICAW24NB4MBSPWAJF4ACI.json","view_paper":"https://pith.science/paper/UTOTLICA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.07230&json=true","fetch_graph":"https://pith.science/api/pith-number/UTOTLICAW24NB4MBSPWAJF4ACI/graph.json","fetch_events":"https://pith.science/api/pith-number/UTOTLICAW24NB4MBSPWAJF4ACI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UTOTLICAW24NB4MBSPWAJF4ACI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UTOTLICAW24NB4MBSPWAJF4ACI/action/storage_attestation","attest_author":"https://pith.science/pith/UTOTLICAW24NB4MBSPWAJF4ACI/action/author_attestation","sign_citation":"https://pith.science/pith/UTOTLICAW24NB4MBSPWAJF4ACI/action/citation_signature","submit_replication":"https://pith.science/pith/UTOTLICAW24NB4MBSPWAJF4ACI/action/replication_record"}},"created_at":"2026-05-18T00:38:31.278281+00:00","updated_at":"2026-05-18T00:38:31.278281+00:00"}