{"as_of":"2026-08-10T21:18:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:53ee03b3f5efa787be949ff1b265c2d8004f01b134871e7de6743ef27fb61cd9","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-10T06:31:04.303077+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-10T17:20:51.156794Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-08T20:44:48.795871Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2309.08520","last_updated":"2023-09-15T16:29:27Z","snapshot_observed_at":"2026-08-10T14:43:47.936653Z","submitted_at":"2023-09-15T16:29:27Z","title":"Scaling Laws for Sparsely-Connected Foundation Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.08520","snapshot_observed_at":"2026-08-10T17:20:51.156794Z","title":"Scaling laws for sparsely-connected foundation models","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.12391","last_updated":"2025-01-21T18:59:49Z","snapshot_observed_at":"2026-08-10T20:26:48.268439Z","submitted_at":"2025-01-21T18:59:49Z","title":"Physics of Skill Learning","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-10T17:20:51.156794Z"},"links":{"cited_paper":"/paper/2309.08520","citing_paper":"/paper/2501.12391"},"observation_digest":"sha256:54cd99e29daa31a2a591d774df01cb0695ff4ff47d621f225fdddfad0b28b43a","observation_id":"60c7d7be-2e56-4d08-a2b4-38c32e4a9efb","resolution":{"observed_at":"2026-08-10T17:20:51.156794Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.08520","last_updated":"2023-09-15T16:29:27Z","snapshot_observed_at":"2026-08-10T14:43:47.936653Z","submitted_at":"2023-09-15T16:29:27Z","title":"Scaling Laws for Sparsely-Connected Foundation Models","version":1},"cited_work":{"arxiv_id":"2309.08520","doi":null,"metadata_source":"pith","pith_arxiv_id":"2309.08520","snapshot_observed_at":"2026-08-08T20:44:48.795871Z","title":"Scaling Laws for Sparsely-Connected Foundation Models","venue":"cs.LG","work_id":"e004bbcb-c839-4c4d-a0d1-ff287682d8a1","year":2023},"citing_paper":{"arxiv_id":"2502.05003","last_updated":"2025-06-10T18:01:40Z","snapshot_observed_at":"2026-08-09T18:46:49.510936Z","submitted_at":"2025-02-07T15:23:34Z","title":"QuEST: Stable Training of LLMs with 1-Bit Weights and Activations","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-08T20:44:48.432495Z"},"links":{"cited_paper":"/paper/2309.08520","citing_paper":"/paper/2502.05003"},"observation_digest":"sha256:d6047f50cdd39ac82b381de5222b0321829395548264e9df520a97d1ab4ce75d","observation_id":"a16b1939-9604-4793-952f-8c496c0761c2","resolution":{"observed_at":"2026-08-08T20:44:48.799372Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"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":"2309.08520","last_updated":"2023-09-15T16:29:27Z","snapshot_observed_at":"2026-08-10T14:43:47.936653Z","submitted_at":"2023-09-15T16:29:27Z","title":"Scaling Laws for Sparsely-Connected Foundation Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.08520","snapshot_observed_at":"2026-08-01T17:12:35.695223Z","title":"arXiv preprint arXiv:2309.08520 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17733","last_updated":"2026-07-20T09:23:10Z","snapshot_observed_at":"2026-08-08T01:05:12.635413Z","submitted_at":"2026-07-20T09:23:10Z","title":"MXSens: Sensitivity-Aware Mixed-Precision Quantization for Efficient LLM Inference","version":1},"reference_index":83,"source":"arxiv_source","source_observed_at":"2026-08-01T17:12:35.695223Z"},"links":{"cited_paper":"/paper/2309.08520","citing_paper":"/paper/2607.17733"},"observation_digest":"sha256:ecef125027c8e4caec3282c8e0777f271f7fc4aa4022eb798c1c50cd75c81683","observation_id":"b58cbc9d-c761-451e-aa26-f54b78697daf","resolution":{"observed_at":"2026-08-01T17:12:35.695223Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2309.08520/citation-record","integrity":"/paper/2309.08520/integrity","json":"/paper/2309.08520/citation-record.json","paper":"/paper/2309.08520"},"outbound":[],"paper":{"arxiv_id":"2309.08520","last_updated":"2023-09-15T16:29:27Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-10T14:43:47.936653Z","submitted_at":"2023-09-15T16:29:27Z","title":"Scaling Laws for Sparsely-Connected Foundation 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 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2309.08520."}