{"as_of":"2026-08-08T18:17:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6c2321d6ab68450d3cc64ab895d54a14e50118381e7b7739002b412503058bfe","coverage":[{"denominator":25,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":25,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T19:32:24.149582Z","state":"measured"},{"denominator":25,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":25,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2502.10487/citation-record","integrity":"/paper/2502.10487/integrity","json":"/paper/2502.10487/citation-record.json","paper":"/paper/2502.10487"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2412.08905","last_updated":"2024-12-12T03:37:41Z","snapshot_observed_at":"2026-08-05T04:04:21.846023Z","submitted_at":"2024-12-12T03:37:41Z","title":"Phi-4 Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.08905","snapshot_observed_at":"2026-08-07T19:32:24.021078Z","title":"Phi-4 techni- cal report","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.10487","last_updated":"2025-02-14T11:15:27Z","snapshot_observed_at":"2026-08-08T15:50:26.926490Z","submitted_at":"2025-02-14T11:15:27Z","title":"Fast Proxies for LLM Robustness Evaluation","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T19:32:24.021078Z"},"links":{"cited_paper":"/paper/2412.08905","citing_paper":"/paper/2502.10487"},"observation_digest":"sha256:53f800d5efa4c9b95a5bd8a3228e86825cf6ddfac15f2b4fad110a2b2bf910b8","observation_id":"a52b6e34-9cab-4c84-9a96-34083bd83ec2","resolution":{"observed_at":"2026-08-07T19:32:24.021078Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.16609","last_updated":"2023-09-28T17:07:49Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-09-28T17:07:49Z","title":"Qwen Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.16609","snapshot_observed_at":"2026-08-07T19:32:24.030248Z","title":"semanticscholar.org/CorpusID:268232499","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.10487","last_updated":"2025-02-14T11:15:27Z","snapshot_observed_at":"2026-08-08T15:50:26.926490Z","submitted_at":"2025-02-14T11:15:27Z","title":"Fast Proxies for LLM Robustness Evaluation","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T19:32:24.030248Z"},"links":{"cited_paper":"/paper/2309.16609","citing_paper":"/paper/2502.10487"},"observation_digest":"sha256:51a2f39409437ca516475066fc9f0112a2cdc3c6b2a968ae54622b87b4d2ebb6","observation_id":"3d1ae997-d9f3-4cb6-ad23-14bd87d03dec","resolution":{"observed_at":"2026-08-07T19:32:24.030248Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.21783","last_updated":"2024-11-23T23:27:33Z","snapshot_observed_at":"2026-07-06T18:55:11.576666Z","submitted_at":"2024-07-31T17:54:27Z","title":"The Llama 3 Herd of Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.21783","snapshot_observed_at":"2026-08-07T19:32:24.037279Z","title":"The Llama 3 herd of models","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.10487","last_updated":"2025-02-14T11:15:27Z","snapshot_observed_at":"2026-08-08T15:50:26.926490Z","submitted_at":"2025-02-14T11:15:27Z","title":"Fast Proxies for LLM Robustness Evaluation","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T19:32:24.037279Z"},"links":{"cited_paper":"/paper/2407.21783","citing_paper":"/paper/2502.10487"},"observation_digest":"sha256:0a0afff528216e9b32f449e169fe261c547c0889a0946d8e3906a90e1e097fea","observation_id":"f60c0e12-aceb-4feb-8476-77092bd92f39","resolution":{"observed_at":"2026-08-07T19:32:24.037279Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.06825","last_updated":"2023-10-10T17:54:58Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-10-10T17:54:58Z","title":"Mistral 7B","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.06825","snapshot_observed_at":"2026-08-07T19:32:24.041487Z","title":"Mistral 7B","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.10487","last_updated":"2025-02-14T11:15:27Z","snapshot_observed_at":"2026-08-08T15:50:26.926490Z","submitted_at":"2025-02-14T11:15:27Z","title":"Fast Proxies for LLM Robustness Evaluation","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T19:32:24.041487Z"},"links":{"cited_paper":"/paper/2310.06825","citing_paper":"/paper/2502.10487"},"observation_digest":"sha256:099b7fb2c14122925312f79f37739a70e12c190ff6ad0cf9dd05a5121aa94326","observation_id":"e24461f8-db07-468b-a3d3-54643b315dea","resolution":{"observed_at":"2026-08-07T19:32:24.041487Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.15221","last_updated":"2024-09-04T00:58:59Z","snapshot_observed_at":"2026-07-06T19:06:41.697671Z","submitted_at":"2024-08-27T17:33:30Z","title":"LLM Defenses Are Not Robust to Multi-Turn Human Jailbreaks Yet","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.15221","snapshot_observed_at":"2026-08-07T19:32:24.045500Z","title":"Llm defenses are not robust to multi-turn human jailbreaks yet","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.10487","last_updated":"2025-02-14T11:15:27Z","snapshot_observed_at":"2026-08-08T15:50:26.926490Z","submitted_at":"2025-02-14T11:15:27Z","title":"Fast Proxies for LLM Robustness Evaluation","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T19:32:24.045500Z"},"links":{"cited_paper":"/paper/2408.15221","citing_paper":"/paper/2502.10487"},"observation_digest":"sha256:a67441a4b9494b4b9169e7bb848bf4b71062e8105730a2fd94a630e7eb36e2bf","observation_id":"c9d9c45c-9194-4078-a496-571e02d37ab6","resolution":{"observed_at":"2026-08-07T19:32:24.045500Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.07921","last_updated":"2024-11-24T18:03:43Z","snapshot_observed_at":"2026-08-08T01:20:41.374144Z","submitted_at":"2024-04-11T17:05:50Z","title":"AmpleGCG: Learning a Universal and Transferable Generative Model of Adversarial Suffixes for Jailbreaking Both Open and Closed LLMs","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.07921","snapshot_observed_at":"2026-08-07T19:32:24.048917Z","title":"AmpleGCG: Learning a universal and transferable generative model of adversarial suffixes for jailbreaking both open and closed llms","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.10487","last_updated":"2025-02-14T11:15:27Z","snapshot_observed_at":"2026-08-08T15:50:26.926490Z","submitted_at":"2025-02-14T11:15:27Z","title":"Fast Proxies for LLM Robustness Evaluation","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T19:32:24.048917Z"},"links":{"cited_paper":"/paper/2404.07921","citing_paper":"/paper/2502.10487"},"observation_digest":"sha256:58bdaf7c6493105445e56eb9ff993675e138491de7318178c181b8a7511c723a","observation_id":"feb381d0-e013-4b82-8a6d-8a4e6a39f74b","resolution":{"observed_at":"2026-08-07T19:32:24.048917Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.04451","last_updated":"2024-03-20T21:34:56Z","snapshot_observed_at":"2026-08-06T02:57:30.438059Z","submitted_at":"2023-10-03T19:44:37Z","title":"AutoDAN: Generating Stealthy Jailbreak Prompts on Aligned Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.04451","snapshot_observed_at":"2026-08-07T19:32:24.092803Z","title":"Autodan: Generating stealthy jailbreak prompts on aligned large language models","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.10487","last_updated":"2025-02-14T11:15:27Z","snapshot_observed_at":"2026-08-08T15:50:26.926490Z","submitted_at":"2025-02-14T11:15:27Z","title":"Fast Proxies for LLM Robustness Evaluation","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T19:32:24.092803Z"},"links":{"cited_paper":"/paper/2310.04451","citing_paper":"/paper/2502.10487"},"observation_digest":"sha256:d2be93edda5e04e1ee9b788d324134f95d27aabf7fafcefeb0921f5c495a2d7e","observation_id":"27897394-233f-4ca9-85d8-19ce25af9711","resolution":{"observed_at":"2026-08-07T19:32:24.092803Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.04249","last_updated":"2024-02-27T04:43:08Z","snapshot_observed_at":"2026-07-06T17:26:23.067923Z","submitted_at":"2024-02-06T18:59:08Z","title":"HarmBench: A Standardized Evaluation Framework for Automated Red Teaming and Robust Refusal","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.04249","snapshot_observed_at":"2026-08-07T19:32:24.096447Z","title":"HarmBench: A standardized evaluation framework for automated red teaming and robust refusal","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.10487","last_updated":"2025-02-14T11:15:27Z","snapshot_observed_at":"2026-08-08T15:50:26.926490Z","submitted_at":"2025-02-14T11:15:27Z","title":"Fast Proxies for LLM Robustness Evaluation","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T19:32:24.096447Z"},"links":{"cited_paper":"/paper/2402.04249","citing_paper":"/paper/2502.10487"},"observation_digest":"sha256:6bf0b8924d8b665633c8b83e118e15c514aaae1aeca806f575f632b836be0fa0","observation_id":"d33b781c-606c-4524-b38f-1ce9ab2f1526","resolution":{"observed_at":"2026-08-07T19:32:24.096447Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.15570","last_updated":"2024-02-23T19:12:53Z","snapshot_observed_at":"2026-07-06T17:34:45.072246Z","submitted_at":"2024-02-23T19:12:53Z","title":"Fast Adversarial Attacks on Language Models In One GPU Minute","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.15570","snapshot_observed_at":"2026-08-07T19:32:24.099738Z","title":"Vinu Sankar Sadasivan, Shoumik Saha, Gaurang Sriramanan, Priyatham Kattakinda, Atoosa Chegini, and Soheil Feizi","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.10487","last_updated":"2025-02-14T11:15:27Z","snapshot_observed_at":"2026-08-08T15:50:26.926490Z","submitted_at":"2025-02-14T11:15:27Z","title":"Fast Proxies for LLM Robustness Evaluation","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T19:32:24.099738Z"},"links":{"cited_paper":"/paper/2402.15570","citing_paper":"/paper/2502.10487"},"observation_digest":"sha256:005319e709a984ca5d77140561e69dd4e888c14859eea58b0df562164b2c2371","observation_id":"fc2f63f1-eaeb-460b-8ca7-d6a49861fdf3","resolution":{"observed_at":"2026-08-07T19:32:24.099738Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.16822","last_updated":"2024-12-11T18:07:25Z","snapshot_observed_at":"2026-08-08T15:50:09.401813Z","submitted_at":"2024-02-26T18:47:27Z","title":"Rainbow Teaming: Open-Ended Generation of Diverse Adversarial Prompts","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.16822","snapshot_observed_at":"2026-08-07T19:32:24.103244Z","title":"Rain- bow teaming: Open-ended generation of diverse adversarial prompts","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.10487","last_updated":"2025-02-14T11:15:27Z","snapshot_observed_at":"2026-08-08T15:50:26.926490Z","submitted_at":"2025-02-14T11:15:27Z","title":"Fast Proxies for LLM Robustness Evaluation","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T19:32:24.103244Z"},"links":{"cited_paper":"/paper/2402.16822","citing_paper":"/paper/2502.10487"},"observation_digest":"sha256:ebf20910dffbebf9da4bd3b17b5942ced0e99c1beb29aef4b658feeb4beaee38","observation_id":"598f292b-bfcb-41c2-b320-390c0e68616d","resolution":{"observed_at":"2026-08-07T19:32:24.103244Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.19737","last_updated":"2023-10-30T17:01:02Z","snapshot_observed_at":"2026-07-06T16:40:35.590974Z","submitted_at":"2023-10-30T17:01:02Z","title":"Adversarial Attacks and Defenses in Large Language Models: Old and New Threats","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.19737","snapshot_observed_at":"2026-08-07T19:32:24.106441Z","title":"Adversarial attacks and defenses in large language models: Old and new threats","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.10487","last_updated":"2025-02-14T11:15:27Z","snapshot_observed_at":"2026-08-08T15:50:26.926490Z","submitted_at":"2025-02-14T11:15:27Z","title":"Fast Proxies for LLM Robustness Evaluation","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T19:32:24.106441Z"},"links":{"cited_paper":"/paper/2310.19737","citing_paper":"/paper/2502.10487"},"observation_digest":"sha256:229941c75cbdbd9bec87378f50a800bcd570190a0d77ed6ee577b60aa5aacfab","observation_id":"5b879a50-5670-4f39-bab6-18f92f6b5a20","resolution":{"observed_at":"2026-08-07T19:32:24.106441Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.09063","last_updated":"2025-04-16T15:15:56Z","snapshot_observed_at":"2026-07-06T17:29:56.393307Z","submitted_at":"2024-02-14T10:20:03Z","title":"Soft Prompt Threats: Attacking Safety Alignment and Unlearning in Open-Source LLMs through the Embedding Space","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.09063","snapshot_observed_at":"2026-08-07T19:32:24.110160Z","title":"Soft prompt threats: Attacking safety alignment and unlearning in open-source LLMs through the embedding space","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.10487","last_updated":"2025-02-14T11:15:27Z","snapshot_observed_at":"2026-08-08T15:50:26.926490Z","submitted_at":"2025-02-14T11:15:27Z","title":"Fast Proxies for LLM Robustness Evaluation","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T19:32:24.110160Z"},"links":{"cited_paper":"/paper/2402.09063","citing_paper":"/paper/2502.10487"},"observation_digest":"sha256:a5462860d4ad214285aed851bdf9c8e3ad6b2a3fa8aa542c7464ad747875d5c5","observation_id":"fc9c4729-bf71-48df-b815-87370bc68e8b","resolution":{"observed_at":"2026-08-07T19:32:24.110160Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.15549","last_updated":"2025-07-29T09:37:22Z","snapshot_observed_at":"2026-08-06T22:31:48.025702Z","submitted_at":"2024-07-22T11:19:14Z","title":"Latent Adversarial Training Improves Robustness to Persistent Harmful Behaviors in LLMs","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.15549","snapshot_observed_at":"2026-08-07T19:32:24.113138Z","title":"Tar- geted latent adversarial training improves robustness to persistent harmful behaviors in llms.arXiv preprint arXiv:2407.15549,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.10487","last_updated":"2025-02-14T11:15:27Z","snapshot_observed_at":"2026-08-08T15:50:26.926490Z","submitted_at":"2025-02-14T11:15:27Z","title":"Fast Proxies for LLM Robustness Evaluation","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T19:32:24.113138Z"},"links":{"cited_paper":"/paper/2407.15549","citing_paper":"/paper/2502.10487"},"observation_digest":"sha256:bde00315a75301d1d6ae70088c4a94604d6c549d5a462d6eb13f2b0c2b63b808","observation_id":"a00685c8-17d2-4db3-a754-c3591a9824e6","resolution":{"observed_at":"2026-08-07T19:32:24.113138Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.00118","last_updated":"2024-10-02T15:22:49Z","snapshot_observed_at":"2026-08-02T16:20:09.773989Z","submitted_at":"2024-07-31T19:13:07Z","title":"Gemma 2: Improving Open Language Models at a Practical Size","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.00118","snapshot_observed_at":"2026-08-07T19:32:24.116471Z","title":"Gemma 2: Improving open language models at a practical size","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.10487","last_updated":"2025-02-14T11:15:27Z","snapshot_observed_at":"2026-08-08T15:50:26.926490Z","submitted_at":"2025-02-14T11:15:27Z","title":"Fast Proxies for LLM Robustness Evaluation","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T19:32:24.116471Z"},"links":{"cited_paper":"/paper/2408.00118","citing_paper":"/paper/2502.10487"},"observation_digest":"sha256:a0fea84d0c9a23c2cb208800017ded1e1aa30ef5b8173b0b7569f63591d0d3f2","observation_id":"a1c8e577-5f46-40c3-813d-6e8fb19398ba","resolution":{"observed_at":"2026-08-07T19:32:24.116471Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.11857","last_updated":"2024-08-15T20:17:33Z","snapshot_observed_at":"2026-07-06T19:04:13.760549Z","submitted_at":"2024-08-15T20:17:33Z","title":"Hermes 3 Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.11857","snapshot_observed_at":"2026-08-07T19:32:24.119477Z","title":"Hermes 3 technical report","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.10487","last_updated":"2025-02-14T11:15:27Z","snapshot_observed_at":"2026-08-08T15:50:26.926490Z","submitted_at":"2025-02-14T11:15:27Z","title":"Fast Proxies for LLM Robustness Evaluation","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T19:32:24.119477Z"},"links":{"cited_paper":"/paper/2408.11857","citing_paper":"/paper/2502.10487"},"observation_digest":"sha256:ff655e5752321c43567aa94efebfaf32f40416e0efc8b38c68576af7ad7a839c","observation_id":"cc48bd29-eb95-488a-b3c8-7e52a14dd6e6","resolution":{"observed_at":"2026-08-07T19:32:24.119477Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2307.09288","last_updated":"2023-07-19T17:08:59Z","snapshot_observed_at":"2026-08-07T12:56:43.323460Z","submitted_at":"2023-07-18T14:31:57Z","title":"Llama 2: Open Foundation and Fine-Tuned Chat Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.09288","snapshot_observed_at":"2026-08-07T19:32:24.122684Z","title":"Llama 2: Open founda- tion and fine-tuned chat models","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.10487","last_updated":"2025-02-14T11:15:27Z","snapshot_observed_at":"2026-08-08T15:50:26.926490Z","submitted_at":"2025-02-14T11:15:27Z","title":"Fast Proxies for LLM Robustness Evaluation","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T19:32:24.122684Z"},"links":{"cited_paper":"/paper/2307.09288","citing_paper":"/paper/2502.10487"},"observation_digest":"sha256:644e56641d5e4fda530dd7401512ea52515d94cd7bf734689dcca74f7966b933","observation_id":"a7bf6e61-cf7a-44ff-9b5b-dc2ad610cfe7","resolution":{"observed_at":"2026-08-07T19:32:24.122684Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.16944","last_updated":"2023-10-25T19:25:16Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-10-25T19:25:16Z","title":"Zephyr: Direct Distillation of LM Alignment","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.16944","snapshot_observed_at":"2026-08-07T19:32:24.126931Z","title":"Zephyr: Direct distillation of lm alignment","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.10487","last_updated":"2025-02-14T11:15:27Z","snapshot_observed_at":"2026-08-08T15:50:26.926490Z","submitted_at":"2025-02-14T11:15:27Z","title":"Fast Proxies for LLM Robustness Evaluation","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T19:32:24.126931Z"},"links":{"cited_paper":"/paper/2310.16944","citing_paper":"/paper/2502.10487"},"observation_digest":"sha256:82eea0f35ec4b4c8d0481d58fd87db94520bdc9a3df8316a7f36df47acacdb64","observation_id":"075bd7b0-4836-41d1-9708-80cf6a8e12ca","resolution":{"observed_at":"2026-08-07T19:32:24.126931Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2312.12321","last_updated":"2024-05-17T05:27:25Z","snapshot_observed_at":"2026-07-06T17:05:22.992895Z","submitted_at":"2023-12-19T16:47:12Z","title":"Bypassing the Safety Training of Open-Source LLMs with Priming Attacks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.12321","snapshot_observed_at":"2026-08-07T19:32:24.131114Z","title":"Bypassing the safety training of open-source llms with priming attacks","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.10487","last_updated":"2025-02-14T11:15:27Z","snapshot_observed_at":"2026-08-08T15:50:26.926490Z","submitted_at":"2025-02-14T11:15:27Z","title":"Fast Proxies for LLM Robustness Evaluation","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T19:32:24.131114Z"},"links":{"cited_paper":"/paper/2312.12321","citing_paper":"/paper/2502.10487"},"observation_digest":"sha256:f21040b5c873e91002022422753e623d4a34813c05fe8050539f7526c9d2522e","observation_id":"c2ac0286-28ca-49a7-a4d0-56b6ededdb7f","resolution":{"observed_at":"2026-08-07T19:32:24.131114Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.15589","last_updated":"2024-11-01T16:39:36Z","snapshot_observed_at":"2026-08-05T10:26:07.839736Z","submitted_at":"2024-05-24T14:20:09Z","title":"Efficient Adversarial Training in LLMs with Continuous Attacks","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.15589","snapshot_observed_at":"2026-08-07T19:32:24.135448Z","title":"Efficient adversarial training in LLMs with continuous attacks","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.10487","last_updated":"2025-02-14T11:15:27Z","snapshot_observed_at":"2026-08-08T15:50:26.926490Z","submitted_at":"2025-02-14T11:15:27Z","title":"Fast Proxies for LLM Robustness Evaluation","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T19:32:24.135448Z"},"links":{"cited_paper":"/paper/2405.15589","citing_paper":"/paper/2502.10487"},"observation_digest":"sha256:436d45de18acf939286ef36eccf6e3372aeb56076a43a8e3802a9eb9da2e7c4d","observation_id":"2f10703b-0917-4198-963a-5a4b71051455","resolution":{"observed_at":"2026-08-07T19:32:24.135448Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2307.15043","last_updated":"2023-12-20T20:48:57Z","snapshot_observed_at":"2026-07-06T15:59:23.019044Z","submitted_at":"2023-07-27T17:49:12Z","title":"Universal and Transferable Adversarial Attacks on Aligned Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.15043","snapshot_observed_at":"2026-08-07T19:32:24.139663Z","title":"Universal and transferable adversarial attacks on aligned language models","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.10487","last_updated":"2025-02-14T11:15:27Z","snapshot_observed_at":"2026-08-08T15:50:26.926490Z","submitted_at":"2025-02-14T11:15:27Z","title":"Fast Proxies for LLM Robustness Evaluation","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T19:32:24.139663Z"},"links":{"cited_paper":"/paper/2307.15043","citing_paper":"/paper/2502.10487"},"observation_digest":"sha256:af51253bf973153c2ef3c605d1157a7faa44ea7e92a5bde23b5fe57e395694ff","observation_id":"e7c891ac-d14e-4f5e-b3d4-dd6310e1dada","resolution":{"observed_at":"2026-08-07T19:32:24.139663Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T19:32:24.429560Z","title":"We use bfloat16 quantization for all models","venue":null,"work_id":"00419141-f08a-4a63-a1db-a1feffbdca5f","year":2023},"citing_paper":{"arxiv_id":"2502.10487","last_updated":"2025-02-14T11:15:27Z","snapshot_observed_at":"2026-08-08T15:50:26.926490Z","submitted_at":"2025-02-14T11:15:27Z","title":"Fast Proxies for LLM Robustness Evaluation","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T19:32:24.142978Z"},"links":{"citing_paper":"/paper/2502.10487"},"observation_digest":"sha256:b6e9571ac83eab2d4e064cf729dfa22154e9b9fdd15409010a547f795bccc8d7","observation_id":"d0aca436-8f82-40bf-b540-7853eb4be69e","resolution":{"observed_at":"2026-08-07T19:32:24.432768Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T19:32:24.417761Z","title":"250, use a batch size of 512, Top-K “ 256, and initialize using the string “x x x x x x x x x x x x x x x x x x x x","venue":null,"work_id":"1d3eb973-bb8a-4c1e-9934-a7c7245217fb","year":2024},"citing_paper":{"arxiv_id":"2502.10487","last_updated":"2025-02-14T11:15:27Z","snapshot_observed_at":"2026-08-08T15:50:26.926490Z","submitted_at":"2025-02-14T11:15:27Z","title":"Fast Proxies for LLM Robustness Evaluation","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T19:32:24.146365Z"},"links":{"citing_paper":"/paper/2502.10487"},"observation_digest":"sha256:d1c21f64764482ddf49a85c2bfb3434f25987a3a99065d965006a95a56daa1a4","observation_id":"cef188b4-8d56-413f-bc37-3f598af7432f","resolution":{"observed_at":"2026-08-07T19:32:24.422481Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T19:32:24.404740Z","title":"x x x x x x x x x x x x x x x x x x x x","venue":null,"work_id":"332d84f4-6e3d-4401-83a2-1f400fc38ffe","year":2024},"citing_paper":{"arxiv_id":"2502.10487","last_updated":"2025-02-14T11:15:27Z","snapshot_observed_at":"2026-08-08T15:50:26.926490Z","submitted_at":"2025-02-14T11:15:27Z","title":"Fast Proxies for LLM Robustness Evaluation","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T19:32:24.149582Z"},"links":{"citing_paper":"/paper/2502.10487"},"observation_digest":"sha256:e7b7e860d7582487e123c97f73b1061f45aaae106af0b83963f7d95b89997aec","observation_id":"294d91a6-966b-4e0b-8fed-b97afafd9f85","resolution":{"observed_at":"2026-08-07T19:32:24.409641Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.08419","last_updated":"2024-07-18T18:24:57Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-10-12T15:38:28Z","title":"Jailbreaking Black Box Large Language Models in Twenty Queries","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.08419","snapshot_observed_at":"2026-08-07T19:32:24.033840Z","title":"Jailbreaking black box large language models in twenty queries","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.10487","last_updated":"2025-02-14T11:15:27Z","snapshot_observed_at":"2026-08-08T15:50:26.926490Z","submitted_at":"2025-02-14T11:15:27Z","title":"Fast Proxies for LLM Robustness Evaluation","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-07T19:32:24.033840Z"},"links":{"cited_paper":"/paper/2310.08419","citing_paper":"/paper/2502.10487"},"observation_digest":"sha256:7936397a49428aaff375223dbf61c3e7ae93abfd9873aac192881db1dde779ae","observation_id":"af7ce8b5-a93b-483c-8906-abb739783706","resolution":{"observed_at":"2026-08-07T19:32:24.033840Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.02151","last_updated":"2025-04-17T18:55:45Z","snapshot_observed_at":"2026-08-08T01:18:53.200448Z","submitted_at":"2024-04-02T17:58:27Z","title":"Jailbreaking Leading Safety-Aligned LLMs with Simple Adaptive Attacks","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.02151","snapshot_observed_at":"2026-08-07T19:32:24.025979Z","title":"Jailbreaking leading safety- aligned LLMs with simple adaptive attacks","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.10487","last_updated":"2025-02-14T11:15:27Z","snapshot_observed_at":"2026-08-08T15:50:26.926490Z","submitted_at":"2025-02-14T11:15:27Z","title":"Fast Proxies for LLM Robustness Evaluation","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-07T19:32:24.025979Z"},"links":{"cited_paper":"/paper/2404.02151","citing_paper":"/paper/2502.10487"},"observation_digest":"sha256:642f22d8377d9b0e064b9773d6dbc9e7a1e85af5eaee94333ddfa05e26ddb48c","observation_id":"31201e82-4e66-438f-9316-cc01e2e0ec73","resolution":{"observed_at":"2026-08-07T19:32:24.025979Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2502.10487","last_updated":"2025-02-14T11:15:27Z","latest_version":1,"primary_category":"cs.CR","snapshot_observed_at":"2026-08-08T15:50:26.926490Z","submitted_at":"2025-02-14T11:15:27Z","title":"Fast Proxies for LLM Robustness Evaluation"},"reference_resolution":{"displayed":25,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":22,"verified_exact":0,"verified_fuzzy":3},"total_outbound_references":25},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 25 of 25 outbound references and 0 inbound Pith citation observations for arXiv:2502.10487."}