{"as_of":"2026-08-19T12:03:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:34b6edefda0970b2d9c1dce3dadb5d74e3c023d423b29d91a310b786221851db","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T20:25:47.712274Z","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-05-15T06:45:11.954526Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2503.21464","last_updated":"2025-03-27T12:54:00Z","snapshot_observed_at":"2026-08-16T12:46:19.127230Z","submitted_at":"2025-03-27T12:54:00Z","title":"Harnessing Chain-of-Thought Metadata for Task Routing and Adversarial Prompt Detection","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.21464","snapshot_observed_at":"2026-08-06T20:25:47.712274Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.02822","last_updated":"2025-07-03T17:33:58Z","snapshot_observed_at":"2026-08-18T21:55:45.146812Z","submitted_at":"2025-07-03T17:33:58Z","title":"SynapseRoute: An Auto-Route Switching Framework on Dual-State Large Language Model","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-06T20:25:47.712274Z"},"links":{"cited_paper":"/paper/2503.21464","citing_paper":"/paper/2507.02822"},"observation_digest":"sha256:8bbe1214d12979b4fb3f7e17a7cc2ac71fd37ed66da83b92f1a689488358d444","observation_id":"010263d2-bd0f-42ba-88b7-980483f1336e","resolution":{"observed_at":"2026-08-06T20:25:47.712274Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.21464","last_updated":"2025-03-27T12:54:00Z","snapshot_observed_at":"2026-08-16T12:46:19.127230Z","submitted_at":"2025-03-27T12:54:00Z","title":"Harnessing Chain-of-Thought Metadata for Task Routing and Adversarial Prompt Detection","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.21464","snapshot_observed_at":"2026-08-05T10:39:07.092325Z","title":"Harnessing Chain-of-Thought Metadata for Task Routing and Adversarial Prompt Detection","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-17T17:37:38.616375Z","submitted_at":"2025-09-04T04:12:31Z","title":"A Comprehensive Survey on Trustworthiness in Reasoning with Large Language Models","version":1},"reference_index":175,"source":"pdf_text","source_observed_at":"2026-08-05T10:39:07.092325Z"},"links":{"cited_paper":"/paper/2503.21464","citing_paper":"/paper/2509.03871"},"observation_digest":"sha256:fffec1c0a7697abe9ef42df02c5347a5ffe175b0de499fd86ec78b49261cd72b","observation_id":"56e94195-9916-4d31-9137-84bf8ef42f05","resolution":{"observed_at":"2026-08-05T10:39:07.092325Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.21464","last_updated":"2025-03-27T12:54:00Z","snapshot_observed_at":"2026-08-16T12:46:19.127230Z","submitted_at":"2025-03-27T12:54:00Z","title":"Harnessing Chain-of-Thought Metadata for Task Routing and Adversarial Prompt Detection","version":1},"cited_work":{"arxiv_id":"2503.21464","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2503.21464","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Harnessing chain-of-thought metadata for task routing and adversarial prompt detection","venue":null,"work_id":"15027d48-e9ac-4de5-be87-93141b58c0c0","year":2026},"citing_paper":{"arxiv_id":"2603.21354","last_updated":"2026-04-08T22:31:39Z","snapshot_observed_at":"2026-08-13T16:44:04.654149Z","submitted_at":"2026-03-22T18:30:11Z","title":"The Workload-Router-Pool Architecture for LLM Inference Optimization: A Vision Paper from the vLLM Semantic Router Project","version":2},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-05-15T06:40:27.945478Z"},"links":{"cited_paper":"/paper/2503.21464","citing_paper":"/paper/2603.21354"},"observation_digest":"sha256:34500947c877d2b30f1a92748ec7c2f6d8dff06c74446a0a166ccc9a12804e09","observation_id":"f40aa542-ca10-4feb-b493-11c0d4f164cc","resolution":{"observed_at":"2026-05-15T06:45:11.958074Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2503.21464/citation-record","integrity":"/paper/2503.21464/integrity","json":"/paper/2503.21464/citation-record.json","paper":"/paper/2503.21464"},"outbound":[],"paper":{"arxiv_id":"2503.21464","last_updated":"2025-03-27T12:54:00Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-16T12:46:19.127230Z","submitted_at":"2025-03-27T12:54:00Z","title":"Harnessing Chain-of-Thought Metadata for Task Routing and Adversarial Prompt Detection"},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2503.21464."}