{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:3TTXWAPMQAFBPYNRN6FT4BLOLX","short_pith_number":"pith:3TTXWAPM","schema_version":"1.0","canonical_sha256":"dce77b01ec800a17e1b16f8b3e056e5dcb2299291cbf1cb11eea33ab34cdaad7","source":{"kind":"arxiv","id":"2010.02432","version":2},"attestation_state":"computed","paper":{"title":"A Panda? No, It's a Sloth: Slowdown Attacks on Adaptive Multi-Exit Neural Network Inference","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.LG","authors_text":"Ionu\\c{t}-Vlad Modoranu, Sanghyun Hong, Tudor Dumitra\\c{s}, Yi\\u{g}itcan Kaya","submitted_at":"2020-10-06T02:06:52Z","abstract_excerpt":"Recent increases in the computational demands of deep neural networks (DNNs), combined with the observation that most input samples require only simple models, have sparked interest in $input$-$adaptive$ multi-exit architectures, such as MSDNets or Shallow-Deep Networks. These architectures enable faster inferences and could bring DNNs to low-power devices, e.g., in the Internet of Things (IoT). However, it is unknown if the computational savings provided by this approach are robust against adversarial pressure. In particular, an adversary may aim to slowdown adaptive DNNs by increasing their "},"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":"2010.02432","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-10-06T02:06:52Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"e6ed4d5cd081bfe0f956eaaed815f34775eb270c29bb6699bec3e278ab0516d7","abstract_canon_sha256":"1c8b84165a373585d7ffacc24373c4f96bda03bf70ec9a3359d04b0bb61f0ca9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:18:32.080489Z","signature_b64":"oYBChioUZwN0ClGWduSuQjo9umccwaFrp+xXy/4BKibv8k5QjnmEAdbjkeFGAmM8jLDtQoj18C/h3rCljGOYAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dce77b01ec800a17e1b16f8b3e056e5dcb2299291cbf1cb11eea33ab34cdaad7","last_reissued_at":"2026-07-05T02:18:32.080053Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:18:32.080053Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Panda? No, It's a Sloth: Slowdown Attacks on Adaptive Multi-Exit Neural Network Inference","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.LG","authors_text":"Ionu\\c{t}-Vlad Modoranu, Sanghyun Hong, Tudor Dumitra\\c{s}, Yi\\u{g}itcan Kaya","submitted_at":"2020-10-06T02:06:52Z","abstract_excerpt":"Recent increases in the computational demands of deep neural networks (DNNs), combined with the observation that most input samples require only simple models, have sparked interest in $input$-$adaptive$ multi-exit architectures, such as MSDNets or Shallow-Deep Networks. These architectures enable faster inferences and could bring DNNs to low-power devices, e.g., in the Internet of Things (IoT). However, it is unknown if the computational savings provided by this approach are robust against adversarial pressure. In particular, an adversary may aim to slowdown adaptive DNNs by increasing their "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.02432","kind":"arxiv","version":2},"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/2010.02432/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2010.02432","created_at":"2026-07-05T02:18:32.080105+00:00"},{"alias_kind":"arxiv_version","alias_value":"2010.02432v2","created_at":"2026-07-05T02:18:32.080105+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.02432","created_at":"2026-07-05T02:18:32.080105+00:00"},{"alias_kind":"pith_short_12","alias_value":"3TTXWAPMQAFB","created_at":"2026-07-05T02:18:32.080105+00:00"},{"alias_kind":"pith_short_16","alias_value":"3TTXWAPMQAFBPYNR","created_at":"2026-07-05T02:18:32.080105+00:00"},{"alias_kind":"pith_short_8","alias_value":"3TTXWAPM","created_at":"2026-07-05T02:18:32.080105+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.10987","citing_title":"AESOP: Adversarial Execution-path Selection to Overload Deep Learning Pipelines","ref_index":40,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3TTXWAPMQAFBPYNRN6FT4BLOLX","json":"https://pith.science/pith/3TTXWAPMQAFBPYNRN6FT4BLOLX.json","graph_json":"https://pith.science/api/pith-number/3TTXWAPMQAFBPYNRN6FT4BLOLX/graph.json","events_json":"https://pith.science/api/pith-number/3TTXWAPMQAFBPYNRN6FT4BLOLX/events.json","paper":"https://pith.science/paper/3TTXWAPM"},"agent_actions":{"view_html":"https://pith.science/pith/3TTXWAPMQAFBPYNRN6FT4BLOLX","download_json":"https://pith.science/pith/3TTXWAPMQAFBPYNRN6FT4BLOLX.json","view_paper":"https://pith.science/paper/3TTXWAPM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2010.02432&json=true","fetch_graph":"https://pith.science/api/pith-number/3TTXWAPMQAFBPYNRN6FT4BLOLX/graph.json","fetch_events":"https://pith.science/api/pith-number/3TTXWAPMQAFBPYNRN6FT4BLOLX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3TTXWAPMQAFBPYNRN6FT4BLOLX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3TTXWAPMQAFBPYNRN6FT4BLOLX/action/storage_attestation","attest_author":"https://pith.science/pith/3TTXWAPMQAFBPYNRN6FT4BLOLX/action/author_attestation","sign_citation":"https://pith.science/pith/3TTXWAPMQAFBPYNRN6FT4BLOLX/action/citation_signature","submit_replication":"https://pith.science/pith/3TTXWAPMQAFBPYNRN6FT4BLOLX/action/replication_record"}},"created_at":"2026-07-05T02:18:32.080105+00:00","updated_at":"2026-07-05T02:18:32.080105+00:00"}