{"as_of":"2026-08-10T11:53:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c9635653592b358f6c428fb1d592b4876fa204f4cda18d06de0cc7a13289005d","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":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-01T06:25:06.349588Z","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-07-01T00:35:10.208837Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2504.20828","last_updated":"2025-04-30T14:08:38Z","snapshot_observed_at":"2026-08-09T04:59:47.338151Z","submitted_at":"2025-04-29T14:51:26Z","title":"Ascendra: Dynamic Request Prioritization for Efficient LLM Serving","version":2},"cited_work":{"arxiv_id":"2504.20828","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2504.20828","snapshot_observed_at":"2026-07-01T00:35:10.208837Z","title":"Ascendra: Dynamic request prioritization for efficient llm serving","venue":null,"work_id":"8e0d46ca-17eb-4ebe-8de0-f77a1ea8c033","year":null},"citing_paper":{"arxiv_id":"2601.21841","last_updated":"2026-05-17T22:32:46Z","snapshot_observed_at":"2026-07-06T22:43:30.761426Z","submitted_at":"2026-01-29T15:18:58Z","title":"Embodied Task Planning via Graph-Informed Action Generation with Large Language Models","version":3},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-21T14:42:10.819481Z"},"links":{"cited_paper":"/paper/2504.20828","citing_paper":"/paper/2601.21841"},"observation_digest":"sha256:fae5e6fc01f353ea06777334938f07a672441d2c68754083f6d9ebbba8ad4ba7","observation_id":"f336c9d3-6baf-4d36-a800-4c1d444fb49c","resolution":{"observed_at":"2026-05-21T14:44:12.850642Z","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":"2504.20828","last_updated":"2025-04-30T14:08:38Z","snapshot_observed_at":"2026-08-09T04:59:47.338151Z","submitted_at":"2025-04-29T14:51:26Z","title":"Ascendra: Dynamic Request Prioritization for Efficient LLM Serving","version":2},"cited_work":{"arxiv_id":"2504.20828","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2504.20828","snapshot_observed_at":"2026-07-01T00:35:10.208837Z","title":"Ascendra: Dynamic request prioritization for efficient llm serving","venue":null,"work_id":"8e0d46ca-17eb-4ebe-8de0-f77a1ea8c033","year":null},"citing_paper":{"arxiv_id":"2605.02329","last_updated":"2026-05-25T17:26:33Z","snapshot_observed_at":"2026-08-02T00:39:56.914878Z","submitted_at":"2026-05-04T08:29:47Z","title":"Taming Request Imbalance: SLO-Aware Scheduling for Disaggregated LLM Inference","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-08T18:27:13.781231Z"},"links":{"cited_paper":"/paper/2504.20828","citing_paper":"/paper/2605.02329"},"observation_digest":"sha256:02b3a298a1b8f4dfe4a4fc4a7c305c49bbc6bb8c302b5c16d4029e90c026f03e","observation_id":"75194a64-52f8-47d5-8761-6982e73f9bd3","resolution":{"observed_at":"2026-05-09T06:25:46.454910Z","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":"2504.20828","last_updated":"2025-04-30T14:08:38Z","snapshot_observed_at":"2026-08-09T04:59:47.338151Z","submitted_at":"2025-04-29T14:51:26Z","title":"Ascendra: Dynamic Request Prioritization for Efficient LLM Serving","version":2},"cited_work":{"arxiv_id":"2504.20828","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2504.20828","snapshot_observed_at":"2026-07-01T00:35:10.208837Z","title":"Ascendra: Dynamic request prioritization for efficient llm serving","venue":null,"work_id":"8e0d46ca-17eb-4ebe-8de0-f77a1ea8c033","year":null},"citing_paper":{"arxiv_id":"2605.02329","last_updated":"2026-05-25T17:26:33Z","snapshot_observed_at":"2026-08-02T00:39:56.914878Z","submitted_at":"2026-05-04T08:29:47Z","title":"Taming Request Imbalance: SLO-Aware Scheduling for Disaggregated LLM Inference","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-01T00:31:12.965178Z"},"links":{"cited_paper":"/paper/2504.20828","citing_paper":"/paper/2605.02329"},"observation_digest":"sha256:aee5221251c4ad0b9b80ea359a38be43db725000551a5262d23a3ea3df69e89c","observation_id":"fa5c4aff-448c-4f09-938c-06de9edd191f","resolution":{"observed_at":"2026-07-01T00:35:10.210688Z","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":"2504.20828","last_updated":"2025-04-30T14:08:38Z","snapshot_observed_at":"2026-08-09T04:59:47.338151Z","submitted_at":"2025-04-29T14:51:26Z","title":"Ascendra: Dynamic Request Prioritization for Efficient LLM Serving","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.20828","snapshot_observed_at":"2026-08-01T06:25:06.349588Z","title":"2025 , archivePrefix =","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.27523","last_updated":"2026-07-29T23:25:45Z","snapshot_observed_at":"2026-08-08T06:31:26.917124Z","submitted_at":"2026-07-29T23:25:45Z","title":"Hierarchical Reranking for Scalable Financial RAG System","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-01T06:25:06.349588Z"},"links":{"cited_paper":"/paper/2504.20828","citing_paper":"/paper/2607.27523"},"observation_digest":"sha256:074df5d75726bc9ff90c212fe5e926cf5e6d136b05e22dd7777726e932a5908b","observation_id":"2b4df5bf-cc13-4ca0-b559-5b763cd639d6","resolution":{"observed_at":"2026-08-01T06:25:06.349588Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2504.20828/citation-record","integrity":"/paper/2504.20828/integrity","json":"/paper/2504.20828/citation-record.json","paper":"/paper/2504.20828"},"outbound":[],"paper":{"arxiv_id":"2504.20828","last_updated":"2025-04-30T14:08:38Z","latest_version":2,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-09T04:59:47.338151Z","submitted_at":"2025-04-29T14:51:26Z","title":"Ascendra: Dynamic Request Prioritization for Efficient LLM Serving"},"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 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:2504.20828."}