{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:WFTTVI2P4R7XXLMBJ7MZPCWMZJ","short_pith_number":"pith:WFTTVI2P","canonical_record":{"source":{"id":"2203.03324","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-03-07T12:07:02Z","cross_cats_sorted":[],"title_canon_sha256":"59091fd5bfdc752252af52f78b04939ad8df23719800e61a9cbee5055eba521b","abstract_canon_sha256":"e9b3346e5f2cf39abca27c16abe6c66720c77d9537e7fd54043e7fb733ac3c64"},"schema_version":"1.0"},"canonical_sha256":"b1673aa34fe47f7bad814fd9978accca70ec4a7a9015785378de63ca83340049","source":{"kind":"arxiv","id":"2203.03324","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2203.03324","created_at":"2026-07-05T04:02:33Z"},{"alias_kind":"arxiv_version","alias_value":"2203.03324v1","created_at":"2026-07-05T04:02:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.03324","created_at":"2026-07-05T04:02:33Z"},{"alias_kind":"pith_short_12","alias_value":"WFTTVI2P4R7X","created_at":"2026-07-05T04:02:33Z"},{"alias_kind":"pith_short_16","alias_value":"WFTTVI2P4R7XXLMB","created_at":"2026-07-05T04:02:33Z"},{"alias_kind":"pith_short_8","alias_value":"WFTTVI2P","created_at":"2026-07-05T04:02:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:WFTTVI2P4R7XXLMBJ7MZPCWMZJ","target":"record","payload":{"canonical_record":{"source":{"id":"2203.03324","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-03-07T12:07:02Z","cross_cats_sorted":[],"title_canon_sha256":"59091fd5bfdc752252af52f78b04939ad8df23719800e61a9cbee5055eba521b","abstract_canon_sha256":"e9b3346e5f2cf39abca27c16abe6c66720c77d9537e7fd54043e7fb733ac3c64"},"schema_version":"1.0"},"canonical_sha256":"b1673aa34fe47f7bad814fd9978accca70ec4a7a9015785378de63ca83340049","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:02:33.433958Z","signature_b64":"O+0Rn73PjeIV4mSgfXqARmlajTxvckstsCUxtwojDH39YexLaCW/Jp1pX05kpVFstwc8xedxLbBrdNOwhMwkAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b1673aa34fe47f7bad814fd9978accca70ec4a7a9015785378de63ca83340049","last_reissued_at":"2026-07-05T04:02:33.433565Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:02:33.433565Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2203.03324","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-07-05T04:02:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X26HJqbJa2hDEMhQZw2zhkyFyS8FTlRQs3FnTGazjevkN2Sqd+J3G/A+nDjKUqjy3RSGwimD3IsStmkqSRrlAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T03:25:24.599871Z"},"content_sha256":"ac287e290b845355757cc97d5c80baa2507c17cc295ba74ce03879ac0e597327","schema_version":"1.0","event_id":"sha256:ac287e290b845355757cc97d5c80baa2507c17cc295ba74ce03879ac0e597327"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:WFTTVI2P4R7XXLMBJ7MZPCWMZJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dynamic ConvNets on Tiny Devices via Nested Sparsity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Andrea Calimera, Antonio Cipolletta, Luca Mocerino, Matteo Grimaldi","submitted_at":"2022-03-07T12:07:02Z","abstract_excerpt":"This work introduces a new training and compression pipeline to build Nested Sparse ConvNets, a class of dynamic Convolutional Neural Networks (ConvNets) suited for inference tasks deployed on resource-constrained devices at the edge of the Internet-of-Things. A Nested Sparse ConvNet consists of a single ConvNet architecture containing N sparse sub-networks with nested weights subsets, like a Matryoshka doll, and can trade accuracy for latency at run time, using the model sparsity as a dynamic knob. To attain high accuracy at training time, we propose a gradient masking technique that optimall"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.03324","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2203.03324/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"},"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-07-05T04:02:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P+TiORY4U1F7EM5eFdxZfPsWX6fvhDMFe04XorNscMHjSj8aVhlz8TaQtePVniqVaHkja7fuVkxiv3AoAKs5CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T03:25:24.600566Z"},"content_sha256":"d64d018c3ebfab1e41d14c8776338a10531f6e00e19300c2f7ae5c480c50377b","schema_version":"1.0","event_id":"sha256:d64d018c3ebfab1e41d14c8776338a10531f6e00e19300c2f7ae5c480c50377b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WFTTVI2P4R7XXLMBJ7MZPCWMZJ/bundle.json","state_url":"https://pith.science/pith/WFTTVI2P4R7XXLMBJ7MZPCWMZJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WFTTVI2P4R7XXLMBJ7MZPCWMZJ/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-08-14T03:25:24Z","links":{"resolver":"https://pith.science/pith/WFTTVI2P4R7XXLMBJ7MZPCWMZJ","bundle":"https://pith.science/pith/WFTTVI2P4R7XXLMBJ7MZPCWMZJ/bundle.json","state":"https://pith.science/pith/WFTTVI2P4R7XXLMBJ7MZPCWMZJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WFTTVI2P4R7XXLMBJ7MZPCWMZJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:WFTTVI2P4R7XXLMBJ7MZPCWMZJ","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":"e9b3346e5f2cf39abca27c16abe6c66720c77d9537e7fd54043e7fb733ac3c64","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-03-07T12:07:02Z","title_canon_sha256":"59091fd5bfdc752252af52f78b04939ad8df23719800e61a9cbee5055eba521b"},"schema_version":"1.0","source":{"id":"2203.03324","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2203.03324","created_at":"2026-07-05T04:02:33Z"},{"alias_kind":"arxiv_version","alias_value":"2203.03324v1","created_at":"2026-07-05T04:02:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.03324","created_at":"2026-07-05T04:02:33Z"},{"alias_kind":"pith_short_12","alias_value":"WFTTVI2P4R7X","created_at":"2026-07-05T04:02:33Z"},{"alias_kind":"pith_short_16","alias_value":"WFTTVI2P4R7XXLMB","created_at":"2026-07-05T04:02:33Z"},{"alias_kind":"pith_short_8","alias_value":"WFTTVI2P","created_at":"2026-07-05T04:02:33Z"}],"graph_snapshots":[{"event_id":"sha256:d64d018c3ebfab1e41d14c8776338a10531f6e00e19300c2f7ae5c480c50377b","target":"graph","created_at":"2026-07-05T04:02:33Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2203.03324/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This work introduces a new training and compression pipeline to build Nested Sparse ConvNets, a class of dynamic Convolutional Neural Networks (ConvNets) suited for inference tasks deployed on resource-constrained devices at the edge of the Internet-of-Things. A Nested Sparse ConvNet consists of a single ConvNet architecture containing N sparse sub-networks with nested weights subsets, like a Matryoshka doll, and can trade accuracy for latency at run time, using the model sparsity as a dynamic knob. To attain high accuracy at training time, we propose a gradient masking technique that optimall","authors_text":"Andrea Calimera, Antonio Cipolletta, Luca Mocerino, Matteo Grimaldi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-03-07T12:07:02Z","title":"Dynamic ConvNets on Tiny Devices via Nested Sparsity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.03324","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:ac287e290b845355757cc97d5c80baa2507c17cc295ba74ce03879ac0e597327","target":"record","created_at":"2026-07-05T04:02:33Z","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":"e9b3346e5f2cf39abca27c16abe6c66720c77d9537e7fd54043e7fb733ac3c64","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-03-07T12:07:02Z","title_canon_sha256":"59091fd5bfdc752252af52f78b04939ad8df23719800e61a9cbee5055eba521b"},"schema_version":"1.0","source":{"id":"2203.03324","kind":"arxiv","version":1}},"canonical_sha256":"b1673aa34fe47f7bad814fd9978accca70ec4a7a9015785378de63ca83340049","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b1673aa34fe47f7bad814fd9978accca70ec4a7a9015785378de63ca83340049","first_computed_at":"2026-07-05T04:02:33.433565Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:02:33.433565Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"O+0Rn73PjeIV4mSgfXqARmlajTxvckstsCUxtwojDH39YexLaCW/Jp1pX05kpVFstwc8xedxLbBrdNOwhMwkAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T04:02:33.433958Z","signed_message":"canonical_sha256_bytes"},"source_id":"2203.03324","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ac287e290b845355757cc97d5c80baa2507c17cc295ba74ce03879ac0e597327","sha256:d64d018c3ebfab1e41d14c8776338a10531f6e00e19300c2f7ae5c480c50377b"],"state_sha256":"18f9f232876f142a7ecaf47a5fa0345a9292d3d79e1b33cee87482e7b4c88a43"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TgHQ0qZE2pquiGyUybdrDGQYm9TGH22Du2h/CWI92dFFnXZX5hMFVuzwWt0vOg0rkoUEaW5RHSbql+B2/Yb7CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T03:25:24.605687Z","bundle_sha256":"a6faa0fd103b18aa82bcf400f3887d384940db891a108441cac8cfb0899f946b"}}