{"as_of":"2026-08-11T00:07:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:93deed4daf6d1a346f31e3eddacbd9a6776fc121bf572ad8f31a7de3b8d20d45","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-07T11:16:22.169338Z","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-04T11:39:47.097757Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2310.01467","last_updated":"2023-10-02T16:43:14Z","snapshot_observed_at":"2026-08-10T11:05:02.095051Z","submitted_at":"2023-10-02T16:43:14Z","title":"FedBPT: Efficient Federated Black-box Prompt Tuning for Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.01467","snapshot_observed_at":"2026-08-07T11:16:22.169338Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.03337","last_updated":"2025-06-03T19:29:50Z","snapshot_observed_at":"2026-08-09T22:06:39.008689Z","submitted_at":"2025-06-03T19:29:50Z","title":"Mitigating Non-IID Drift in Zeroth-Order Federated LLM Fine-Tuning with Transferable Sparsity","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T11:16:22.169338Z"},"links":{"cited_paper":"/paper/2310.01467","citing_paper":"/paper/2506.03337"},"observation_digest":"sha256:07619334f00b5beee05b3f8c6af1937284672ba33ade69aa2b80d25123a3153c","observation_id":"ccf9532c-57d1-427c-9ff6-c6021dbbece6","resolution":{"observed_at":"2026-08-07T11:16:22.169338Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.01467","last_updated":"2023-10-02T16:43:14Z","snapshot_observed_at":"2026-08-10T11:05:02.095051Z","submitted_at":"2023-10-02T16:43:14Z","title":"FedBPT: Efficient Federated Black-box Prompt Tuning for Large Language Models","version":1},"cited_work":{"arxiv_id":"2310.01467","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2310.01467","snapshot_observed_at":"2026-07-04T11:39:47.097757Z","title":"arXiv preprint arXiv:2310.01467 , year=","venue":null,"work_id":"21d9d328-c9d1-4549-813e-f3ad0a35cb02","year":2023},"citing_paper":{"arxiv_id":"2605.11857","last_updated":"2026-05-12T09:41:40Z","snapshot_observed_at":"2026-07-06T23:23:39.723268Z","submitted_at":"2026-05-12T09:41:40Z","title":"Beyond Parameter Aggregation: Semantic Consensus for Federated Fine-Tuning of LLMs","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-05-13T06:27:43.534185Z"},"links":{"cited_paper":"/paper/2310.01467","citing_paper":"/paper/2605.11857"},"observation_digest":"sha256:770845df239aecb82530d9fb32c5be93daa16285018f7ec3686344f0bb292b41","observation_id":"8d04cfd4-51ec-436e-a9f9-39395f48ceb2","resolution":{"observed_at":"2026-05-13T06:32:24.743587Z","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":"2310.01467","last_updated":"2023-10-02T16:43:14Z","snapshot_observed_at":"2026-08-10T11:05:02.095051Z","submitted_at":"2023-10-02T16:43:14Z","title":"FedBPT: Efficient Federated Black-box Prompt Tuning for Large Language Models","version":1},"cited_work":{"arxiv_id":"2310.01467","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2310.01467","snapshot_observed_at":"2026-07-04T11:39:47.097757Z","title":"arXiv preprint arXiv:2310.01467 , year=","venue":null,"work_id":"21d9d328-c9d1-4549-813e-f3ad0a35cb02","year":2023},"citing_paper":{"arxiv_id":"2606.24004","last_updated":"2026-06-29T07:01:12Z","snapshot_observed_at":"2026-08-02T11:15:29.427964Z","submitted_at":"2026-06-22T23:21:55Z","title":"Towards Spec Learning: Inference-Time Alignment from Preference Pairs","version":1},"reference_index":96,"source":"pdf_text","source_observed_at":"2026-06-26T07:49:36.816100Z"},"links":{"cited_paper":"/paper/2310.01467","citing_paper":"/paper/2606.24004"},"observation_digest":"sha256:3e5560e5f7e096c1171ed871dc8fe9e9417b0cffec6ab34ea49e2129400772e2","observation_id":"49d10174-f4f2-4f27-820e-831b1024b4ed","resolution":{"observed_at":"2026-07-04T11:39:47.099608Z","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":"2310.01467","last_updated":"2023-10-02T16:43:14Z","snapshot_observed_at":"2026-08-10T11:05:02.095051Z","submitted_at":"2023-10-02T16:43:14Z","title":"FedBPT: Efficient Federated Black-box Prompt Tuning for Large Language Models","version":1},"cited_work":{"arxiv_id":"2310.01467","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2310.01467","snapshot_observed_at":"2026-07-04T11:39:47.097757Z","title":"arXiv preprint arXiv:2310.01467 , year=","venue":null,"work_id":"21d9d328-c9d1-4549-813e-f3ad0a35cb02","year":2023},"citing_paper":{"arxiv_id":"2606.24004","last_updated":"2026-06-29T07:01:12Z","snapshot_observed_at":"2026-08-02T11:15:29.427964Z","submitted_at":"2026-06-22T23:21:55Z","title":"Towards Spec Learning: Inference-Time Alignment from Preference Pairs","version":2},"reference_index":96,"source":"pdf_text","source_observed_at":"2026-06-30T10:17:33.176525Z"},"links":{"cited_paper":"/paper/2310.01467","citing_paper":"/paper/2606.24004"},"observation_digest":"sha256:78754ca46dfe7667f5cd45e47739a118111085b533425daf8a6c7ea21bb914d6","observation_id":"f08c24a9-b92c-42b6-af46-c2787affa19e","resolution":{"observed_at":"2026-06-30T12:04:39.407055Z","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/2310.01467/citation-record","integrity":"/paper/2310.01467/integrity","json":"/paper/2310.01467/citation-record.json","paper":"/paper/2310.01467"},"outbound":[],"paper":{"arxiv_id":"2310.01467","last_updated":"2023-10-02T16:43:14Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-10T11:05:02.095051Z","submitted_at":"2023-10-02T16:43:14Z","title":"FedBPT: Efficient Federated Black-box Prompt Tuning for Large Language Models"},"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 4 inbound Pith citation observations for arXiv:2310.01467."}