{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:K7JBH5GSFSHXK6WLAQ44RKSTTR","short_pith_number":"pith:K7JBH5GS","canonical_record":{"source":{"id":"1903.11816","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2019-03-28T07:49:36Z","cross_cats_sorted":[],"title_canon_sha256":"00506553221a536b0e4d919856ff67c56ac5d12b9db4ba47108f0b648f3e49d6","abstract_canon_sha256":"520e3e868b86e13b37900b63fe5d433ba96be0ca237fea233a8957142f8fbea6"},"schema_version":"1.0"},"canonical_sha256":"57d213f4d22c8f757acb0439c8aa539c7e1a0bd535f443e762a3248cf87e33e3","source":{"kind":"arxiv","id":"1903.11816","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.11816","created_at":"2026-05-17T23:49:59Z"},{"alias_kind":"arxiv_version","alias_value":"1903.11816v1","created_at":"2026-05-17T23:49:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.11816","created_at":"2026-05-17T23:49:59Z"},{"alias_kind":"pith_short_12","alias_value":"K7JBH5GSFSHX","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"K7JBH5GSFSHXK6WL","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"K7JBH5GS","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:K7JBH5GSFSHXK6WLAQ44RKSTTR","target":"record","payload":{"canonical_record":{"source":{"id":"1903.11816","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2019-03-28T07:49:36Z","cross_cats_sorted":[],"title_canon_sha256":"00506553221a536b0e4d919856ff67c56ac5d12b9db4ba47108f0b648f3e49d6","abstract_canon_sha256":"520e3e868b86e13b37900b63fe5d433ba96be0ca237fea233a8957142f8fbea6"},"schema_version":"1.0"},"canonical_sha256":"57d213f4d22c8f757acb0439c8aa539c7e1a0bd535f443e762a3248cf87e33e3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:49:59.030786Z","signature_b64":"BJizDTW6RT4c9JC6ZhyBEzkmwzRoDoxWSa6ZFu0qn3phBLDEYFAENwB+/2HPFbwxiq6kECJcx1gz10TN5duDBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"57d213f4d22c8f757acb0439c8aa539c7e1a0bd535f443e762a3248cf87e33e3","last_reissued_at":"2026-05-17T23:49:59.030159Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:49:59.030159Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.11816","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-05-17T23:49:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XX9KaNeqwCqU4HveU/FC0YZCW5oJnPGyrPIIKHZwxh8YZqIKNFlQiMYC1OB45RlrTo6sSak9Jo2xPNw5/e6HDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T21:40:49.461875Z"},"content_sha256":"eda530658ff58a407b69b8064b013aa3506ca2ffa86bf63338f5847656a389cf","schema_version":"1.0","event_id":"sha256:eda530658ff58a407b69b8064b013aa3506ca2ffa86bf63338f5847656a389cf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:K7JBH5GSFSHXK6WLAQ44RKSTTR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"FastFCN: Rethinking Dilated Convolution in the Backbone for Semantic Segmentation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Huikai Wu, Junge Zhang, Kaiqi Huang, Kongming Liang, Yizhou Yu","submitted_at":"2019-03-28T07:49:36Z","abstract_excerpt":"Modern approaches for semantic segmentation usually employ dilated convolutions in the backbone to extract high-resolution feature maps, which brings heavy computation complexity and memory footprint. To replace the time and memory consuming dilated convolutions, we propose a novel joint upsampling module named Joint Pyramid Upsampling (JPU) by formulating the task of extracting high-resolution feature maps into a joint upsampling problem. With the proposed JPU, our method reduces the computation complexity by more than three times without performance loss. Experiments show that JPU is superio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.11816","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":""},"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-17T23:49:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nXDiaDhU2/mF7IIkxV+p4qxlhlFy8bVt8/jVqspMwadUZy5CRHfpXy111hONZdRn1WrDtApJlAnK/8zm7LHfAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T21:40:49.462505Z"},"content_sha256":"da91a7d35aedd2882f1594ca1463c64a59533cda62f55edbd12edd7bdec184c1","schema_version":"1.0","event_id":"sha256:da91a7d35aedd2882f1594ca1463c64a59533cda62f55edbd12edd7bdec184c1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/K7JBH5GSFSHXK6WLAQ44RKSTTR/bundle.json","state_url":"https://pith.science/pith/K7JBH5GSFSHXK6WLAQ44RKSTTR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/K7JBH5GSFSHXK6WLAQ44RKSTTR/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-25T21:40:49Z","links":{"resolver":"https://pith.science/pith/K7JBH5GSFSHXK6WLAQ44RKSTTR","bundle":"https://pith.science/pith/K7JBH5GSFSHXK6WLAQ44RKSTTR/bundle.json","state":"https://pith.science/pith/K7JBH5GSFSHXK6WLAQ44RKSTTR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/K7JBH5GSFSHXK6WLAQ44RKSTTR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:K7JBH5GSFSHXK6WLAQ44RKSTTR","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":"520e3e868b86e13b37900b63fe5d433ba96be0ca237fea233a8957142f8fbea6","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2019-03-28T07:49:36Z","title_canon_sha256":"00506553221a536b0e4d919856ff67c56ac5d12b9db4ba47108f0b648f3e49d6"},"schema_version":"1.0","source":{"id":"1903.11816","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.11816","created_at":"2026-05-17T23:49:59Z"},{"alias_kind":"arxiv_version","alias_value":"1903.11816v1","created_at":"2026-05-17T23:49:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.11816","created_at":"2026-05-17T23:49:59Z"},{"alias_kind":"pith_short_12","alias_value":"K7JBH5GSFSHX","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"K7JBH5GSFSHXK6WL","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"K7JBH5GS","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:da91a7d35aedd2882f1594ca1463c64a59533cda62f55edbd12edd7bdec184c1","target":"graph","created_at":"2026-05-17T23:49:59Z","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":"Modern approaches for semantic segmentation usually employ dilated convolutions in the backbone to extract high-resolution feature maps, which brings heavy computation complexity and memory footprint. To replace the time and memory consuming dilated convolutions, we propose a novel joint upsampling module named Joint Pyramid Upsampling (JPU) by formulating the task of extracting high-resolution feature maps into a joint upsampling problem. With the proposed JPU, our method reduces the computation complexity by more than three times without performance loss. Experiments show that JPU is superio","authors_text":"Huikai Wu, Junge Zhang, Kaiqi Huang, Kongming Liang, Yizhou Yu","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2019-03-28T07:49:36Z","title":"FastFCN: Rethinking Dilated Convolution in the Backbone for Semantic Segmentation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.11816","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:eda530658ff58a407b69b8064b013aa3506ca2ffa86bf63338f5847656a389cf","target":"record","created_at":"2026-05-17T23:49:59Z","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":"520e3e868b86e13b37900b63fe5d433ba96be0ca237fea233a8957142f8fbea6","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2019-03-28T07:49:36Z","title_canon_sha256":"00506553221a536b0e4d919856ff67c56ac5d12b9db4ba47108f0b648f3e49d6"},"schema_version":"1.0","source":{"id":"1903.11816","kind":"arxiv","version":1}},"canonical_sha256":"57d213f4d22c8f757acb0439c8aa539c7e1a0bd535f443e762a3248cf87e33e3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"57d213f4d22c8f757acb0439c8aa539c7e1a0bd535f443e762a3248cf87e33e3","first_computed_at":"2026-05-17T23:49:59.030159Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:49:59.030159Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BJizDTW6RT4c9JC6ZhyBEzkmwzRoDoxWSa6ZFu0qn3phBLDEYFAENwB+/2HPFbwxiq6kECJcx1gz10TN5duDBw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:49:59.030786Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.11816","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eda530658ff58a407b69b8064b013aa3506ca2ffa86bf63338f5847656a389cf","sha256:da91a7d35aedd2882f1594ca1463c64a59533cda62f55edbd12edd7bdec184c1"],"state_sha256":"a9fc4a0bf901848b8c032cfbb89f50aac707abf34e4fb384bdd75ea5ade6ccc0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DK3OTubTq8hmdr1m1v4S+po3Ha0n17vyzmGbPWoxSr2nnfSDX9ExDxkRuXtoDadaDkbAmm5QOSzeUKcKVf7wDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T21:40:49.465292Z","bundle_sha256":"345cba708b68afd35ecf313b444fba27d30d990527c5540b0129d55b761cf103"}}