{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:SVFJ4EM47DIEWBJLV6CNZNJQLK","short_pith_number":"pith:SVFJ4EM4","schema_version":"1.0","canonical_sha256":"954a9e119cf8d04b052baf84dcb5305a9ac56949d818da2b89a9e19c9770392a","source":{"kind":"arxiv","id":"1611.07718","version":2},"attestation_state":"computed","paper":{"title":"Deep Convolutional Neural Networks with Merge-and-Run Mappings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Jingdong Wang, Liming Zhao, Wenjun Zeng, Xi Li, Zhuowen Tu","submitted_at":"2016-11-23T10:08:40Z","abstract_excerpt":"A deep residual network, built by stacking a sequence of residual blocks, is easy to train, because identity mappings skip residual branches and thus improve information flow. To further reduce the training difficulty, we present a simple network architecture, deep merge-and-run neural networks. The novelty lies in a modularized building block, merge-and-run block, which assembles residual branches in parallel through a merge-and-run mapping: Average the inputs of these residual branches (Merge), and add the average to the output of each residual branch as the input of the subsequent residual "},"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":"1611.07718","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-11-23T10:08:40Z","cross_cats_sorted":[],"title_canon_sha256":"c7701b1b6481cbc425e598c1c306269da4b60ced4a243c4531f4e77ac3f6c647","abstract_canon_sha256":"8a4029210736d6690d6613da712fd58e51861a5ba32c3e0b9ba3cf1052df8b66"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:58.352690Z","signature_b64":"CdqwX8ifmMrP/4MPd2KqWtcSsxHRXT85Z89WqxkZ0wZWUo5+1UGL9tQQ2gRolHO2UPpWm4FWh5EJJiGbEtcqBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"954a9e119cf8d04b052baf84dcb5305a9ac56949d818da2b89a9e19c9770392a","last_reissued_at":"2026-05-18T00:39:58.352182Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:58.352182Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deep Convolutional Neural Networks with Merge-and-Run Mappings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Jingdong Wang, Liming Zhao, Wenjun Zeng, Xi Li, Zhuowen Tu","submitted_at":"2016-11-23T10:08:40Z","abstract_excerpt":"A deep residual network, built by stacking a sequence of residual blocks, is easy to train, because identity mappings skip residual branches and thus improve information flow. To further reduce the training difficulty, we present a simple network architecture, deep merge-and-run neural networks. The novelty lies in a modularized building block, merge-and-run block, which assembles residual branches in parallel through a merge-and-run mapping: Average the inputs of these residual branches (Merge), and add the average to the output of each residual branch as the input of the subsequent residual "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.07718","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":"1611.07718","created_at":"2026-05-18T00:39:58.352253+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.07718v2","created_at":"2026-05-18T00:39:58.352253+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.07718","created_at":"2026-05-18T00:39:58.352253+00:00"},{"alias_kind":"pith_short_12","alias_value":"SVFJ4EM47DIE","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_16","alias_value":"SVFJ4EM47DIEWBJL","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_8","alias_value":"SVFJ4EM4","created_at":"2026-05-18T12:30:44.179134+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SVFJ4EM47DIEWBJLV6CNZNJQLK","json":"https://pith.science/pith/SVFJ4EM47DIEWBJLV6CNZNJQLK.json","graph_json":"https://pith.science/api/pith-number/SVFJ4EM47DIEWBJLV6CNZNJQLK/graph.json","events_json":"https://pith.science/api/pith-number/SVFJ4EM47DIEWBJLV6CNZNJQLK/events.json","paper":"https://pith.science/paper/SVFJ4EM4"},"agent_actions":{"view_html":"https://pith.science/pith/SVFJ4EM47DIEWBJLV6CNZNJQLK","download_json":"https://pith.science/pith/SVFJ4EM47DIEWBJLV6CNZNJQLK.json","view_paper":"https://pith.science/paper/SVFJ4EM4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.07718&json=true","fetch_graph":"https://pith.science/api/pith-number/SVFJ4EM47DIEWBJLV6CNZNJQLK/graph.json","fetch_events":"https://pith.science/api/pith-number/SVFJ4EM47DIEWBJLV6CNZNJQLK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SVFJ4EM47DIEWBJLV6CNZNJQLK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SVFJ4EM47DIEWBJLV6CNZNJQLK/action/storage_attestation","attest_author":"https://pith.science/pith/SVFJ4EM47DIEWBJLV6CNZNJQLK/action/author_attestation","sign_citation":"https://pith.science/pith/SVFJ4EM47DIEWBJLV6CNZNJQLK/action/citation_signature","submit_replication":"https://pith.science/pith/SVFJ4EM47DIEWBJLV6CNZNJQLK/action/replication_record"}},"created_at":"2026-05-18T00:39:58.352253+00:00","updated_at":"2026-05-18T00:39:58.352253+00:00"}