{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:ZXJBRZRWZ4P4RCPSS7TTJDBK2V","short_pith_number":"pith:ZXJBRZRW","canonical_record":{"source":{"id":"2008.02197","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2020-08-05T15:50:38Z","cross_cats_sorted":[],"title_canon_sha256":"6a9ff2725d353f86e74dab7707c53746a05b010a4ef4e190e7bd082a1553c764","abstract_canon_sha256":"1a5d72acf32fa00e25fe9cd1ba0bee511cec4277f5d36f24cd7f1ce5cc03b402"},"schema_version":"1.0"},"canonical_sha256":"cdd218e636cf1fc889f297e7348c2ad56755cbb975461ed9e79f5106385a209c","source":{"kind":"arxiv","id":"2008.02197","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2008.02197","created_at":"2026-07-05T01:24:59Z"},{"alias_kind":"arxiv_version","alias_value":"2008.02197v1","created_at":"2026-07-05T01:24:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2008.02197","created_at":"2026-07-05T01:24:59Z"},{"alias_kind":"pith_short_12","alias_value":"ZXJBRZRWZ4P4","created_at":"2026-07-05T01:24:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZXJBRZRWZ4P4RCPS","created_at":"2026-07-05T01:24:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZXJBRZRW","created_at":"2026-07-05T01:24:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:ZXJBRZRWZ4P4RCPSS7TTJDBK2V","target":"record","payload":{"canonical_record":{"source":{"id":"2008.02197","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2020-08-05T15:50:38Z","cross_cats_sorted":[],"title_canon_sha256":"6a9ff2725d353f86e74dab7707c53746a05b010a4ef4e190e7bd082a1553c764","abstract_canon_sha256":"1a5d72acf32fa00e25fe9cd1ba0bee511cec4277f5d36f24cd7f1ce5cc03b402"},"schema_version":"1.0"},"canonical_sha256":"cdd218e636cf1fc889f297e7348c2ad56755cbb975461ed9e79f5106385a209c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:24:59.781189Z","signature_b64":"kL8JsMf5yFnfIypdQxZlhCtURxFt5aBoRb1kJee/O3XN1wlRnU9iL3uy5srdqjfBJOqBUD7Buq3gkuZM6eesDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cdd218e636cf1fc889f297e7348c2ad56755cbb975461ed9e79f5106385a209c","last_reissued_at":"2026-07-05T01:24:59.780772Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:24:59.780772Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2008.02197","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-05T01:24:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u4oyr691HNh7KCfFBNFI33aXnq3+aDJ2jrfOMNTOJAZuIO0KvSZDN0C4v+PwcoBoaw7FT8J3ysRUudiTF6SjBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T12:20:38.462556Z"},"content_sha256":"596e3923c89da5a8cca479e27a35b598f41a2f42a434b4415e41ec74c7a33bb8","schema_version":"1.0","event_id":"sha256:596e3923c89da5a8cca479e27a35b598f41a2f42a434b4415e41ec74c7a33bb8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:ZXJBRZRWZ4P4RCPSS7TTJDBK2V","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"One word at a time: adversarial attacks on retrieval models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Manisha Verma, Nisarg Raval","submitted_at":"2020-08-05T15:50:38Z","abstract_excerpt":"Adversarial examples, generated by applying small perturbations to input features, are widely used to fool classifiers and measure their robustness to noisy inputs. However, little work has been done to evaluate the robustness of ranking models through adversarial examples. In this work, we present a systematic approach of leveraging adversarial examples to measure the robustness of popular ranking models. We explore a simple method to generate adversarial examples that forces a ranker to incorrectly rank the documents. Using this approach, we analyze the robustness of various ranking models a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2008.02197","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/2008.02197/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-05T01:24:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z/1tA5gR5/Ev+T4XsQjRsqKQvPQVHgUxy4/pfONzRIeZhayTyJXvGZJgfA3gNo42M3poEZ3esfutPuroF0MuBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T12:20:38.463827Z"},"content_sha256":"722d35d33f6ba9f3cc6ff507871ad27f937023485991fe8ef919d1de03f9a01e","schema_version":"1.0","event_id":"sha256:722d35d33f6ba9f3cc6ff507871ad27f937023485991fe8ef919d1de03f9a01e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZXJBRZRWZ4P4RCPSS7TTJDBK2V/bundle.json","state_url":"https://pith.science/pith/ZXJBRZRWZ4P4RCPSS7TTJDBK2V/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZXJBRZRWZ4P4RCPSS7TTJDBK2V/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-11T12:20:38Z","links":{"resolver":"https://pith.science/pith/ZXJBRZRWZ4P4RCPSS7TTJDBK2V","bundle":"https://pith.science/pith/ZXJBRZRWZ4P4RCPSS7TTJDBK2V/bundle.json","state":"https://pith.science/pith/ZXJBRZRWZ4P4RCPSS7TTJDBK2V/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZXJBRZRWZ4P4RCPSS7TTJDBK2V/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:ZXJBRZRWZ4P4RCPSS7TTJDBK2V","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":"1a5d72acf32fa00e25fe9cd1ba0bee511cec4277f5d36f24cd7f1ce5cc03b402","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2020-08-05T15:50:38Z","title_canon_sha256":"6a9ff2725d353f86e74dab7707c53746a05b010a4ef4e190e7bd082a1553c764"},"schema_version":"1.0","source":{"id":"2008.02197","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2008.02197","created_at":"2026-07-05T01:24:59Z"},{"alias_kind":"arxiv_version","alias_value":"2008.02197v1","created_at":"2026-07-05T01:24:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2008.02197","created_at":"2026-07-05T01:24:59Z"},{"alias_kind":"pith_short_12","alias_value":"ZXJBRZRWZ4P4","created_at":"2026-07-05T01:24:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZXJBRZRWZ4P4RCPS","created_at":"2026-07-05T01:24:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZXJBRZRW","created_at":"2026-07-05T01:24:59Z"}],"graph_snapshots":[{"event_id":"sha256:722d35d33f6ba9f3cc6ff507871ad27f937023485991fe8ef919d1de03f9a01e","target":"graph","created_at":"2026-07-05T01:24:59Z","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/2008.02197/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Adversarial examples, generated by applying small perturbations to input features, are widely used to fool classifiers and measure their robustness to noisy inputs. However, little work has been done to evaluate the robustness of ranking models through adversarial examples. In this work, we present a systematic approach of leveraging adversarial examples to measure the robustness of popular ranking models. We explore a simple method to generate adversarial examples that forces a ranker to incorrectly rank the documents. Using this approach, we analyze the robustness of various ranking models a","authors_text":"Manisha Verma, Nisarg Raval","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2020-08-05T15:50:38Z","title":"One word at a time: adversarial attacks on retrieval models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2008.02197","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:596e3923c89da5a8cca479e27a35b598f41a2f42a434b4415e41ec74c7a33bb8","target":"record","created_at":"2026-07-05T01:24:59Z","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":"1a5d72acf32fa00e25fe9cd1ba0bee511cec4277f5d36f24cd7f1ce5cc03b402","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2020-08-05T15:50:38Z","title_canon_sha256":"6a9ff2725d353f86e74dab7707c53746a05b010a4ef4e190e7bd082a1553c764"},"schema_version":"1.0","source":{"id":"2008.02197","kind":"arxiv","version":1}},"canonical_sha256":"cdd218e636cf1fc889f297e7348c2ad56755cbb975461ed9e79f5106385a209c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cdd218e636cf1fc889f297e7348c2ad56755cbb975461ed9e79f5106385a209c","first_computed_at":"2026-07-05T01:24:59.780772Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:24:59.780772Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kL8JsMf5yFnfIypdQxZlhCtURxFt5aBoRb1kJee/O3XN1wlRnU9iL3uy5srdqjfBJOqBUD7Buq3gkuZM6eesDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T01:24:59.781189Z","signed_message":"canonical_sha256_bytes"},"source_id":"2008.02197","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:596e3923c89da5a8cca479e27a35b598f41a2f42a434b4415e41ec74c7a33bb8","sha256:722d35d33f6ba9f3cc6ff507871ad27f937023485991fe8ef919d1de03f9a01e"],"state_sha256":"91f5c1e403c1b0f616b4dd7599f168f5ff0c2b65d6b7ebebf96f3a1ee714dfb2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ccN0pe6WftnzQjRR1vdtu+T9KhVoP7/mSdSe0IniUQqNh35PnH1ZhhulKaaYKpWJ1MBxOc3M9fyY4RV3wIKaAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T12:20:38.473175Z","bundle_sha256":"97e002b08d317d4820a0e433488d460892074cc88e708324d998cdf666415750"}}