{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:IULG4YXBPQTXAK4PFP34WRKVT4","short_pith_number":"pith:IULG4YXB","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"},"canonical_sha256":"45166e62e17c27702b8f2bf7cb45559f233b7758f2acd46530fdc3c19ea29fd1","source":{"kind":"arxiv","id":"2304.02862","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2304.02862","created_at":"2026-07-05T05:58:42Z"},{"alias_kind":"arxiv_version","alias_value":"2304.02862v1","created_at":"2026-07-05T05:58:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2304.02862","created_at":"2026-07-05T05:58:42Z"},{"alias_kind":"pith_short_12","alias_value":"IULG4YXBPQTX","created_at":"2026-07-05T05:58:42Z"},{"alias_kind":"pith_short_16","alias_value":"IULG4YXBPQTXAK4P","created_at":"2026-07-05T05:58:42Z"},{"alias_kind":"pith_short_8","alias_value":"IULG4YXB","created_at":"2026-07-05T05:58:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:IULG4YXBPQTXAK4PFP34WRKVT4","target":"record","payload":{"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"},"canonical_sha256":"45166e62e17c27702b8f2bf7cb45559f233b7758f2acd46530fdc3c19ea29fd1","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"},"source_kind":"arxiv","source_id":"2304.02862","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-05T05:58:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q9LRmjN3B+7ghRPXHgcVSYFk8QxAnI+LIC1cwlQM+12aUCuMXInhWA/6QzFQc8sPibbIuXGiUFUGjdCqzEv8BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T16:05:55.045416Z"},"content_sha256":"12a6e67b4d7c0f398b93baee4dc9d5b245d7bbabb2dac4445ffb8667307954ba","schema_version":"1.0","event_id":"sha256:12a6e67b4d7c0f398b93baee4dc9d5b245d7bbabb2dac4445ffb8667307954ba"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:IULG4YXBPQTXAK4PFP34WRKVT4","target":"graph","payload":{"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"},"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-05T05:58:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"za09eQcwTYwJ7btbfsMdD5dhrr/RVMOEnKJuOtCEDbl3fX7/bwjhCOmWarzKcGoKrKL34tRlzo/z1l+ZXyTcBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T16:05:55.045908Z"},"content_sha256":"41e976c7b88a36a2a2f59f8e8585bb9d4ae897db9944d21ded7bdf699693fe23","schema_version":"1.0","event_id":"sha256:41e976c7b88a36a2a2f59f8e8585bb9d4ae897db9944d21ded7bdf699693fe23"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IULG4YXBPQTXAK4PFP34WRKVT4/bundle.json","state_url":"https://pith.science/pith/IULG4YXBPQTXAK4PFP34WRKVT4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IULG4YXBPQTXAK4PFP34WRKVT4/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-18T16:05:55Z","links":{"resolver":"https://pith.science/pith/IULG4YXBPQTXAK4PFP34WRKVT4","bundle":"https://pith.science/pith/IULG4YXBPQTXAK4PFP34WRKVT4/bundle.json","state":"https://pith.science/pith/IULG4YXBPQTXAK4PFP34WRKVT4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IULG4YXBPQTXAK4PFP34WRKVT4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:IULG4YXBPQTXAK4PFP34WRKVT4","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":"ab4ee90f50e911f4809fb6ffb91704cfe393222862be43a11c9167c610e17ea9","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-04-06T04:53:13Z","title_canon_sha256":"045452dabf97c59e38dd6f243149d68a9756a0738f5573291c48440477fa0425"},"schema_version":"1.0","source":{"id":"2304.02862","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2304.02862","created_at":"2026-07-05T05:58:42Z"},{"alias_kind":"arxiv_version","alias_value":"2304.02862v1","created_at":"2026-07-05T05:58:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2304.02862","created_at":"2026-07-05T05:58:42Z"},{"alias_kind":"pith_short_12","alias_value":"IULG4YXBPQTX","created_at":"2026-07-05T05:58:42Z"},{"alias_kind":"pith_short_16","alias_value":"IULG4YXBPQTXAK4P","created_at":"2026-07-05T05:58:42Z"},{"alias_kind":"pith_short_8","alias_value":"IULG4YXB","created_at":"2026-07-05T05:58:42Z"}],"graph_snapshots":[{"event_id":"sha256:41e976c7b88a36a2a2f59f8e8585bb9d4ae897db9944d21ded7bdf699693fe23","target":"graph","created_at":"2026-07-05T05:58:42Z","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/2304.02862/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Krishna Pratap Singh, Manas Gogoi, Sambhavi Tiwari, Shekhar Verma","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-04-06T04:53:13Z","title":"Learning to Learn with Indispensable Connections"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2304.02862","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:12a6e67b4d7c0f398b93baee4dc9d5b245d7bbabb2dac4445ffb8667307954ba","target":"record","created_at":"2026-07-05T05:58:42Z","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":"ab4ee90f50e911f4809fb6ffb91704cfe393222862be43a11c9167c610e17ea9","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-04-06T04:53:13Z","title_canon_sha256":"045452dabf97c59e38dd6f243149d68a9756a0738f5573291c48440477fa0425"},"schema_version":"1.0","source":{"id":"2304.02862","kind":"arxiv","version":1}},"canonical_sha256":"45166e62e17c27702b8f2bf7cb45559f233b7758f2acd46530fdc3c19ea29fd1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"45166e62e17c27702b8f2bf7cb45559f233b7758f2acd46530fdc3c19ea29fd1","first_computed_at":"2026-07-05T05:58:42.432450Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:58:42.432450Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2hyb6ai/g0q98YTNfUk28bC1dT3WKFANY/4XiaFw6xamsFVj6OtKwUYUQzT2rWAjhrSrq1H7ZC3m/OSzfM68Dw==","signature_status":"signed_v1","signed_at":"2026-07-05T05:58:42.432843Z","signed_message":"canonical_sha256_bytes"},"source_id":"2304.02862","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:12a6e67b4d7c0f398b93baee4dc9d5b245d7bbabb2dac4445ffb8667307954ba","sha256:41e976c7b88a36a2a2f59f8e8585bb9d4ae897db9944d21ded7bdf699693fe23"],"state_sha256":"5360873b4345e10fac01a3f48a301b07c9d7c4cb02713a5ef03ff531c87fa294"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T96qCGY43WKoybasGvH63rG4K/trNry2J9s+a2W6MiGFvAAPYRSxsjsRPK8MB/DrYMpoVPVXXRd5W6t/AnuPBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-18T16:05:55.049536Z","bundle_sha256":"c834bbb801815b4aecbb15daa0536ddab7104cab3a915726c94b380d7b6a3442"}}