{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:OXNMULVY4FJ6QRIBMEIDIS6UH5","short_pith_number":"pith:OXNMULVY","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"},"canonical_sha256":"75daca2eb8e153e845016110344bd43f6b1d814e70b238cf654b88e2053011ac","source":{"kind":"arxiv","id":"1806.07568","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.07568","created_at":"2026-05-18T00:12:47Z"},{"alias_kind":"arxiv_version","alias_value":"1806.07568v1","created_at":"2026-05-18T00:12:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.07568","created_at":"2026-05-18T00:12:47Z"},{"alias_kind":"pith_short_12","alias_value":"OXNMULVY4FJ6","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"OXNMULVY4FJ6QRIB","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"OXNMULVY","created_at":"2026-05-18T12:32:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:OXNMULVY4FJ6QRIBMEIDIS6UH5","target":"record","payload":{"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"},"canonical_sha256":"75daca2eb8e153e845016110344bd43f6b1d814e70b238cf654b88e2053011ac","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"},"source_kind":"arxiv","source_id":"1806.07568","source_version":1,"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:12:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2bEwHxXaMpTOb7v9AO84ReJjVLWAxhZGWyS+yYDFESd7wQC9hvRcO9anrcm+dHIk3aX491o8G8t1PzGAUlzCAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T13:55:39.421608Z"},"content_sha256":"0c39874b1e0435290797fbcea7a7ffb03d9d3a49cbf77278e3f53b41cfad9b9e","schema_version":"1.0","event_id":"sha256:0c39874b1e0435290797fbcea7a7ffb03d9d3a49cbf77278e3f53b41cfad9b9e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:OXNMULVY4FJ6QRIBMEIDIS6UH5","target":"graph","payload":{"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"},"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:12:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y0T/I8/4PDadUQoaM/eDl++4t1BYJR053bZjmxdeO+UFnLl1esn3gxsKixC+rFCL4trNbn7/joEmHyGnbqtoCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T13:55:39.421964Z"},"content_sha256":"5e20549367019ba6870813ef336ab5953858220226f6969bd31972662f3c909b","schema_version":"1.0","event_id":"sha256:5e20549367019ba6870813ef336ab5953858220226f6969bd31972662f3c909b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OXNMULVY4FJ6QRIBMEIDIS6UH5/bundle.json","state_url":"https://pith.science/pith/OXNMULVY4FJ6QRIBMEIDIS6UH5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OXNMULVY4FJ6QRIBMEIDIS6UH5/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-02T13:55:39Z","links":{"resolver":"https://pith.science/pith/OXNMULVY4FJ6QRIBMEIDIS6UH5","bundle":"https://pith.science/pith/OXNMULVY4FJ6QRIBMEIDIS6UH5/bundle.json","state":"https://pith.science/pith/OXNMULVY4FJ6QRIBMEIDIS6UH5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OXNMULVY4FJ6QRIBMEIDIS6UH5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:OXNMULVY4FJ6QRIBMEIDIS6UH5","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":"832ecbeb1a4e6d04d61620dab508d56fca0402bba8a9fb9d88aaa939547a055f","cross_cats_sorted":["cs.CV","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-06-20T06:11:35Z","title_canon_sha256":"c7b8b77bae258853009387d45b65aa6c4638f40f088110c97460569ebd0f5f8f"},"schema_version":"1.0","source":{"id":"1806.07568","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.07568","created_at":"2026-05-18T00:12:47Z"},{"alias_kind":"arxiv_version","alias_value":"1806.07568v1","created_at":"2026-05-18T00:12:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.07568","created_at":"2026-05-18T00:12:47Z"},{"alias_kind":"pith_short_12","alias_value":"OXNMULVY4FJ6","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"OXNMULVY4FJ6QRIB","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"OXNMULVY","created_at":"2026-05-18T12:32:43Z"}],"graph_snapshots":[{"event_id":"sha256:5e20549367019ba6870813ef336ab5953858220226f6969bd31972662f3c909b","target":"graph","created_at":"2026-05-18T00:12:47Z","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":"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","authors_text":"Jaehong Kim, Jiwon Kim, Sungeun Hong, Yongseok Choi","cross_cats":["cs.CV","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-06-20T06:11:35Z","title":"Doubly Nested Network for Resource-Efficient Inference"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.07568","kind":"arxiv","version":1},"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:0c39874b1e0435290797fbcea7a7ffb03d9d3a49cbf77278e3f53b41cfad9b9e","target":"record","created_at":"2026-05-18T00:12:47Z","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":"832ecbeb1a4e6d04d61620dab508d56fca0402bba8a9fb9d88aaa939547a055f","cross_cats_sorted":["cs.CV","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-06-20T06:11:35Z","title_canon_sha256":"c7b8b77bae258853009387d45b65aa6c4638f40f088110c97460569ebd0f5f8f"},"schema_version":"1.0","source":{"id":"1806.07568","kind":"arxiv","version":1}},"canonical_sha256":"75daca2eb8e153e845016110344bd43f6b1d814e70b238cf654b88e2053011ac","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"75daca2eb8e153e845016110344bd43f6b1d814e70b238cf654b88e2053011ac","first_computed_at":"2026-05-18T00:12:47.371446Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:12:47.371446Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lduul7+2rPQCkCmdKuH5QikK3WqwAFAUZVkQYuYuQ0R1fPce8IT2PC4rc4o3nRI0MldosHaTzKgL0xHWwxo+CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:12:47.372183Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.07568","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0c39874b1e0435290797fbcea7a7ffb03d9d3a49cbf77278e3f53b41cfad9b9e","sha256:5e20549367019ba6870813ef336ab5953858220226f6969bd31972662f3c909b"],"state_sha256":"81cc552c24b402592a9b8cc36934b270681e5e710fbd0030a9ad1344b4bd34ba"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gBw7inUepYl+aI8v4reK+Puz3QitCTvVBOZ95JZtzXpcAcY1oFAavwkTa1HyUgs5OlbJ4X2JhW+sMLM25EaJBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T13:55:39.424016Z","bundle_sha256":"5fe14ba6edb87160d14e1b9a76f98c92aff6a3795f0b794854224823c1b13577"}}