{"as_of":"2026-08-14T21:44:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:91f4a061ad4aeb5ea245e92e7ea13a77094d130bf1f676260bbd0d5a362854c9","coverage":[{"denominator":5,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":5,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T21:47:23.819767Z","state":"measured"},{"denominator":7,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":7,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T13:52:06.128962Z","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-16T22:03:36.056391Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2508.08011","last_updated":"2025-08-11T14:15:33Z","snapshot_observed_at":"2026-08-14T20:40:59.594744Z","submitted_at":"2025-08-11T14:15:33Z","title":"Progressive Depth Up-scaling via Optimal Transport","version":1},"cited_work":{"arxiv_id":"2508.08011","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2508.08011","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Progressive depth up-scaling via optimal transport","venue":null,"work_id":"824c3dd6-1b9c-4457-8a02-d527f6d3c321","year":null},"citing_paper":{"arxiv_id":"2512.13751","last_updated":"2026-05-09T08:34:38Z","snapshot_observed_at":"2026-08-11T20:36:34.223497Z","submitted_at":"2025-12-15T05:50:45Z","title":"MIDUS: Memory-Infused Depth Up-Scaling","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-16T22:02:42.297041Z"},"links":{"cited_paper":"/paper/2508.08011","citing_paper":"/paper/2512.13751"},"observation_digest":"sha256:57ea164250e652f2bd29a38ed482aaf532772e09cf0b85d05f7400218ac1ff83","observation_id":"f24fcd5f-35fa-4a79-97a3-5dc398e9da13","resolution":{"observed_at":"2026-05-16T22:03:36.058583Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2508.08011","last_updated":"2025-08-11T14:15:33Z","snapshot_observed_at":"2026-08-14T20:40:59.594744Z","submitted_at":"2025-08-11T14:15:33Z","title":"Progressive Depth Up-scaling via Optimal Transport","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2508.08011","snapshot_observed_at":"2026-08-14T13:52:06.128962Z","title":"Progressive depth up-scaling via optimal transport.arXiv preprint arXiv:2508.08011,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.13317","last_updated":"2026-08-13T14:40:59Z","snapshot_observed_at":"2026-08-14T21:19:07.740406Z","submitted_at":"2026-08-13T14:40:59Z","title":"StateBridge: Training-free Hidden-state Alignment for Latent Communication in LLM Multi-Agent Systems","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T13:52:06.128962Z"},"links":{"cited_paper":"/paper/2508.08011","citing_paper":"/paper/2608.13317"},"observation_digest":"sha256:ceae8b967eaeb23bcb2f06e816e2974a7021b5d09c76700a719195857ff95b76","observation_id":"adb721f3-7838-4d0b-b54b-cb5e3b9e4a11","resolution":{"observed_at":"2026-08-14T13:52:06.128962Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2508.08011/citation-record","integrity":"/paper/2508.08011/integrity","json":"/paper/2508.08011/citation-record.json","paper":"/paper/2508.08011"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2504.06011","last_updated":"2025-04-08T13:16:54Z","snapshot_observed_at":"2026-08-10T22:32:13.310903Z","submitted_at":"2025-04-08T13:16:54Z","title":"Llama-3-Nanda-10B-Chat: An Open Generative Large Language Model for Hindi","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.06011","snapshot_observed_at":"2026-08-05T21:47:23.570483Z","title":"In International Conference on Learning Repre- sentations","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2508.08011","last_updated":"2025-08-11T14:15:33Z","snapshot_observed_at":"2026-08-14T20:40:59.594744Z","submitted_at":"2025-08-11T14:15:33Z","title":"Progressive Depth Up-scaling via Optimal Transport","version":1},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-05T21:47:23.570483Z"},"links":{"cited_paper":"/paper/2504.06011","citing_paper":"/paper/2508.08011"},"observation_digest":"sha256:1b6941cfa94f6d2af59832c82a21b267255ee01817340f0abed0080be86554c1","observation_id":"6dc6ed43-6b12-4690-ae43-df7f0f8bfae5","resolution":{"observed_at":"2026-08-05T21:47:23.570483Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.21783","last_updated":"2024-11-23T23:27:33Z","snapshot_observed_at":"2026-08-13T17:20:44.002518Z","submitted_at":"2024-07-31T17:54:27Z","title":"The Llama 3 Herd of Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.21783","snapshot_observed_at":"2026-08-05T21:47:23.693492Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.08011","last_updated":"2025-08-11T14:15:33Z","snapshot_observed_at":"2026-08-14T20:40:59.594744Z","submitted_at":"2025-08-11T14:15:33Z","title":"Progressive Depth Up-scaling via Optimal Transport","version":1},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-05T21:47:23.693492Z"},"links":{"cited_paper":"/paper/2407.21783","citing_paper":"/paper/2508.08011"},"observation_digest":"sha256:f31fc079adcacacafb35ae170951352f47660360e69bd42b1a5a12bf76a535a3","observation_id":"65ba179b-6f77-4264-9e2d-2a3ea654519a","resolution":{"observed_at":"2026-08-05T21:47:23.693492Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T21:47:23.934390Z","title":null,"venue":null,"work_id":"e1b55787-37a3-4a2f-a080-0e269045b8b3","year":null},"citing_paper":{"arxiv_id":"2508.08011","last_updated":"2025-08-11T14:15:33Z","snapshot_observed_at":"2026-08-14T20:40:59.594744Z","submitted_at":"2025-08-11T14:15:33Z","title":"Progressive Depth Up-scaling via Optimal Transport","version":1},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-05T21:47:23.737817Z"},"links":{"citing_paper":"/paper/2508.08011"},"observation_digest":"sha256:72d6e0a2e778b9a4f4044632d7cf71d7905ecc2caa89a9fec44cc29b45880860","observation_id":"a209826c-7a5a-4844-8650-ae2af4a1eb5f","resolution":{"observed_at":"2026-08-05T21:47:23.970538Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2007.05558","last_updated":"2022-07-27T17:26:18Z","snapshot_observed_at":"2026-08-14T20:40:27.981488Z","submitted_at":"2020-07-10T18:26:17Z","title":"The Computational Limits of Deep Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2007.05558","snapshot_observed_at":"2026-08-05T21:47:23.819767Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2508.08011","last_updated":"2025-08-11T14:15:33Z","snapshot_observed_at":"2026-08-14T20:40:59.594744Z","submitted_at":"2025-08-11T14:15:33Z","title":"Progressive Depth Up-scaling via Optimal Transport","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-05T21:47:23.819767Z"},"links":{"cited_paper":"/paper/2007.05558","citing_paper":"/paper/2508.08011"},"observation_digest":"sha256:2981617be3419e4afe36f6395eb9311afab1ad4f9fba5748a7b53ed400d0535a","observation_id":"69aba07d-1ebd-47ff-bc73-3ab3df3f82e4","resolution":{"observed_at":"2026-08-05T21:47:23.819767Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1803.05457","last_updated":"2018-03-14T18:04:21Z","snapshot_observed_at":"2026-08-14T19:36:07.505691Z","submitted_at":"2018-03-14T18:04:21Z","title":"Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challenge","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1803.05457","snapshot_observed_at":"2026-08-05T21:47:23.626269Z","title":"Clark, P.; Cowhey, I.; Etzioni, O.; Khot, T.; Sabharwal, A.; Schoenick, C.; and Tafjord, O","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2508.08011","last_updated":"2025-08-11T14:15:33Z","snapshot_observed_at":"2026-08-14T20:40:59.594744Z","submitted_at":"2025-08-11T14:15:33Z","title":"Progressive Depth Up-scaling via Optimal Transport","version":1},"reference_index":2936,"source":"pdf_text","source_observed_at":"2026-08-05T21:47:23.626269Z"},"links":{"cited_paper":"/paper/1803.05457","citing_paper":"/paper/2508.08011"},"observation_digest":"sha256:8374ce1f970f787e0c1fc11d1dcc063aacdabc032d3d7233ae2d4c8dbab7ecc7","observation_id":"4c909d5c-ca11-4ac9-a960-b88595d1d454","resolution":{"observed_at":"2026-08-05T21:47:23.626269Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2508.08011","last_updated":"2025-08-11T14:15:33Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-14T20:40:59.594744Z","submitted_at":"2025-08-11T14:15:33Z","title":"Progressive Depth Up-scaling via Optimal Transport"},"reference_resolution":{"displayed":5,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":4,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":5},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 5 of 5 outbound references and 2 inbound Pith citation observations for arXiv:2508.08011."}