{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:SF5SLGWI363HCTTUA2EGAP4RJX","short_pith_number":"pith:SF5SLGWI","schema_version":"1.0","canonical_sha256":"917b259ac8dfb6714e740688603f914de846dfdf7ff7975350b3c2754294b8e0","source":{"kind":"arxiv","id":"1910.00780","version":3},"attestation_state":"computed","paper":{"title":"How does topology influence gradient propagation and model performance of deep networks with DenseNet-type skip connections?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.LG"],"primary_cat":"stat.ML","authors_text":"Guihong Li, Kartikeya Bhardwaj, Radu Marculescu","submitted_at":"2019-10-02T05:25:47Z","abstract_excerpt":"DenseNets introduce concatenation-type skip connections that achieve state-of-the-art accuracy in several computer vision tasks. In this paper, we reveal that the topology of the concatenation-type skip connections is closely related to the gradient propagation which, in turn, enables a predictable behavior of DNNs' test performance. To this end, we introduce a new metric called NN-Mass to quantify how effectively information flows through DNNs. Moreover, we empirically show that NN-Mass also works for other types of skip connections, e.g., for ResNets, Wide-ResNets (WRNs), and MobileNets, whi"},"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":"1910.00780","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-10-02T05:25:47Z","cross_cats_sorted":["cs.CV","cs.LG"],"title_canon_sha256":"9c7a75d76526917a18a5d2fac34027f848677f488ea7b0faa39a3566e15fd494","abstract_canon_sha256":"8af315d8c09e07a7f87556175ba6a7cd7ae99757e8d0079ed99d233e0b00f828"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:28:15.620489Z","signature_b64":"67aLwEh32ABN2bH+i1YcBrCFRAC2x5SZK61JbXYgRSDlTWsj8/O6de3Ej+y/TSrC37GSsBqVyD7qAWpLNyBMAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"917b259ac8dfb6714e740688603f914de846dfdf7ff7975350b3c2754294b8e0","last_reissued_at":"2026-07-05T02:28:15.620028Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:28:15.620028Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"How does topology influence gradient propagation and model performance of deep networks with DenseNet-type skip connections?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.LG"],"primary_cat":"stat.ML","authors_text":"Guihong Li, Kartikeya Bhardwaj, Radu Marculescu","submitted_at":"2019-10-02T05:25:47Z","abstract_excerpt":"DenseNets introduce concatenation-type skip connections that achieve state-of-the-art accuracy in several computer vision tasks. In this paper, we reveal that the topology of the concatenation-type skip connections is closely related to the gradient propagation which, in turn, enables a predictable behavior of DNNs' test performance. To this end, we introduce a new metric called NN-Mass to quantify how effectively information flows through DNNs. Moreover, we empirically show that NN-Mass also works for other types of skip connections, e.g., for ResNets, Wide-ResNets (WRNs), and MobileNets, whi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1910.00780","kind":"arxiv","version":3},"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.00780/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1910.00780","created_at":"2026-07-05T02:28:15.620087+00:00"},{"alias_kind":"arxiv_version","alias_value":"1910.00780v3","created_at":"2026-07-05T02:28:15.620087+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1910.00780","created_at":"2026-07-05T02:28:15.620087+00:00"},{"alias_kind":"pith_short_12","alias_value":"SF5SLGWI363H","created_at":"2026-07-05T02:28:15.620087+00:00"},{"alias_kind":"pith_short_16","alias_value":"SF5SLGWI363HCTTU","created_at":"2026-07-05T02:28:15.620087+00:00"},{"alias_kind":"pith_short_8","alias_value":"SF5SLGWI","created_at":"2026-07-05T02:28:15.620087+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.11768","citing_title":"No More Adam: Learning Rate Scaling at Initialization is All You Need","ref_index":7,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SF5SLGWI363HCTTUA2EGAP4RJX","json":"https://pith.science/pith/SF5SLGWI363HCTTUA2EGAP4RJX.json","graph_json":"https://pith.science/api/pith-number/SF5SLGWI363HCTTUA2EGAP4RJX/graph.json","events_json":"https://pith.science/api/pith-number/SF5SLGWI363HCTTUA2EGAP4RJX/events.json","paper":"https://pith.science/paper/SF5SLGWI"},"agent_actions":{"view_html":"https://pith.science/pith/SF5SLGWI363HCTTUA2EGAP4RJX","download_json":"https://pith.science/pith/SF5SLGWI363HCTTUA2EGAP4RJX.json","view_paper":"https://pith.science/paper/SF5SLGWI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1910.00780&json=true","fetch_graph":"https://pith.science/api/pith-number/SF5SLGWI363HCTTUA2EGAP4RJX/graph.json","fetch_events":"https://pith.science/api/pith-number/SF5SLGWI363HCTTUA2EGAP4RJX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SF5SLGWI363HCTTUA2EGAP4RJX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SF5SLGWI363HCTTUA2EGAP4RJX/action/storage_attestation","attest_author":"https://pith.science/pith/SF5SLGWI363HCTTUA2EGAP4RJX/action/author_attestation","sign_citation":"https://pith.science/pith/SF5SLGWI363HCTTUA2EGAP4RJX/action/citation_signature","submit_replication":"https://pith.science/pith/SF5SLGWI363HCTTUA2EGAP4RJX/action/replication_record"}},"created_at":"2026-07-05T02:28:15.620087+00:00","updated_at":"2026-07-05T02:28:15.620087+00:00"}