{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:E7LAADGRVGADJH3GV4C676YCCW","short_pith_number":"pith:E7LAADGR","canonical_record":{"source":{"id":"1910.12037","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.CV","submitted_at":"2019-10-26T09:39:36Z","cross_cats_sorted":[],"title_canon_sha256":"1a5778cdea2f0b7e0a41e4a517bc695d3c3c358cd8bc83caa8b4770294ba8500","abstract_canon_sha256":"049a1a0b912bf6d67cab19c294bc3fdf90594c88784bf2fdf93dd5dde93c6045"},"schema_version":"1.0"},"canonical_sha256":"27d6000cd1a980349f66af05effb0215a4c965199b4971e81a3bfbc7362f03ac","source":{"kind":"arxiv","id":"1910.12037","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1910.12037","created_at":"2026-07-05T00:15:12Z"},{"alias_kind":"arxiv_version","alias_value":"1910.12037v1","created_at":"2026-07-05T00:15:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1910.12037","created_at":"2026-07-05T00:15:12Z"},{"alias_kind":"pith_short_12","alias_value":"E7LAADGRVGAD","created_at":"2026-07-05T00:15:12Z"},{"alias_kind":"pith_short_16","alias_value":"E7LAADGRVGADJH3G","created_at":"2026-07-05T00:15:12Z"},{"alias_kind":"pith_short_8","alias_value":"E7LAADGR","created_at":"2026-07-05T00:15:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:E7LAADGRVGADJH3GV4C676YCCW","target":"record","payload":{"canonical_record":{"source":{"id":"1910.12037","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.CV","submitted_at":"2019-10-26T09:39:36Z","cross_cats_sorted":[],"title_canon_sha256":"1a5778cdea2f0b7e0a41e4a517bc695d3c3c358cd8bc83caa8b4770294ba8500","abstract_canon_sha256":"049a1a0b912bf6d67cab19c294bc3fdf90594c88784bf2fdf93dd5dde93c6045"},"schema_version":"1.0"},"canonical_sha256":"27d6000cd1a980349f66af05effb0215a4c965199b4971e81a3bfbc7362f03ac","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:15:12.155638Z","signature_b64":"hqJz9X3rj7LojgvE3GofmmWFm63+ygT6UFm3NeOQEE2OU2CiyC+CwjfIzBOycb9DvpGeEMbA/tbZ1ws91sncBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"27d6000cd1a980349f66af05effb0215a4c965199b4971e81a3bfbc7362f03ac","last_reissued_at":"2026-07-05T00:15:12.155229Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:15:12.155229Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1910.12037","source_version":1,"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-07-05T00:15:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZLFzir2kYbNd56aJPlnwvjIXzfyaeqrFmPVOGOAT0SWBFgUs13/ZYDnMJa+Lwq11JlfwWo4Nt31jNcs3z8dSCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-21T21:17:44.950901Z"},"content_sha256":"5cdec8aa47634d8c52d070031098f44c49f0b4f4a6464fd79804019c78ab530c","schema_version":"1.0","event_id":"sha256:5cdec8aa47634d8c52d070031098f44c49f0b4f4a6464fd79804019c78ab530c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:E7LAADGRVGADJH3GV4C676YCCW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Region Mutual Information Loss for Semantic Segmentation","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Deng Cai, Shuai Zhao, Yang Wang, Zheng Yang","submitted_at":"2019-10-26T09:39:36Z","abstract_excerpt":"Semantic segmentation is a fundamental problem in computer vision. It is considered as a pixel-wise classification problem in practice, and most segmentation models use a pixel-wise loss as their optimization riterion. However, the pixel-wise loss ignores the dependencies between pixels in an image. Several ways to exploit the relationship between pixels have been investigated, \\eg, conditional random fields (CRF) and pixel affinity based methods. Nevertheless, these methods usually require additional model branches, large extra memories, or more inference time. In this paper, we develop a reg"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1910.12037","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1910.12037/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T00:15:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uqJ0bRPipdw3jX2L/VPtmFQpT7LiJMih7ImKCbUedKkMG813bI/eJDTtRVst4NWaTJURvFaRkcgh73R3sxjLBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-21T21:17:44.951277Z"},"content_sha256":"bd8bc79db24926d13b22cd39c6ab613e5b186906513b4e0bdc15834c205a5261","schema_version":"1.0","event_id":"sha256:bd8bc79db24926d13b22cd39c6ab613e5b186906513b4e0bdc15834c205a5261"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E7LAADGRVGADJH3GV4C676YCCW/bundle.json","state_url":"https://pith.science/pith/E7LAADGRVGADJH3GV4C676YCCW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E7LAADGRVGADJH3GV4C676YCCW/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-07-21T21:17:44Z","links":{"resolver":"https://pith.science/pith/E7LAADGRVGADJH3GV4C676YCCW","bundle":"https://pith.science/pith/E7LAADGRVGADJH3GV4C676YCCW/bundle.json","state":"https://pith.science/pith/E7LAADGRVGADJH3GV4C676YCCW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E7LAADGRVGADJH3GV4C676YCCW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:E7LAADGRVGADJH3GV4C676YCCW","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":"049a1a0b912bf6d67cab19c294bc3fdf90594c88784bf2fdf93dd5dde93c6045","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.CV","submitted_at":"2019-10-26T09:39:36Z","title_canon_sha256":"1a5778cdea2f0b7e0a41e4a517bc695d3c3c358cd8bc83caa8b4770294ba8500"},"schema_version":"1.0","source":{"id":"1910.12037","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1910.12037","created_at":"2026-07-05T00:15:12Z"},{"alias_kind":"arxiv_version","alias_value":"1910.12037v1","created_at":"2026-07-05T00:15:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1910.12037","created_at":"2026-07-05T00:15:12Z"},{"alias_kind":"pith_short_12","alias_value":"E7LAADGRVGAD","created_at":"2026-07-05T00:15:12Z"},{"alias_kind":"pith_short_16","alias_value":"E7LAADGRVGADJH3G","created_at":"2026-07-05T00:15:12Z"},{"alias_kind":"pith_short_8","alias_value":"E7LAADGR","created_at":"2026-07-05T00:15:12Z"}],"graph_snapshots":[{"event_id":"sha256:bd8bc79db24926d13b22cd39c6ab613e5b186906513b4e0bdc15834c205a5261","target":"graph","created_at":"2026-07-05T00:15:12Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1910.12037/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Semantic segmentation is a fundamental problem in computer vision. It is considered as a pixel-wise classification problem in practice, and most segmentation models use a pixel-wise loss as their optimization riterion. However, the pixel-wise loss ignores the dependencies between pixels in an image. Several ways to exploit the relationship between pixels have been investigated, \\eg, conditional random fields (CRF) and pixel affinity based methods. Nevertheless, these methods usually require additional model branches, large extra memories, or more inference time. In this paper, we develop a reg","authors_text":"Deng Cai, Shuai Zhao, Yang Wang, Zheng Yang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.CV","submitted_at":"2019-10-26T09:39:36Z","title":"Region Mutual Information Loss for Semantic Segmentation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1910.12037","kind":"arxiv","version":1},"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:5cdec8aa47634d8c52d070031098f44c49f0b4f4a6464fd79804019c78ab530c","target":"record","created_at":"2026-07-05T00:15:12Z","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":"049a1a0b912bf6d67cab19c294bc3fdf90594c88784bf2fdf93dd5dde93c6045","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.CV","submitted_at":"2019-10-26T09:39:36Z","title_canon_sha256":"1a5778cdea2f0b7e0a41e4a517bc695d3c3c358cd8bc83caa8b4770294ba8500"},"schema_version":"1.0","source":{"id":"1910.12037","kind":"arxiv","version":1}},"canonical_sha256":"27d6000cd1a980349f66af05effb0215a4c965199b4971e81a3bfbc7362f03ac","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"27d6000cd1a980349f66af05effb0215a4c965199b4971e81a3bfbc7362f03ac","first_computed_at":"2026-07-05T00:15:12.155229Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:15:12.155229Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hqJz9X3rj7LojgvE3GofmmWFm63+ygT6UFm3NeOQEE2OU2CiyC+CwjfIzBOycb9DvpGeEMbA/tbZ1ws91sncBw==","signature_status":"signed_v1","signed_at":"2026-07-05T00:15:12.155638Z","signed_message":"canonical_sha256_bytes"},"source_id":"1910.12037","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5cdec8aa47634d8c52d070031098f44c49f0b4f4a6464fd79804019c78ab530c","sha256:bd8bc79db24926d13b22cd39c6ab613e5b186906513b4e0bdc15834c205a5261"],"state_sha256":"f7f9b264afe4bf6628c3ba0814b58452e6ae07c611630ba01f6d527655fe6449"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g/CRtgKfT7nltPqqkpeqFU10+GIr2HFugf4VD8OUK18wFTl6G8KbBpDd1v3E7NwwiYYKaJxQRa1wNzyGeGkbBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-21T21:17:44.953417Z","bundle_sha256":"7ae9ccc6421d2851f92430aebd4b0d1bf106a612073e686bdee4dc5798a27904"}}