{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:CSHAH4V3O2XQ7AGXIV25HB7EER","short_pith_number":"pith:CSHAH4V3","canonical_record":{"source":{"id":"1905.02265","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-05-06T21:14:41Z","cross_cats_sorted":[],"title_canon_sha256":"19f76a798194b6db77e17439a8d88324e6718f5f7d45eef790d0c7cbe5991efd","abstract_canon_sha256":"9d0a2f8ed21f1ab8ba94cf075be42910fb8f55d1dcc5c0a444013092dacf52d3"},"schema_version":"1.0"},"canonical_sha256":"148e03f2bb76af0f80d74575d387e424500c31f44acf21baac309d7f241a0002","source":{"kind":"arxiv","id":"1905.02265","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.02265","created_at":"2026-07-05T00:00:25Z"},{"alias_kind":"arxiv_version","alias_value":"1905.02265v3","created_at":"2026-07-05T00:00:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.02265","created_at":"2026-07-05T00:00:25Z"},{"alias_kind":"pith_short_12","alias_value":"CSHAH4V3O2XQ","created_at":"2026-07-05T00:00:25Z"},{"alias_kind":"pith_short_16","alias_value":"CSHAH4V3O2XQ7AGX","created_at":"2026-07-05T00:00:25Z"},{"alias_kind":"pith_short_8","alias_value":"CSHAH4V3","created_at":"2026-07-05T00:00:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:CSHAH4V3O2XQ7AGXIV25HB7EER","target":"record","payload":{"canonical_record":{"source":{"id":"1905.02265","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-05-06T21:14:41Z","cross_cats_sorted":[],"title_canon_sha256":"19f76a798194b6db77e17439a8d88324e6718f5f7d45eef790d0c7cbe5991efd","abstract_canon_sha256":"9d0a2f8ed21f1ab8ba94cf075be42910fb8f55d1dcc5c0a444013092dacf52d3"},"schema_version":"1.0"},"canonical_sha256":"148e03f2bb76af0f80d74575d387e424500c31f44acf21baac309d7f241a0002","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:00:25.513186Z","signature_b64":"FbXNjMRDlvm5vPO7anYxXiNTQb8ucNlTlzzDQml2gsW3LcyN7/kpNkMyoYGYAvUxM9nxtfn7YrgX4Sc3qtpwDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"148e03f2bb76af0f80d74575d387e424500c31f44acf21baac309d7f241a0002","last_reissued_at":"2026-07-05T00:00:25.512778Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:00:25.512778Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.02265","source_version":3,"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-07-05T00:00:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PPVVqEKWRwUcEzkctA/SonYM/JLOzpuMkAMrgaxpCI8Aq5cXr5Tn1FR/VGSxj5naId5Y1Z3cJuIVFvdv7Ik7DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T13:36:57.977547Z"},"content_sha256":"afd7bd434958bfa46e5dee19ec141b59a80f644cb0fe1902cfd8c74d43c10688","schema_version":"1.0","event_id":"sha256:afd7bd434958bfa46e5dee19ec141b59a80f644cb0fe1902cfd8c74d43c10688"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:CSHAH4V3O2XQ7AGXIV25HB7EER","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Comprehensible Context-driven Text Game Playing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Jonathan May, Xusen Yin","submitted_at":"2019-05-06T21:14:41Z","abstract_excerpt":"In order to train a computer agent to play a text-based computer game, we must represent each hidden state of the game. A Long Short-Term Memory (LSTM) model running over observed texts is a common choice for state construction. However, a normal Deep Q-learning Network (DQN) for such an agent requires millions of steps of training or more to converge. As such, an LSTM-based DQN can take tens of days to finish the training process. Though we can use a Convolutional Neural Network (CNN) as a text-encoder to construct states much faster than the LSTM, doing so without an understanding of the syn"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.02265","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1905.02265/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T00:00:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p2EOtCoxO5wFGdqlnkS0biIpuu6JCVWtj74NIGc2kdoiZbkPi4zbVUE6LSTT/bXgvDN2X2ZBA5p34tPEWHFGCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T13:36:57.978076Z"},"content_sha256":"476a215d2ed652ab19e74caa5f944430855ac39daae2ba9fdac57b17fcfcf8c9","schema_version":"1.0","event_id":"sha256:476a215d2ed652ab19e74caa5f944430855ac39daae2ba9fdac57b17fcfcf8c9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CSHAH4V3O2XQ7AGXIV25HB7EER/bundle.json","state_url":"https://pith.science/pith/CSHAH4V3O2XQ7AGXIV25HB7EER/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CSHAH4V3O2XQ7AGXIV25HB7EER/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-08-05T13:36:57Z","links":{"resolver":"https://pith.science/pith/CSHAH4V3O2XQ7AGXIV25HB7EER","bundle":"https://pith.science/pith/CSHAH4V3O2XQ7AGXIV25HB7EER/bundle.json","state":"https://pith.science/pith/CSHAH4V3O2XQ7AGXIV25HB7EER/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CSHAH4V3O2XQ7AGXIV25HB7EER/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:CSHAH4V3O2XQ7AGXIV25HB7EER","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":"9d0a2f8ed21f1ab8ba94cf075be42910fb8f55d1dcc5c0a444013092dacf52d3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-05-06T21:14:41Z","title_canon_sha256":"19f76a798194b6db77e17439a8d88324e6718f5f7d45eef790d0c7cbe5991efd"},"schema_version":"1.0","source":{"id":"1905.02265","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.02265","created_at":"2026-07-05T00:00:25Z"},{"alias_kind":"arxiv_version","alias_value":"1905.02265v3","created_at":"2026-07-05T00:00:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.02265","created_at":"2026-07-05T00:00:25Z"},{"alias_kind":"pith_short_12","alias_value":"CSHAH4V3O2XQ","created_at":"2026-07-05T00:00:25Z"},{"alias_kind":"pith_short_16","alias_value":"CSHAH4V3O2XQ7AGX","created_at":"2026-07-05T00:00:25Z"},{"alias_kind":"pith_short_8","alias_value":"CSHAH4V3","created_at":"2026-07-05T00:00:25Z"}],"graph_snapshots":[{"event_id":"sha256:476a215d2ed652ab19e74caa5f944430855ac39daae2ba9fdac57b17fcfcf8c9","target":"graph","created_at":"2026-07-05T00:00:25Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1905.02265/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In order to train a computer agent to play a text-based computer game, we must represent each hidden state of the game. A Long Short-Term Memory (LSTM) model running over observed texts is a common choice for state construction. However, a normal Deep Q-learning Network (DQN) for such an agent requires millions of steps of training or more to converge. As such, an LSTM-based DQN can take tens of days to finish the training process. Though we can use a Convolutional Neural Network (CNN) as a text-encoder to construct states much faster than the LSTM, doing so without an understanding of the syn","authors_text":"Jonathan May, Xusen Yin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-05-06T21:14:41Z","title":"Comprehensible Context-driven Text Game Playing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.02265","kind":"arxiv","version":3},"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:afd7bd434958bfa46e5dee19ec141b59a80f644cb0fe1902cfd8c74d43c10688","target":"record","created_at":"2026-07-05T00:00:25Z","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":"9d0a2f8ed21f1ab8ba94cf075be42910fb8f55d1dcc5c0a444013092dacf52d3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-05-06T21:14:41Z","title_canon_sha256":"19f76a798194b6db77e17439a8d88324e6718f5f7d45eef790d0c7cbe5991efd"},"schema_version":"1.0","source":{"id":"1905.02265","kind":"arxiv","version":3}},"canonical_sha256":"148e03f2bb76af0f80d74575d387e424500c31f44acf21baac309d7f241a0002","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"148e03f2bb76af0f80d74575d387e424500c31f44acf21baac309d7f241a0002","first_computed_at":"2026-07-05T00:00:25.512778Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:00:25.512778Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FbXNjMRDlvm5vPO7anYxXiNTQb8ucNlTlzzDQml2gsW3LcyN7/kpNkMyoYGYAvUxM9nxtfn7YrgX4Sc3qtpwDA==","signature_status":"signed_v1","signed_at":"2026-07-05T00:00:25.513186Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.02265","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:afd7bd434958bfa46e5dee19ec141b59a80f644cb0fe1902cfd8c74d43c10688","sha256:476a215d2ed652ab19e74caa5f944430855ac39daae2ba9fdac57b17fcfcf8c9"],"state_sha256":"b8a67de1d4cb5175b98d9a013074cd455abd87e18d8327171f0a3b0f40a0b881"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8ffWoVMHdCPRukrKke0ZZOSuqntZxkd4vMQIH723LtwAaog5QPx3HI2Q4cGdXEG0L35/dbHZmbcbxiq0sJc8CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T13:36:57.981670Z","bundle_sha256":"f47fad2f62d1e685a99c1502bc935f66fdf3d8d6dd7e6bd001c9b7c16fcd196d"}}