{"as_of":"2026-08-05T14:57:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1a5ca3033d822a45b91d13c10a565d95de386213fac40b0b17c5e0ef22ec954b","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":11,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":11,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-05T06:32:48.257954+00:00","state":"measured"},{"denominator":11,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":11,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T10:39:06.995308Z","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":0,"observed_at":"2026-08-05T02:28:24.338817Z","source":"arxiv_reference"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2501.18841","last_updated":"2025-01-31T01:20:44Z","snapshot_observed_at":"2026-07-06T20:28:47.519113Z","submitted_at":"2025-01-31T01:20:44Z","title":"Trading Inference-Time Compute for Adversarial Robustness","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.18841","snapshot_observed_at":"2026-08-05T10:39:06.995308Z","title":"Trading inference-time compute for adversarial robustness","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.03871","last_updated":"2025-09-04T04:12:31Z","snapshot_observed_at":"2026-08-05T10:38:56.478715Z","submitted_at":"2025-09-04T04:12:31Z","title":"A Comprehensive Survey on Trustworthiness in Reasoning with Large Language Models","version":1},"reference_index":140,"source":"pdf_text","source_observed_at":"2026-08-05T10:39:06.995308Z"},"links":{"cited_paper":"/paper/2501.18841","citing_paper":"/paper/2509.03871"},"observation_digest":"sha256:dd5cdc8a0983434bf8b2c408cb5ad96872e1a3e0f5bbe8fb1fdee9b266b674b5","observation_id":"1ecda5bb-50ea-448b-a394-c659a641c898","resolution":{"observed_at":"2026-08-05T10:39:06.995308Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.18841","last_updated":"2025-01-31T01:20:44Z","snapshot_observed_at":"2026-07-06T20:28:47.519113Z","submitted_at":"2025-01-31T01:20:44Z","title":"Trading Inference-Time Compute for Adversarial Robustness","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.18841","snapshot_observed_at":"2026-08-04T14:43:56.377275Z","title":"Trading inference-time compute for adversarial robustness","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.23694","last_updated":"2026-06-03T04:13:57Z","snapshot_observed_at":"2026-08-04T14:43:33.365212Z","submitted_at":"2025-09-28T07:05:17Z","title":"SafeSearch: Automated Red-Teaming of LLM-Based Search Agents","version":6},"reference_index":67,"source":"arxiv_source","source_observed_at":"2026-08-04T14:43:56.377275Z"},"links":{"cited_paper":"/paper/2501.18841","citing_paper":"/paper/2509.23694"},"observation_digest":"sha256:de259bd3b31ce8245bc6f50846d801c0853df79ab1d47cec72dace59108cd298","observation_id":"56253540-ad43-4978-9be2-f6601c580c75","resolution":{"observed_at":"2026-08-04T14:43:56.377275Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.18841","last_updated":"2025-01-31T01:20:44Z","snapshot_observed_at":"2026-07-06T20:28:47.519113Z","submitted_at":"2025-01-31T01:20:44Z","title":"Trading Inference-Time Compute for Adversarial Robustness","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.18841","snapshot_observed_at":"2026-08-04T07:07:56.762559Z","title":"Trading inference-time compute for adversarial robustness","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2511.04694","last_updated":"2026-07-01T16:09:28Z","snapshot_observed_at":"2026-08-04T07:07:51.334462Z","submitted_at":"2025-10-30T22:13:31Z","title":"Reasoning Up the Instruction Ladder for Controllable Language Models","version":5},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-04T07:07:56.762559Z"},"links":{"cited_paper":"/paper/2501.18841","citing_paper":"/paper/2511.04694"},"observation_digest":"sha256:09eb385d2cffa418b0d8c2d703c4b82a308ebf582563af73531fe7463a887cba","observation_id":"23d6cad5-9fb8-442d-a3ae-b010bebbf6ee","resolution":{"observed_at":"2026-08-04T07:07:56.762559Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.18841","last_updated":"2025-01-31T01:20:44Z","snapshot_observed_at":"2026-07-06T20:28:47.519113Z","submitted_at":"2025-01-31T01:20:44Z","title":"Trading Inference-Time Compute for Adversarial Robustness","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.18841","snapshot_observed_at":"2026-08-03T12:21:01.678657Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2601.03595","last_updated":"2026-07-28T04:16:50Z","snapshot_observed_at":"2026-08-04T10:13:04.105311Z","submitted_at":"2026-01-07T05:26:26Z","title":"Controllable LLM Reasoning via Sparse Autoencoder-Based Steering","version":2},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-03T12:21:01.678657Z"},"links":{"cited_paper":"/paper/2501.18841","citing_paper":"/paper/2601.03595"},"observation_digest":"sha256:da1ed0c210a7d31127e98321136d4f60c4b2334b639fda6a2db0a93e4a102aba","observation_id":"2424077d-99e2-4d0f-87b0-258bf7d32bfc","resolution":{"observed_at":"2026-08-03T12:21:01.678657Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.18841","last_updated":"2025-01-31T01:20:44Z","snapshot_observed_at":"2026-07-06T20:28:47.519113Z","submitted_at":"2025-01-31T01:20:44Z","title":"Trading Inference-Time Compute for Adversarial Robustness","version":1},"cited_work":{"arxiv_id":"2501.18841","doi":"10.48550/arxiv.2501.18841","metadata_source":"arxiv_reference","pith_arxiv_id":"2501.18841","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Trading inference-time compute for adversarial robustness.arXiv preprint arXiv:2501.18841","venue":"ArXiv.org","work_id":"843c3751-da20-4805-8388-33948cbcf036","year":2025},"citing_paper":{"arxiv_id":"2603.17305","last_updated":"2026-05-19T16:22:05Z","snapshot_observed_at":"2026-07-06T22:49:28.866886Z","submitted_at":"2026-03-18T03:00:42Z","title":"Contrastive Reasoning Alignment: Reinforcement Learning from Hidden Representations","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-05-21T11:23:26.852673Z"},"links":{"cited_paper":"/paper/2501.18841","citing_paper":"/paper/2603.17305"},"observation_digest":"sha256:f933cbba4f6cc23c9fdd2e6571bcd04813c86f8ec4f85593b3b4cf1f52be712e","observation_id":"00d20dcc-caf4-473c-b7a2-7bd2202ee07d","resolution":{"observed_at":"2026-05-21T11:24:08.439559Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.18841","last_updated":"2025-01-31T01:20:44Z","snapshot_observed_at":"2026-07-06T20:28:47.519113Z","submitted_at":"2025-01-31T01:20:44Z","title":"Trading Inference-Time Compute for Adversarial Robustness","version":1},"cited_work":{"arxiv_id":"2501.18841","doi":"10.48550/arxiv.2501.18841","metadata_source":"arxiv_reference","pith_arxiv_id":"2501.18841","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Trading inference-time compute for adversarial robustness.arXiv preprint arXiv:2501.18841","venue":"ArXiv.org","work_id":"843c3751-da20-4805-8388-33948cbcf036","year":2025},"citing_paper":{"arxiv_id":"2605.19485","last_updated":"2026-05-19T07:36:52Z","snapshot_observed_at":"2026-07-06T23:30:11.337726Z","submitted_at":"2026-05-19T07:36:52Z","title":"Attention-Guided Reward for Reinforcement Learning-based Jailbreak against Large Reasoning Models","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-05-20T06:33:30.647965Z"},"links":{"cited_paper":"/paper/2501.18841","citing_paper":"/paper/2605.19485"},"observation_digest":"sha256:1b02647d4d6709814ad9815e16dfc8d3a63974f3dea8ab115b3f40fd708c9a13","observation_id":"e3859945-dbd2-4c25-98d1-10fa72383f03","resolution":{"observed_at":"2026-05-20T06:38:05.890538Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.18841","last_updated":"2025-01-31T01:20:44Z","snapshot_observed_at":"2026-07-06T20:28:47.519113Z","submitted_at":"2025-01-31T01:20:44Z","title":"Trading Inference-Time Compute for Adversarial Robustness","version":1},"cited_work":{"arxiv_id":"2501.18841","doi":"10.48550/arxiv.2501.18841","metadata_source":"arxiv_reference","pith_arxiv_id":"2501.18841","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Trading inference-time compute for adversarial robustness.arXiv preprint arXiv:2501.18841","venue":"ArXiv.org","work_id":"843c3751-da20-4805-8388-33948cbcf036","year":2025},"citing_paper":{"arxiv_id":"2605.20286","last_updated":"2026-05-19T06:11:04Z","snapshot_observed_at":"2026-07-06T23:30:53.900592Z","submitted_at":"2026-05-19T06:11:04Z","title":"Adaptive Probe-based Steering for Robust LLM Jailbreaking","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-05-21T02:32:49.034790Z"},"links":{"cited_paper":"/paper/2501.18841","citing_paper":"/paper/2605.20286"},"observation_digest":"sha256:fa049d637ae85bbd70bb0e5245d2a83703398c673d886e45a2bab250fd4d08cc","observation_id":"a7298098-b10c-436f-b2aa-a3b53f6a18dc","resolution":{"observed_at":"2026-05-21T02:33:54.924148Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.18841","last_updated":"2025-01-31T01:20:44Z","snapshot_observed_at":"2026-07-06T20:28:47.519113Z","submitted_at":"2025-01-31T01:20:44Z","title":"Trading Inference-Time Compute for Adversarial Robustness","version":1},"cited_work":{"arxiv_id":"2501.18841","doi":"10.48550/arxiv.2501.18841","metadata_source":"arxiv_reference","pith_arxiv_id":"2501.18841","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Trading inference-time compute for adversarial robustness.arXiv preprint arXiv:2501.18841","venue":"ArXiv.org","work_id":"843c3751-da20-4805-8388-33948cbcf036","year":2025},"citing_paper":{"arxiv_id":"2606.31748","last_updated":"2026-06-30T14:38:49Z","snapshot_observed_at":"2026-07-07T00:05:27.130060Z","submitted_at":"2026-06-30T14:38:49Z","title":"Addressing Over-Refusal in LLMs with Competing Rewards","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-07-01T06:59:12.695984Z"},"links":{"cited_paper":"/paper/2501.18841","citing_paper":"/paper/2606.31748"},"observation_digest":"sha256:b546680c23bc9324da903b9b0b5a63093d63f8ebbb8371d086ab7720c4da4558","observation_id":"b60c7f61-504b-4306-bd7b-19cf058aa0eb","resolution":{"observed_at":"2026-07-01T08:55:35.482347Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.18841","last_updated":"2025-01-31T01:20:44Z","snapshot_observed_at":"2026-07-06T20:28:47.519113Z","submitted_at":"2025-01-31T01:20:44Z","title":"Trading Inference-Time Compute for Adversarial Robustness","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.18841","snapshot_observed_at":"2026-08-03T00:55:26.018246Z","title":"arXiv preprint arXiv:2501.18841 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28636","last_updated":"2026-05-19T13:56:13Z","snapshot_observed_at":"2026-08-05T14:23:31.071098Z","submitted_at":"2026-05-19T13:56:13Z","title":"Chain-of-Models: Cross-Model Auditing for Bias-Robust LLM Judges","version":1},"reference_index":71,"source":"arxiv_source","source_observed_at":"2026-08-03T00:55:26.018246Z"},"links":{"cited_paper":"/paper/2501.18841","citing_paper":"/paper/2607.28636"},"observation_digest":"sha256:53fc2f1cd5343721c95aa1fef2100a54dd9f54e9fb95029a8adc147e45857b56","observation_id":"1048856a-943c-49fd-968e-1d524deec0bf","resolution":{"observed_at":"2026-08-03T00:55:26.018246Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.18841","last_updated":"2025-01-31T01:20:44Z","snapshot_observed_at":"2026-07-06T20:28:47.519113Z","submitted_at":"2025-01-31T01:20:44Z","title":"Trading Inference-Time Compute for Adversarial Robustness","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.18841","snapshot_observed_at":"2026-08-03T14:38:56.406706Z","title":"Trading inference-time compute for adversarial robustness.arXiv preprint arXiv:2501.18841, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.29052","last_updated":"2026-07-31T06:10:24Z","snapshot_observed_at":"2026-08-05T14:28:11.488733Z","submitted_at":"2026-07-31T06:10:24Z","title":"Outcome-Guided Distillation: A Teacher-Student Framework to Advance VLM Reasoning in Autonomous Driving","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-03T14:38:56.406706Z"},"links":{"cited_paper":"/paper/2501.18841","citing_paper":"/paper/2607.29052"},"observation_digest":"sha256:a711c956c58d0ce6f25cb774d69e17dae752ab007a05a9e607cd7c0c14a3da33","observation_id":"2624a320-7852-426d-8c1e-a4439a7ebea9","resolution":{"observed_at":"2026-08-03T14:38:56.406706Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.18841","last_updated":"2025-01-31T01:20:44Z","snapshot_observed_at":"2026-07-06T20:28:47.519113Z","submitted_at":"2025-01-31T01:20:44Z","title":"Trading Inference-Time Compute for Adversarial Robustness","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.18841","snapshot_observed_at":"2026-08-04T01:03:47.560713Z","title":"Trading inference-time compute for adversarial robustness,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.00202","last_updated":"2026-07-31T18:27:12Z","snapshot_observed_at":"2026-08-05T14:38:16.510503Z","submitted_at":"2026-07-31T18:27:12Z","title":"From Monoliths to Swarms: A Study of Attack Surface Evolution in the Transition to Multi-Agent Web Systems","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-04T01:03:47.560713Z"},"links":{"cited_paper":"/paper/2501.18841","citing_paper":"/paper/2608.00202"},"observation_digest":"sha256:234f26fb5ffb57691deca71b58678aea3aa813eeb308d752b62e7e27ffbf34ae","observation_id":"8273bdb2-5108-4b30-9576-c2d507d6d816","resolution":{"observed_at":"2026-08-04T01:03:47.560713Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2501.18841/citation-record","integrity":"/paper/2501.18841/integrity","json":"/paper/2501.18841/citation-record.json","paper":"/paper/2501.18841"},"outbound":[],"paper":{"arxiv_id":"2501.18841","last_updated":"2025-01-31T01:20:44Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T20:28:47.519113Z","submitted_at":"2025-01-31T01:20:44Z","title":"Trading Inference-Time Compute for Adversarial Robustness"},"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-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"thesis":"As of 5 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 11 inbound Pith citation observations for arXiv:2501.18841."}