{"as_of":"2026-08-09T20:51:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:381d4faf5461dae61d0e0c94fb15fd1a2e989bef3f845597c7ea36e54c5549e8","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":13,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":13,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":13,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":13,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T14:36:33.339509Z","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-30T23:35:07.254827Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2505.10475","last_updated":"2025-05-15T16:24:45Z","snapshot_observed_at":"2026-08-07T15:45:00.286151Z","submitted_at":"2025-05-15T16:24:45Z","title":"Parallel Scaling Law for Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.10475","snapshot_observed_at":"2026-08-06T14:36:33.339509Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.18580","last_updated":"2025-07-24T16:56:38Z","snapshot_observed_at":"2026-08-06T18:21:31.656714Z","submitted_at":"2025-07-24T16:56:38Z","title":"System Report for CCL25-Eval Task 10: SRAG-MAV for Fine-Grained Chinese Hate Speech Recognition","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-06T14:36:33.339509Z"},"links":{"cited_paper":"/paper/2505.10475","citing_paper":"/paper/2507.18580"},"observation_digest":"sha256:ce84baa0d18bd346c155b6bbc25f12f7c6c6b37fb79c19e4f5530183f4e64ee6","observation_id":"d9ef287e-212b-4d88-9dd4-2e3db15b1761","resolution":{"observed_at":"2026-08-06T14:36:33.339509Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.10475","last_updated":"2025-05-15T16:24:45Z","snapshot_observed_at":"2026-08-07T15:45:00.286151Z","submitted_at":"2025-05-15T16:24:45Z","title":"Parallel Scaling Law for Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.10475","snapshot_observed_at":"2026-08-05T21:55:07.259301Z","title":"Parallel Scaling Law for Language Models","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2508.07785","last_updated":"2025-08-11T09:15:36Z","snapshot_observed_at":"2026-08-09T17:03:23.397293Z","submitted_at":"2025-08-11T09:15:36Z","title":"Grove MoE: Towards Efficient and Superior MoE LLMs with Adjugate Experts","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-05T21:55:07.259301Z"},"links":{"cited_paper":"/paper/2505.10475","citing_paper":"/paper/2508.07785"},"observation_digest":"sha256:2d614299e152089df08d7f62e0d6f9b70ff354f3e5ab8bb60eb50f2414e2f452","observation_id":"86c53e88-b9b7-4736-9498-c8f3ad700b54","resolution":{"observed_at":"2026-08-05T21:55:07.259301Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.10475","last_updated":"2025-05-15T16:24:45Z","snapshot_observed_at":"2026-08-07T15:45:00.286151Z","submitted_at":"2025-05-15T16:24:45Z","title":"Parallel Scaling Law for Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.10475","snapshot_observed_at":"2026-08-05T13:52:03.639253Z","title":"Parallel scaling law for language models, 2025 a","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.04475","last_updated":"2025-08-30T03:09:07Z","snapshot_observed_at":"2026-08-08T21:44:17.416488Z","submitted_at":"2025-08-30T03:09:07Z","title":"ParaThinker: Native Parallel Thinking as a New Paradigm to Scale LLM Test-time Compute","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-05T13:52:03.639253Z"},"links":{"cited_paper":"/paper/2505.10475","citing_paper":"/paper/2509.04475"},"observation_digest":"sha256:0315e35d6f9b7aff89d2e2dc330a4d9eeeed71452545d2eb5f87407fb4ff8e7d","observation_id":"a8464fe0-7b75-4f41-a026-6aa7729b5837","resolution":{"observed_at":"2026-08-05T13:52:03.639253Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.10475","last_updated":"2025-05-15T16:24:45Z","snapshot_observed_at":"2026-08-07T15:45:00.286151Z","submitted_at":"2025-05-15T16:24:45Z","title":"Parallel Scaling Law for Language Models","version":1},"cited_work":{"arxiv_id":"2505.10475","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2505.10475","snapshot_observed_at":"2026-06-30T23:35:07.254827Z","title":"Parallel scaling law for language models","venue":null,"work_id":"21e9dd09-a711-47d9-9ce9-3e5cb7213a02","year":2025},"citing_paper":{"arxiv_id":"2509.08016","last_updated":"2026-04-09T01:22:20Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-09-09T00:55:04Z","title":"Video Parallel Scaling: Aggregating Diverse Frame Subsets for VideoLLMs","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-18T18:35:01.328250Z"},"links":{"cited_paper":"/paper/2505.10475","citing_paper":"/paper/2509.08016"},"observation_digest":"sha256:64d79b5c63ce01235deaf37a38a710984ac254b46636f71580c2dda51ab75fc1","observation_id":"f0a77883-5ce6-4769-bffc-67145f1265dc","resolution":{"observed_at":"2026-05-18T18:36:44.187053Z","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":"2505.10475","last_updated":"2025-05-15T16:24:45Z","snapshot_observed_at":"2026-08-07T15:45:00.286151Z","submitted_at":"2025-05-15T16:24:45Z","title":"Parallel Scaling Law for Language Models","version":1},"cited_work":{"arxiv_id":"2505.10475","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2505.10475","snapshot_observed_at":"2026-06-30T23:35:07.254827Z","title":"Parallel scaling law for language models","venue":null,"work_id":"21e9dd09-a711-47d9-9ce9-3e5cb7213a02","year":2025},"citing_paper":{"arxiv_id":"2512.06443","last_updated":"2026-04-14T07:55:36Z","snapshot_observed_at":"2026-08-07T01:10:46.412155Z","submitted_at":"2025-12-06T14:14:01Z","title":"Vec-LUT: Vector Table Lookup for Parallel Ultra-Low-Bit LLM Inference on Edge Devices","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-17T00:46:48.862313Z"},"links":{"cited_paper":"/paper/2505.10475","citing_paper":"/paper/2512.06443"},"observation_digest":"sha256:33b8e487618ede23ef1b5f5dd94f634cc78c35f05324c44330c9fc9955bd6c5f","observation_id":"44c14fd2-3d28-4dee-ac4d-5e318028687c","resolution":{"observed_at":"2026-05-17T00:48:45.809804Z","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":"2505.10475","last_updated":"2025-05-15T16:24:45Z","snapshot_observed_at":"2026-08-07T15:45:00.286151Z","submitted_at":"2025-05-15T16:24:45Z","title":"Parallel Scaling Law for Language Models","version":1},"cited_work":{"arxiv_id":"2505.10475","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2505.10475","snapshot_observed_at":"2026-06-30T23:35:07.254827Z","title":"Parallel scaling law for language models","venue":null,"work_id":"21e9dd09-a711-47d9-9ce9-3e5cb7213a02","year":2025},"citing_paper":{"arxiv_id":"2601.21619","last_updated":"2026-05-09T01:57:30Z","snapshot_observed_at":"2026-07-06T22:43:30.761426Z","submitted_at":"2026-01-29T12:22:45Z","title":"On the Overscaling Curse of Parallel Thinking: System Efficacy Contradicts Sample Efficiency","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-16T10:38:09.875786Z"},"links":{"cited_paper":"/paper/2505.10475","citing_paper":"/paper/2601.21619"},"observation_digest":"sha256:a684cabe8f7bebe8f7f72cca441eabc674b78d4cb078dff5a96453b59168dba7","observation_id":"0d7ac0bf-a7ba-4cc8-9980-3c0b2c23d10e","resolution":{"observed_at":"2026-05-16T10:40:51.377730Z","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":"2505.10475","last_updated":"2025-05-15T16:24:45Z","snapshot_observed_at":"2026-08-07T15:45:00.286151Z","submitted_at":"2025-05-15T16:24:45Z","title":"Parallel Scaling Law for Language Models","version":1},"cited_work":{"arxiv_id":"2505.10475","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2505.10475","snapshot_observed_at":"2026-06-30T23:35:07.254827Z","title":"Parallel scaling law for language models","venue":null,"work_id":"21e9dd09-a711-47d9-9ce9-3e5cb7213a02","year":2025},"citing_paper":{"arxiv_id":"2604.19341","last_updated":"2026-04-21T11:24:09Z","snapshot_observed_at":"2026-07-06T23:06:02.635464Z","submitted_at":"2026-04-21T11:24:09Z","title":"Evaluation-driven Scaling for Scientific Discovery","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-05-10T03:39:52.204043Z"},"links":{"cited_paper":"/paper/2505.10475","citing_paper":"/paper/2604.19341"},"observation_digest":"sha256:3e2820ae8a89195e6c170f872f14b44c7d494a04dfec4aa4ca126fe487012c32","observation_id":"85ba890c-f556-41c4-83e5-7bdae37cad36","resolution":{"observed_at":"2026-05-11T12:26:05.369634Z","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":"2505.10475","last_updated":"2025-05-15T16:24:45Z","snapshot_observed_at":"2026-08-07T15:45:00.286151Z","submitted_at":"2025-05-15T16:24:45Z","title":"Parallel Scaling Law for Language Models","version":1},"cited_work":{"arxiv_id":"2505.10475","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2505.10475","snapshot_observed_at":"2026-06-30T23:35:07.254827Z","title":"Parallel scaling law for language models","venue":null,"work_id":"21e9dd09-a711-47d9-9ce9-3e5cb7213a02","year":2025},"citing_paper":{"arxiv_id":"2605.08696","last_updated":"2026-07-31T21:33:57Z","snapshot_observed_at":"2026-08-06T23:11:17.515488Z","submitted_at":"2026-05-09T05:07:55Z","title":"Structured Recurrent Mixers for Massively Parallelized Sequence Generation","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-05-12T01:28:46.885635Z"},"links":{"cited_paper":"/paper/2505.10475","citing_paper":"/paper/2605.08696"},"observation_digest":"sha256:d7d650d3bcda2a0cbb6c665b59a4201d8fb11fe7c9ab7e55c0c0c1d9082ebfd5","observation_id":"8ba909a7-f7f4-430c-92de-a863fb278ea5","resolution":{"observed_at":"2026-05-12T07:56:29.228324Z","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":"2505.10475","last_updated":"2025-05-15T16:24:45Z","snapshot_observed_at":"2026-08-07T15:45:00.286151Z","submitted_at":"2025-05-15T16:24:45Z","title":"Parallel Scaling Law for Language Models","version":1},"cited_work":{"arxiv_id":"2505.10475","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2505.10475","snapshot_observed_at":"2026-06-30T23:35:07.254827Z","title":"Parallel scaling law for language models","venue":null,"work_id":"21e9dd09-a711-47d9-9ce9-3e5cb7213a02","year":2025},"citing_paper":{"arxiv_id":"2605.08696","last_updated":"2026-07-31T21:33:57Z","snapshot_observed_at":"2026-08-06T23:11:17.515488Z","submitted_at":"2026-05-09T05:07:55Z","title":"Structured Recurrent Mixers for Massively Parallelized Sequence Generation","version":2},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-05-20T23:27:20.754475Z"},"links":{"cited_paper":"/paper/2505.10475","citing_paper":"/paper/2605.08696"},"observation_digest":"sha256:3111be2a159aa1bda2caf6c6674b21606267f39b4473249811632a36fc270578","observation_id":"2daf2c9d-56a2-4a70-adae-eb820af0c9f5","resolution":{"observed_at":"2026-05-20T23:29:13.005444Z","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":"2505.10475","last_updated":"2025-05-15T16:24:45Z","snapshot_observed_at":"2026-08-07T15:45:00.286151Z","submitted_at":"2025-05-15T16:24:45Z","title":"Parallel Scaling Law for Language Models","version":1},"cited_work":{"arxiv_id":"2505.10475","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2505.10475","snapshot_observed_at":"2026-06-30T23:35:07.254827Z","title":"Parallel scaling law for language models","venue":null,"work_id":"21e9dd09-a711-47d9-9ce9-3e5cb7213a02","year":2025},"citing_paper":{"arxiv_id":"2605.08696","last_updated":"2026-07-31T21:33:57Z","snapshot_observed_at":"2026-08-06T23:11:17.515488Z","submitted_at":"2026-05-09T05:07:55Z","title":"Structured Recurrent Mixers for Massively Parallelized Sequence Generation","version":3},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-06-30T23:31:48.469869Z"},"links":{"cited_paper":"/paper/2505.10475","citing_paper":"/paper/2605.08696"},"observation_digest":"sha256:eba842bdf981aebea2dd6346f24fbbf845cec865ba8744810ef4a3629ba1a5e5","observation_id":"7ce67c41-5046-43bd-bc66-016794d337a4","resolution":{"observed_at":"2026-06-30T23:35:07.256259Z","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":"2505.10475","last_updated":"2025-05-15T16:24:45Z","snapshot_observed_at":"2026-08-07T15:45:00.286151Z","submitted_at":"2025-05-15T16:24:45Z","title":"Parallel Scaling Law for Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.10475","snapshot_observed_at":"2026-08-04T05:19:06.400737Z","title":"Parallel scaling law for language models, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2605.08696","last_updated":"2026-07-31T21:33:57Z","snapshot_observed_at":"2026-08-06T23:11:17.515488Z","submitted_at":"2026-05-09T05:07:55Z","title":"Structured Recurrent Mixers for Massively Parallelized Sequence Generation","version":4},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-04T05:19:06.400737Z"},"links":{"cited_paper":"/paper/2505.10475","citing_paper":"/paper/2605.08696"},"observation_digest":"sha256:7197ea92970c272ad4340ee20521f732a6b665bfd44477c9104e843ca52d2c2c","observation_id":"f1b2d68f-55bd-40f8-83de-7aa5e11aa1be","resolution":{"observed_at":"2026-08-04T05:19:06.400737Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.10475","last_updated":"2025-05-15T16:24:45Z","snapshot_observed_at":"2026-08-07T15:45:00.286151Z","submitted_at":"2025-05-15T16:24:45Z","title":"Parallel Scaling Law for Language Models","version":1},"cited_work":{"arxiv_id":"2505.10475","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2505.10475","snapshot_observed_at":"2026-06-30T23:35:07.254827Z","title":"Parallel scaling law for language models","venue":null,"work_id":"21e9dd09-a711-47d9-9ce9-3e5cb7213a02","year":2025},"citing_paper":{"arxiv_id":"2605.18750","last_updated":"2026-05-18T17:59:18Z","snapshot_observed_at":"2026-07-06T23:29:33.702647Z","submitted_at":"2026-05-18T17:59:18Z","title":"A Readiness-Driven Runtime for Pipeline-Parallel Training under Runtime Variability","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-20T07:35:32.225708Z"},"links":{"cited_paper":"/paper/2505.10475","citing_paper":"/paper/2605.18750"},"observation_digest":"sha256:22de41ba15c23d8e48aad406061a2a061af9982de680a9b6803c809cfb9c2550","observation_id":"ad31ccb7-640f-4f04-a05d-cd0f1c3c74cb","resolution":{"observed_at":"2026-05-20T07:38:09.462627Z","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":"2505.10475","last_updated":"2025-05-15T16:24:45Z","snapshot_observed_at":"2026-08-07T15:45:00.286151Z","submitted_at":"2025-05-15T16:24:45Z","title":"Parallel Scaling Law for Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.10475","snapshot_observed_at":"2026-08-02T12:12:35.629644Z","title":"CoRR , volume =","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.22577","last_updated":"2026-06-06T13:51:15Z","snapshot_observed_at":"2026-08-05T23:00:23.353495Z","submitted_at":"2026-06-06T13:51:15Z","title":"cMoLLM at Scale: Horizontal Scaling Laws for Mixture-of-LLMs","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-02T12:12:35.629644Z"},"links":{"cited_paper":"/paper/2505.10475","citing_paper":"/paper/2607.22577"},"observation_digest":"sha256:84ffdc1b0a23a0e0822cd4e2263b6a03a58a84f0d6d3299924b3e25b5294dde6","observation_id":"67f495f4-0cb9-4803-8f3e-888f73ec96ef","resolution":{"observed_at":"2026-08-02T12:12:35.629644Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2505.10475/citation-record","integrity":"/paper/2505.10475/integrity","json":"/paper/2505.10475/citation-record.json","paper":"/paper/2505.10475"},"outbound":[],"paper":{"arxiv_id":"2505.10475","last_updated":"2025-05-15T16:24:45Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-07T15:45:00.286151Z","submitted_at":"2025-05-15T16:24:45Z","title":"Parallel Scaling Law for 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-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 13 inbound Pith citation observations for arXiv:2505.10475."}