{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:2GVJE5TIGMYWIEU3KQXHK56752","short_pith_number":"pith:2GVJE5TI","canonical_record":{"source":{"id":"1704.06611","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-04-21T16:02:26Z","cross_cats_sorted":["cs.NE","cs.PL"],"title_canon_sha256":"5bbfcf1bc4d862c4a48c313342a7286993fdc9e2d3c7a08a881b14fa8c1deca2","abstract_canon_sha256":"6a3b10f3767f9d44e4ca5ad946386ca176cbb7ce65d0a94a02921a1724cd51bf"},"schema_version":"1.0"},"canonical_sha256":"d1aa927668333164129b542e7577dfeeabf2d8ba1d33aa750ec107d629bd480d","source":{"kind":"arxiv","id":"1704.06611","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.06611","created_at":"2026-05-18T00:45:59Z"},{"alias_kind":"arxiv_version","alias_value":"1704.06611v1","created_at":"2026-05-18T00:45:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.06611","created_at":"2026-05-18T00:45:59Z"},{"alias_kind":"pith_short_12","alias_value":"2GVJE5TIGMYW","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"2GVJE5TIGMYWIEU3","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"2GVJE5TI","created_at":"2026-05-18T12:30:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:2GVJE5TIGMYWIEU3KQXHK56752","target":"record","payload":{"canonical_record":{"source":{"id":"1704.06611","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-04-21T16:02:26Z","cross_cats_sorted":["cs.NE","cs.PL"],"title_canon_sha256":"5bbfcf1bc4d862c4a48c313342a7286993fdc9e2d3c7a08a881b14fa8c1deca2","abstract_canon_sha256":"6a3b10f3767f9d44e4ca5ad946386ca176cbb7ce65d0a94a02921a1724cd51bf"},"schema_version":"1.0"},"canonical_sha256":"d1aa927668333164129b542e7577dfeeabf2d8ba1d33aa750ec107d629bd480d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:59.243423Z","signature_b64":"TpUbW8cbLNhy5ClcBD9Obr11XUCPt1WgJEKlZpMLBiWNey+vwqU6iLOvnEO5PXiEg0QA9sw13Q6Qojnw9DrNBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d1aa927668333164129b542e7577dfeeabf2d8ba1d33aa750ec107d629bd480d","last_reissued_at":"2026-05-18T00:45:59.242943Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:59.242943Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.06611","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:45:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bs57FBii44AznIorONvqToLz0Z+il4M5hynqOZOzVrgIaDC997C3Clvco7j4IasMgAnqSMNjQKe36ZCPmRnPCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T17:06:09.084708Z"},"content_sha256":"7053f84d8c7a7386f40c2187073017007f302df1abdf86464f8472d841a15639","schema_version":"1.0","event_id":"sha256:7053f84d8c7a7386f40c2187073017007f302df1abdf86464f8472d841a15639"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:2GVJE5TIGMYWIEU3KQXHK56752","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Making Neural Programming Architectures Generalize via Recursion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE","cs.PL"],"primary_cat":"cs.LG","authors_text":"Dawn Song, Jonathon Cai, Richard Shin","submitted_at":"2017-04-21T16:02:26Z","abstract_excerpt":"Empirically, neural networks that attempt to learn programs from data have exhibited poor generalizability. Moreover, it has traditionally been difficult to reason about the behavior of these models beyond a certain level of input complexity. In order to address these issues, we propose augmenting neural architectures with a key abstraction: recursion. As an application, we implement recursion in the Neural Programmer-Interpreter framework on four tasks: grade-school addition, bubble sort, topological sort, and quicksort. We demonstrate superior generalizability and interpretability with small"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.06611","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:45:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f9MFUMkgL5NcS5Ko4U45VjCHfCGivVMq4Esk9IeBIEVv3gY6sOvd3n5DWjUIRxiGtmCcnETc7IPAKq6QZOG5DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T17:06:09.085064Z"},"content_sha256":"1e7838b3ccb4b2f48095c39751da5a1952b01946e30815b4aedced9ff63f336a","schema_version":"1.0","event_id":"sha256:1e7838b3ccb4b2f48095c39751da5a1952b01946e30815b4aedced9ff63f336a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2GVJE5TIGMYWIEU3KQXHK56752/bundle.json","state_url":"https://pith.science/pith/2GVJE5TIGMYWIEU3KQXHK56752/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2GVJE5TIGMYWIEU3KQXHK56752/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-29T17:06:09Z","links":{"resolver":"https://pith.science/pith/2GVJE5TIGMYWIEU3KQXHK56752","bundle":"https://pith.science/pith/2GVJE5TIGMYWIEU3KQXHK56752/bundle.json","state":"https://pith.science/pith/2GVJE5TIGMYWIEU3KQXHK56752/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2GVJE5TIGMYWIEU3KQXHK56752/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:2GVJE5TIGMYWIEU3KQXHK56752","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":"6a3b10f3767f9d44e4ca5ad946386ca176cbb7ce65d0a94a02921a1724cd51bf","cross_cats_sorted":["cs.NE","cs.PL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-04-21T16:02:26Z","title_canon_sha256":"5bbfcf1bc4d862c4a48c313342a7286993fdc9e2d3c7a08a881b14fa8c1deca2"},"schema_version":"1.0","source":{"id":"1704.06611","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.06611","created_at":"2026-05-18T00:45:59Z"},{"alias_kind":"arxiv_version","alias_value":"1704.06611v1","created_at":"2026-05-18T00:45:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.06611","created_at":"2026-05-18T00:45:59Z"},{"alias_kind":"pith_short_12","alias_value":"2GVJE5TIGMYW","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"2GVJE5TIGMYWIEU3","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"2GVJE5TI","created_at":"2026-05-18T12:30:55Z"}],"graph_snapshots":[{"event_id":"sha256:1e7838b3ccb4b2f48095c39751da5a1952b01946e30815b4aedced9ff63f336a","target":"graph","created_at":"2026-05-18T00:45:59Z","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":"Empirically, neural networks that attempt to learn programs from data have exhibited poor generalizability. Moreover, it has traditionally been difficult to reason about the behavior of these models beyond a certain level of input complexity. In order to address these issues, we propose augmenting neural architectures with a key abstraction: recursion. As an application, we implement recursion in the Neural Programmer-Interpreter framework on four tasks: grade-school addition, bubble sort, topological sort, and quicksort. We demonstrate superior generalizability and interpretability with small","authors_text":"Dawn Song, Jonathon Cai, Richard Shin","cross_cats":["cs.NE","cs.PL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-04-21T16:02:26Z","title":"Making Neural Programming Architectures Generalize via Recursion"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.06611","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:7053f84d8c7a7386f40c2187073017007f302df1abdf86464f8472d841a15639","target":"record","created_at":"2026-05-18T00:45:59Z","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":"6a3b10f3767f9d44e4ca5ad946386ca176cbb7ce65d0a94a02921a1724cd51bf","cross_cats_sorted":["cs.NE","cs.PL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-04-21T16:02:26Z","title_canon_sha256":"5bbfcf1bc4d862c4a48c313342a7286993fdc9e2d3c7a08a881b14fa8c1deca2"},"schema_version":"1.0","source":{"id":"1704.06611","kind":"arxiv","version":1}},"canonical_sha256":"d1aa927668333164129b542e7577dfeeabf2d8ba1d33aa750ec107d629bd480d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d1aa927668333164129b542e7577dfeeabf2d8ba1d33aa750ec107d629bd480d","first_computed_at":"2026-05-18T00:45:59.242943Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:45:59.242943Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TpUbW8cbLNhy5ClcBD9Obr11XUCPt1WgJEKlZpMLBiWNey+vwqU6iLOvnEO5PXiEg0QA9sw13Q6Qojnw9DrNBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:45:59.243423Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.06611","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7053f84d8c7a7386f40c2187073017007f302df1abdf86464f8472d841a15639","sha256:1e7838b3ccb4b2f48095c39751da5a1952b01946e30815b4aedced9ff63f336a"],"state_sha256":"83548210acdc7aefaddded61db21b7fd72dcd17281bdc0a34a0b11433bf351fe"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yXde8BqsRZ+e3r9VYx9mEMynfODZYtopC/cF5TUKuktQTjb8+FqZmpjBIlEcHU08UQgA4E95weQ39U3kOAlcAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T17:06:09.087412Z","bundle_sha256":"0bff162fbd598e134d8f664a01e0211b6d9ece2473defcc05f34adfc197b9973"}}