{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:QKTGCOZOLMTGU4FTF3HOZZLLOE","short_pith_number":"pith:QKTGCOZO","schema_version":"1.0","canonical_sha256":"82a6613b2e5b266a70b32eceece56b7109500d0482c66f5652e247cf30d89d6c","source":{"kind":"arxiv","id":"1608.06993","version":5},"attestation_state":"computed","paper":{"title":"Densely Connected Convolutional Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CV","authors_text":"Gao Huang, Kilian Q. Weinberger, Laurens van der Maaten, Zhuang Liu","submitted_at":"2016-08-25T00:44:55Z","abstract_excerpt":"Recent work has shown that convolutional networks can be substantially deeper, more accurate, and efficient to train if they contain shorter connections between layers close to the input and those close to the output. In this paper, we embrace this observation and introduce the Dense Convolutional Network (DenseNet), which connects each layer to every other layer in a feed-forward fashion. Whereas traditional convolutional networks with L layers have L connections - one between each layer and its subsequent layer - our network has L(L+1)/2 direct connections. For each layer, the feature-maps o"},"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":"1608.06993","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-08-25T00:44:55Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"4594cfa44ed2a0c487b397ab64492ad8f720eb91b7b9872a04d90cdda40bba16","abstract_canon_sha256":"ef585569090f32ed6223d3b8275aa5521b7e46a09d480dcac571c66e7f8d54ac"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:02.240347Z","signature_b64":"pdNDQq1AUUWmSwIacqoXbQ79tvAX2mi3PX72ekeAOaeCvhYcrDPF2TU91Fdms1FtE2ZP1650hX7iYlxYQB9uDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"82a6613b2e5b266a70b32eceece56b7109500d0482c66f5652e247cf30d89d6c","last_reissued_at":"2026-05-18T00:25:02.239952Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:02.239952Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Densely Connected Convolutional Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CV","authors_text":"Gao Huang, Kilian Q. Weinberger, Laurens van der Maaten, Zhuang Liu","submitted_at":"2016-08-25T00:44:55Z","abstract_excerpt":"Recent work has shown that convolutional networks can be substantially deeper, more accurate, and efficient to train if they contain shorter connections between layers close to the input and those close to the output. In this paper, we embrace this observation and introduce the Dense Convolutional Network (DenseNet), which connects each layer to every other layer in a feed-forward fashion. Whereas traditional convolutional networks with L layers have L connections - one between each layer and its subsequent layer - our network has L(L+1)/2 direct connections. For each layer, the feature-maps o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.06993","kind":"arxiv","version":5},"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":"1608.06993","created_at":"2026-05-18T00:25:02.240025+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.06993v5","created_at":"2026-05-18T00:25:02.240025+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.06993","created_at":"2026-05-18T00:25:02.240025+00:00"},{"alias_kind":"pith_short_12","alias_value":"QKTGCOZOLMTG","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_16","alias_value":"QKTGCOZOLMTGU4FT","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_8","alias_value":"QKTGCOZO","created_at":"2026-05-18T12:30:39.010887+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":10,"internal_anchor_count":6,"sample":[{"citing_arxiv_id":"2605.20009","citing_title":"Training Neural Networks with Optimal Double-Bayesian Learning","ref_index":20,"is_internal_anchor":true},{"citing_arxiv_id":"2509.03472","citing_title":"DPQuant: Efficient and Differentially-Private Model Training via Dynamic Quantization Scheduling","ref_index":20,"is_internal_anchor":true},{"citing_arxiv_id":"2509.06130","citing_title":"A general framework for knowledge integration in machine learning for electromagnetic scattering using quasinormal modes","ref_index":55,"is_internal_anchor":true},{"citing_arxiv_id":"2511.07329","citing_title":"Preparation of Fractal-Inspired Computational Architectures for Advanced Large Language Model Analysis","ref_index":5,"is_internal_anchor":true},{"citing_arxiv_id":"2512.21370","citing_title":"Detection of Lensed Gravitational Waves in the Millihertz Band Using Frequency-Domain Lensing Feature Extraction Network","ref_index":54,"is_internal_anchor":true},{"citing_arxiv_id":"2602.09524","citing_title":"HLGFA: High-Low Resolution Guided Feature Alignment for Unsupervised Anomaly Detection","ref_index":7,"is_internal_anchor":true},{"citing_arxiv_id":"2604.03203","citing_title":"PR3DICTR: A modular AI framework for medical 3D image-based detection and outcome prediction","ref_index":16,"is_internal_anchor":false},{"citing_arxiv_id":"2604.07254","citing_title":"Non-identifiability of Explanations from Model Behavior in Deep Networks of Image Authenticity Judgments","ref_index":4,"is_internal_anchor":false},{"citing_arxiv_id":"1608.03983","citing_title":"SGDR: Stochastic Gradient Descent with Warm Restarts","ref_index":9,"is_internal_anchor":false},{"citing_arxiv_id":"2604.14336","citing_title":"Mistake gating leads to energy and memory efficient continual learning","ref_index":10,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QKTGCOZOLMTGU4FTF3HOZZLLOE","json":"https://pith.science/pith/QKTGCOZOLMTGU4FTF3HOZZLLOE.json","graph_json":"https://pith.science/api/pith-number/QKTGCOZOLMTGU4FTF3HOZZLLOE/graph.json","events_json":"https://pith.science/api/pith-number/QKTGCOZOLMTGU4FTF3HOZZLLOE/events.json","paper":"https://pith.science/paper/QKTGCOZO"},"agent_actions":{"view_html":"https://pith.science/pith/QKTGCOZOLMTGU4FTF3HOZZLLOE","download_json":"https://pith.science/pith/QKTGCOZOLMTGU4FTF3HOZZLLOE.json","view_paper":"https://pith.science/paper/QKTGCOZO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.06993&json=true","fetch_graph":"https://pith.science/api/pith-number/QKTGCOZOLMTGU4FTF3HOZZLLOE/graph.json","fetch_events":"https://pith.science/api/pith-number/QKTGCOZOLMTGU4FTF3HOZZLLOE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QKTGCOZOLMTGU4FTF3HOZZLLOE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QKTGCOZOLMTGU4FTF3HOZZLLOE/action/storage_attestation","attest_author":"https://pith.science/pith/QKTGCOZOLMTGU4FTF3HOZZLLOE/action/author_attestation","sign_citation":"https://pith.science/pith/QKTGCOZOLMTGU4FTF3HOZZLLOE/action/citation_signature","submit_replication":"https://pith.science/pith/QKTGCOZOLMTGU4FTF3HOZZLLOE/action/replication_record"}},"created_at":"2026-05-18T00:25:02.240025+00:00","updated_at":"2026-05-18T00:25:02.240025+00:00"}