{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:I56QVCUPUCUGNCVJKZRPKTZ5IR","short_pith_number":"pith:I56QVCUP","canonical_record":{"source":{"id":"1705.05524","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-05-16T04:30:56Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"b6ed3f78e4d791fefc5b3f0d5f20354d9d02aec610f27a12b79f95308ec238c5","abstract_canon_sha256":"ff4b09e2c70d5b9bfdb3a86d2274d1c6c0ca7e51b9f588eb5f70f53ff8bef192"},"schema_version":"1.0"},"canonical_sha256":"477d0a8a8fa0a8668aa95662f54f3d4463d40dfbd0365b4fdf6dba45fa064757","source":{"kind":"arxiv","id":"1705.05524","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.05524","created_at":"2026-05-18T00:31:31Z"},{"alias_kind":"arxiv_version","alias_value":"1705.05524v2","created_at":"2026-05-18T00:31:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.05524","created_at":"2026-05-18T00:31:31Z"},{"alias_kind":"pith_short_12","alias_value":"I56QVCUPUCUG","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"I56QVCUPUCUGNCVJ","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"I56QVCUP","created_at":"2026-05-18T12:31:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:I56QVCUPUCUGNCVJKZRPKTZ5IR","target":"record","payload":{"canonical_record":{"source":{"id":"1705.05524","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-05-16T04:30:56Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"b6ed3f78e4d791fefc5b3f0d5f20354d9d02aec610f27a12b79f95308ec238c5","abstract_canon_sha256":"ff4b09e2c70d5b9bfdb3a86d2274d1c6c0ca7e51b9f588eb5f70f53ff8bef192"},"schema_version":"1.0"},"canonical_sha256":"477d0a8a8fa0a8668aa95662f54f3d4463d40dfbd0365b4fdf6dba45fa064757","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:31.143165Z","signature_b64":"8aAygYUwa40f7JsI5XLPKgrtPWj/2FWjuaMRcLVmdsFFca9OyOM93S10bpyuVK1oNlBHl9L97T9hmJgmFhmUAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"477d0a8a8fa0a8668aa95662f54f3d4463d40dfbd0365b4fdf6dba45fa064757","last_reissued_at":"2026-05-18T00:31:31.142430Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:31.142430Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.05524","source_version":2,"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:31:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gSdIGTOcXFka1y7d18Gf/UApBDFSXCOYA3JjDr7zU1g+3/Iagq5UHzcZoqRXpj5IbgOLX34OzH7KCEgFCiWRAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T10:47:31.734411Z"},"content_sha256":"9d536132e027d48be73c20c97fa3a46d0c834aafb9edb400a7db1f1e1fe51725","schema_version":"1.0","event_id":"sha256:9d536132e027d48be73c20c97fa3a46d0c834aafb9edb400a7db1f1e1fe51725"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:I56QVCUPUCUGNCVJKZRPKTZ5IR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning Hard Alignments with Variational Inference","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.AI","authors_text":"Chung-Cheng Chiu, Colin Raffel, Dieterich Lawson, George Tucker, Kevin Swersky, Navdeep Jaitly","submitted_at":"2017-05-16T04:30:56Z","abstract_excerpt":"There has recently been significant interest in hard attention models for tasks such as object recognition, visual captioning and speech recognition. Hard attention can offer benefits over soft attention such as decreased computational cost, but training hard attention models can be difficult because of the discrete latent variables they introduce. Previous work used REINFORCE and Q-learning to approach these issues, but those methods can provide high-variance gradient estimates and be slow to train. In this paper, we tackle the problem of learning hard attention for a sequential task using va"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.05524","kind":"arxiv","version":2},"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:31:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UuS5HTqpju24et0tppDXWVDfWEZsSt1iHZmKMQZoEiX32Cn9FzAaairvB+DsG0j68Xc0UYccI39WahnH17u1Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T10:47:31.734772Z"},"content_sha256":"e1f0e8619e48db1ea8b8ac89f8a8d92652d26d8fd81a892b60aeb9c93cfbd290","schema_version":"1.0","event_id":"sha256:e1f0e8619e48db1ea8b8ac89f8a8d92652d26d8fd81a892b60aeb9c93cfbd290"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/I56QVCUPUCUGNCVJKZRPKTZ5IR/bundle.json","state_url":"https://pith.science/pith/I56QVCUPUCUGNCVJKZRPKTZ5IR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/I56QVCUPUCUGNCVJKZRPKTZ5IR/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-19T10:47:31Z","links":{"resolver":"https://pith.science/pith/I56QVCUPUCUGNCVJKZRPKTZ5IR","bundle":"https://pith.science/pith/I56QVCUPUCUGNCVJKZRPKTZ5IR/bundle.json","state":"https://pith.science/pith/I56QVCUPUCUGNCVJKZRPKTZ5IR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/I56QVCUPUCUGNCVJKZRPKTZ5IR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:I56QVCUPUCUGNCVJKZRPKTZ5IR","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":"ff4b09e2c70d5b9bfdb3a86d2274d1c6c0ca7e51b9f588eb5f70f53ff8bef192","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-05-16T04:30:56Z","title_canon_sha256":"b6ed3f78e4d791fefc5b3f0d5f20354d9d02aec610f27a12b79f95308ec238c5"},"schema_version":"1.0","source":{"id":"1705.05524","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.05524","created_at":"2026-05-18T00:31:31Z"},{"alias_kind":"arxiv_version","alias_value":"1705.05524v2","created_at":"2026-05-18T00:31:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.05524","created_at":"2026-05-18T00:31:31Z"},{"alias_kind":"pith_short_12","alias_value":"I56QVCUPUCUG","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"I56QVCUPUCUGNCVJ","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"I56QVCUP","created_at":"2026-05-18T12:31:21Z"}],"graph_snapshots":[{"event_id":"sha256:e1f0e8619e48db1ea8b8ac89f8a8d92652d26d8fd81a892b60aeb9c93cfbd290","target":"graph","created_at":"2026-05-18T00:31:31Z","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":"There has recently been significant interest in hard attention models for tasks such as object recognition, visual captioning and speech recognition. Hard attention can offer benefits over soft attention such as decreased computational cost, but training hard attention models can be difficult because of the discrete latent variables they introduce. Previous work used REINFORCE and Q-learning to approach these issues, but those methods can provide high-variance gradient estimates and be slow to train. In this paper, we tackle the problem of learning hard attention for a sequential task using va","authors_text":"Chung-Cheng Chiu, Colin Raffel, Dieterich Lawson, George Tucker, Kevin Swersky, Navdeep Jaitly","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-05-16T04:30:56Z","title":"Learning Hard Alignments with Variational Inference"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.05524","kind":"arxiv","version":2},"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:9d536132e027d48be73c20c97fa3a46d0c834aafb9edb400a7db1f1e1fe51725","target":"record","created_at":"2026-05-18T00:31:31Z","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":"ff4b09e2c70d5b9bfdb3a86d2274d1c6c0ca7e51b9f588eb5f70f53ff8bef192","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-05-16T04:30:56Z","title_canon_sha256":"b6ed3f78e4d791fefc5b3f0d5f20354d9d02aec610f27a12b79f95308ec238c5"},"schema_version":"1.0","source":{"id":"1705.05524","kind":"arxiv","version":2}},"canonical_sha256":"477d0a8a8fa0a8668aa95662f54f3d4463d40dfbd0365b4fdf6dba45fa064757","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"477d0a8a8fa0a8668aa95662f54f3d4463d40dfbd0365b4fdf6dba45fa064757","first_computed_at":"2026-05-18T00:31:31.142430Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:31:31.142430Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8aAygYUwa40f7JsI5XLPKgrtPWj/2FWjuaMRcLVmdsFFca9OyOM93S10bpyuVK1oNlBHl9L97T9hmJgmFhmUAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:31:31.143165Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.05524","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9d536132e027d48be73c20c97fa3a46d0c834aafb9edb400a7db1f1e1fe51725","sha256:e1f0e8619e48db1ea8b8ac89f8a8d92652d26d8fd81a892b60aeb9c93cfbd290"],"state_sha256":"af038480b4bdc68f50de4c58a7a01774aac531b85e81fc5f0fd648a3e13ee41e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Gmd7cI5q+n95qJlYMEOZVbt7sUq8LOjJv3bmCRjwUz9hBj+T/nd8lwfHUDv2+k2i4cQDe//3p+Ya/+qwNOJNCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T10:47:31.736433Z","bundle_sha256":"3456c531804f65f8619f5e953299e46537e0b8163bb874d16f27971d98c27850"}}