{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:C324AXLFQOID5YKMLMWZLBUEBF","short_pith_number":"pith:C324AXLF","schema_version":"1.0","canonical_sha256":"16f5c05d6583903ee14c5b2d958684096ba3ff9f44648230d9b17391858fd5f7","source":{"kind":"arxiv","id":"1707.03141","version":3},"attestation_state":"computed","paper":{"title":"A Simple Neural Attentive Meta-Learner","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NE","stat.ML"],"primary_cat":"cs.AI","authors_text":"Mostafa Rohaninejad, Nikhil Mishra, Pieter Abbeel, Xi Chen","submitted_at":"2017-07-11T06:21:31Z","abstract_excerpt":"Deep neural networks excel in regimes with large amounts of data, but tend to struggle when data is scarce or when they need to adapt quickly to changes in the task. In response, recent work in meta-learning proposes training a meta-learner on a distribution of similar tasks, in the hopes of generalization to novel but related tasks by learning a high-level strategy that captures the essence of the problem it is asked to solve. However, many recent meta-learning approaches are extensively hand-designed, either using architectures specialized to a particular application, or hard-coding algorith"},"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":"1707.03141","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-07-11T06:21:31Z","cross_cats_sorted":["cs.LG","cs.NE","stat.ML"],"title_canon_sha256":"a4aa5a4f383b35dee5870f6570664603d39afde6ea09b59d27bf68e46ae11178","abstract_canon_sha256":"c1499d2671d3df1a5b0bba907fa5ab45eb737270e9015924938f2a4d930c0e52"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:39.742101Z","signature_b64":"Ehb6Xud8vy05G6DhTWLIVxAMFBsKTu1DBtQcDuRmAy8duYBLT2yyS6bGVS0xtCmbN8sgtRLR6inAIDFixsTTDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"16f5c05d6583903ee14c5b2d958684096ba3ff9f44648230d9b17391858fd5f7","last_reissued_at":"2026-05-18T00:22:39.741694Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:39.741694Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Simple Neural Attentive Meta-Learner","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NE","stat.ML"],"primary_cat":"cs.AI","authors_text":"Mostafa Rohaninejad, Nikhil Mishra, Pieter Abbeel, Xi Chen","submitted_at":"2017-07-11T06:21:31Z","abstract_excerpt":"Deep neural networks excel in regimes with large amounts of data, but tend to struggle when data is scarce or when they need to adapt quickly to changes in the task. In response, recent work in meta-learning proposes training a meta-learner on a distribution of similar tasks, in the hopes of generalization to novel but related tasks by learning a high-level strategy that captures the essence of the problem it is asked to solve. However, many recent meta-learning approaches are extensively hand-designed, either using architectures specialized to a particular application, or hard-coding algorith"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.03141","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1707.03141","created_at":"2026-05-18T00:22:39.741754+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.03141v3","created_at":"2026-05-18T00:22:39.741754+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.03141","created_at":"2026-05-18T00:22:39.741754+00:00"},{"alias_kind":"pith_short_12","alias_value":"C324AXLFQOID","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_16","alias_value":"C324AXLFQOID5YKM","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_8","alias_value":"C324AXLF","created_at":"2026-05-18T12:31:08.081275+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1910.07113","citing_title":"Solving Rubik's Cube with a Robot Hand","ref_index":69,"is_internal_anchor":true},{"citing_arxiv_id":"2605.02920","citing_title":"Where to Bind Matters: Hebbian Fast Weights in Vision Transformers for Few-Shot Character Recognition","ref_index":20,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/C324AXLFQOID5YKMLMWZLBUEBF","json":"https://pith.science/pith/C324AXLFQOID5YKMLMWZLBUEBF.json","graph_json":"https://pith.science/api/pith-number/C324AXLFQOID5YKMLMWZLBUEBF/graph.json","events_json":"https://pith.science/api/pith-number/C324AXLFQOID5YKMLMWZLBUEBF/events.json","paper":"https://pith.science/paper/C324AXLF"},"agent_actions":{"view_html":"https://pith.science/pith/C324AXLFQOID5YKMLMWZLBUEBF","download_json":"https://pith.science/pith/C324AXLFQOID5YKMLMWZLBUEBF.json","view_paper":"https://pith.science/paper/C324AXLF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.03141&json=true","fetch_graph":"https://pith.science/api/pith-number/C324AXLFQOID5YKMLMWZLBUEBF/graph.json","fetch_events":"https://pith.science/api/pith-number/C324AXLFQOID5YKMLMWZLBUEBF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C324AXLFQOID5YKMLMWZLBUEBF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C324AXLFQOID5YKMLMWZLBUEBF/action/storage_attestation","attest_author":"https://pith.science/pith/C324AXLFQOID5YKMLMWZLBUEBF/action/author_attestation","sign_citation":"https://pith.science/pith/C324AXLFQOID5YKMLMWZLBUEBF/action/citation_signature","submit_replication":"https://pith.science/pith/C324AXLFQOID5YKMLMWZLBUEBF/action/replication_record"}},"created_at":"2026-05-18T00:22:39.741754+00:00","updated_at":"2026-05-18T00:22:39.741754+00:00"}