{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:AEE5HK2YNV4C2GX4UODGXM4SHD","short_pith_number":"pith:AEE5HK2Y","canonical_record":{"source":{"id":"1605.06431","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-05-20T16:44:03Z","cross_cats_sorted":["cs.AI","cs.LG","cs.NE"],"title_canon_sha256":"e945935079a74c32cbf9ca153f3cdf2bd19aef7b3e1122b31540966a1a0b48ff","abstract_canon_sha256":"2d72badd95e1bee8405bab52981a3f28f665a329497a0d292d5a9138191765d5"},"schema_version":"1.0"},"canonical_sha256":"0109d3ab586d782d1afca3866bb39238fb1261cd10d47ce20b0d73c8166c53c3","source":{"kind":"arxiv","id":"1605.06431","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.06431","created_at":"2026-05-18T01:01:08Z"},{"alias_kind":"arxiv_version","alias_value":"1605.06431v2","created_at":"2026-05-18T01:01:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.06431","created_at":"2026-05-18T01:01:08Z"},{"alias_kind":"pith_short_12","alias_value":"AEE5HK2YNV4C","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"AEE5HK2YNV4C2GX4","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"AEE5HK2Y","created_at":"2026-05-18T12:30:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:AEE5HK2YNV4C2GX4UODGXM4SHD","target":"record","payload":{"canonical_record":{"source":{"id":"1605.06431","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-05-20T16:44:03Z","cross_cats_sorted":["cs.AI","cs.LG","cs.NE"],"title_canon_sha256":"e945935079a74c32cbf9ca153f3cdf2bd19aef7b3e1122b31540966a1a0b48ff","abstract_canon_sha256":"2d72badd95e1bee8405bab52981a3f28f665a329497a0d292d5a9138191765d5"},"schema_version":"1.0"},"canonical_sha256":"0109d3ab586d782d1afca3866bb39238fb1261cd10d47ce20b0d73c8166c53c3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:01:08.486136Z","signature_b64":"B+WRqN8KiGASy+J9y2m+vUnk6OcdlxyCo+jZRdKAZDjPDGVG0MEybJbkBoEKV+tQFgVvHiWiwLaTqzNQdgTqCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0109d3ab586d782d1afca3866bb39238fb1261cd10d47ce20b0d73c8166c53c3","last_reissued_at":"2026-05-18T01:01:08.485635Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:01:08.485635Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.06431","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-18T01:01:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AYJj10vGeKVNarLR6BNmTkRaEr5Cb/xylWs0iUU42YQg+8f9hS7zLUNiRyoGircG3fbaMkClSHPmkcWLlmrYBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T04:15:57.713276Z"},"content_sha256":"55af174f68e3f0bff88f037792d01b6385fa7d4d6475467d7e020e0d9110b4fd","schema_version":"1.0","event_id":"sha256:55af174f68e3f0bff88f037792d01b6385fa7d4d6475467d7e020e0d9110b4fd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:AEE5HK2YNV4C2GX4UODGXM4SHD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Residual Networks Behave Like Ensembles of Relatively Shallow Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG","cs.NE"],"primary_cat":"cs.CV","authors_text":"Andreas Veit, Michael Wilber, Serge Belongie","submitted_at":"2016-05-20T16:44:03Z","abstract_excerpt":"In this work we propose a novel interpretation of residual networks showing that they can be seen as a collection of many paths of differing length. Moreover, residual networks seem to enable very deep networks by leveraging only the short paths during training. To support this observation, we rewrite residual networks as an explicit collection of paths. Unlike traditional models, paths through residual networks vary in length. Further, a lesion study reveals that these paths show ensemble-like behavior in the sense that they do not strongly depend on each other. Finally, and most surprising, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.06431","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-18T01:01:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MEPZibpifgO7q9QzRytK4CRQk2/B8R1trIB8DQl41oCn6JW6MR6ZsJsoNkU9K3YicTQg2pxR8FrZ9wrfu4EdAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T04:15:57.713641Z"},"content_sha256":"b19611b4fcd4d7e41ae61b15a80e4bee83e9a92b53f0577d6af1d5d47636dc72","schema_version":"1.0","event_id":"sha256:b19611b4fcd4d7e41ae61b15a80e4bee83e9a92b53f0577d6af1d5d47636dc72"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AEE5HK2YNV4C2GX4UODGXM4SHD/bundle.json","state_url":"https://pith.science/pith/AEE5HK2YNV4C2GX4UODGXM4SHD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AEE5HK2YNV4C2GX4UODGXM4SHD/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-28T04:15:57Z","links":{"resolver":"https://pith.science/pith/AEE5HK2YNV4C2GX4UODGXM4SHD","bundle":"https://pith.science/pith/AEE5HK2YNV4C2GX4UODGXM4SHD/bundle.json","state":"https://pith.science/pith/AEE5HK2YNV4C2GX4UODGXM4SHD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AEE5HK2YNV4C2GX4UODGXM4SHD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:AEE5HK2YNV4C2GX4UODGXM4SHD","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":"2d72badd95e1bee8405bab52981a3f28f665a329497a0d292d5a9138191765d5","cross_cats_sorted":["cs.AI","cs.LG","cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-05-20T16:44:03Z","title_canon_sha256":"e945935079a74c32cbf9ca153f3cdf2bd19aef7b3e1122b31540966a1a0b48ff"},"schema_version":"1.0","source":{"id":"1605.06431","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.06431","created_at":"2026-05-18T01:01:08Z"},{"alias_kind":"arxiv_version","alias_value":"1605.06431v2","created_at":"2026-05-18T01:01:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.06431","created_at":"2026-05-18T01:01:08Z"},{"alias_kind":"pith_short_12","alias_value":"AEE5HK2YNV4C","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"AEE5HK2YNV4C2GX4","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"AEE5HK2Y","created_at":"2026-05-18T12:30:07Z"}],"graph_snapshots":[{"event_id":"sha256:b19611b4fcd4d7e41ae61b15a80e4bee83e9a92b53f0577d6af1d5d47636dc72","target":"graph","created_at":"2026-05-18T01:01:08Z","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":"In this work we propose a novel interpretation of residual networks showing that they can be seen as a collection of many paths of differing length. Moreover, residual networks seem to enable very deep networks by leveraging only the short paths during training. To support this observation, we rewrite residual networks as an explicit collection of paths. Unlike traditional models, paths through residual networks vary in length. Further, a lesion study reveals that these paths show ensemble-like behavior in the sense that they do not strongly depend on each other. Finally, and most surprising, ","authors_text":"Andreas Veit, Michael Wilber, Serge Belongie","cross_cats":["cs.AI","cs.LG","cs.NE"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-05-20T16:44:03Z","title":"Residual Networks Behave Like Ensembles of Relatively Shallow Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.06431","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:55af174f68e3f0bff88f037792d01b6385fa7d4d6475467d7e020e0d9110b4fd","target":"record","created_at":"2026-05-18T01:01:08Z","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":"2d72badd95e1bee8405bab52981a3f28f665a329497a0d292d5a9138191765d5","cross_cats_sorted":["cs.AI","cs.LG","cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-05-20T16:44:03Z","title_canon_sha256":"e945935079a74c32cbf9ca153f3cdf2bd19aef7b3e1122b31540966a1a0b48ff"},"schema_version":"1.0","source":{"id":"1605.06431","kind":"arxiv","version":2}},"canonical_sha256":"0109d3ab586d782d1afca3866bb39238fb1261cd10d47ce20b0d73c8166c53c3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0109d3ab586d782d1afca3866bb39238fb1261cd10d47ce20b0d73c8166c53c3","first_computed_at":"2026-05-18T01:01:08.485635Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:01:08.485635Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"B+WRqN8KiGASy+J9y2m+vUnk6OcdlxyCo+jZRdKAZDjPDGVG0MEybJbkBoEKV+tQFgVvHiWiwLaTqzNQdgTqCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:01:08.486136Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.06431","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:55af174f68e3f0bff88f037792d01b6385fa7d4d6475467d7e020e0d9110b4fd","sha256:b19611b4fcd4d7e41ae61b15a80e4bee83e9a92b53f0577d6af1d5d47636dc72"],"state_sha256":"5be302f1d83ae32fff8e230a6daa32c17fdc554ba17c8edcdb316c540275d6e8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7+zVSwHoRbkTiPq9x7/CzthH+eFqioRRohyNJ2YoJ9OyS5B95DOML0jj1WsfREHLv5ZNJvLZ6l081qOox3mtAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T04:15:57.715639Z","bundle_sha256":"b1ed8edb6a77866c304bcfe4d4ecc84341e948aba2b5b3a01ea758fc2f1ecf89"}}