{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:I4PTREJQRK7YVOKILZ24BUYOT2","short_pith_number":"pith:I4PTREJQ","canonical_record":{"source":{"id":"1702.08782","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-02-28T13:37:59Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"707168001177758d06b858f0036769a10c7432ebaefe4be0698f3c4fdcc15f2a","abstract_canon_sha256":"b37aa69aeac41cff8b1c0eef104f796eb7e7f8b8ccfd69d14ad9fe0f7358ad6e"},"schema_version":"1.0"},"canonical_sha256":"471f3891308abf8ab9485e75c0d30e9ead562a36a612187456f0af17533e5c4b","source":{"kind":"arxiv","id":"1702.08782","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.08782","created_at":"2026-05-18T00:49:31Z"},{"alias_kind":"arxiv_version","alias_value":"1702.08782v2","created_at":"2026-05-18T00:49:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.08782","created_at":"2026-05-18T00:49:31Z"},{"alias_kind":"pith_short_12","alias_value":"I4PTREJQRK7Y","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"I4PTREJQRK7YVOKI","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"I4PTREJQ","created_at":"2026-05-18T12:31:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:I4PTREJQRK7YVOKILZ24BUYOT2","target":"record","payload":{"canonical_record":{"source":{"id":"1702.08782","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-02-28T13:37:59Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"707168001177758d06b858f0036769a10c7432ebaefe4be0698f3c4fdcc15f2a","abstract_canon_sha256":"b37aa69aeac41cff8b1c0eef104f796eb7e7f8b8ccfd69d14ad9fe0f7358ad6e"},"schema_version":"1.0"},"canonical_sha256":"471f3891308abf8ab9485e75c0d30e9ead562a36a612187456f0af17533e5c4b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:31.259544Z","signature_b64":"kDdYbFlUChcc7MvTklUgDbNCyrSquoAganBENzGTNDy9flBPJWKnxYx7o8WZsf63Lrkaa3IqZSkehFNY9h49BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"471f3891308abf8ab9485e75c0d30e9ead562a36a612187456f0af17533e5c4b","last_reissued_at":"2026-05-18T00:49:31.258789Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:31.258789Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.08782","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:49:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"otBPd9HdqEAxddttTkJrXtK2LpSRz1gemes0feuVun8uI0fggM/S0LUoIwhoFsfFhLXvkEppvOQApUqO8vVVDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T04:27:46.234020Z"},"content_sha256":"1b2136c0b186b1516cc39e4f78a8ea4001345801343b946fbbeb7617a6118256","schema_version":"1.0","event_id":"sha256:1b2136c0b186b1516cc39e4f78a8ea4001345801343b946fbbeb7617a6118256"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:I4PTREJQRK7YVOKILZ24BUYOT2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"ShaResNet: reducing residual network parameter number by sharing weights","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CV","authors_text":"Alexandre Boulch","submitted_at":"2017-02-28T13:37:59Z","abstract_excerpt":"Deep Residual Networks have reached the state of the art in many image processing tasks such image classification. However, the cost for a gain in accuracy in terms of depth and memory is prohibitive as it requires a higher number of residual blocks, up to double the initial value. To tackle this problem, we propose in this paper a way to reduce the redundant information of the networks. We share the weights of convolutional layers between residual blocks operating at the same spatial scale. The signal flows multiple times in the same convolutional layer. The resulting architecture, called Sha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.08782","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:49:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t+9pnkMeuVeO2qutsw0dmj40oHYOdMrzI32YgPrK/3Mfw7fHSS25zr1XQzLIwYLx8DNtpfKq8Fkq171JHkDLAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T04:27:46.234381Z"},"content_sha256":"3014b81795138bf6b84c6a3a687bd5d4de43e2ab96d621881e4888daf3646366","schema_version":"1.0","event_id":"sha256:3014b81795138bf6b84c6a3a687bd5d4de43e2ab96d621881e4888daf3646366"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/I4PTREJQRK7YVOKILZ24BUYOT2/bundle.json","state_url":"https://pith.science/pith/I4PTREJQRK7YVOKILZ24BUYOT2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/I4PTREJQRK7YVOKILZ24BUYOT2/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-06-20T04:27:46Z","links":{"resolver":"https://pith.science/pith/I4PTREJQRK7YVOKILZ24BUYOT2","bundle":"https://pith.science/pith/I4PTREJQRK7YVOKILZ24BUYOT2/bundle.json","state":"https://pith.science/pith/I4PTREJQRK7YVOKILZ24BUYOT2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/I4PTREJQRK7YVOKILZ24BUYOT2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:I4PTREJQRK7YVOKILZ24BUYOT2","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":"b37aa69aeac41cff8b1c0eef104f796eb7e7f8b8ccfd69d14ad9fe0f7358ad6e","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-02-28T13:37:59Z","title_canon_sha256":"707168001177758d06b858f0036769a10c7432ebaefe4be0698f3c4fdcc15f2a"},"schema_version":"1.0","source":{"id":"1702.08782","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.08782","created_at":"2026-05-18T00:49:31Z"},{"alias_kind":"arxiv_version","alias_value":"1702.08782v2","created_at":"2026-05-18T00:49:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.08782","created_at":"2026-05-18T00:49:31Z"},{"alias_kind":"pith_short_12","alias_value":"I4PTREJQRK7Y","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"I4PTREJQRK7YVOKI","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"I4PTREJQ","created_at":"2026-05-18T12:31:21Z"}],"graph_snapshots":[{"event_id":"sha256:3014b81795138bf6b84c6a3a687bd5d4de43e2ab96d621881e4888daf3646366","target":"graph","created_at":"2026-05-18T00:49: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":"Deep Residual Networks have reached the state of the art in many image processing tasks such image classification. However, the cost for a gain in accuracy in terms of depth and memory is prohibitive as it requires a higher number of residual blocks, up to double the initial value. To tackle this problem, we propose in this paper a way to reduce the redundant information of the networks. We share the weights of convolutional layers between residual blocks operating at the same spatial scale. The signal flows multiple times in the same convolutional layer. The resulting architecture, called Sha","authors_text":"Alexandre Boulch","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-02-28T13:37:59Z","title":"ShaResNet: reducing residual network parameter number by sharing weights"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.08782","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:1b2136c0b186b1516cc39e4f78a8ea4001345801343b946fbbeb7617a6118256","target":"record","created_at":"2026-05-18T00:49: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":"b37aa69aeac41cff8b1c0eef104f796eb7e7f8b8ccfd69d14ad9fe0f7358ad6e","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-02-28T13:37:59Z","title_canon_sha256":"707168001177758d06b858f0036769a10c7432ebaefe4be0698f3c4fdcc15f2a"},"schema_version":"1.0","source":{"id":"1702.08782","kind":"arxiv","version":2}},"canonical_sha256":"471f3891308abf8ab9485e75c0d30e9ead562a36a612187456f0af17533e5c4b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"471f3891308abf8ab9485e75c0d30e9ead562a36a612187456f0af17533e5c4b","first_computed_at":"2026-05-18T00:49:31.258789Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:49:31.258789Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kDdYbFlUChcc7MvTklUgDbNCyrSquoAganBENzGTNDy9flBPJWKnxYx7o8WZsf63Lrkaa3IqZSkehFNY9h49BA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:49:31.259544Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.08782","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1b2136c0b186b1516cc39e4f78a8ea4001345801343b946fbbeb7617a6118256","sha256:3014b81795138bf6b84c6a3a687bd5d4de43e2ab96d621881e4888daf3646366"],"state_sha256":"0428187604c1af873e9f5dcf7806b8e7329768c6eb99fa102a9841dfac6540f6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s4RVfSpUt/kXOx01WYN4ol9+MNjo+d/XztMOh+X3HXckDQWYw67Lnnquup0VbrDbqpe7GeN2Tcv20w5Wt4b9Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T04:27:46.236310Z","bundle_sha256":"0b21ed607017171772bb727cf695964a1d8816d18fd8f550be55879056158065"}}