{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:IULG4YXBPQTXAK4PFP34WRKVT4","short_pith_number":"pith:IULG4YXB","schema_version":"1.0","canonical_sha256":"45166e62e17c27702b8f2bf7cb45559f233b7758f2acd46530fdc3c19ea29fd1","source":{"kind":"arxiv","id":"2304.02862","version":1},"attestation_state":"computed","paper":{"title":"Learning to Learn with Indispensable Connections","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Krishna Pratap Singh, Manas Gogoi, Sambhavi Tiwari, Shekhar Verma","submitted_at":"2023-04-06T04:53:13Z","abstract_excerpt":"Meta-learning aims to solve unseen tasks with few labelled instances. Nevertheless, despite its effectiveness for quick learning in existing optimization-based methods, it has several flaws. Inconsequential connections are frequently seen during meta-training, which results in an over-parameterized neural network. Because of this, meta-testing observes unnecessary computations and extra memory overhead. To overcome such flaws. We propose a novel meta-learning method called Meta-LTH that includes indispensible (necessary) connections. We applied the lottery ticket hypothesis technique known as "},"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":"2304.02862","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-04-06T04:53:13Z","cross_cats_sorted":[],"title_canon_sha256":"045452dabf97c59e38dd6f243149d68a9756a0738f5573291c48440477fa0425","abstract_canon_sha256":"ab4ee90f50e911f4809fb6ffb91704cfe393222862be43a11c9167c610e17ea9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:58:42.432843Z","signature_b64":"2hyb6ai/g0q98YTNfUk28bC1dT3WKFANY/4XiaFw6xamsFVj6OtKwUYUQzT2rWAjhrSrq1H7ZC3m/OSzfM68Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"45166e62e17c27702b8f2bf7cb45559f233b7758f2acd46530fdc3c19ea29fd1","last_reissued_at":"2026-07-05T05:58:42.432450Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:58:42.432450Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning to Learn with Indispensable Connections","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Krishna Pratap Singh, Manas Gogoi, Sambhavi Tiwari, Shekhar Verma","submitted_at":"2023-04-06T04:53:13Z","abstract_excerpt":"Meta-learning aims to solve unseen tasks with few labelled instances. Nevertheless, despite its effectiveness for quick learning in existing optimization-based methods, it has several flaws. Inconsequential connections are frequently seen during meta-training, which results in an over-parameterized neural network. Because of this, meta-testing observes unnecessary computations and extra memory overhead. To overcome such flaws. We propose a novel meta-learning method called Meta-LTH that includes indispensible (necessary) connections. We applied the lottery ticket hypothesis technique known as "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2304.02862","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/2304.02862/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":"2304.02862","created_at":"2026-07-05T05:58:42.432511+00:00"},{"alias_kind":"arxiv_version","alias_value":"2304.02862v1","created_at":"2026-07-05T05:58:42.432511+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2304.02862","created_at":"2026-07-05T05:58:42.432511+00:00"},{"alias_kind":"pith_short_12","alias_value":"IULG4YXBPQTX","created_at":"2026-07-05T05:58:42.432511+00:00"},{"alias_kind":"pith_short_16","alias_value":"IULG4YXBPQTXAK4P","created_at":"2026-07-05T05:58:42.432511+00:00"},{"alias_kind":"pith_short_8","alias_value":"IULG4YXB","created_at":"2026-07-05T05:58:42.432511+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/IULG4YXBPQTXAK4PFP34WRKVT4","json":"https://pith.science/pith/IULG4YXBPQTXAK4PFP34WRKVT4.json","graph_json":"https://pith.science/api/pith-number/IULG4YXBPQTXAK4PFP34WRKVT4/graph.json","events_json":"https://pith.science/api/pith-number/IULG4YXBPQTXAK4PFP34WRKVT4/events.json","paper":"https://pith.science/paper/IULG4YXB"},"agent_actions":{"view_html":"https://pith.science/pith/IULG4YXBPQTXAK4PFP34WRKVT4","download_json":"https://pith.science/pith/IULG4YXBPQTXAK4PFP34WRKVT4.json","view_paper":"https://pith.science/paper/IULG4YXB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2304.02862&json=true","fetch_graph":"https://pith.science/api/pith-number/IULG4YXBPQTXAK4PFP34WRKVT4/graph.json","fetch_events":"https://pith.science/api/pith-number/IULG4YXBPQTXAK4PFP34WRKVT4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IULG4YXBPQTXAK4PFP34WRKVT4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IULG4YXBPQTXAK4PFP34WRKVT4/action/storage_attestation","attest_author":"https://pith.science/pith/IULG4YXBPQTXAK4PFP34WRKVT4/action/author_attestation","sign_citation":"https://pith.science/pith/IULG4YXBPQTXAK4PFP34WRKVT4/action/citation_signature","submit_replication":"https://pith.science/pith/IULG4YXBPQTXAK4PFP34WRKVT4/action/replication_record"}},"created_at":"2026-07-05T05:58:42.432511+00:00","updated_at":"2026-07-05T05:58:42.432511+00:00"}