{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:4APTEBW2EHRPHLKABDFXFXU7PL","short_pith_number":"pith:4APTEBW2","canonical_record":{"source":{"id":"1904.04562","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-04-09T09:34:07Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"c09688d95d8a8a1a964c0ee58836b051189d72ddbaa5f3fa899cc0b92d6bf8a6","abstract_canon_sha256":"6c91a8260708862baef2a3b4410b87e2be13910c8427e9e2863b7db309ded621"},"schema_version":"1.0"},"canonical_sha256":"e01f3206da21e2f3ad4008cb72de9f7acdb9f0dbbd9228ffc02c0232e52d2973","source":{"kind":"arxiv","id":"1904.04562","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.04562","created_at":"2026-05-17T23:48:58Z"},{"alias_kind":"arxiv_version","alias_value":"1904.04562v1","created_at":"2026-05-17T23:48:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.04562","created_at":"2026-05-17T23:48:58Z"},{"alias_kind":"pith_short_12","alias_value":"4APTEBW2EHRP","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"4APTEBW2EHRPHLKA","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"4APTEBW2","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:4APTEBW2EHRPHLKABDFXFXU7PL","target":"record","payload":{"canonical_record":{"source":{"id":"1904.04562","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-04-09T09:34:07Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"c09688d95d8a8a1a964c0ee58836b051189d72ddbaa5f3fa899cc0b92d6bf8a6","abstract_canon_sha256":"6c91a8260708862baef2a3b4410b87e2be13910c8427e9e2863b7db309ded621"},"schema_version":"1.0"},"canonical_sha256":"e01f3206da21e2f3ad4008cb72de9f7acdb9f0dbbd9228ffc02c0232e52d2973","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:58.744071Z","signature_b64":"VACWbP2ZGyzjv5nEyOxOWorQ/nkLkML5NVfsEsfIUfHDkWBnC7cLXF/ZPJVDAgq+PoWhus8nqafuLnWIg4bhDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e01f3206da21e2f3ad4008cb72de9f7acdb9f0dbbd9228ffc02c0232e52d2973","last_reissued_at":"2026-05-17T23:48:58.743713Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:58.743713Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1904.04562","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-17T23:48:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NQzlnwKclsTfONzJsD7U3HVw9knW+Ib23lWIDIBf4XKuLzeGeBh47XKNHuyDa95bQNTbO7BNbhbn22ERiyy/AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T23:40:22.027698Z"},"content_sha256":"7145d0a542ccbf56ced20a376ecc515a9c324e8d79438e4be59bfb9e9e785804","schema_version":"1.0","event_id":"sha256:7145d0a542ccbf56ced20a376ecc515a9c324e8d79438e4be59bfb9e9e785804"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:4APTEBW2EHRPHLKABDFXFXU7PL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Deep Virtual Networks for Memory Efficient Inference of Multiple Tasks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CV","authors_text":"Chanho Ahn, Eunwoo Kim, Philip H.S. Torr, Songhwai Oh","submitted_at":"2019-04-09T09:34:07Z","abstract_excerpt":"Deep networks consume a large amount of memory by their nature. A natural question arises can we reduce that memory requirement whilst maintaining performance. In particular, in this work we address the problem of memory efficient learning for multiple tasks. To this end, we propose a novel network architecture producing multiple networks of different configurations, termed deep virtual networks (DVNs), for different tasks. Each DVN is specialized for a single task and structured hierarchically. The hierarchical structure, which contains multiple levels of hierarchy corresponding to different "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.04562","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-17T23:48:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FzvznJ7pzLD1X9WYZNhDL0D5LmjQCWPbCFa54B5Iv9yRvib1oDj69JO8RZxb5AtU4BJ3sRG4uvRmQM9jsciVAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T23:40:22.028382Z"},"content_sha256":"2f078e8e6358287640d6d86c021974c5232042df04ef0f31be4f4cacd72b6ad8","schema_version":"1.0","event_id":"sha256:2f078e8e6358287640d6d86c021974c5232042df04ef0f31be4f4cacd72b6ad8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4APTEBW2EHRPHLKABDFXFXU7PL/bundle.json","state_url":"https://pith.science/pith/4APTEBW2EHRPHLKABDFXFXU7PL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4APTEBW2EHRPHLKABDFXFXU7PL/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-29T23:40:22Z","links":{"resolver":"https://pith.science/pith/4APTEBW2EHRPHLKABDFXFXU7PL","bundle":"https://pith.science/pith/4APTEBW2EHRPHLKABDFXFXU7PL/bundle.json","state":"https://pith.science/pith/4APTEBW2EHRPHLKABDFXFXU7PL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4APTEBW2EHRPHLKABDFXFXU7PL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:4APTEBW2EHRPHLKABDFXFXU7PL","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":"6c91a8260708862baef2a3b4410b87e2be13910c8427e9e2863b7db309ded621","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-04-09T09:34:07Z","title_canon_sha256":"c09688d95d8a8a1a964c0ee58836b051189d72ddbaa5f3fa899cc0b92d6bf8a6"},"schema_version":"1.0","source":{"id":"1904.04562","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.04562","created_at":"2026-05-17T23:48:58Z"},{"alias_kind":"arxiv_version","alias_value":"1904.04562v1","created_at":"2026-05-17T23:48:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.04562","created_at":"2026-05-17T23:48:58Z"},{"alias_kind":"pith_short_12","alias_value":"4APTEBW2EHRP","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"4APTEBW2EHRPHLKA","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"4APTEBW2","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:2f078e8e6358287640d6d86c021974c5232042df04ef0f31be4f4cacd72b6ad8","target":"graph","created_at":"2026-05-17T23:48:58Z","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":"Deep networks consume a large amount of memory by their nature. A natural question arises can we reduce that memory requirement whilst maintaining performance. In particular, in this work we address the problem of memory efficient learning for multiple tasks. To this end, we propose a novel network architecture producing multiple networks of different configurations, termed deep virtual networks (DVNs), for different tasks. Each DVN is specialized for a single task and structured hierarchically. The hierarchical structure, which contains multiple levels of hierarchy corresponding to different ","authors_text":"Chanho Ahn, Eunwoo Kim, Philip H.S. Torr, Songhwai Oh","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-04-09T09:34:07Z","title":"Deep Virtual Networks for Memory Efficient Inference of Multiple Tasks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.04562","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:7145d0a542ccbf56ced20a376ecc515a9c324e8d79438e4be59bfb9e9e785804","target":"record","created_at":"2026-05-17T23:48:58Z","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":"6c91a8260708862baef2a3b4410b87e2be13910c8427e9e2863b7db309ded621","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-04-09T09:34:07Z","title_canon_sha256":"c09688d95d8a8a1a964c0ee58836b051189d72ddbaa5f3fa899cc0b92d6bf8a6"},"schema_version":"1.0","source":{"id":"1904.04562","kind":"arxiv","version":1}},"canonical_sha256":"e01f3206da21e2f3ad4008cb72de9f7acdb9f0dbbd9228ffc02c0232e52d2973","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e01f3206da21e2f3ad4008cb72de9f7acdb9f0dbbd9228ffc02c0232e52d2973","first_computed_at":"2026-05-17T23:48:58.743713Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:48:58.743713Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VACWbP2ZGyzjv5nEyOxOWorQ/nkLkML5NVfsEsfIUfHDkWBnC7cLXF/ZPJVDAgq+PoWhus8nqafuLnWIg4bhDQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:48:58.744071Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.04562","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7145d0a542ccbf56ced20a376ecc515a9c324e8d79438e4be59bfb9e9e785804","sha256:2f078e8e6358287640d6d86c021974c5232042df04ef0f31be4f4cacd72b6ad8"],"state_sha256":"4a530778e3d0ebf3b1c40c5bb639e01356af85a83b714458d8eca65779d5eb47"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jYThuU5xSRS3c65vpwwLXkQEPJmQhXKhKkCQpgpYzWyNE+cyeUeOnIGxioJaFR5RfrRT32mStay1sL7eOvPEAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T23:40:22.032202Z","bundle_sha256":"6ad95e2362c6ca67deda28e205db6c24e68fa2dcc0c8213eb316c6357ae774ff"}}