{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:3IQ7HYX7SNZUDVFNRQS6QJBYY6","short_pith_number":"pith:3IQ7HYX7","schema_version":"1.0","canonical_sha256":"da21f3e2ff937341d4ad8c25e82438c7be297f23d1f8d34807a183dc9e6bd855","source":{"kind":"arxiv","id":"1706.06383","version":1},"attestation_state":"computed","paper":{"title":"Programmable Agents","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE","stat.ML"],"primary_cat":"cs.AI","authors_text":"David Saxton, Misha Denil, Nando de Freitas, Sergio G\\'omez Colmenarejo, Serkan Cabi","submitted_at":"2017-06-20T12:19:34Z","abstract_excerpt":"We build deep RL agents that execute declarative programs expressed in formal language. The agents learn to ground the terms in this language in their environment, and can generalize their behavior at test time to execute new programs that refer to objects that were not referenced during training. The agents develop disentangled interpretable representations that allow them to generalize to a wide variety of zero-shot semantic tasks."},"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":"1706.06383","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-06-20T12:19:34Z","cross_cats_sorted":["cs.NE","stat.ML"],"title_canon_sha256":"603fdec6ec6a4694aa373fcd81379b6685ac0706af448fc0435c7d57ba3cfe32","abstract_canon_sha256":"14e236b2381e938fa8b6633d0f3c1ff5fe34d7b79843573fbae01b366b10cb2f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:03.379932Z","signature_b64":"yrkTH9Ufx3IXgmMKSeT6GdbvHuQN413XXQSLOHpAjRbFf6b/6QeEpKe7ikuv2Q4RNABHnPXOFPJeFZC6cwiBBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"da21f3e2ff937341d4ad8c25e82438c7be297f23d1f8d34807a183dc9e6bd855","last_reissued_at":"2026-05-18T00:42:03.379389Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:03.379389Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Programmable Agents","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE","stat.ML"],"primary_cat":"cs.AI","authors_text":"David Saxton, Misha Denil, Nando de Freitas, Sergio G\\'omez Colmenarejo, Serkan Cabi","submitted_at":"2017-06-20T12:19:34Z","abstract_excerpt":"We build deep RL agents that execute declarative programs expressed in formal language. The agents learn to ground the terms in this language in their environment, and can generalize their behavior at test time to execute new programs that refer to objects that were not referenced during training. The agents develop disentangled interpretable representations that allow them to generalize to a wide variety of zero-shot semantic tasks."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.06383","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1706.06383","created_at":"2026-05-18T00:42:03.379481+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.06383v1","created_at":"2026-05-18T00:42:03.379481+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.06383","created_at":"2026-05-18T00:42:03.379481+00:00"},{"alias_kind":"pith_short_12","alias_value":"3IQ7HYX7SNZU","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_16","alias_value":"3IQ7HYX7SNZUDVFN","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_8","alias_value":"3IQ7HYX7","created_at":"2026-05-18T12:30:58.224056+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2105.14491","citing_title":"How Attentive are Graph Attention Networks?","ref_index":11,"is_internal_anchor":true},{"citing_arxiv_id":"1710.10903","citing_title":"Graph Attention Networks","ref_index":4,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3IQ7HYX7SNZUDVFNRQS6QJBYY6","json":"https://pith.science/pith/3IQ7HYX7SNZUDVFNRQS6QJBYY6.json","graph_json":"https://pith.science/api/pith-number/3IQ7HYX7SNZUDVFNRQS6QJBYY6/graph.json","events_json":"https://pith.science/api/pith-number/3IQ7HYX7SNZUDVFNRQS6QJBYY6/events.json","paper":"https://pith.science/paper/3IQ7HYX7"},"agent_actions":{"view_html":"https://pith.science/pith/3IQ7HYX7SNZUDVFNRQS6QJBYY6","download_json":"https://pith.science/pith/3IQ7HYX7SNZUDVFNRQS6QJBYY6.json","view_paper":"https://pith.science/paper/3IQ7HYX7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.06383&json=true","fetch_graph":"https://pith.science/api/pith-number/3IQ7HYX7SNZUDVFNRQS6QJBYY6/graph.json","fetch_events":"https://pith.science/api/pith-number/3IQ7HYX7SNZUDVFNRQS6QJBYY6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3IQ7HYX7SNZUDVFNRQS6QJBYY6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3IQ7HYX7SNZUDVFNRQS6QJBYY6/action/storage_attestation","attest_author":"https://pith.science/pith/3IQ7HYX7SNZUDVFNRQS6QJBYY6/action/author_attestation","sign_citation":"https://pith.science/pith/3IQ7HYX7SNZUDVFNRQS6QJBYY6/action/citation_signature","submit_replication":"https://pith.science/pith/3IQ7HYX7SNZUDVFNRQS6QJBYY6/action/replication_record"}},"created_at":"2026-05-18T00:42:03.379481+00:00","updated_at":"2026-05-18T00:42:03.379481+00:00"}