{"as_of":"2026-08-08T18:53:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:561ece3335c6ccb33b82cf81621fab989053a512c5aa0b0100fe68c008b1456c","coverage":[{"denominator":26,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":26,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-14T14:51:11.146058Z","state":"measured"},{"denominator":26,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":26,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2607.09885/citation-record","integrity":"/paper/2607.09885/integrity","json":"/paper/2607.09885/citation-record.json","paper":"/paper/2607.09885"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2311.16867","last_updated":"2023-11-29T19:45:10Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-11-28T15:12:47Z","title":"The Falcon Series of Open Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.16867","snapshot_observed_at":"2026-07-14T14:51:11.146058Z","title":"The Falcon series of open language models.arXiv preprint arXiv:2311.16867,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.09885","last_updated":"2026-07-10T18:19:47Z","snapshot_observed_at":"2026-08-04T18:45:04.409892Z","submitted_at":"2026-07-10T18:19:47Z","title":"Index SLM Technical Report","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-14T14:51:11.146058Z"},"links":{"cited_paper":"/paper/2311.16867","citing_paper":"/paper/2607.09885"},"observation_digest":"sha256:92826958d134e92f17a4ab633afc77bfd289632271f594e196f900a4b53186fa","observation_id":"4022fdde-37df-4792-b5fe-55e06204dd0e","resolution":{"observed_at":"2026-07-14T14:51:11.146058Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.16609","last_updated":"2023-09-28T17:07:49Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-09-28T17:07:49Z","title":"Qwen Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.16609","snapshot_observed_at":"2026-07-14T14:51:11.146058Z","title":"Qwen technical report.arXiv preprint arXiv:2309.16609,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.09885","last_updated":"2026-07-10T18:19:47Z","snapshot_observed_at":"2026-08-04T18:45:04.409892Z","submitted_at":"2026-07-10T18:19:47Z","title":"Index SLM Technical Report","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-14T14:51:11.146058Z"},"links":{"cited_paper":"/paper/2309.16609","citing_paper":"/paper/2607.09885"},"observation_digest":"sha256:65c7585f3aa3209790e3837cc6b86d23fa9f53f47aa7162f12f5cc61aa4cfa07","observation_id":"4e9dec7d-30ca-45bc-9aa2-f70c03d5940b","resolution":{"observed_at":"2026-07-14T14:51:11.146058Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.02954","last_updated":"2024-01-05T18:59:13Z","snapshot_observed_at":"2026-08-02T13:11:16.882565Z","submitted_at":"2024-01-05T18:59:13Z","title":"DeepSeek LLM: Scaling Open-Source Language Models with Longtermism","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.02954","snapshot_observed_at":"2026-07-14T14:51:11.146058Z","title":"DeepSeek LLM: Scaling open-source language models with longtermism.arXiv preprint arXiv:2401.02954,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.09885","last_updated":"2026-07-10T18:19:47Z","snapshot_observed_at":"2026-08-04T18:45:04.409892Z","submitted_at":"2026-07-10T18:19:47Z","title":"Index SLM Technical Report","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-14T14:51:11.146058Z"},"links":{"cited_paper":"/paper/2401.02954","citing_paper":"/paper/2607.09885"},"observation_digest":"sha256:a24e6f3493592211dc3d9b2fcfd3648a0adf987915392b954337b9334cb5ae43","observation_id":"4cf92130-045d-4a92-bc8c-7c46558e6573","resolution":{"observed_at":"2026-07-14T14:51:11.146058Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2107.03374","last_updated":"2021-07-14T17:16:02Z","snapshot_observed_at":"2026-08-08T11:58:24.516369Z","submitted_at":"2021-07-07T17:41:24Z","title":"Evaluating Large Language Models Trained on Code","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2107.03374","snapshot_observed_at":"2026-07-14T14:51:11.146058Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.09885","last_updated":"2026-07-10T18:19:47Z","snapshot_observed_at":"2026-08-04T18:45:04.409892Z","submitted_at":"2026-07-10T18:19:47Z","title":"Index SLM Technical Report","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-14T14:51:11.146058Z"},"links":{"cited_paper":"/paper/2107.03374","citing_paper":"/paper/2607.09885"},"observation_digest":"sha256:d9cf2b4dd4497240239b5efff2426171c4f0ef9f116cfec25a993aed3b196766","observation_id":"5aa333bd-88d2-4177-acec-bb5e95d4cb2c","resolution":{"observed_at":"2026-07-14T14:51:11.146058Z","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-07-06T02:11:23.670680Z","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-07-14T14:51:11.146058Z","title":"Think you have solved question answering? Try ARC, the AI2 reasoning challenge.arXiv preprint arXiv:1803.05457,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.09885","last_updated":"2026-07-10T18:19:47Z","snapshot_observed_at":"2026-08-04T18:45:04.409892Z","submitted_at":"2026-07-10T18:19:47Z","title":"Index SLM Technical Report","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-14T14:51:11.146058Z"},"links":{"cited_paper":"/paper/1803.05457","citing_paper":"/paper/2607.09885"},"observation_digest":"sha256:629651886d3dfe9c061d754a7557037b72573a2dfa82fcb0dd39f12f991eee12","observation_id":"32d29b11-aaf5-4acc-88b3-3b1582254c90","resolution":{"observed_at":"2026-07-14T14:51:11.146058Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2110.14168","last_updated":"2021-11-18T00:23:45Z","snapshot_observed_at":"2026-08-07T01:45:38.840969Z","submitted_at":"2021-10-27T04:49:45Z","title":"Training Verifiers to Solve Math Word Problems","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2110.14168","snapshot_observed_at":"2026-07-14T14:51:11.146058Z","title":"Training verifiers to solve math word problems.arXiv preprint arXiv:2110.14168,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.09885","last_updated":"2026-07-10T18:19:47Z","snapshot_observed_at":"2026-08-04T18:45:04.409892Z","submitted_at":"2026-07-10T18:19:47Z","title":"Index SLM Technical Report","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-14T14:51:11.146058Z"},"links":{"cited_paper":"/paper/2110.14168","citing_paper":"/paper/2607.09885"},"observation_digest":"sha256:55c9ec8357928e4a50a8a54189abd7c5b2834acb25a9f8d8d13c16faf3c74a02","observation_id":"5c4e9ba8-0bca-4e05-bbf6-18f2ee8776ef","resolution":{"observed_at":"2026-07-14T14:51:11.146058Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.11568","last_updated":"2023-09-20T18:12:56Z","snapshot_observed_at":"2026-07-06T16:21:25.401345Z","submitted_at":"2023-09-20T18:12:56Z","title":"BTLM-3B-8K: 7B Parameter Performance in a 3B Parameter Model","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.11568","snapshot_observed_at":"2026-07-14T14:51:11.146058Z","title":"BTLM-3B-8K: 7B parameter performance in a 3B parameter model.arXiv preprint arXiv:2309.11568,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.09885","last_updated":"2026-07-10T18:19:47Z","snapshot_observed_at":"2026-08-04T18:45:04.409892Z","submitted_at":"2026-07-10T18:19:47Z","title":"Index SLM Technical Report","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-14T14:51:11.146058Z"},"links":{"cited_paper":"/paper/2309.11568","citing_paper":"/paper/2607.09885"},"observation_digest":"sha256:04964ceaeb0f6d8df0c2af27c6ae142cd57faa366052b4e37cb1c2fb80506ee9","observation_id":"f152a3ee-d1ee-44dc-86e5-5f469daac534","resolution":{"observed_at":"2026-07-14T14:51:11.146058Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.08295","last_updated":"2024-04-16T12:52:47Z","snapshot_observed_at":"2026-08-03T03:29:01.959523Z","submitted_at":"2024-03-13T06:59:16Z","title":"Gemma: Open Models Based on Gemini Research and Technology","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.08295","snapshot_observed_at":"2026-07-14T14:51:11.146058Z","title":"Gemma: Open models based on Gemini research and technology.arXiv preprint arXiv:2403.08295,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.09885","last_updated":"2026-07-10T18:19:47Z","snapshot_observed_at":"2026-08-04T18:45:04.409892Z","submitted_at":"2026-07-10T18:19:47Z","title":"Index SLM Technical Report","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-14T14:51:11.146058Z"},"links":{"cited_paper":"/paper/2403.08295","citing_paper":"/paper/2607.09885"},"observation_digest":"sha256:e4bdd50dddf02eab27ca637b286a7ae80cb252d9babd09ddc87eaef1b9256ec6","observation_id":"5d793d8c-f9a8-45a9-b2be-3fdde127ca08","resolution":{"observed_at":"2026-07-14T14:51:11.146058Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2203.15556","last_updated":"2022-03-29T13:38:03Z","snapshot_observed_at":"2026-07-06T12:54:11.616335Z","submitted_at":"2022-03-29T13:38:03Z","title":"Training Compute-Optimal Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2203.15556","snapshot_observed_at":"2026-07-14T14:51:11.146058Z","title":"Training compute-optimal large lan- guage models.arXiv preprint arXiv:2203.15556,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.09885","last_updated":"2026-07-10T18:19:47Z","snapshot_observed_at":"2026-08-04T18:45:04.409892Z","submitted_at":"2026-07-10T18:19:47Z","title":"Index SLM Technical Report","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-14T14:51:11.146058Z"},"links":{"cited_paper":"/paper/2203.15556","citing_paper":"/paper/2607.09885"},"observation_digest":"sha256:6804ecb04c4b07b1cc4a45ee71534b1f9980d2ff18f6cb3d5fb13b30164ee5d7","observation_id":"0ca746e2-4f70-4dbf-bd64-cc52500946b7","resolution":{"observed_at":"2026-07-14T14:51:11.146058Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.06395","last_updated":"2024-06-03T08:54:38Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-04-09T15:36:50Z","title":"MiniCPM: Unveiling the Potential of Small Language Models with Scalable Training Strategies","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.06395","snapshot_observed_at":"2026-07-14T14:51:11.146058Z","title":"MiniCPM: Unveiling the potential of small language models with scalable training strate- gies.arXiv preprint arXiv:2404.06395,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.09885","last_updated":"2026-07-10T18:19:47Z","snapshot_observed_at":"2026-08-04T18:45:04.409892Z","submitted_at":"2026-07-10T18:19:47Z","title":"Index SLM Technical Report","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-14T14:51:11.146058Z"},"links":{"cited_paper":"/paper/2404.06395","citing_paper":"/paper/2607.09885"},"observation_digest":"sha256:0b7ee656ae62d2601267ae1e3d77240be4d8c86a4b41984ff260eaa8d02f18e9","observation_id":"77d58b65-776f-4a04-be0b-c8a71e7fd0c1","resolution":{"observed_at":"2026-07-14T14:51:11.146058Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.06825","last_updated":"2023-10-10T17:54:58Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-10-10T17:54:58Z","title":"Mistral 7B","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.06825","snapshot_observed_at":"2026-07-14T14:51:11.146058Z","title":"Mistral 7B.arXiv preprint arXiv:2310.06825,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.09885","last_updated":"2026-07-10T18:19:47Z","snapshot_observed_at":"2026-08-04T18:45:04.409892Z","submitted_at":"2026-07-10T18:19:47Z","title":"Index SLM Technical Report","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-14T14:51:11.146058Z"},"links":{"cited_paper":"/paper/2310.06825","citing_paper":"/paper/2607.09885"},"observation_digest":"sha256:381c50adecdd6cba6a70f03c9efebb42a32295a45cac463eff28914851e73025","observation_id":"8e29ca51-843c-4c00-a7fb-32a18a13b7ff","resolution":{"observed_at":"2026-07-14T14:51:11.146058Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2001.08361","last_updated":"2020-01-23T03:59:20Z","snapshot_observed_at":"2026-07-06T08:52:12.656082Z","submitted_at":"2020-01-23T03:59:20Z","title":"Scaling Laws for Neural Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2001.08361","snapshot_observed_at":"2026-07-14T14:51:11.146058Z","title":"Scaling laws for neural language models.arXiv preprint arXiv:2001.08361,","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2607.09885","last_updated":"2026-07-10T18:19:47Z","snapshot_observed_at":"2026-08-04T18:45:04.409892Z","submitted_at":"2026-07-10T18:19:47Z","title":"Index SLM Technical Report","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-14T14:51:11.146058Z"},"links":{"cited_paper":"/paper/2001.08361","citing_paper":"/paper/2607.09885"},"observation_digest":"sha256:189c1f48fe7f285c311ef39526a7b7eda8d8daf7d290a56b52af4eca8dca4ea7","observation_id":"8dd7dd39-c3f9-45cd-bd63-c4804b4c75bb","resolution":{"observed_at":"2026-07-14T14:51:11.146058Z","resolver_source":null,"status":"unresolved"},"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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T14:51:11.146058Z","title":"SentencePiece: A simple and language independent subword tokenizer and detokenizer for neural text processing","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.09885","last_updated":"2026-07-10T18:19:47Z","snapshot_observed_at":"2026-08-04T18:45:04.409892Z","submitted_at":"2026-07-10T18:19:47Z","title":"Index SLM Technical Report","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-07-14T14:51:11.146058Z"},"links":{"citing_paper":"/paper/2607.09885"},"observation_digest":"sha256:a9f652ae57dd91438ea4ecd0913bf559a73a87bbca0ee579940f41ecd0d6c94f","observation_id":"61350df4-de69-4bc1-95f5-53ff1ca91dd2","resolution":{"observed_at":"2026-07-14T14:51:11.146058Z","resolver_source":null,"status":"unresolved"},"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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T14:51:11.146058Z","title":"All Rights Reserved.13 Index Katherine Lee, Daphne Ippolito, Andrew Nystrom, Chiyuan Zhang, Douglas Eck, Chris Callison-Burch, and Nicholas Carlini","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.09885","last_updated":"2026-07-10T18:19:47Z","snapshot_observed_at":"2026-08-04T18:45:04.409892Z","submitted_at":"2026-07-10T18:19:47Z","title":"Index SLM Technical Report","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-07-14T14:51:11.146058Z"},"links":{"citing_paper":"/paper/2607.09885"},"observation_digest":"sha256:bbaf870e60a82459570ec2f0a510d56209449668b87f61b5b0a5a7e69d20e864","observation_id":"03299dd3-a9f3-4e7f-8735-e646c11298de","resolution":{"observed_at":"2026-07-14T14:51:11.146058Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2306.09212","last_updated":"2024-01-17T19:09:57Z","snapshot_observed_at":"2026-08-04T18:52:19.083847Z","submitted_at":"2023-06-15T15:49:51Z","title":"CMMLU: Measuring massive multitask language understanding in Chinese","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.09212","snapshot_observed_at":"2026-07-14T14:51:11.146058Z","title":"CMMLU: Measuring massive multitask language understanding in Chinese.arXiv preprint arXiv:2306.09212,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.09885","last_updated":"2026-07-10T18:19:47Z","snapshot_observed_at":"2026-08-04T18:45:04.409892Z","submitted_at":"2026-07-10T18:19:47Z","title":"Index SLM Technical Report","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-07-14T14:51:11.146058Z"},"links":{"cited_paper":"/paper/2306.09212","citing_paper":"/paper/2607.09885"},"observation_digest":"sha256:4adaf539f9282e482edfe2bd6cf21bb384b981bf5f8262a144c505ee68e4ab11","observation_id":"61e578ea-85f5-4cf6-82d6-9f66e45770f5","resolution":{"observed_at":"2026-07-14T14:51:11.146058Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2312.06550","last_updated":"2023-12-11T17:39:00Z","snapshot_observed_at":"2026-07-06T16:59:56.350207Z","submitted_at":"2023-12-11T17:39:00Z","title":"LLM360: Towards Fully Transparent Open-Source LLMs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.06550","snapshot_observed_at":"2026-07-14T14:51:11.146058Z","title":"LLM360: Towards fully transparent open-source LLMs.arXiv preprint arXiv:2312.06550,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.09885","last_updated":"2026-07-10T18:19:47Z","snapshot_observed_at":"2026-08-04T18:45:04.409892Z","submitted_at":"2026-07-10T18:19:47Z","title":"Index SLM Technical Report","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-14T14:51:11.146058Z"},"links":{"cited_paper":"/paper/2312.06550","citing_paper":"/paper/2607.09885"},"observation_digest":"sha256:3e07678c0dd4a98d2875500675488dbb646ad72fd5f9f99ac8cdef65ecfbdb57","observation_id":"8ab404bf-10e9-4a7a-9640-19e398dbad67","resolution":{"observed_at":"2026-07-14T14:51:11.146058Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.08774","last_updated":"2024-03-04T06:01:33Z","snapshot_observed_at":"2026-08-07T07:30:12.213965Z","submitted_at":"2023-03-15T17:15:04Z","title":"GPT-4 Technical Report","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.08774","snapshot_observed_at":"2026-07-14T14:51:11.146058Z","title":"GPT-4 technical report.arXiv preprint arXiv:2303.08774,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.09885","last_updated":"2026-07-10T18:19:47Z","snapshot_observed_at":"2026-08-04T18:45:04.409892Z","submitted_at":"2026-07-10T18:19:47Z","title":"Index SLM Technical Report","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-07-14T14:51:11.146058Z"},"links":{"cited_paper":"/paper/2303.08774","citing_paper":"/paper/2607.09885"},"observation_digest":"sha256:d106599535cf6c7d3db836aa83c82661c494b59c7b0281d4e77d1b9cb028f190","observation_id":"7a8ba575-98c8-4654-ae0f-a5eb603c4293","resolution":{"observed_at":"2026-07-14T14:51:11.146058Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2002.05202","last_updated":"2020-02-12T19:57:13Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2020-02-12T19:57:13Z","title":"GLU Variants Improve Transformer","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2002.05202","snapshot_observed_at":"2026-07-14T14:51:11.146058Z","title":"GLU variants improve transformer.arXiv preprint arXiv:2002.05202,","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2607.09885","last_updated":"2026-07-10T18:19:47Z","snapshot_observed_at":"2026-08-04T18:45:04.409892Z","submitted_at":"2026-07-10T18:19:47Z","title":"Index SLM Technical Report","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-07-14T14:51:11.146058Z"},"links":{"cited_paper":"/paper/2002.05202","citing_paper":"/paper/2607.09885"},"observation_digest":"sha256:bb13483f02d25c7df541e882af5257706f4673b7bf21a3e9ce5c82c52dcf002e","observation_id":"df3da238-c208-4b6b-a18d-0eda034f8679","resolution":{"observed_at":"2026-07-14T14:51:11.146058Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2302.13971","last_updated":"2023-02-27T17:11:15Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-02-27T17:11:15Z","title":"LLaMA: Open and Efficient Foundation Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.13971","snapshot_observed_at":"2026-07-14T14:51:11.146058Z","title":"LLaMA: Open and efficient foundation language models.arXiv preprint arXiv:2302.13971, 2023a","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.09885","last_updated":"2026-07-10T18:19:47Z","snapshot_observed_at":"2026-08-04T18:45:04.409892Z","submitted_at":"2026-07-10T18:19:47Z","title":"Index SLM Technical Report","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-07-14T14:51:11.146058Z"},"links":{"cited_paper":"/paper/2302.13971","citing_paper":"/paper/2607.09885"},"observation_digest":"sha256:48f0778a628ab7d6ce74bf9a1a27fac7a6c66037a5d3bac31296c610b8d1ca60","observation_id":"bff585f6-9849-426c-9d8b-2e347442979b","resolution":{"observed_at":"2026-07-14T14:51:11.146058Z","resolver_source":null,"status":"unresolved"},"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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T14:51:11.146058Z","title":"All Rights Reserved.14 Index Ashish Vaswani, Noam Shazeer, Niki Parmar, Jakob Uszkoreit, Llion Jones, Aidan N Gomez, Łukasz Kaiser, and Illia Polosukhin","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.09885","last_updated":"2026-07-10T18:19:47Z","snapshot_observed_at":"2026-08-04T18:45:04.409892Z","submitted_at":"2026-07-10T18:19:47Z","title":"Index SLM Technical Report","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-07-14T14:51:11.146058Z"},"links":{"citing_paper":"/paper/2607.09885"},"observation_digest":"sha256:c6021a545e4a3c436cdf78f4ef262c191d89bef00d2d3d87a362a8121c59dddb","observation_id":"d70e9bea-134e-417a-8a4d-3732eae59ae8","resolution":{"observed_at":"2026-07-14T14:51:11.146058Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.19341","last_updated":"2023-10-30T08:31:47Z","snapshot_observed_at":"2026-08-06T06:09:43.812715Z","submitted_at":"2023-10-30T08:31:47Z","title":"Skywork: A More Open Bilingual Foundation Model","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.19341","snapshot_observed_at":"2026-07-14T14:51:11.146058Z","title":"Skywork: A more open bilingual foundation model.arXiv preprint arXiv:2310.19341,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.09885","last_updated":"2026-07-10T18:19:47Z","snapshot_observed_at":"2026-08-04T18:45:04.409892Z","submitted_at":"2026-07-10T18:19:47Z","title":"Index SLM Technical Report","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-07-14T14:51:11.146058Z"},"links":{"cited_paper":"/paper/2310.19341","citing_paper":"/paper/2607.09885"},"observation_digest":"sha256:a28f6ad4eb7362664c814141330395e41376f24f232e4057b7a4ec6dfbe7762b","observation_id":"d6307b6e-4d6d-4b5b-a74a-a4316946c20f","resolution":{"observed_at":"2026-07-14T14:51:11.146058Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.10305","last_updated":"2025-04-17T08:34:42Z","snapshot_observed_at":"2026-08-06T06:52:14.558389Z","submitted_at":"2023-09-19T04:13:22Z","title":"Baichuan 2: Open Large-scale Language Models","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.10305","snapshot_observed_at":"2026-07-14T14:51:11.146058Z","title":"Baichuan 2: Open large-scale language models.arXiv preprint arXiv:2309.10305,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.09885","last_updated":"2026-07-10T18:19:47Z","snapshot_observed_at":"2026-08-04T18:45:04.409892Z","submitted_at":"2026-07-10T18:19:47Z","title":"Index SLM Technical Report","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-07-14T14:51:11.146058Z"},"links":{"cited_paper":"/paper/2309.10305","citing_paper":"/paper/2607.09885"},"observation_digest":"sha256:a81aff22ab6a3803224a20a647249c7ea7450ed52beb01ba3eb64e6af54a04a6","observation_id":"c1c5ecbb-a86a-4e07-a8eb-59becdd51cf5","resolution":{"observed_at":"2026-07-14T14:51:11.146058Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.10671","last_updated":"2024-09-10T13:25:53Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-07-15T12:35:42Z","title":"Qwen2 Technical Report","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.10671","snapshot_observed_at":"2026-07-14T14:51:11.146058Z","title":"Qwen2 technical report.arXiv preprint arXiv:2407.10671,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.09885","last_updated":"2026-07-10T18:19:47Z","snapshot_observed_at":"2026-08-04T18:45:04.409892Z","submitted_at":"2026-07-10T18:19:47Z","title":"Index SLM Technical Report","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-07-14T14:51:11.146058Z"},"links":{"cited_paper":"/paper/2407.10671","citing_paper":"/paper/2607.09885"},"observation_digest":"sha256:29c73dab2fa55430a8e640bc94e142255c8c3d81ff98b65f337a0488be3fefb0","observation_id":"26942b32-98f0-4877-ae1c-b96549bf6eb8","resolution":{"observed_at":"2026-07-14T14:51:11.146058Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2203.03466","last_updated":"2022-03-28T08:12:14Z","snapshot_observed_at":"2026-08-07T09:04:57.100575Z","submitted_at":"2022-03-07T15:37:35Z","title":"Tensor Programs V: Tuning Large Neural Networks via Zero-Shot Hyperparameter Transfer","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2203.03466","snapshot_observed_at":"2026-07-14T14:51:11.146058Z","title":"Tensor programs V: Tuning large neural networks via zero-shot hyperparam- eter transfer.arXiv preprint arXiv:2203.03466,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.09885","last_updated":"2026-07-10T18:19:47Z","snapshot_observed_at":"2026-08-04T18:45:04.409892Z","submitted_at":"2026-07-10T18:19:47Z","title":"Index SLM Technical Report","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-07-14T14:51:11.146058Z"},"links":{"cited_paper":"/paper/2203.03466","citing_paper":"/paper/2607.09885"},"observation_digest":"sha256:ccf2b1251543da62a04f7510efd8961057781326702f21e1d316c4e1c03d6c1a","observation_id":"6143a722-f2b9-467f-bd1d-61bb7bc87469","resolution":{"observed_at":"2026-07-14T14:51:11.146058Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2311.16832","last_updated":"2023-11-28T14:49:23Z","snapshot_observed_at":"2026-07-06T16:53:51.485946Z","submitted_at":"2023-11-28T14:49:23Z","title":"CharacterGLM: Customizing Chinese Conversational AI Characters with Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.16832","snapshot_observed_at":"2026-07-14T14:51:11.146058Z","title":"CharacterGLM: Customizing Chinese conversational AI characters with large language models.arXiv preprint arXiv:2311.16832,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.09885","last_updated":"2026-07-10T18:19:47Z","snapshot_observed_at":"2026-08-04T18:45:04.409892Z","submitted_at":"2026-07-10T18:19:47Z","title":"Index SLM Technical Report","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-07-14T14:51:11.146058Z"},"links":{"cited_paper":"/paper/2311.16832","citing_paper":"/paper/2607.09885"},"observation_digest":"sha256:bd3a9a8e62c0b6aa2d3b7d7c4e4c6ef38e785752dd058b49c2faa30578e2d969","observation_id":"3b807066-a299-4119-bc63-eb2ed3765526","resolution":{"observed_at":"2026-07-14T14:51:11.146058Z","resolver_source":null,"status":"unresolved"},"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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T14:51:11.146058Z","title":"Fig- ure 9 shows the released role-playing interface, through which users instantiate a custom persona from a small uploaded dialogue corpus","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.09885","last_updated":"2026-07-10T18:19:47Z","snapshot_observed_at":"2026-08-04T18:45:04.409892Z","submitted_at":"2026-07-10T18:19:47Z","title":"Index SLM Technical Report","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-07-14T14:51:11.146058Z"},"links":{"citing_paper":"/paper/2607.09885"},"observation_digest":"sha256:5ee90feef185f94c952353bcede92ac810e6c3e9e357444b1d1e16e7e8c45a78","observation_id":"9eb96a33-19cd-440c-9fdc-d6a6b678e9c6","resolution":{"observed_at":"2026-07-14T14:51:11.146058Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.09885","last_updated":"2026-07-10T18:19:47Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-04T18:45:04.409892Z","submitted_at":"2026-07-10T18:19:47Z","title":"Index SLM Technical Report"},"reference_resolution":{"displayed":26,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":26,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":26},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 26 of 26 outbound references and 0 inbound Pith citation observations for arXiv:2607.09885."}