{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:JNRQIZC3PK7HOKLGEMQTS7HXXU","short_pith_number":"pith:JNRQIZC3","canonical_record":{"source":{"id":"1611.00020","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2016-10-31T20:07:23Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"ee580b0be57324accea2d45b27cf171dc11f2c429984b1c46369ba3b4285ad9c","abstract_canon_sha256":"6ba520ba8cfd895bba4694a4bbdfc778a3482a335aff6d49ad80f65607d62b27"},"schema_version":"1.0"},"canonical_sha256":"4b6304645b7abe7729662321397cf7bd2fe3a1e77c93ef3b770e19fa9d5af7c1","source":{"kind":"arxiv","id":"1611.00020","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.00020","created_at":"2026-05-18T00:45:58Z"},{"alias_kind":"arxiv_version","alias_value":"1611.00020v4","created_at":"2026-05-18T00:45:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.00020","created_at":"2026-05-18T00:45:58Z"},{"alias_kind":"pith_short_12","alias_value":"JNRQIZC3PK7H","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"JNRQIZC3PK7HOKLG","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"JNRQIZC3","created_at":"2026-05-18T12:30:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:JNRQIZC3PK7HOKLGEMQTS7HXXU","target":"record","payload":{"canonical_record":{"source":{"id":"1611.00020","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2016-10-31T20:07:23Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"ee580b0be57324accea2d45b27cf171dc11f2c429984b1c46369ba3b4285ad9c","abstract_canon_sha256":"6ba520ba8cfd895bba4694a4bbdfc778a3482a335aff6d49ad80f65607d62b27"},"schema_version":"1.0"},"canonical_sha256":"4b6304645b7abe7729662321397cf7bd2fe3a1e77c93ef3b770e19fa9d5af7c1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:58.487328Z","signature_b64":"9hXZBOyyte60DOxoUhE0JAlGUhCh9o/ig27o0Xbkt2bxsGB766U14gmAi+btLr5g/sjZsi64+6uorqH2yLssCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4b6304645b7abe7729662321397cf7bd2fe3a1e77c93ef3b770e19fa9d5af7c1","last_reissued_at":"2026-05-18T00:45:58.486721Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:58.486721Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.00020","source_version":4,"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:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r1TLWmO/gv3iPzZIOBDF0nhR+vLkKThLg+hbYA7QzXR7ZwxOulsZY9fmR7AmGB2/xvmFs2wDk9XnerzxJQg1Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T21:07:09.026855Z"},"content_sha256":"1b3d14132cfaf924202f1f55047b5d1331c37601a79b1890197bc824aecfd263","schema_version":"1.0","event_id":"sha256:1b3d14132cfaf924202f1f55047b5d1331c37601a79b1890197bc824aecfd263"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:JNRQIZC3PK7HOKLGEMQTS7HXXU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Neural Symbolic Machines: Learning Semantic Parsers on Freebase with Weak Supervision","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.CL","authors_text":"Chen Liang, Jonathan Berant, Kenneth D. Forbus, Ni Lao, Quoc Le","submitted_at":"2016-10-31T20:07:23Z","abstract_excerpt":"Harnessing the statistical power of neural networks to perform language understanding and symbolic reasoning is difficult, when it requires executing efficient discrete operations against a large knowledge-base. In this work, we introduce a Neural Symbolic Machine, which contains (a) a neural \"programmer\", i.e., a sequence-to-sequence model that maps language utterances to programs and utilizes a key-variable memory to handle compositionality (b) a symbolic \"computer\", i.e., a Lisp interpreter that performs program execution, and helps find good programs by pruning the search space. We apply R"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.00020","kind":"arxiv","version":4},"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:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LM+HQA0f957tl3jLnqVb1bkunFJ2ca3npgjp17sNrsaojHiaN0NJuX/SMwRPL4SUSxQP/5Lz/lriV5gXfCYbDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T21:07:09.027585Z"},"content_sha256":"54815b3638c10026cf8acf9cd0ae7d1d46a1d7401e0c83f14e15e630f8214f21","schema_version":"1.0","event_id":"sha256:54815b3638c10026cf8acf9cd0ae7d1d46a1d7401e0c83f14e15e630f8214f21"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JNRQIZC3PK7HOKLGEMQTS7HXXU/bundle.json","state_url":"https://pith.science/pith/JNRQIZC3PK7HOKLGEMQTS7HXXU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JNRQIZC3PK7HOKLGEMQTS7HXXU/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-06-08T21:07:09Z","links":{"resolver":"https://pith.science/pith/JNRQIZC3PK7HOKLGEMQTS7HXXU","bundle":"https://pith.science/pith/JNRQIZC3PK7HOKLGEMQTS7HXXU/bundle.json","state":"https://pith.science/pith/JNRQIZC3PK7HOKLGEMQTS7HXXU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JNRQIZC3PK7HOKLGEMQTS7HXXU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:JNRQIZC3PK7HOKLGEMQTS7HXXU","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":"6ba520ba8cfd895bba4694a4bbdfc778a3482a335aff6d49ad80f65607d62b27","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2016-10-31T20:07:23Z","title_canon_sha256":"ee580b0be57324accea2d45b27cf171dc11f2c429984b1c46369ba3b4285ad9c"},"schema_version":"1.0","source":{"id":"1611.00020","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.00020","created_at":"2026-05-18T00:45:58Z"},{"alias_kind":"arxiv_version","alias_value":"1611.00020v4","created_at":"2026-05-18T00:45:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.00020","created_at":"2026-05-18T00:45:58Z"},{"alias_kind":"pith_short_12","alias_value":"JNRQIZC3PK7H","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"JNRQIZC3PK7HOKLG","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"JNRQIZC3","created_at":"2026-05-18T12:30:25Z"}],"graph_snapshots":[{"event_id":"sha256:54815b3638c10026cf8acf9cd0ae7d1d46a1d7401e0c83f14e15e630f8214f21","target":"graph","created_at":"2026-05-18T00:45:58Z","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":"Harnessing the statistical power of neural networks to perform language understanding and symbolic reasoning is difficult, when it requires executing efficient discrete operations against a large knowledge-base. In this work, we introduce a Neural Symbolic Machine, which contains (a) a neural \"programmer\", i.e., a sequence-to-sequence model that maps language utterances to programs and utilizes a key-variable memory to handle compositionality (b) a symbolic \"computer\", i.e., a Lisp interpreter that performs program execution, and helps find good programs by pruning the search space. We apply R","authors_text":"Chen Liang, Jonathan Berant, Kenneth D. Forbus, Ni Lao, Quoc Le","cross_cats":["cs.AI","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2016-10-31T20:07:23Z","title":"Neural Symbolic Machines: Learning Semantic Parsers on Freebase with Weak Supervision"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.00020","kind":"arxiv","version":4},"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:1b3d14132cfaf924202f1f55047b5d1331c37601a79b1890197bc824aecfd263","target":"record","created_at":"2026-05-18T00:45:58Z","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":"6ba520ba8cfd895bba4694a4bbdfc778a3482a335aff6d49ad80f65607d62b27","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2016-10-31T20:07:23Z","title_canon_sha256":"ee580b0be57324accea2d45b27cf171dc11f2c429984b1c46369ba3b4285ad9c"},"schema_version":"1.0","source":{"id":"1611.00020","kind":"arxiv","version":4}},"canonical_sha256":"4b6304645b7abe7729662321397cf7bd2fe3a1e77c93ef3b770e19fa9d5af7c1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4b6304645b7abe7729662321397cf7bd2fe3a1e77c93ef3b770e19fa9d5af7c1","first_computed_at":"2026-05-18T00:45:58.486721Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:45:58.486721Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9hXZBOyyte60DOxoUhE0JAlGUhCh9o/ig27o0Xbkt2bxsGB766U14gmAi+btLr5g/sjZsi64+6uorqH2yLssCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:45:58.487328Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.00020","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1b3d14132cfaf924202f1f55047b5d1331c37601a79b1890197bc824aecfd263","sha256:54815b3638c10026cf8acf9cd0ae7d1d46a1d7401e0c83f14e15e630f8214f21"],"state_sha256":"941310d2e1cf320659d6fe16fa9ef3c4cd7b4bcb4f2d2aa992f70b9df8933922"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/+NsJvfJ+js2w9nrC0Pd0Nb1EwCCwXLB0pY+/Uw0fBvnbacKbHm79VTM/oiP3fLalozGiEdGMMuSoMsLoCr9Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T21:07:09.032097Z","bundle_sha256":"af5211d103aaabf1f5eb0e955e86f37fab3e1a1f6e70cdccd02b812c72f8c018"}}