{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:74GP5XRNMHTTEX7IYYLEY4OWRF","short_pith_number":"pith:74GP5XRN","schema_version":"1.0","canonical_sha256":"ff0cfede2d61e7325fe8c6164c71d689522494467b1b9a96e12872d008102f42","source":{"kind":"arxiv","id":"2207.03677","version":5},"attestation_state":"computed","paper":{"title":"SuperTickets: Drawing Task-Agnostic Lottery Tickets from Supernets via Jointly Architecture Searching and Parameter Pruning","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CV","authors_text":"Baopu Li, Haoran You, Xu Ouyang, Yingyan Celine Lin, Zhanyi Sun","submitted_at":"2022-07-08T03:44:34Z","abstract_excerpt":"Neural architecture search (NAS) has demonstrated amazing success in searching for efficient deep neural networks (DNNs) from a given supernet. In parallel, the lottery ticket hypothesis has shown that DNNs contain small subnetworks that can be trained from scratch to achieve a comparable or higher accuracy than original DNNs. As such, it is currently a common practice to develop efficient DNNs via a pipeline of first search and then prune. Nevertheless, doing so often requires a search-train-prune-retrain process and thus prohibitive computational cost. In this paper, we discover for the firs"},"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":"2207.03677","kind":"arxiv","version":5},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.CV","submitted_at":"2022-07-08T03:44:34Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"e2347ca21af7dbb065b9c4865bef9e05f12d1af039d74a678385cd038ee4712d","abstract_canon_sha256":"b5fa1c24332a026ab1a23fd7eb62acf0a3b200b18b59618fe4fa205272ce7db4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:22:41.523450Z","signature_b64":"p5kdF4ZgMSlpgaUhLbbUXsqK7mEcud0KwGAR4CqO6anHG6aDoTYrv15mWG3u4LEqyPcAzgII6XkIVAfB/U2rDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ff0cfede2d61e7325fe8c6164c71d689522494467b1b9a96e12872d008102f42","last_reissued_at":"2026-07-05T10:22:41.522822Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:22:41.522822Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"SuperTickets: Drawing Task-Agnostic Lottery Tickets from Supernets via Jointly Architecture Searching and Parameter Pruning","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CV","authors_text":"Baopu Li, Haoran You, Xu Ouyang, Yingyan Celine Lin, Zhanyi Sun","submitted_at":"2022-07-08T03:44:34Z","abstract_excerpt":"Neural architecture search (NAS) has demonstrated amazing success in searching for efficient deep neural networks (DNNs) from a given supernet. In parallel, the lottery ticket hypothesis has shown that DNNs contain small subnetworks that can be trained from scratch to achieve a comparable or higher accuracy than original DNNs. As such, it is currently a common practice to develop efficient DNNs via a pipeline of first search and then prune. Nevertheless, doing so often requires a search-train-prune-retrain process and thus prohibitive computational cost. In this paper, we discover for the firs"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2207.03677","kind":"arxiv","version":5},"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/2207.03677/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":"2207.03677","created_at":"2026-07-05T10:22:41.522885+00:00"},{"alias_kind":"arxiv_version","alias_value":"2207.03677v5","created_at":"2026-07-05T10:22:41.522885+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.03677","created_at":"2026-07-05T10:22:41.522885+00:00"},{"alias_kind":"pith_short_12","alias_value":"74GP5XRNMHTT","created_at":"2026-07-05T10:22:41.522885+00:00"},{"alias_kind":"pith_short_16","alias_value":"74GP5XRNMHTTEX7I","created_at":"2026-07-05T10:22:41.522885+00:00"},{"alias_kind":"pith_short_8","alias_value":"74GP5XRN","created_at":"2026-07-05T10:22:41.522885+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/74GP5XRNMHTTEX7IYYLEY4OWRF","json":"https://pith.science/pith/74GP5XRNMHTTEX7IYYLEY4OWRF.json","graph_json":"https://pith.science/api/pith-number/74GP5XRNMHTTEX7IYYLEY4OWRF/graph.json","events_json":"https://pith.science/api/pith-number/74GP5XRNMHTTEX7IYYLEY4OWRF/events.json","paper":"https://pith.science/paper/74GP5XRN"},"agent_actions":{"view_html":"https://pith.science/pith/74GP5XRNMHTTEX7IYYLEY4OWRF","download_json":"https://pith.science/pith/74GP5XRNMHTTEX7IYYLEY4OWRF.json","view_paper":"https://pith.science/paper/74GP5XRN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2207.03677&json=true","fetch_graph":"https://pith.science/api/pith-number/74GP5XRNMHTTEX7IYYLEY4OWRF/graph.json","fetch_events":"https://pith.science/api/pith-number/74GP5XRNMHTTEX7IYYLEY4OWRF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/74GP5XRNMHTTEX7IYYLEY4OWRF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/74GP5XRNMHTTEX7IYYLEY4OWRF/action/storage_attestation","attest_author":"https://pith.science/pith/74GP5XRNMHTTEX7IYYLEY4OWRF/action/author_attestation","sign_citation":"https://pith.science/pith/74GP5XRNMHTTEX7IYYLEY4OWRF/action/citation_signature","submit_replication":"https://pith.science/pith/74GP5XRNMHTTEX7IYYLEY4OWRF/action/replication_record"}},"created_at":"2026-07-05T10:22:41.522885+00:00","updated_at":"2026-07-05T10:22:41.522885+00:00"}