{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:5NHYGV3NEOFVCBS2T3R3PJNQZ3","short_pith_number":"pith:5NHYGV3N","canonical_record":{"source":{"id":"2208.10751","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2022-08-23T06:10:06Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"b4d8439ff2e11c76fa1df6f0e8042f444827532b63f36c254a4fa436be25533f","abstract_canon_sha256":"c062ae51c726979b1173c32611e121510844e4deb121b253ff76596bc0815215"},"schema_version":"1.0"},"canonical_sha256":"eb4f83576d238b51065a9ee3b7a5b0cef1429259175a3a642a47f32addad6034","source":{"kind":"arxiv","id":"2208.10751","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2208.10751","created_at":"2026-07-05T04:50:39Z"},{"alias_kind":"arxiv_version","alias_value":"2208.10751v1","created_at":"2026-07-05T04:50:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2208.10751","created_at":"2026-07-05T04:50:39Z"},{"alias_kind":"pith_short_12","alias_value":"5NHYGV3NEOFV","created_at":"2026-07-05T04:50:39Z"},{"alias_kind":"pith_short_16","alias_value":"5NHYGV3NEOFVCBS2","created_at":"2026-07-05T04:50:39Z"},{"alias_kind":"pith_short_8","alias_value":"5NHYGV3N","created_at":"2026-07-05T04:50:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:5NHYGV3NEOFVCBS2T3R3PJNQZ3","target":"record","payload":{"canonical_record":{"source":{"id":"2208.10751","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2022-08-23T06:10:06Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"b4d8439ff2e11c76fa1df6f0e8042f444827532b63f36c254a4fa436be25533f","abstract_canon_sha256":"c062ae51c726979b1173c32611e121510844e4deb121b253ff76596bc0815215"},"schema_version":"1.0"},"canonical_sha256":"eb4f83576d238b51065a9ee3b7a5b0cef1429259175a3a642a47f32addad6034","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:50:39.790400Z","signature_b64":"CgUnEvnOph5Vt9618fKWbdWlm+vEWkTa36dTB0LVCL7qzGAJmk8Cf/QYIDHjTDQPoDOcQyfC1E/mYwzeP4GdCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eb4f83576d238b51065a9ee3b7a5b0cef1429259175a3a642a47f32addad6034","last_reissued_at":"2026-07-05T04:50:39.789950Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:50:39.789950Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2208.10751","source_version":1,"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-05T04:50:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kNiyM8SI+P2Tu/8IIWU8bze1/z57xdUoW3phuzGk9sVQT7Dp5FUPOeGsyxaQFycUABZsaAHnxdZ8FageixUSBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T21:18:46.434907Z"},"content_sha256":"d291c01f28f460f89f27b7f0b9460a8db87f6630bbf3a804aa4409f17d4a0853","schema_version":"1.0","event_id":"sha256:d291c01f28f460f89f27b7f0b9460a8db87f6630bbf3a804aa4409f17d4a0853"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:5NHYGV3NEOFVCBS2T3R3PJNQZ3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Predicting Query-Item Relationship using Adversarial Training and Robust Modeling Techniques","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.IR","authors_text":"Min Seok Kim","submitted_at":"2022-08-23T06:10:06Z","abstract_excerpt":"We present an effective way to predict search query-item relationship. We combine pre-trained transformer and LSTM models, and increase model robustness using adversarial training, exponential moving average, multi-sampled dropout, and diversity based ensemble, to tackle an extremely difficult problem of predicting against queries not seen before. All of our strategies focus on increasing robustness of deep learning models and are applicable in any task where deep learning models are used. Applying our strategies, we achieved 10th place in KDD Cup 2022 Product Substitution Classification task."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2208.10751","kind":"arxiv","version":1},"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/2208.10751/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-05T04:50:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NkCdLQsACPRjlAnixcqRv6N+RXcwpP5ubON6af/A5ehNReUyFF0OxNYdNvshzTfIGEpxjwtm1vT35Qhr524gBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T21:18:46.435420Z"},"content_sha256":"4fcafd54b41b751b2d28f1af247d2f0b85b38edde13fe4ea8560fa72f80bec25","schema_version":"1.0","event_id":"sha256:4fcafd54b41b751b2d28f1af247d2f0b85b38edde13fe4ea8560fa72f80bec25"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5NHYGV3NEOFVCBS2T3R3PJNQZ3/bundle.json","state_url":"https://pith.science/pith/5NHYGV3NEOFVCBS2T3R3PJNQZ3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5NHYGV3NEOFVCBS2T3R3PJNQZ3/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-23T21:18:46Z","links":{"resolver":"https://pith.science/pith/5NHYGV3NEOFVCBS2T3R3PJNQZ3","bundle":"https://pith.science/pith/5NHYGV3NEOFVCBS2T3R3PJNQZ3/bundle.json","state":"https://pith.science/pith/5NHYGV3NEOFVCBS2T3R3PJNQZ3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5NHYGV3NEOFVCBS2T3R3PJNQZ3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:5NHYGV3NEOFVCBS2T3R3PJNQZ3","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":"c062ae51c726979b1173c32611e121510844e4deb121b253ff76596bc0815215","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2022-08-23T06:10:06Z","title_canon_sha256":"b4d8439ff2e11c76fa1df6f0e8042f444827532b63f36c254a4fa436be25533f"},"schema_version":"1.0","source":{"id":"2208.10751","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2208.10751","created_at":"2026-07-05T04:50:39Z"},{"alias_kind":"arxiv_version","alias_value":"2208.10751v1","created_at":"2026-07-05T04:50:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2208.10751","created_at":"2026-07-05T04:50:39Z"},{"alias_kind":"pith_short_12","alias_value":"5NHYGV3NEOFV","created_at":"2026-07-05T04:50:39Z"},{"alias_kind":"pith_short_16","alias_value":"5NHYGV3NEOFVCBS2","created_at":"2026-07-05T04:50:39Z"},{"alias_kind":"pith_short_8","alias_value":"5NHYGV3N","created_at":"2026-07-05T04:50:39Z"}],"graph_snapshots":[{"event_id":"sha256:4fcafd54b41b751b2d28f1af247d2f0b85b38edde13fe4ea8560fa72f80bec25","target":"graph","created_at":"2026-07-05T04:50:39Z","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/2208.10751/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We present an effective way to predict search query-item relationship. We combine pre-trained transformer and LSTM models, and increase model robustness using adversarial training, exponential moving average, multi-sampled dropout, and diversity based ensemble, to tackle an extremely difficult problem of predicting against queries not seen before. All of our strategies focus on increasing robustness of deep learning models and are applicable in any task where deep learning models are used. Applying our strategies, we achieved 10th place in KDD Cup 2022 Product Substitution Classification task.","authors_text":"Min Seok Kim","cross_cats":["cs.AI"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2022-08-23T06:10:06Z","title":"Predicting Query-Item Relationship using Adversarial Training and Robust Modeling Techniques"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2208.10751","kind":"arxiv","version":1},"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:d291c01f28f460f89f27b7f0b9460a8db87f6630bbf3a804aa4409f17d4a0853","target":"record","created_at":"2026-07-05T04:50:39Z","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":"c062ae51c726979b1173c32611e121510844e4deb121b253ff76596bc0815215","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2022-08-23T06:10:06Z","title_canon_sha256":"b4d8439ff2e11c76fa1df6f0e8042f444827532b63f36c254a4fa436be25533f"},"schema_version":"1.0","source":{"id":"2208.10751","kind":"arxiv","version":1}},"canonical_sha256":"eb4f83576d238b51065a9ee3b7a5b0cef1429259175a3a642a47f32addad6034","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eb4f83576d238b51065a9ee3b7a5b0cef1429259175a3a642a47f32addad6034","first_computed_at":"2026-07-05T04:50:39.789950Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:50:39.789950Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CgUnEvnOph5Vt9618fKWbdWlm+vEWkTa36dTB0LVCL7qzGAJmk8Cf/QYIDHjTDQPoDOcQyfC1E/mYwzeP4GdCg==","signature_status":"signed_v1","signed_at":"2026-07-05T04:50:39.790400Z","signed_message":"canonical_sha256_bytes"},"source_id":"2208.10751","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d291c01f28f460f89f27b7f0b9460a8db87f6630bbf3a804aa4409f17d4a0853","sha256:4fcafd54b41b751b2d28f1af247d2f0b85b38edde13fe4ea8560fa72f80bec25"],"state_sha256":"da2adeb4f18b2a253c0c434fd78ed20591f14955f67503a2e35981c1331263cb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y1u+opkOU6W+u6a6/CgPHOv0j087z5KsxQy7Dp4wb4muEagAirBY3J5FrGT0bGyBAcIit8uzxKmZcTP6q/pHAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-23T21:18:46.439458Z","bundle_sha256":"5d22d7dd33c9d6eb9eac7e172556865b18624bee8e6cd12ea319163734922694"}}