{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:52UM4YYUGBKIWIZCWU6EPF7E5W","short_pith_number":"pith:52UM4YYU","canonical_record":{"source":{"id":"1610.02424","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-10-07T20:56:47Z","cross_cats_sorted":["cs.CL","cs.CV"],"title_canon_sha256":"1dedb54d95df8a2ad98d96310892ccc3460aef26aef91a8e4d736c529425c19a","abstract_canon_sha256":"434448efa4aff710e9ffadec62142b38271656144687e750b6e103e316a741d6"},"schema_version":"1.0"},"canonical_sha256":"eea8ce631430548b2322b53c4797e4edb5498cc5ec189105e67aa3ee0ee557e5","source":{"kind":"arxiv","id":"1610.02424","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.02424","created_at":"2026-05-18T00:02:45Z"},{"alias_kind":"arxiv_version","alias_value":"1610.02424v2","created_at":"2026-05-18T00:02:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.02424","created_at":"2026-05-18T00:02:45Z"},{"alias_kind":"pith_short_12","alias_value":"52UM4YYUGBKI","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"52UM4YYUGBKIWIZC","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"52UM4YYU","created_at":"2026-05-18T12:29:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:52UM4YYUGBKIWIZCWU6EPF7E5W","target":"record","payload":{"canonical_record":{"source":{"id":"1610.02424","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-10-07T20:56:47Z","cross_cats_sorted":["cs.CL","cs.CV"],"title_canon_sha256":"1dedb54d95df8a2ad98d96310892ccc3460aef26aef91a8e4d736c529425c19a","abstract_canon_sha256":"434448efa4aff710e9ffadec62142b38271656144687e750b6e103e316a741d6"},"schema_version":"1.0"},"canonical_sha256":"eea8ce631430548b2322b53c4797e4edb5498cc5ec189105e67aa3ee0ee557e5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:45.918297Z","signature_b64":"JVqY7hO4Mm7DDAXCvnEVV+zEUZgKRL0O0ZiDWHxtpZ2R7EywLw/ntVC3wckeQPCLmBY+JkHIbnjiWbVox+gpDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eea8ce631430548b2322b53c4797e4edb5498cc5ec189105e67aa3ee0ee557e5","last_reissued_at":"2026-05-18T00:02:45.917695Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:45.917695Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1610.02424","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:02:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DqB2xKNblYmDSvw/RHdyt+9XXHRxhQphu0Wa9eVP3Gynm5sAPNICZGmHOPy9ndYjDezwRGE/8s0hEGPc5f1OCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T06:23:03.945046Z"},"content_sha256":"ef2743e9a95c3afc5a604dead966d3f3f2d6aa4739767ae42fa37fea4b24df35","schema_version":"1.0","event_id":"sha256:ef2743e9a95c3afc5a604dead966d3f3f2d6aa4739767ae42fa37fea4b24df35"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:52UM4YYUGBKIWIZCWU6EPF7E5W","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Diverse Beam Search: Decoding Diverse Solutions from Neural Sequence Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL","cs.CV"],"primary_cat":"cs.AI","authors_text":"Ashwin K Vijayakumar, David Crandall, Dhruv Batra, Michael Cogswell, Qing Sun, Ramprasath R. Selvaraju, Stefan Lee","submitted_at":"2016-10-07T20:56:47Z","abstract_excerpt":"Neural sequence models are widely used to model time-series data. Equally ubiquitous is the usage of beam search (BS) as an approximate inference algorithm to decode output sequences from these models. BS explores the search space in a greedy left-right fashion retaining only the top-B candidates - resulting in sequences that differ only slightly from each other. Producing lists of nearly identical sequences is not only computationally wasteful but also typically fails to capture the inherent ambiguity of complex AI tasks. To overcome this problem, we propose Diverse Beam Search (DBS), an alte"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.02424","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:02:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m/tsms8o4n3ieqHTif+V8PUzU+fCbKbHyvJTDuPeX+A4ROZoFSqNf7JmeJF6FW0Texq1MgpgKIxtvPYGBQfwAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T06:23:03.945405Z"},"content_sha256":"6b8519188c147ea0bc9a446185ecb9d6457dd0e3b6a68f4507e2d88b2bfa797f","schema_version":"1.0","event_id":"sha256:6b8519188c147ea0bc9a446185ecb9d6457dd0e3b6a68f4507e2d88b2bfa797f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/52UM4YYUGBKIWIZCWU6EPF7E5W/bundle.json","state_url":"https://pith.science/pith/52UM4YYUGBKIWIZCWU6EPF7E5W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/52UM4YYUGBKIWIZCWU6EPF7E5W/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-02T06:23:03Z","links":{"resolver":"https://pith.science/pith/52UM4YYUGBKIWIZCWU6EPF7E5W","bundle":"https://pith.science/pith/52UM4YYUGBKIWIZCWU6EPF7E5W/bundle.json","state":"https://pith.science/pith/52UM4YYUGBKIWIZCWU6EPF7E5W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/52UM4YYUGBKIWIZCWU6EPF7E5W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:52UM4YYUGBKIWIZCWU6EPF7E5W","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":"434448efa4aff710e9ffadec62142b38271656144687e750b6e103e316a741d6","cross_cats_sorted":["cs.CL","cs.CV"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-10-07T20:56:47Z","title_canon_sha256":"1dedb54d95df8a2ad98d96310892ccc3460aef26aef91a8e4d736c529425c19a"},"schema_version":"1.0","source":{"id":"1610.02424","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.02424","created_at":"2026-05-18T00:02:45Z"},{"alias_kind":"arxiv_version","alias_value":"1610.02424v2","created_at":"2026-05-18T00:02:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.02424","created_at":"2026-05-18T00:02:45Z"},{"alias_kind":"pith_short_12","alias_value":"52UM4YYUGBKI","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"52UM4YYUGBKIWIZC","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"52UM4YYU","created_at":"2026-05-18T12:29:58Z"}],"graph_snapshots":[{"event_id":"sha256:6b8519188c147ea0bc9a446185ecb9d6457dd0e3b6a68f4507e2d88b2bfa797f","target":"graph","created_at":"2026-05-18T00:02:45Z","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":"Neural sequence models are widely used to model time-series data. Equally ubiquitous is the usage of beam search (BS) as an approximate inference algorithm to decode output sequences from these models. BS explores the search space in a greedy left-right fashion retaining only the top-B candidates - resulting in sequences that differ only slightly from each other. Producing lists of nearly identical sequences is not only computationally wasteful but also typically fails to capture the inherent ambiguity of complex AI tasks. To overcome this problem, we propose Diverse Beam Search (DBS), an alte","authors_text":"Ashwin K Vijayakumar, David Crandall, Dhruv Batra, Michael Cogswell, Qing Sun, Ramprasath R. Selvaraju, Stefan Lee","cross_cats":["cs.CL","cs.CV"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-10-07T20:56:47Z","title":"Diverse Beam Search: Decoding Diverse Solutions from Neural Sequence Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.02424","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:ef2743e9a95c3afc5a604dead966d3f3f2d6aa4739767ae42fa37fea4b24df35","target":"record","created_at":"2026-05-18T00:02:45Z","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":"434448efa4aff710e9ffadec62142b38271656144687e750b6e103e316a741d6","cross_cats_sorted":["cs.CL","cs.CV"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-10-07T20:56:47Z","title_canon_sha256":"1dedb54d95df8a2ad98d96310892ccc3460aef26aef91a8e4d736c529425c19a"},"schema_version":"1.0","source":{"id":"1610.02424","kind":"arxiv","version":2}},"canonical_sha256":"eea8ce631430548b2322b53c4797e4edb5498cc5ec189105e67aa3ee0ee557e5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eea8ce631430548b2322b53c4797e4edb5498cc5ec189105e67aa3ee0ee557e5","first_computed_at":"2026-05-18T00:02:45.917695Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:02:45.917695Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JVqY7hO4Mm7DDAXCvnEVV+zEUZgKRL0O0ZiDWHxtpZ2R7EywLw/ntVC3wckeQPCLmBY+JkHIbnjiWbVox+gpDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:02:45.918297Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.02424","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ef2743e9a95c3afc5a604dead966d3f3f2d6aa4739767ae42fa37fea4b24df35","sha256:6b8519188c147ea0bc9a446185ecb9d6457dd0e3b6a68f4507e2d88b2bfa797f"],"state_sha256":"ac911114c5066bfcff20dfe3a3d10b1f3b14a6f6faf4b85c4f8afc15e3817e2b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xCOTiBXpA/qyyKvwxh8izaKoIAnY5uJYH2sWZIV5fJPWcGojO6nfwVT81L6U56noI5jWGAx0crfFgh1zUcZ/CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T06:23:03.947347Z","bundle_sha256":"9c2df7fff34900c55068c1094abf7ad419e611cb876bcac87d287e5a32af5cc5"}}