{"as_of":"2026-08-09T19:12:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:029b39e08344d2aa8d27963cb8bba96c5a281725e3f611e6d041c4038c808ecd","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":6,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":6,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":6,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":6,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T11:11:01.888565Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-06-29T12:03:24.292027Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2504.05804","last_updated":"2025-05-23T02:35:56Z","snapshot_observed_at":"2026-08-08T22:35:46.019485Z","submitted_at":"2025-04-08T08:36:18Z","title":"StealthRank: LLM Ranking Manipulation via Stealthy Prompt Optimization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.05804","snapshot_observed_at":"2026-08-04T11:11:01.888565Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2510.06732","last_updated":"2026-06-28T18:43:51Z","snapshot_observed_at":"2026-08-09T10:05:32.053023Z","submitted_at":"2025-10-08T07:40:40Z","title":"Are LLMs Reliable Rankers? Rank Manipulation via Two-Stage Token Optimization","version":2},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-04T11:11:01.888565Z"},"links":{"cited_paper":"/paper/2504.05804","citing_paper":"/paper/2510.06732"},"observation_digest":"sha256:eb9c7d5436cde0d82803103e6e92c174608766c6a07459a34c0213db6bb46d49","observation_id":"5a50a46f-2758-49c6-a2f5-69146a0c91d9","resolution":{"observed_at":"2026-08-04T11:11:01.888565Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.05804","last_updated":"2025-05-23T02:35:56Z","snapshot_observed_at":"2026-08-08T22:35:46.019485Z","submitted_at":"2025-04-08T08:36:18Z","title":"StealthRank: LLM Ranking Manipulation via Stealthy Prompt Optimization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.05804","snapshot_observed_at":"2026-08-04T08:06:15.283369Z","title":"Stealthrank: Llm ranking manipulation via stealthy prompt optimization.arXiv preprint arXiv:2504.05804, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2510.22963","last_updated":"2026-06-19T20:25:06Z","snapshot_observed_at":"2026-08-04T08:06:05.944327Z","submitted_at":"2025-10-27T03:37:41Z","title":"When Compression Becomes an Attack Surface: Black-Box Attacks on Prompt-Compressed LLM Agents","version":4},"reference_index":85,"source":"pdf_text","source_observed_at":"2026-08-04T08:06:15.283369Z"},"links":{"cited_paper":"/paper/2504.05804","citing_paper":"/paper/2510.22963"},"observation_digest":"sha256:a8008a86ece7504066dcc140855049f266ffb72d0dc115679ee58f2a1786a485","observation_id":"e6e9a015-fbdd-4f89-9223-57b9aec500c9","resolution":{"observed_at":"2026-08-04T08:06:15.283369Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.05804","last_updated":"2025-05-23T02:35:56Z","snapshot_observed_at":"2026-08-08T22:35:46.019485Z","submitted_at":"2025-04-08T08:36:18Z","title":"StealthRank: LLM Ranking Manipulation via Stealthy Prompt Optimization","version":2},"cited_work":{"arxiv_id":"2504.05804","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2504.05804","snapshot_observed_at":"2026-06-29T12:03:24.292027Z","title":"Stealthrank: Llm ranking manipulation via stealthy prompt optimization.arXiv preprint arXiv:2504.05804","venue":null,"work_id":"0258d454-7983-43bd-9580-8ce0c6c40055","year":2025},"citing_paper":{"arxiv_id":"2602.00364","last_updated":"2026-05-15T06:16:27Z","snapshot_observed_at":"2026-08-02T19:31:59.051482Z","submitted_at":"2026-01-30T22:28:04Z","title":"\"Someone Hid It\": Query-Agnostic Black-Box Attacks on LLM-Based Retrieval","version":4},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-21T14:18:33.374331Z"},"links":{"cited_paper":"/paper/2504.05804","citing_paper":"/paper/2602.00364"},"observation_digest":"sha256:238018c7386b5415fd984725a9bd7fb5f91ee39036f4d25c5b72b853006570bf","observation_id":"e29aa146-a144-49e8-b19e-0dfc4db8beb3","resolution":{"observed_at":"2026-05-21T14:20:13.714170Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.05804","last_updated":"2025-05-23T02:35:56Z","snapshot_observed_at":"2026-08-08T22:35:46.019485Z","submitted_at":"2025-04-08T08:36:18Z","title":"StealthRank: LLM Ranking Manipulation via Stealthy Prompt Optimization","version":2},"cited_work":{"arxiv_id":"2504.05804","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2504.05804","snapshot_observed_at":"2026-06-29T12:03:24.292027Z","title":"Stealthrank: Llm ranking manipulation via stealthy prompt optimization.arXiv preprint arXiv:2504.05804","venue":null,"work_id":"0258d454-7983-43bd-9580-8ce0c6c40055","year":2025},"citing_paper":{"arxiv_id":"2605.28017","last_updated":"2026-05-28T01:52:56Z","snapshot_observed_at":"2026-08-09T13:36:21.981975Z","submitted_at":"2026-05-27T06:16:11Z","title":"Can It Reach the Generator? Investigating the Survival of Prompt-Injection Attacks in Realistic RAG Settings","version":2},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-06-29T11:55:34.911818Z"},"links":{"cited_paper":"/paper/2504.05804","citing_paper":"/paper/2605.28017"},"observation_digest":"sha256:c910eac95001cb1f52163873b332f4b63e7d9a050fc3757539eb08a1e2cc01fc","observation_id":"258ae85d-dac3-4e41-b744-e385e1449e9e","resolution":{"observed_at":"2026-06-29T12:03:24.293626Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.05804","last_updated":"2025-05-23T02:35:56Z","snapshot_observed_at":"2026-08-08T22:35:46.019485Z","submitted_at":"2025-04-08T08:36:18Z","title":"StealthRank: LLM Ranking Manipulation via Stealthy Prompt Optimization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.05804","snapshot_observed_at":"2026-07-14T02:33:34.084111Z","title":"StealthRank : LLM ranking manipulation via stealthy prompt optimization, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.11871","last_updated":"2026-07-13T17:55:19Z","snapshot_observed_at":"2026-08-05T16:49:44.432361Z","submitted_at":"2026-07-13T17:55:19Z","title":"Inside the Unfair Judge: A Mechanistic Interpretability Account of LLM-as-Judge Bias","version":1},"reference_index":193,"source":"arxiv_source","source_observed_at":"2026-07-14T02:33:34.084111Z"},"links":{"cited_paper":"/paper/2504.05804","citing_paper":"/paper/2607.11871"},"observation_digest":"sha256:523b9f3598973ed4d94bfc54e7ed0f63a957cd31c44961de8465ad0f89c1ecb0","observation_id":"5f5fa856-2e45-4588-a499-9cc5969dccd2","resolution":{"observed_at":"2026-07-14T02:33:34.084111Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.05804","last_updated":"2025-05-23T02:35:56Z","snapshot_observed_at":"2026-08-08T22:35:46.019485Z","submitted_at":"2025-04-08T08:36:18Z","title":"StealthRank: LLM Ranking Manipulation via Stealthy Prompt Optimization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.05804","snapshot_observed_at":"2026-08-02T03:00:05.884890Z","title":"StealthRank : LLM ranking manipulation via stealthy prompt optimization, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.14035","last_updated":"2026-07-15T17:03:08Z","snapshot_observed_at":"2026-08-06T04:29:47.561169Z","submitted_at":"2026-07-15T17:03:08Z","title":"Optimizing Visibility in Generative Engines: A Critical Survey of Generative Engine Optimization (2023-2026)","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-02T03:00:05.884890Z"},"links":{"cited_paper":"/paper/2504.05804","citing_paper":"/paper/2607.14035"},"observation_digest":"sha256:69c4b7f85f14c346e3f63b8f13aa78e6db1b7a5ef2ba8c1020ab453b77cf8d24","observation_id":"a2b2c246-3965-4958-874a-e39a05aceb47","resolution":{"observed_at":"2026-08-02T03:00:05.884890Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2504.05804/citation-record","integrity":"/paper/2504.05804/integrity","json":"/paper/2504.05804/citation-record.json","paper":"/paper/2504.05804"},"outbound":[],"paper":{"arxiv_id":"2504.05804","last_updated":"2025-05-23T02:35:56Z","latest_version":2,"primary_category":"cs.IR","snapshot_observed_at":"2026-08-08T22:35:46.019485Z","submitted_at":"2025-04-08T08:36:18Z","title":"StealthRank: LLM Ranking Manipulation via Stealthy Prompt Optimization"},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 6 inbound Pith citation observations for arXiv:2504.05804."}