{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:UTOTLICAW24NB4MBSPWAJF4ACI","short_pith_number":"pith:UTOTLICA","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"},"canonical_sha256":"a4dd35a040b6b8d0f18193ec049780123e09edef5e47710f50963d257833c90b","source":{"kind":"arxiv","id":"1606.07230","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.07230","created_at":"2026-05-18T00:38:31Z"},{"alias_kind":"arxiv_version","alias_value":"1606.07230v2","created_at":"2026-05-18T00:38:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.07230","created_at":"2026-05-18T00:38:31Z"},{"alias_kind":"pith_short_12","alias_value":"UTOTLICAW24N","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"UTOTLICAW24NB4MB","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"UTOTLICA","created_at":"2026-05-18T12:30:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:UTOTLICAW24NB4MBSPWAJF4ACI","target":"record","payload":{"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"},"canonical_sha256":"a4dd35a040b6b8d0f18193ec049780123e09edef5e47710f50963d257833c90b","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"},"source_kind":"arxiv","source_id":"1606.07230","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:38:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p0pEuoYdlakQbp2hamEhFR50/tshLqqwpp8j6miSY+zu4DmY1aMyi84BstDjpedxz5tD8erjw7theyawhLsIAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T20:04:31.104100Z"},"content_sha256":"72032af838f1d8a61a11ace5119821542ce5b9e7eb02c53c645df1a071aba3de","schema_version":"1.0","event_id":"sha256:72032af838f1d8a61a11ace5119821542ce5b9e7eb02c53c645df1a071aba3de"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:UTOTLICAW24NB4MBSPWAJF4ACI","target":"graph","payload":{"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"},"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:38:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cnOhAvUCD9uzGeWc6HL2dUjnDwNXztMVZBYgZWcMdmMZpPOwzEmUm1rR3ZoXGgioM2LPd/oinpJKNNFUI0btAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T20:04:31.104860Z"},"content_sha256":"4412891e8a8bda87146c024c5c14ef52516aafa7e1258fd0330ba59f31cd4024","schema_version":"1.0","event_id":"sha256:4412891e8a8bda87146c024c5c14ef52516aafa7e1258fd0330ba59f31cd4024"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UTOTLICAW24NB4MBSPWAJF4ACI/bundle.json","state_url":"https://pith.science/pith/UTOTLICAW24NB4MBSPWAJF4ACI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UTOTLICAW24NB4MBSPWAJF4ACI/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-26T20:04:31Z","links":{"resolver":"https://pith.science/pith/UTOTLICAW24NB4MBSPWAJF4ACI","bundle":"https://pith.science/pith/UTOTLICAW24NB4MBSPWAJF4ACI/bundle.json","state":"https://pith.science/pith/UTOTLICAW24NB4MBSPWAJF4ACI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UTOTLICAW24NB4MBSPWAJF4ACI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:UTOTLICAW24NB4MBSPWAJF4ACI","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":"b77ea417e38af4a4dcd7eb6b93d41b471b69eb4dc7105e69262f433f5d42be80","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-06-23T08:52:39Z","title_canon_sha256":"9a544cb9566b42099d5e507a6223936d64c58adeb3aaf46c1fd5c0744f6af0ee"},"schema_version":"1.0","source":{"id":"1606.07230","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.07230","created_at":"2026-05-18T00:38:31Z"},{"alias_kind":"arxiv_version","alias_value":"1606.07230v2","created_at":"2026-05-18T00:38:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.07230","created_at":"2026-05-18T00:38:31Z"},{"alias_kind":"pith_short_12","alias_value":"UTOTLICAW24N","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"UTOTLICAW24NB4MB","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"UTOTLICA","created_at":"2026-05-18T12:30:46Z"}],"graph_snapshots":[{"event_id":"sha256:4412891e8a8bda87146c024c5c14ef52516aafa7e1258fd0330ba59f31cd4024","target":"graph","created_at":"2026-05-18T00:38:31Z","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":"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","authors_text":"Chen Change Loy, Ping Luo, Xiaoou Tang, Xiaoxiao Li, Ziwei Liu","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-06-23T08:52:39Z","title":"Deep Learning Markov Random Field for Semantic Segmentation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.07230","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:72032af838f1d8a61a11ace5119821542ce5b9e7eb02c53c645df1a071aba3de","target":"record","created_at":"2026-05-18T00:38:31Z","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":"b77ea417e38af4a4dcd7eb6b93d41b471b69eb4dc7105e69262f433f5d42be80","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-06-23T08:52:39Z","title_canon_sha256":"9a544cb9566b42099d5e507a6223936d64c58adeb3aaf46c1fd5c0744f6af0ee"},"schema_version":"1.0","source":{"id":"1606.07230","kind":"arxiv","version":2}},"canonical_sha256":"a4dd35a040b6b8d0f18193ec049780123e09edef5e47710f50963d257833c90b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a4dd35a040b6b8d0f18193ec049780123e09edef5e47710f50963d257833c90b","first_computed_at":"2026-05-18T00:38:31.278193Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:38:31.278193Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8MGuQxS9A77FS/JpYsuU9sRPloKQeVJDEGc9u1fKk9uiETWl/OZaqbxEHFRBD3MsHNALBY6/lwZnWrr8BcoTBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:38:31.278756Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.07230","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:72032af838f1d8a61a11ace5119821542ce5b9e7eb02c53c645df1a071aba3de","sha256:4412891e8a8bda87146c024c5c14ef52516aafa7e1258fd0330ba59f31cd4024"],"state_sha256":"c4454c2b3929a2c56dfa6f902c987b96453e213164587149ccf0ef4c2acecdc2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CdAxYqyZh3vjO3+rRZ5pTViSNm8m48+ad/jwlV2I8jipWLDKdvIl/iISsWTEEUrfh7lxBQfJYqOfuqb+Rl+MBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T20:04:31.109352Z","bundle_sha256":"f123d41dccbb44b68b3730d01b86d9ccecce9b07209983071df30d3d0039feaa"}}