{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:APN64FLV3QW2CJ6XBRQ276YSAW","short_pith_number":"pith:APN64FLV","canonical_record":{"source":{"id":"1902.00592","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2019-02-02T00:19:12Z","cross_cats_sorted":[],"title_canon_sha256":"f80ce66144cadb17825d02f8dd98ff2e8fe03f9fa3319bedae1049dc322f880e","abstract_canon_sha256":"72521fc0115003bb5a14f716eb010c7e3ebca10978d1eb0ddf3cb568be816fd5"},"schema_version":"1.0"},"canonical_sha256":"03dbee1575dc2da127d70c61affb120584ee478dadd311732ecdfac22c7d1e1a","source":{"kind":"arxiv","id":"1902.00592","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.00592","created_at":"2026-05-17T23:51:05Z"},{"alias_kind":"arxiv_version","alias_value":"1902.00592v2","created_at":"2026-05-17T23:51:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.00592","created_at":"2026-05-17T23:51:05Z"},{"alias_kind":"pith_short_12","alias_value":"APN64FLV3QW2","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"APN64FLV3QW2CJ6X","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"APN64FLV","created_at":"2026-05-18T12:33:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:APN64FLV3QW2CJ6XBRQ276YSAW","target":"record","payload":{"canonical_record":{"source":{"id":"1902.00592","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2019-02-02T00:19:12Z","cross_cats_sorted":[],"title_canon_sha256":"f80ce66144cadb17825d02f8dd98ff2e8fe03f9fa3319bedae1049dc322f880e","abstract_canon_sha256":"72521fc0115003bb5a14f716eb010c7e3ebca10978d1eb0ddf3cb568be816fd5"},"schema_version":"1.0"},"canonical_sha256":"03dbee1575dc2da127d70c61affb120584ee478dadd311732ecdfac22c7d1e1a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:05.032382Z","signature_b64":"24AWQJ9ECtlUMFJ6GE/al1dZHcwf7qYUgItUNCHsJVFyR18cXdtttfQkrfy5HK7h67oX7cQ/Eu633kMYPu4NBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"03dbee1575dc2da127d70c61affb120584ee478dadd311732ecdfac22c7d1e1a","last_reissued_at":"2026-05-17T23:51:05.031820Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:05.031820Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.00592","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-17T23:51:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VrBO0UkWr3p+uiURCreA6y1Kw90tQCoR0WbVBtFeJc01QzLz/NehXAycpTeBxquszZsgn8Yn8GIHNlKU5jREAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T04:28:35.025070Z"},"content_sha256":"514e53f55814da43bb6df040e48cd3679ac0be692ad2bddbfb4f4af305656686","schema_version":"1.0","event_id":"sha256:514e53f55814da43bb6df040e48cd3679ac0be692ad2bddbfb4f4af305656686"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:APN64FLV3QW2CJ6XBRQ276YSAW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An end-to-end Generative Retrieval Method for Sponsored Search Engine --Decoding Efficiently into a Closed Target Domain","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Chunwei Yan, Hanju Guan, Jinlong Hu, Kefeng Zhang, Muchenxuan Tong, Wenying Han, Xiaochun Liu, Yang Yu, Yijiang Lian, Ying Cao, Ying Li, Yue Wang, Zhigang Li, Zhijie Chen","submitted_at":"2019-02-02T00:19:12Z","abstract_excerpt":"In this paper, we present a generative retrieval method for sponsored search engine, which uses neural machine translation (NMT) to generate keywords directly from query. This method is completely end-to-end, which skips query rewriting and relevance judging phases in traditional retrieval systems. Different from standard machine translation, the target space in the retrieval setting is a constrained closed set, where only committed keywords should be generated. We present a Trie-based pruning technique in beam search to address this problem. The biggest challenge in deploying this method into"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.00592","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-17T23:51:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wxpcq/grvp3DJCaB4nNqJxs0NhzZ3rY1ZsotCTDjsnV3CvOSy4JVXhR2+nsLnyUl9mGGLJQ29SplkLhPZKMODQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T04:28:35.025727Z"},"content_sha256":"bf32d6b75cb8e335a6753542f111da88be1da887eccee00e5b12179e078d18d1","schema_version":"1.0","event_id":"sha256:bf32d6b75cb8e335a6753542f111da88be1da887eccee00e5b12179e078d18d1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/APN64FLV3QW2CJ6XBRQ276YSAW/bundle.json","state_url":"https://pith.science/pith/APN64FLV3QW2CJ6XBRQ276YSAW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/APN64FLV3QW2CJ6XBRQ276YSAW/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-27T04:28:35Z","links":{"resolver":"https://pith.science/pith/APN64FLV3QW2CJ6XBRQ276YSAW","bundle":"https://pith.science/pith/APN64FLV3QW2CJ6XBRQ276YSAW/bundle.json","state":"https://pith.science/pith/APN64FLV3QW2CJ6XBRQ276YSAW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/APN64FLV3QW2CJ6XBRQ276YSAW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:APN64FLV3QW2CJ6XBRQ276YSAW","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":"72521fc0115003bb5a14f716eb010c7e3ebca10978d1eb0ddf3cb568be816fd5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2019-02-02T00:19:12Z","title_canon_sha256":"f80ce66144cadb17825d02f8dd98ff2e8fe03f9fa3319bedae1049dc322f880e"},"schema_version":"1.0","source":{"id":"1902.00592","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.00592","created_at":"2026-05-17T23:51:05Z"},{"alias_kind":"arxiv_version","alias_value":"1902.00592v2","created_at":"2026-05-17T23:51:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.00592","created_at":"2026-05-17T23:51:05Z"},{"alias_kind":"pith_short_12","alias_value":"APN64FLV3QW2","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"APN64FLV3QW2CJ6X","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"APN64FLV","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:bf32d6b75cb8e335a6753542f111da88be1da887eccee00e5b12179e078d18d1","target":"graph","created_at":"2026-05-17T23:51:05Z","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":"In this paper, we present a generative retrieval method for sponsored search engine, which uses neural machine translation (NMT) to generate keywords directly from query. This method is completely end-to-end, which skips query rewriting and relevance judging phases in traditional retrieval systems. Different from standard machine translation, the target space in the retrieval setting is a constrained closed set, where only committed keywords should be generated. We present a Trie-based pruning technique in beam search to address this problem. The biggest challenge in deploying this method into","authors_text":"Chunwei Yan, Hanju Guan, Jinlong Hu, Kefeng Zhang, Muchenxuan Tong, Wenying Han, Xiaochun Liu, Yang Yu, Yijiang Lian, Ying Cao, Ying Li, Yue Wang, Zhigang Li, Zhijie Chen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2019-02-02T00:19:12Z","title":"An end-to-end Generative Retrieval Method for Sponsored Search Engine --Decoding Efficiently into a Closed Target Domain"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.00592","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:514e53f55814da43bb6df040e48cd3679ac0be692ad2bddbfb4f4af305656686","target":"record","created_at":"2026-05-17T23:51:05Z","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":"72521fc0115003bb5a14f716eb010c7e3ebca10978d1eb0ddf3cb568be816fd5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2019-02-02T00:19:12Z","title_canon_sha256":"f80ce66144cadb17825d02f8dd98ff2e8fe03f9fa3319bedae1049dc322f880e"},"schema_version":"1.0","source":{"id":"1902.00592","kind":"arxiv","version":2}},"canonical_sha256":"03dbee1575dc2da127d70c61affb120584ee478dadd311732ecdfac22c7d1e1a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"03dbee1575dc2da127d70c61affb120584ee478dadd311732ecdfac22c7d1e1a","first_computed_at":"2026-05-17T23:51:05.031820Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:51:05.031820Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"24AWQJ9ECtlUMFJ6GE/al1dZHcwf7qYUgItUNCHsJVFyR18cXdtttfQkrfy5HK7h67oX7cQ/Eu633kMYPu4NBw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:51:05.032382Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.00592","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:514e53f55814da43bb6df040e48cd3679ac0be692ad2bddbfb4f4af305656686","sha256:bf32d6b75cb8e335a6753542f111da88be1da887eccee00e5b12179e078d18d1"],"state_sha256":"eeebc2d6dc9f135e55d52ef98879f806c9262e89c6ce559fd17667c861aec51e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yOhcyW0TbFkmvVpcgq8c6rSEjypPYf5qeXVI2x+Fn+oYIBMoFHnlqO6+A6E6zaDg6VxgLVjEgl2FCK7fQhGaAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T04:28:35.028765Z","bundle_sha256":"85ff731e8fbd54d63949e6a9f3cafc4d662c861ed30dee68682510b00b119083"}}