{"as_of":"2026-08-11T01:52:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e3fc9124d381de9fd9b12afa9373fb38c9750dce78b5d0dca953ba6c97a8fe7c","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":12,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":12,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":12,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":12,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T20:08:13.579248Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"arxiv_reference","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":40,"observed_at":"2026-08-05T02:28:24.338817Z","source":"arxiv_reference"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2302.03668","last_updated":"2023-06-01T12:26:45Z","snapshot_observed_at":"2026-08-08T08:28:54.214867Z","submitted_at":"2023-02-07T18:40:18Z","title":"Hard Prompts Made Easy: Gradient-Based Discrete Optimization for Prompt Tuning and Discovery","version":2},"cited_work":{"arxiv_id":"2302.03668","doi":"10.48550/arxiv.2302.03668","metadata_source":"arxiv_reference","pith_arxiv_id":"2302.03668","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Hard prompts made easy: Gradient-based discrete optimization for prompt tuning and discovery","venue":"arXiv (Cornell University)","work_id":"584dc6bf-7262-4b56-a62a-fdb564b98d2d","year":2023},"citing_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},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-05-24T07:42:09.112946Z"},"links":{"cited_paper":"/paper/2302.03668","citing_paper":"/paper/2307.15043"},"observation_digest":"sha256:2c599a150eab1720766e481a9812d1ff9383e552cc5628cbb97614223c508921","observation_id":"e62e4a33-f511-4137-b300-e7a0247455d2","resolution":{"observed_at":"2026-05-24T07:44:08.477006Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2302.03668","last_updated":"2023-06-01T12:26:45Z","snapshot_observed_at":"2026-08-08T08:28:54.214867Z","submitted_at":"2023-02-07T18:40:18Z","title":"Hard Prompts Made Easy: Gradient-Based Discrete Optimization for Prompt Tuning and Discovery","version":2},"cited_work":{"arxiv_id":"2302.03668","doi":"10.48550/arxiv.2302.03668","metadata_source":"arxiv_reference","pith_arxiv_id":"2302.03668","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Hard prompts made easy: Gradient-based discrete optimization for prompt tuning and discovery","venue":"arXiv (Cornell University)","work_id":"584dc6bf-7262-4b56-a62a-fdb564b98d2d","year":2023},"citing_paper":{"arxiv_id":"2309.00614","last_updated":"2023-09-04T17:47:36Z","snapshot_observed_at":"2026-07-06T16:13:23.343694Z","submitted_at":"2023-09-01T17:59:44Z","title":"Baseline Defenses for Adversarial Attacks Against Aligned Language Models","version":2},"reference_index":60,"source":"arxiv_source","source_observed_at":"2026-05-13T23:24:39.835347Z"},"links":{"cited_paper":"/paper/2302.03668","citing_paper":"/paper/2309.00614"},"observation_digest":"sha256:3f754606072b125ad99d25d57b0b1a0ba1942258f3d15740929164623028f3f3","observation_id":"300773cb-bd2b-4e22-bccf-48840696baaf","resolution":{"observed_at":"2026-05-13T23:24:40.233850Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2302.03668","last_updated":"2023-06-01T12:26:45Z","snapshot_observed_at":"2026-08-08T08:28:54.214867Z","submitted_at":"2023-02-07T18:40:18Z","title":"Hard Prompts Made Easy: Gradient-Based Discrete Optimization for Prompt Tuning and Discovery","version":2},"cited_work":{"arxiv_id":"2302.03668","doi":"10.48550/arxiv.2302.03668","metadata_source":"arxiv_reference","pith_arxiv_id":"2302.03668","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Hard prompts made easy: Gradient-based discrete optimization for prompt tuning and discovery","venue":"arXiv (Cornell University)","work_id":"584dc6bf-7262-4b56-a62a-fdb564b98d2d","year":2023},"citing_paper":{"arxiv_id":"2309.03409","last_updated":"2024-04-15T07:50:32Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-09-07T00:07:15Z","title":"Large Language Models as Optimizers","version":3},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-05-15T00:04:31.212102Z"},"links":{"cited_paper":"/paper/2302.03668","citing_paper":"/paper/2309.03409"},"observation_digest":"sha256:b4ee6d2b01d77d1703267e8d8d4824ae3328f01c2fd71fb7f4a4ff1ebed69f76","observation_id":"51790050-753c-41c9-85e3-dbe3c1a4ef79","resolution":{"observed_at":"2026-05-15T00:04:31.331797Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2302.03668","last_updated":"2023-06-01T12:26:45Z","snapshot_observed_at":"2026-08-08T08:28:54.214867Z","submitted_at":"2023-02-07T18:40:18Z","title":"Hard Prompts Made Easy: Gradient-Based Discrete Optimization for Prompt Tuning and Discovery","version":2},"cited_work":{"arxiv_id":"2302.03668","doi":"10.48550/arxiv.2302.03668","metadata_source":"arxiv_reference","pith_arxiv_id":"2302.03668","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Hard prompts made easy: Gradient-based discrete optimization for prompt tuning and discovery","venue":"arXiv (Cornell University)","work_id":"584dc6bf-7262-4b56-a62a-fdb564b98d2d","year":2023},"citing_paper":{"arxiv_id":"2310.06987","last_updated":"2023-10-10T20:15:54Z","snapshot_observed_at":"2026-07-06T16:30:46.321160Z","submitted_at":"2023-10-10T20:15:54Z","title":"Catastrophic Jailbreak of Open-source LLMs via Exploiting Generation","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-05-16T22:00:51.487120Z"},"links":{"cited_paper":"/paper/2302.03668","citing_paper":"/paper/2310.06987"},"observation_digest":"sha256:c2a3b8f16dcd8d294cefb0f4a17bce6d8d512e4c042abb2a246d3c6aae64f422","observation_id":"6cabf74e-7312-417c-bcf0-39cae94646a8","resolution":{"observed_at":"2026-05-16T22:00:51.523673Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2302.03668","last_updated":"2023-06-01T12:26:45Z","snapshot_observed_at":"2026-08-08T08:28:54.214867Z","submitted_at":"2023-02-07T18:40:18Z","title":"Hard Prompts Made Easy: Gradient-Based Discrete Optimization for Prompt Tuning and Discovery","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.03668","snapshot_observed_at":"2026-08-08T20:08:13.579248Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.05150","last_updated":"2025-02-07T18:26:15Z","snapshot_observed_at":"2026-08-09T15:49:28.774276Z","submitted_at":"2025-02-07T18:26:15Z","title":"CodeSCM: Causal Analysis for Multi-Modal Code Generation","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-08T20:08:13.579248Z"},"links":{"cited_paper":"/paper/2302.03668","citing_paper":"/paper/2502.05150"},"observation_digest":"sha256:ff21b66ebad90efcb8e71f02b141fc6225da198eea3eae3a2ba5dc5b5ab327fe","observation_id":"3b83d5ef-48a3-4636-bcd8-0ba06aae57cc","resolution":{"observed_at":"2026-08-08T20:08:13.579248Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2302.03668","last_updated":"2023-06-01T12:26:45Z","snapshot_observed_at":"2026-08-08T08:28:54.214867Z","submitted_at":"2023-02-07T18:40:18Z","title":"Hard Prompts Made Easy: Gradient-Based Discrete Optimization for Prompt Tuning and Discovery","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.03668","snapshot_observed_at":"2026-08-06T23:51:21.598507Z","title":"Hard prompts made easy: Gradient-based discrete optimization for prompt tuning and discovery.ArXiv, abs/2302.03668,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.16196","last_updated":"2025-06-19T10:25:16Z","snapshot_observed_at":"2026-08-11T01:03:45.106402Z","submitted_at":"2025-06-19T10:25:16Z","title":"Efficient and Privacy-Preserving Soft Prompt Transfer for LLMs","version":1},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-06T23:51:21.598507Z"},"links":{"cited_paper":"/paper/2302.03668","citing_paper":"/paper/2506.16196"},"observation_digest":"sha256:b0bf7e8b7eef3717719433c0e72b146c980e2f6fc2d7c72f7db8e5837b63dd5e","observation_id":"c899c6ad-5ee1-4016-b8f2-01d072ed3f1f","resolution":{"observed_at":"2026-08-06T23:51:21.598507Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2302.03668","last_updated":"2023-06-01T12:26:45Z","snapshot_observed_at":"2026-08-08T08:28:54.214867Z","submitted_at":"2023-02-07T18:40:18Z","title":"Hard Prompts Made Easy: Gradient-Based Discrete Optimization for Prompt Tuning and Discovery","version":2},"cited_work":{"arxiv_id":"2302.03668","doi":"10.48550/arxiv.2302.03668","metadata_source":"arxiv_reference","pith_arxiv_id":"2302.03668","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Hard prompts made easy: Gradient-based discrete optimization for prompt tuning and discovery","venue":"arXiv (Cornell University)","work_id":"584dc6bf-7262-4b56-a62a-fdb564b98d2d","year":2023},"citing_paper":{"arxiv_id":"2604.09920","last_updated":"2026-04-10T21:30:45Z","snapshot_observed_at":"2026-07-06T22:58:38.807460Z","submitted_at":"2026-04-10T21:30:45Z","title":"Does Your VFM Speak Plant? The Botanical Grammar of Vision Foundation Models for Object Detection","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-05-10T17:07:17.174815Z"},"links":{"cited_paper":"/paper/2302.03668","citing_paper":"/paper/2604.09920"},"observation_digest":"sha256:076736d51d32ea6547f175a9461774658fcc88555b9deb29e969c44bd24221d2","observation_id":"b7a7328c-8340-48e1-80ab-455201ea28bc","resolution":{"observed_at":"2026-05-11T07:35:57.239935Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2302.03668","last_updated":"2023-06-01T12:26:45Z","snapshot_observed_at":"2026-08-08T08:28:54.214867Z","submitted_at":"2023-02-07T18:40:18Z","title":"Hard Prompts Made Easy: Gradient-Based Discrete Optimization for Prompt Tuning and Discovery","version":2},"cited_work":{"arxiv_id":"2302.03668","doi":"10.48550/arxiv.2302.03668","metadata_source":"arxiv_reference","pith_arxiv_id":"2302.03668","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Hard prompts made easy: Gradient-based discrete optimization for prompt tuning and discovery","venue":"arXiv (Cornell University)","work_id":"584dc6bf-7262-4b56-a62a-fdb564b98d2d","year":2023},"citing_paper":{"arxiv_id":"2604.24983","last_updated":"2026-04-27T20:39:08Z","snapshot_observed_at":"2026-07-06T23:10:57.164248Z","submitted_at":"2026-04-27T20:39:08Z","title":"Adaptive Prompt Embedding Optimization for LLM Jailbreaking","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-05-08T03:28:32.989179Z"},"links":{"cited_paper":"/paper/2302.03668","citing_paper":"/paper/2604.24983"},"observation_digest":"sha256:b8aa9c4760d09878931e7248c11763f3b0fa3afe4ee54e507ec1a140fb196416","observation_id":"bfe18aeb-7c28-4f79-b4e2-2a1ec683451c","resolution":{"observed_at":"2026-05-11T22:06:14.415802Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2302.03668","last_updated":"2023-06-01T12:26:45Z","snapshot_observed_at":"2026-08-08T08:28:54.214867Z","submitted_at":"2023-02-07T18:40:18Z","title":"Hard Prompts Made Easy: Gradient-Based Discrete Optimization for Prompt Tuning and Discovery","version":2},"cited_work":{"arxiv_id":"2302.03668","doi":"10.48550/arxiv.2302.03668","metadata_source":"arxiv_reference","pith_arxiv_id":"2302.03668","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Hard prompts made easy: Gradient-based discrete optimization for prompt tuning and discovery","venue":"arXiv (Cornell University)","work_id":"584dc6bf-7262-4b56-a62a-fdb564b98d2d","year":2023},"citing_paper":{"arxiv_id":"2605.10582","last_updated":"2026-05-11T13:54:26Z","snapshot_observed_at":"2026-08-06T09:00:38.839501Z","submitted_at":"2026-05-11T13:54:26Z","title":"Guaranteed Jailbreaking Defense via Disrupt-and-Rectify Smoothing","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-05-12T04:50:08.866969Z"},"links":{"cited_paper":"/paper/2302.03668","citing_paper":"/paper/2605.10582"},"observation_digest":"sha256:9b447a55867011f9b1935e22baa844c6b7b59f196a6697efe033a16e78af1bfc","observation_id":"b9724111-e5c8-4c01-8264-379b0c32b24d","resolution":{"observed_at":"2026-05-12T05:51:27.506593Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2302.03668","last_updated":"2023-06-01T12:26:45Z","snapshot_observed_at":"2026-08-08T08:28:54.214867Z","submitted_at":"2023-02-07T18:40:18Z","title":"Hard Prompts Made Easy: Gradient-Based Discrete Optimization for Prompt Tuning and Discovery","version":2},"cited_work":{"arxiv_id":"2302.03668","doi":"10.48550/arxiv.2302.03668","metadata_source":"arxiv_reference","pith_arxiv_id":"2302.03668","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Hard prompts made easy: Gradient-based discrete optimization for prompt tuning and discovery","venue":"arXiv (Cornell University)","work_id":"584dc6bf-7262-4b56-a62a-fdb564b98d2d","year":2023},"citing_paper":{"arxiv_id":"2605.12484","last_updated":"2026-05-14T17:49:32Z","snapshot_observed_at":"2026-08-02T06:23:20.104772Z","submitted_at":"2026-05-12T17:58:20Z","title":"Learning, Fast and Slow: Towards LLMs That Adapt Continually","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-05-13T05:00:31.452781Z"},"links":{"cited_paper":"/paper/2302.03668","citing_paper":"/paper/2605.12484"},"observation_digest":"sha256:6176ed3ea7abb55e6bd4946328f8024516e58c87d22112257d36b4c43d6d7f08","observation_id":"b2668995-6299-4751-8aee-ae380075cc72","resolution":{"observed_at":"2026-05-13T05:07:18.473989Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2302.03668","last_updated":"2023-06-01T12:26:45Z","snapshot_observed_at":"2026-08-08T08:28:54.214867Z","submitted_at":"2023-02-07T18:40:18Z","title":"Hard Prompts Made Easy: Gradient-Based Discrete Optimization for Prompt Tuning and Discovery","version":2},"cited_work":{"arxiv_id":"2302.03668","doi":"10.48550/arxiv.2302.03668","metadata_source":"arxiv_reference","pith_arxiv_id":"2302.03668","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Hard prompts made easy: Gradient-based discrete optimization for prompt tuning and discovery","venue":"arXiv (Cornell University)","work_id":"584dc6bf-7262-4b56-a62a-fdb564b98d2d","year":2023},"citing_paper":{"arxiv_id":"2605.12484","last_updated":"2026-05-14T17:49:32Z","snapshot_observed_at":"2026-08-02T06:23:20.104772Z","submitted_at":"2026-05-12T17:58:20Z","title":"Learning, Fast and Slow: Towards LLMs That Adapt Continually","version":2},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-05-15T05:19:05.368681Z"},"links":{"cited_paper":"/paper/2302.03668","citing_paper":"/paper/2605.12484"},"observation_digest":"sha256:7f9706418d7ef459fd68366720a9cfd2308208041902c2a40c69045fd0c3844c","observation_id":"a647a829-99fd-4c81-ad82-686a3a286361","resolution":{"observed_at":"2026-05-15T05:19:45.658422Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2302.03668","last_updated":"2023-06-01T12:26:45Z","snapshot_observed_at":"2026-08-08T08:28:54.214867Z","submitted_at":"2023-02-07T18:40:18Z","title":"Hard Prompts Made Easy: Gradient-Based Discrete Optimization for Prompt Tuning and Discovery","version":2},"cited_work":{"arxiv_id":"2302.03668","doi":"10.48550/arxiv.2302.03668","metadata_source":"arxiv_reference","pith_arxiv_id":"2302.03668","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Hard prompts made easy: Gradient-based discrete optimization for prompt tuning and discovery","venue":"arXiv (Cornell University)","work_id":"584dc6bf-7262-4b56-a62a-fdb564b98d2d","year":2023},"citing_paper":{"arxiv_id":"2606.09563","last_updated":"2026-06-08T14:37:46Z","snapshot_observed_at":"2026-08-01T00:37:11.487032Z","submitted_at":"2026-06-08T14:37:46Z","title":"PRISM: Recovering Instruction Sets from Language Model Activations","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-06-27T16:52:02.948457Z"},"links":{"cited_paper":"/paper/2302.03668","citing_paper":"/paper/2606.09563"},"observation_digest":"sha256:d69eea0a538da10853a6e432057cfb1ac4a2b7561867cfd83be31d707c8b651a","observation_id":"a10deb94-6725-4814-b361-f2bebb4ad4a1","resolution":{"observed_at":"2026-06-27T17:01:08.060750Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2302.03668/citation-record","integrity":"/paper/2302.03668/integrity","json":"/paper/2302.03668/citation-record.json","paper":"/paper/2302.03668"},"outbound":[],"paper":{"arxiv_id":"2302.03668","last_updated":"2023-06-01T12:26:45Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-08T08:28:54.214867Z","submitted_at":"2023-02-07T18:40:18Z","title":"Hard Prompts Made Easy: Gradient-Based Discrete Optimization for Prompt Tuning and Discovery"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 12 inbound Pith citation observations for arXiv:2302.03668."}