{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:OXNMULVY4FJ6QRIBMEIDIS6UH5","short_pith_number":"pith:OXNMULVY","schema_version":"1.0","canonical_sha256":"75daca2eb8e153e845016110344bd43f6b1d814e70b238cf654b88e2053011ac","source":{"kind":"arxiv","id":"1806.07568","version":1},"attestation_state":"computed","paper":{"title":"Doubly Nested Network for Resource-Efficient Inference","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","stat.ML"],"primary_cat":"cs.LG","authors_text":"Jaehong Kim, Jiwon Kim, Sungeun Hong, Yongseok Choi","submitted_at":"2018-06-20T06:11:35Z","abstract_excerpt":"We propose doubly nested network(DNNet) where all neurons represent their own sub-models that solve the same task. Every sub-model is nested both layer-wise and channel-wise. While nesting sub-models layer-wise is straight-forward with deep-supervision as proposed in \\cite{xie2015holistically}, channel-wise nesting has not been explored in the literature to our best knowledge. Channel-wise nesting is non-trivial as neurons between consecutive layers are all connected to each other. In this work, we introduce a technique to solve this problem by sorting channels topologically and connecting neu"},"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":"1806.07568","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-06-20T06:11:35Z","cross_cats_sorted":["cs.CV","stat.ML"],"title_canon_sha256":"c7b8b77bae258853009387d45b65aa6c4638f40f088110c97460569ebd0f5f8f","abstract_canon_sha256":"832ecbeb1a4e6d04d61620dab508d56fca0402bba8a9fb9d88aaa939547a055f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:47.372183Z","signature_b64":"lduul7+2rPQCkCmdKuH5QikK3WqwAFAUZVkQYuYuQ0R1fPce8IT2PC4rc4o3nRI0MldosHaTzKgL0xHWwxo+CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"75daca2eb8e153e845016110344bd43f6b1d814e70b238cf654b88e2053011ac","last_reissued_at":"2026-05-18T00:12:47.371446Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:47.371446Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Doubly Nested Network for Resource-Efficient Inference","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","stat.ML"],"primary_cat":"cs.LG","authors_text":"Jaehong Kim, Jiwon Kim, Sungeun Hong, Yongseok Choi","submitted_at":"2018-06-20T06:11:35Z","abstract_excerpt":"We propose doubly nested network(DNNet) where all neurons represent their own sub-models that solve the same task. Every sub-model is nested both layer-wise and channel-wise. While nesting sub-models layer-wise is straight-forward with deep-supervision as proposed in \\cite{xie2015holistically}, channel-wise nesting has not been explored in the literature to our best knowledge. Channel-wise nesting is non-trivial as neurons between consecutive layers are all connected to each other. In this work, we introduce a technique to solve this problem by sorting channels topologically and connecting neu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.07568","kind":"arxiv","version":1},"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":"1806.07568","created_at":"2026-05-18T00:12:47.371561+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.07568v1","created_at":"2026-05-18T00:12:47.371561+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.07568","created_at":"2026-05-18T00:12:47.371561+00:00"},{"alias_kind":"pith_short_12","alias_value":"OXNMULVY4FJ6","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_16","alias_value":"OXNMULVY4FJ6QRIB","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_8","alias_value":"OXNMULVY","created_at":"2026-05-18T12:32:43.782077+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/OXNMULVY4FJ6QRIBMEIDIS6UH5","json":"https://pith.science/pith/OXNMULVY4FJ6QRIBMEIDIS6UH5.json","graph_json":"https://pith.science/api/pith-number/OXNMULVY4FJ6QRIBMEIDIS6UH5/graph.json","events_json":"https://pith.science/api/pith-number/OXNMULVY4FJ6QRIBMEIDIS6UH5/events.json","paper":"https://pith.science/paper/OXNMULVY"},"agent_actions":{"view_html":"https://pith.science/pith/OXNMULVY4FJ6QRIBMEIDIS6UH5","download_json":"https://pith.science/pith/OXNMULVY4FJ6QRIBMEIDIS6UH5.json","view_paper":"https://pith.science/paper/OXNMULVY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.07568&json=true","fetch_graph":"https://pith.science/api/pith-number/OXNMULVY4FJ6QRIBMEIDIS6UH5/graph.json","fetch_events":"https://pith.science/api/pith-number/OXNMULVY4FJ6QRIBMEIDIS6UH5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OXNMULVY4FJ6QRIBMEIDIS6UH5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OXNMULVY4FJ6QRIBMEIDIS6UH5/action/storage_attestation","attest_author":"https://pith.science/pith/OXNMULVY4FJ6QRIBMEIDIS6UH5/action/author_attestation","sign_citation":"https://pith.science/pith/OXNMULVY4FJ6QRIBMEIDIS6UH5/action/citation_signature","submit_replication":"https://pith.science/pith/OXNMULVY4FJ6QRIBMEIDIS6UH5/action/replication_record"}},"created_at":"2026-05-18T00:12:47.371561+00:00","updated_at":"2026-05-18T00:12:47.371561+00:00"}