{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:WANE5K5ZP3KPBUXOVNELX4UOU5","short_pith_number":"pith:WANE5K5Z","canonical_record":{"source":{"id":"1710.04157","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-10-11T16:29:38Z","cross_cats_sorted":[],"title_canon_sha256":"8686c7c74f85a65a4690e5f9de285e0f4dc9645f6db1a69a52b0fa13fa5761ca","abstract_canon_sha256":"48774136288b728ce3c78c915b1fbe17ee9b8493ef048a3591310ebe846a4ba5"},"schema_version":"1.0"},"canonical_sha256":"b01a4eabb97ed4f0d2eeab48bbf28ea75b82deeb29c2ea5aec3bc485c9fed9d5","source":{"kind":"arxiv","id":"1710.04157","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.04157","created_at":"2026-05-18T00:33:04Z"},{"alias_kind":"arxiv_version","alias_value":"1710.04157v1","created_at":"2026-05-18T00:33:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.04157","created_at":"2026-05-18T00:33:04Z"},{"alias_kind":"pith_short_12","alias_value":"WANE5K5ZP3KP","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"WANE5K5ZP3KPBUXO","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"WANE5K5Z","created_at":"2026-05-18T12:31:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:WANE5K5ZP3KPBUXOVNELX4UOU5","target":"record","payload":{"canonical_record":{"source":{"id":"1710.04157","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-10-11T16:29:38Z","cross_cats_sorted":[],"title_canon_sha256":"8686c7c74f85a65a4690e5f9de285e0f4dc9645f6db1a69a52b0fa13fa5761ca","abstract_canon_sha256":"48774136288b728ce3c78c915b1fbe17ee9b8493ef048a3591310ebe846a4ba5"},"schema_version":"1.0"},"canonical_sha256":"b01a4eabb97ed4f0d2eeab48bbf28ea75b82deeb29c2ea5aec3bc485c9fed9d5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:04.738953Z","signature_b64":"w9V5/3De2QlK7W/ij1ITDwA7CJcLOiAzDnM2/faSl/EB9zrTzpKDTYp5sF9TWOakV1zxTcr5fDGGowrrxNCUCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b01a4eabb97ed4f0d2eeab48bbf28ea75b82deeb29c2ea5aec3bc485c9fed9d5","last_reissued_at":"2026-05-18T00:33:04.738432Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:04.738432Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.04157","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-05-18T00:33:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/MrwxuE6FfPYTny7c8IzFS4C7Aafa8gQ+kdoYaPaFEwTIrwhXG43b+qzCTrXH+QW02IONZYtp3Zlly7v5n00Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T23:15:37.457225Z"},"content_sha256":"6f10f90e0609c5655162539a199b780e351f446f123932995946feebd528313f","schema_version":"1.0","event_id":"sha256:6f10f90e0609c5655162539a199b780e351f446f123932995946feebd528313f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:WANE5K5ZP3KPBUXOVNELX4UOU5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Neural Program Meta-Induction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Jacob Devlin, Matthew Hausknecht, Pushmeet Kohli, Rishabh Singh, Rudy Bunel","submitted_at":"2017-10-11T16:29:38Z","abstract_excerpt":"Most recently proposed methods for Neural Program Induction work under the assumption of having a large set of input/output (I/O) examples for learning any underlying input-output mapping. This paper aims to address the problem of data and computation efficiency of program induction by leveraging information from related tasks. Specifically, we propose two approaches for cross-task knowledge transfer to improve program induction in limited-data scenarios. In our first proposal, portfolio adaptation, a set of induction models is pretrained on a set of related tasks, and the best model is adapte"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.04157","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":""},"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-05-18T00:33:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VZaQlp9A0pbFvIBYch7xsl6MVDpTgSUeLDJnq1ap8c0tErPSp7DQttjN491vJD8JaST1TdJbL7uW48wJv018AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T23:15:37.457865Z"},"content_sha256":"fb4348b221e6d86308061474bec0203fac730a033b68b4fa640f90fad2beb38e","schema_version":"1.0","event_id":"sha256:fb4348b221e6d86308061474bec0203fac730a033b68b4fa640f90fad2beb38e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WANE5K5ZP3KPBUXOVNELX4UOU5/bundle.json","state_url":"https://pith.science/pith/WANE5K5ZP3KPBUXOVNELX4UOU5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WANE5K5ZP3KPBUXOVNELX4UOU5/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-05-27T23:15:37Z","links":{"resolver":"https://pith.science/pith/WANE5K5ZP3KPBUXOVNELX4UOU5","bundle":"https://pith.science/pith/WANE5K5ZP3KPBUXOVNELX4UOU5/bundle.json","state":"https://pith.science/pith/WANE5K5ZP3KPBUXOVNELX4UOU5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WANE5K5ZP3KPBUXOVNELX4UOU5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:WANE5K5ZP3KPBUXOVNELX4UOU5","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":"48774136288b728ce3c78c915b1fbe17ee9b8493ef048a3591310ebe846a4ba5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-10-11T16:29:38Z","title_canon_sha256":"8686c7c74f85a65a4690e5f9de285e0f4dc9645f6db1a69a52b0fa13fa5761ca"},"schema_version":"1.0","source":{"id":"1710.04157","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.04157","created_at":"2026-05-18T00:33:04Z"},{"alias_kind":"arxiv_version","alias_value":"1710.04157v1","created_at":"2026-05-18T00:33:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.04157","created_at":"2026-05-18T00:33:04Z"},{"alias_kind":"pith_short_12","alias_value":"WANE5K5ZP3KP","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"WANE5K5ZP3KPBUXO","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"WANE5K5Z","created_at":"2026-05-18T12:31:53Z"}],"graph_snapshots":[{"event_id":"sha256:fb4348b221e6d86308061474bec0203fac730a033b68b4fa640f90fad2beb38e","target":"graph","created_at":"2026-05-18T00:33:04Z","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"},"paper":{"abstract_excerpt":"Most recently proposed methods for Neural Program Induction work under the assumption of having a large set of input/output (I/O) examples for learning any underlying input-output mapping. This paper aims to address the problem of data and computation efficiency of program induction by leveraging information from related tasks. Specifically, we propose two approaches for cross-task knowledge transfer to improve program induction in limited-data scenarios. In our first proposal, portfolio adaptation, a set of induction models is pretrained on a set of related tasks, and the best model is adapte","authors_text":"Jacob Devlin, Matthew Hausknecht, Pushmeet Kohli, Rishabh Singh, Rudy Bunel","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-10-11T16:29:38Z","title":"Neural Program Meta-Induction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.04157","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:6f10f90e0609c5655162539a199b780e351f446f123932995946feebd528313f","target":"record","created_at":"2026-05-18T00:33:04Z","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":"48774136288b728ce3c78c915b1fbe17ee9b8493ef048a3591310ebe846a4ba5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-10-11T16:29:38Z","title_canon_sha256":"8686c7c74f85a65a4690e5f9de285e0f4dc9645f6db1a69a52b0fa13fa5761ca"},"schema_version":"1.0","source":{"id":"1710.04157","kind":"arxiv","version":1}},"canonical_sha256":"b01a4eabb97ed4f0d2eeab48bbf28ea75b82deeb29c2ea5aec3bc485c9fed9d5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b01a4eabb97ed4f0d2eeab48bbf28ea75b82deeb29c2ea5aec3bc485c9fed9d5","first_computed_at":"2026-05-18T00:33:04.738432Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:33:04.738432Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"w9V5/3De2QlK7W/ij1ITDwA7CJcLOiAzDnM2/faSl/EB9zrTzpKDTYp5sF9TWOakV1zxTcr5fDGGowrrxNCUCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:33:04.738953Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.04157","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6f10f90e0609c5655162539a199b780e351f446f123932995946feebd528313f","sha256:fb4348b221e6d86308061474bec0203fac730a033b68b4fa640f90fad2beb38e"],"state_sha256":"3b9ac02c6d8e1e3fbc1bf8879f85cf1ebb097189250a02b64e7922625adf6bd9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"62Do14oc02BCIL8ddp64IePEEy27+aO5zFal9kzsCwQ5flMe2HSKc3aU9NNxzUNQA+vF5Q/7M6GviWdN9layAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T23:15:37.461417Z","bundle_sha256":"06684a5a7d07e9b1e876499b7e3579bf3079f20ae80c028e31025265ddecc9bc"}}