{"as_of":"2026-08-16T08:16:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e18cf8be9c4fdf3376b52bef7a27ad6265367563860597d6dc88980a0a94644e","coverage":[{"denominator":80,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":80,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T23:12:10.257064Z","state":"measured"},{"denominator":80,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":80,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+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/2608.09119/citation-record","integrity":"/paper/2608.09119/integrity","json":"/paper/2608.09119/citation-record.json","paper":"/paper/2608.09119"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T23:12:09.825707Z","title":"Open-swe-traces: Advancing dual-mode multilingual distillation for software engineering agents.arXiv preprint arXiv:2606.16038, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.09119","last_updated":"2026-08-10T04:53:05Z","snapshot_observed_at":"2026-08-16T00:01:56.727123Z","submitted_at":"2026-08-10T04:53:05Z","title":"Motif 3: Technical Report","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-11T23:12:09.825707Z"},"links":{"citing_paper":"/paper/2608.09119"},"observation_digest":"sha256:62ade1cbfaaa8b882ed04f539b046361f00b0ab6189b90d705335b70480ce17a","observation_id":"96f7824b-af72-45ca-94c4-b066ab27a3ba","resolution":{"observed_at":"2026-08-11T23:12:09.825707Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.13245","last_updated":"2023-12-23T17:55:11Z","snapshot_observed_at":"2026-08-15T06:28:09.529747Z","submitted_at":"2023-05-22T17:16:38Z","title":"GQA: Training Generalized Multi-Query Transformer Models from Multi-Head Checkpoints","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.13245","snapshot_observed_at":"2026-08-11T23:12:09.831671Z","title":"GQA: Training generalized multi-query transformer models from multi-head checkpoints","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.09119","last_updated":"2026-08-10T04:53:05Z","snapshot_observed_at":"2026-08-16T00:01:56.727123Z","submitted_at":"2026-08-10T04:53:05Z","title":"Motif 3: Technical Report","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-11T23:12:09.831671Z"},"links":{"cited_paper":"/paper/2305.13245","citing_paper":"/paper/2608.09119"},"observation_digest":"sha256:7a86390c3c93e8dc44a7566a71872f20060a47805cac99c085a2bdb7d27f5603","observation_id":"352dba50-6749-42e0-9915-6d0e5411b031","resolution":{"observed_at":"2026-08-11T23:12:09.831671Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T23:12:12.721050Z","title":"Artificial analysis long context reasoning benchmark (AA-LCR)","venue":null,"work_id":"d1070528-4573-4a35-898f-68a5065b018e","year":2025},"citing_paper":{"arxiv_id":"2608.09119","last_updated":"2026-08-10T04:53:05Z","snapshot_observed_at":"2026-08-16T00:01:56.727123Z","submitted_at":"2026-08-10T04:53:05Z","title":"Motif 3: Technical Report","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-11T23:12:09.837121Z"},"links":{"citing_paper":"/paper/2608.09119"},"observation_digest":"sha256:222ed39a8678430864695c8e11b5c849ed8989a26f1b86bda794fe6de135c0ad","observation_id":"841138b4-2724-4e69-8baf-5a5130e03212","resolution":{"observed_at":"2026-08-11T23:12:12.727269Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T23:12:12.699806Z","title":"GDPval-AA v2 leaderboard","venue":null,"work_id":"2f32d6e1-a200-45c1-9483-839b725edfbb","year":2026},"citing_paper":{"arxiv_id":"2608.09119","last_updated":"2026-08-10T04:53:05Z","snapshot_observed_at":"2026-08-16T00:01:56.727123Z","submitted_at":"2026-08-10T04:53:05Z","title":"Motif 3: Technical Report","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-11T23:12:09.842271Z"},"links":{"citing_paper":"/paper/2608.09119"},"observation_digest":"sha256:e0fb34809ae9fb278ae770c0b24eff1b25a28eab5b436a6c966bd28cc2c588ea","observation_id":"40aa0b26-a862-4a1c-a28d-1b757effdcea","resolution":{"observed_at":"2026-08-11T23:12:12.706703Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T23:12:12.681065Z","title":"ITBench-AA benchmark leaderboard","venue":null,"work_id":"3e21e186-ccc1-4504-9b53-daa689af98b4","year":2026},"citing_paper":{"arxiv_id":"2608.09119","last_updated":"2026-08-10T04:53:05Z","snapshot_observed_at":"2026-08-16T00:01:56.727123Z","submitted_at":"2026-08-10T04:53:05Z","title":"Motif 3: Technical Report","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-11T23:12:09.847341Z"},"links":{"citing_paper":"/paper/2608.09119"},"observation_digest":"sha256:1da7a5775fe71a9fe41fcb201e2d00f198c955de2c11fa75877b073611d34552","observation_id":"b6625f1d-cf36-4563-9c2b-fc35cddbc030","resolution":{"observed_at":"2026-08-11T23:12:12.686022Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T23:12:12.664023Z","title":"Online benchmark and leaderboard, 2026","venue":null,"work_id":"14244660-df7d-4364-a8eb-56f090e0bf46","year":2026},"citing_paper":{"arxiv_id":"2608.09119","last_updated":"2026-08-10T04:53:05Z","snapshot_observed_at":"2026-08-16T00:01:56.727123Z","submitted_at":"2026-08-10T04:53:05Z","title":"Motif 3: Technical Report","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-11T23:12:09.852533Z"},"links":{"citing_paper":"/paper/2608.09119"},"observation_digest":"sha256:e1c5a3f6c607bd4db68843b3e8673215abfe92a0dd1312e8a5db7c3e97f91791","observation_id":"fa898f5c-a7e0-46f9-9761-2f37619f2734","resolution":{"observed_at":"2026-08-11T23:12:12.669642Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2108.07732","last_updated":"2021-08-16T03:57:30Z","snapshot_observed_at":"2026-08-15T17:40:38.050939Z","submitted_at":"2021-08-16T03:57:30Z","title":"Program Synthesis with Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2108.07732","snapshot_observed_at":"2026-08-11T23:12:09.857957Z","title":"Program synthesis with large language models.arXiv preprint arXiv:2108.07732, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2608.09119","last_updated":"2026-08-10T04:53:05Z","snapshot_observed_at":"2026-08-16T00:01:56.727123Z","submitted_at":"2026-08-10T04:53:05Z","title":"Motif 3: Technical Report","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-11T23:12:09.857957Z"},"links":{"cited_paper":"/paper/2108.07732","citing_paper":"/paper/2608.09119"},"observation_digest":"sha256:e8894318dbab41e48ab03f6d3656d365c844cbc2b7183652b678bd3e2f131a38","observation_id":"5185f0e5-841c-4aa7-b863-672c442b734a","resolution":{"observed_at":"2026-08-11T23:12:09.857957Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.07982","last_updated":"2025-06-09T17:52:18Z","snapshot_observed_at":"2026-08-14T06:34:01.114459Z","submitted_at":"2025-06-09T17:52:18Z","title":"$\\tau^2$-Bench: Evaluating Conversational Agents in a Dual-Control Environment","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.07982","snapshot_observed_at":"2026-08-11T23:12:09.863007Z","title":"τ2-bench: Evaluating conversational agents in a dual-control environment.arXiv preprint arXiv:2506.07982, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.09119","last_updated":"2026-08-10T04:53:05Z","snapshot_observed_at":"2026-08-16T00:01:56.727123Z","submitted_at":"2026-08-10T04:53:05Z","title":"Motif 3: Technical Report","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-11T23:12:09.863007Z"},"links":{"cited_paper":"/paper/2506.07982","citing_paper":"/paper/2608.09119"},"observation_digest":"sha256:e1ed8d7571ec62f647a17140670f56283b1fdb52159f9eda90aafc4822c7ae09","observation_id":"6f0ef21b-96ac-4424-ab24-8974ed0a099e","resolution":{"observed_at":"2026-08-11T23:12:09.863007Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T23:12:12.645413Z","title":"PIQA: Reasoning about physical commonsense in natural language.Proceedings of the AAAI Conference on Artificial Intelligence, 2020","venue":null,"work_id":"e412eb30-364f-4d89-8916-ce0aa801e396","year":2020},"citing_paper":{"arxiv_id":"2608.09119","last_updated":"2026-08-10T04:53:05Z","snapshot_observed_at":"2026-08-16T00:01:56.727123Z","submitted_at":"2026-08-10T04:53:05Z","title":"Motif 3: Technical Report","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-11T23:12:09.868468Z"},"links":{"citing_paper":"/paper/2608.09119"},"observation_digest":"sha256:f115a67a3043cddd35717f0a5e986c4c1175c6f92b1bf10e4c9bbf570a7c7dad","observation_id":"e50f4243-4533-4305-aadb-db1254c99409","resolution":{"observed_at":"2026-08-11T23:12:12.651150Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2311.09431","last_updated":"2023-11-15T23:01:02Z","snapshot_observed_at":"2026-08-13T22:53:37.044169Z","submitted_at":"2023-11-15T23:01:02Z","title":"Striped Attention: Faster Ring Attention for Causal Transformers","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.09431","snapshot_observed_at":"2026-08-11T23:12:09.873268Z","title":"Striped attention: Faster ring attention for causal transformers.arXiv preprint arXiv:2311.09431, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.09119","last_updated":"2026-08-10T04:53:05Z","snapshot_observed_at":"2026-08-16T00:01:56.727123Z","submitted_at":"2026-08-10T04:53:05Z","title":"Motif 3: Technical Report","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-11T23:12:09.873268Z"},"links":{"cited_paper":"/paper/2311.09431","citing_paper":"/paper/2608.09119"},"observation_digest":"sha256:833dfa04406d278fc3cadf6c2c6b8c85e3df9ea4b75644aa26d296c76a258630","observation_id":"199e88d6-ca7d-46ff-9779-2cd69ff64e3f","resolution":{"observed_at":"2026-08-11T23:12:09.873268Z","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-08-11T23:12:09.879247Z","title":"Evaluating large language models trained on code.arXiv preprint arXiv:2107.03374, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2608.09119","last_updated":"2026-08-10T04:53:05Z","snapshot_observed_at":"2026-08-16T00:01:56.727123Z","submitted_at":"2026-08-10T04:53:05Z","title":"Motif 3: Technical Report","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-11T23:12:09.879247Z"},"links":{"cited_paper":"/paper/2107.03374","citing_paper":"/paper/2608.09119"},"observation_digest":"sha256:fc11129ef01fdc2a3a95eb54bcc837798873a8f1556a71c6def9e3ceaba994d9","observation_id":"58dd115d-3f9b-4094-9d29-0a3d1c046c96","resolution":{"observed_at":"2026-08-11T23:12:09.879247Z","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-11T23:12:09.884723Z","title":"Think you have solved question answering? try ARC, the AI2 reasoning challenge","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2608.09119","last_updated":"2026-08-10T04:53:05Z","snapshot_observed_at":"2026-08-16T00:01:56.727123Z","submitted_at":"2026-08-10T04:53:05Z","title":"Motif 3: Technical Report","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-11T23:12:09.884723Z"},"links":{"cited_paper":"/paper/1803.05457","citing_paper":"/paper/2608.09119"},"observation_digest":"sha256:f102fa19c416a511c68c17c83239cd8b3d6608a1f56641475931914f43543219","observation_id":"a00acdfe-bf4a-4e3e-a746-186b50672570","resolution":{"observed_at":"2026-08-11T23:12:09.884723Z","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-14T02:43:01.480086Z","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-08-11T23:12:09.890228Z","title":"Training verifiers to solve math word problems.arXiv preprint arXiv:2110.14168, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2608.09119","last_updated":"2026-08-10T04:53:05Z","snapshot_observed_at":"2026-08-16T00:01:56.727123Z","submitted_at":"2026-08-10T04:53:05Z","title":"Motif 3: Technical Report","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-11T23:12:09.890228Z"},"links":{"cited_paper":"/paper/2110.14168","citing_paper":"/paper/2608.09119"},"observation_digest":"sha256:fb5b12adb3d715c58bb380788525dcc0c26a1334a1173e82b87d3f4df226ebbd","observation_id":"d348bc73-30ba-441d-9d03-714343bc4085","resolution":{"observed_at":"2026-08-11T23:12:09.890228Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.04434","last_updated":"2024-06-19T06:04:17Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-05-07T15:56:43Z","title":"DeepSeek-V2: A Strong, Economical, and Efficient Mixture-of-Experts Language Model","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.04434","snapshot_observed_at":"2026-08-11T23:12:09.896042Z","title":"DeepSeek-V2: A strong, economical, and efficient mixture-of-experts language model","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.09119","last_updated":"2026-08-10T04:53:05Z","snapshot_observed_at":"2026-08-16T00:01:56.727123Z","submitted_at":"2026-08-10T04:53:05Z","title":"Motif 3: Technical Report","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-11T23:12:09.896042Z"},"links":{"cited_paper":"/paper/2405.04434","citing_paper":"/paper/2608.09119"},"observation_digest":"sha256:967913cf7d421dd88bb889a59ce9926587ad74f0ca808e4ace458c6e243cd089","observation_id":"e0858f7e-9ac6-49bd-b227-d4ba0c732763","resolution":{"observed_at":"2026-08-11T23:12:09.896042Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.19437","last_updated":"2025-02-18T17:26:38Z","snapshot_observed_at":"2026-08-15T17:27:11.980940Z","submitted_at":"2024-12-27T04:03:16Z","title":"DeepSeek-V3 Technical Report","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.19437","snapshot_observed_at":"2026-08-11T23:12:09.900991Z","title":"DeepSeek-V3 technical report.arXiv preprint arXiv:2412.19437, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.09119","last_updated":"2026-08-10T04:53:05Z","snapshot_observed_at":"2026-08-16T00:01:56.727123Z","submitted_at":"2026-08-10T04:53:05Z","title":"Motif 3: Technical Report","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-11T23:12:09.900991Z"},"links":{"cited_paper":"/paper/2412.19437","citing_paper":"/paper/2608.09119"},"observation_digest":"sha256:c7c9b824054844b174a47f922e1f4f0bc20b4ad65d98f03535339f101e1add32","observation_id":"d6f21ccd-3edc-476e-8f72-bf4d16546030","resolution":{"observed_at":"2026-08-11T23:12:09.900991Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T23:12:12.621150Z","title":"DeepEP: Hybrid expert-parallel communication","venue":null,"work_id":"db1190c0-c996-4f09-99ec-437eeab45394","year":2025},"citing_paper":{"arxiv_id":"2608.09119","last_updated":"2026-08-10T04:53:05Z","snapshot_observed_at":"2026-08-16T00:01:56.727123Z","submitted_at":"2026-08-10T04:53:05Z","title":"Motif 3: Technical Report","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-11T23:12:09.906139Z"},"links":{"citing_paper":"/paper/2608.09119"},"observation_digest":"sha256:e6d13f8c5a08dd3f2f6b9d44ec421ed4f9aeac56b3d736b23490f78c3a65066a","observation_id":"03229335-269f-4c32-8f16-8163414fc04a","resolution":{"observed_at":"2026-08-11T23:12:12.631570Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T23:12:09.911684Z","title":"DeepSeek-V4: Towards highly efficient million-token context intelligence.arXiv preprint arXiv:2606.19348, June 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.09119","last_updated":"2026-08-10T04:53:05Z","snapshot_observed_at":"2026-08-16T00:01:56.727123Z","submitted_at":"2026-08-10T04:53:05Z","title":"Motif 3: Technical Report","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-11T23:12:09.911684Z"},"links":{"citing_paper":"/paper/2608.09119"},"observation_digest":"sha256:dca69a0a54c8fe6ec41ae227acfd84cb82e96c77affb2256fde2e983ba6d3fb7","observation_id":"8124b7f4-17dc-49ef-802c-09147d7e1253","resolution":{"observed_at":"2026-08-11T23:12:09.911684Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2605.00674","last_updated":"2026-05-15T17:10:37Z","snapshot_observed_at":"2026-08-11T13:24:32.272927Z","submitted_at":"2026-05-01T13:56:34Z","title":"Beyond Benchmarks: MathArena as an Evaluation Platform for Mathematics with LLMs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2605.00674","snapshot_observed_at":"2026-08-11T23:12:09.916832Z","title":"Beyond benchmarks: Matharena as an evaluation platform for mathematics with llms.arXiv preprint arXiv:2605.00674, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.09119","last_updated":"2026-08-10T04:53:05Z","snapshot_observed_at":"2026-08-16T00:01:56.727123Z","submitted_at":"2026-08-10T04:53:05Z","title":"Motif 3: Technical Report","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-11T23:12:09.916832Z"},"links":{"cited_paper":"/paper/2605.00674","citing_paper":"/paper/2608.09119"},"observation_digest":"sha256:05353a9f511d79c6880a36efe518b0cafa72706627aa3426b1c6f8d71648fef8","observation_id":"9cea9e0b-9a49-4487-83cd-920769eed99c","resolution":{"observed_at":"2026-08-11T23:12:09.916832Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2602.15763","last_updated":"2026-02-24T10:44:44Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-02-17T17:50:56Z","title":"GLM-5: from Vibe Coding to Agentic Engineering","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2602.15763","snapshot_observed_at":"2026-08-11T23:12:09.921673Z","title":"GLM-5: From vibe coding to agentic engineering.arXiv preprint arXiv:2602.15763, February 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.09119","last_updated":"2026-08-10T04:53:05Z","snapshot_observed_at":"2026-08-16T00:01:56.727123Z","submitted_at":"2026-08-10T04:53:05Z","title":"Motif 3: Technical Report","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-11T23:12:09.921673Z"},"links":{"cited_paper":"/paper/2602.15763","citing_paper":"/paper/2608.09119"},"observation_digest":"sha256:0dfeaaadb34eb348c734b79633594b13d3e4f110b937b2f9b63166f6c45f70ca","observation_id":"381efd72-9d36-46f9-82e4-76da54536f5d","resolution":{"observed_at":"2026-08-11T23:12:09.921673Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T23:12:12.597374Z","title":"Measuring massive multitask language understanding.International Conference on Learning Representations, 2021","venue":null,"work_id":"2a603fbd-4df6-46b3-ac0b-45bc584bf680","year":2021},"citing_paper":{"arxiv_id":"2608.09119","last_updated":"2026-08-10T04:53:05Z","snapshot_observed_at":"2026-08-16T00:01:56.727123Z","submitted_at":"2026-08-10T04:53:05Z","title":"Motif 3: Technical Report","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-11T23:12:09.926792Z"},"links":{"citing_paper":"/paper/2608.09119"},"observation_digest":"sha256:d2d452f1432b3bba50ba683a44dbafc83f79deb6441d7094a6c10f08edfbd194","observation_id":"3588dac7-b590-4ab2-abd8-4a4a8e694ebb","resolution":{"observed_at":"2026-08-11T23:12:12.605477Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T23:12:09.931747Z","title":"Measuring mathematical problem solving with the MATH dataset.NeurIPS Datasets and Benchmarks, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2608.09119","last_updated":"2026-08-10T04:53:05Z","snapshot_observed_at":"2026-08-16T00:01:56.727123Z","submitted_at":"2026-08-10T04:53:05Z","title":"Motif 3: Technical Report","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-11T23:12:09.931747Z"},"links":{"citing_paper":"/paper/2608.09119"},"observation_digest":"sha256:4c88459829c1f991bae7f6dcd05b5cbff31108103d801873a38a7f88940eff55","observation_id":"1858c407-b6bc-47fe-b373-97f9a0ca6b0e","resolution":{"observed_at":"2026-08-11T23:12:09.931747Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.10989","last_updated":"2025-01-24T00:14:55Z","snapshot_observed_at":"2026-08-12T22:23:22.667861Z","submitted_at":"2024-10-14T18:17:01Z","title":"Liger Kernel: Efficient Triton Kernels for LLM Training","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.10989","snapshot_observed_at":"2026-08-11T23:12:09.937202Z","title":"Liger kernel: Efficient triton kernels for LLM training.arXiv preprint arXiv:2410.10989, 2024","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.09119","last_updated":"2026-08-10T04:53:05Z","snapshot_observed_at":"2026-08-16T00:01:56.727123Z","submitted_at":"2026-08-10T04:53:05Z","title":"Motif 3: Technical Report","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-11T23:12:09.937202Z"},"links":{"cited_paper":"/paper/2410.10989","citing_paper":"/paper/2608.09119"},"observation_digest":"sha256:cf24ec90028920c9456fc17f2f1625b7f92f83348e1127e2a01fa3ad80f904a3","observation_id":"233b03fc-430f-4ebc-8bd8-207738f4ba10","resolution":{"observed_at":"2026-08-11T23:12:09.937202Z","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-08-11T23:12:09.942934Z","title":"Aa-omniscience: Evaluat- ing cross-domain knowledge reliability in large language models.arXiv preprint arXiv:2511.13029, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.09119","last_updated":"2026-08-10T04:53:05Z","snapshot_observed_at":"2026-08-16T00:01:56.727123Z","submitted_at":"2026-08-10T04:53:05Z","title":"Motif 3: Technical Report","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-11T23:12:09.942934Z"},"links":{"citing_paper":"/paper/2608.09119"},"observation_digest":"sha256:9b5b0b5c1b3d36e11657899a7c26ee874d39f64457680b0f11e4ee85b2c8ab38","observation_id":"38b03e6b-efa1-419c-b898-0a2ac5fecc36","resolution":{"observed_at":"2026-08-11T23:12:09.942934Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.14509","last_updated":"2023-10-04T16:51:13Z","snapshot_observed_at":"2026-08-13T22:49:56.824755Z","submitted_at":"2023-09-25T20:15:57Z","title":"DeepSpeed Ulysses: System Optimizations for Enabling Training of Extreme Long Sequence Transformer Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.14509","snapshot_observed_at":"2026-08-11T23:12:09.947925Z","title":"DeepSpeed Ulysses: System optimizations for enabling training of extreme long sequence transformer models.arXiv preprint arXiv:2309.14509, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.09119","last_updated":"2026-08-10T04:53:05Z","snapshot_observed_at":"2026-08-16T00:01:56.727123Z","submitted_at":"2026-08-10T04:53:05Z","title":"Motif 3: Technical Report","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-11T23:12:09.947925Z"},"links":{"cited_paper":"/paper/2309.14509","citing_paper":"/paper/2608.09119"},"observation_digest":"sha256:c524bb24a130c0d62f2abf278b9eecc968c3f819b55ab07898923f1815771b0f","observation_id":"5d5cfcbc-cbdb-41b1-9bc2-94807788e6d4","resolution":{"observed_at":"2026-08-11T23:12:09.947925Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.05352","last_updated":"2025-02-07T21:46:52Z","snapshot_observed_at":"2026-08-13T12:01:44.786455Z","submitted_at":"2025-02-07T21:46:52Z","title":"ITBench: Evaluating AI Agents across Diverse Real-World IT Automation Tasks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.05352","snapshot_observed_at":"2026-08-11T23:12:09.952843Z","title":"Itbench: Evaluating ai agents across diverse real-world it automation tasks.arXiv preprint arXiv:2502.05352, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.09119","last_updated":"2026-08-10T04:53:05Z","snapshot_observed_at":"2026-08-16T00:01:56.727123Z","submitted_at":"2026-08-10T04:53:05Z","title":"Motif 3: Technical Report","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-11T23:12:09.952843Z"},"links":{"cited_paper":"/paper/2502.05352","citing_paper":"/paper/2608.09119"},"observation_digest":"sha256:2917e9bd5d29726e883265fcd9be0a1f4fd7b86813efea91be6f32f9cf4f7876","observation_id":"07b4d204-c61b-4404-a55a-7273f46e0ce1","resolution":{"observed_at":"2026-08-11T23:12:09.952843Z","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-08-11T23:12:09.957692Z","title":"DCP: Addressing input dynamism in long-context training via dynamic context parallelism","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.09119","last_updated":"2026-08-10T04:53:05Z","snapshot_observed_at":"2026-08-16T00:01:56.727123Z","submitted_at":"2026-08-10T04:53:05Z","title":"Motif 3: Technical Report","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-11T23:12:09.957692Z"},"links":{"citing_paper":"/paper/2608.09119"},"observation_digest":"sha256:e63de318d178e6f2f41ac3ddd5ef80fc18f1a9854c4354ed2d99c7165983f053","observation_id":"4d05a1ea-4f01-4880-adce-36b5a6f98733","resolution":{"observed_at":"2026-08-11T23:12:09.957692Z","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-08-11T23:12:09.962235Z","title":"Swe-bench: Can language models resolve real-world github issues? InInternational Conference on Learning Representations, volume 2024, pages 54107–54157, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.09119","last_updated":"2026-08-10T04:53:05Z","snapshot_observed_at":"2026-08-16T00:01:56.727123Z","submitted_at":"2026-08-10T04:53:05Z","title":"Motif 3: Technical Report","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-11T23:12:09.962235Z"},"links":{"citing_paper":"/paper/2608.09119"},"observation_digest":"sha256:08d8ab28edcc2dae68c07af3bf5cd6ec886e8062af8cededf5bd114822cfc714","observation_id":"608cb4a4-1909-4c77-a336-02bdd30fdb8a","resolution":{"observed_at":"2026-08-11T23:12:09.962235Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T23:12:12.556589Z","title":"Muon: An optimizer for hidden layers in neural networks","venue":null,"work_id":"c2e805a6-9668-4bac-b2d0-fba4cd399001","year":2024},"citing_paper":{"arxiv_id":"2608.09119","last_updated":"2026-08-10T04:53:05Z","snapshot_observed_at":"2026-08-16T00:01:56.727123Z","submitted_at":"2026-08-10T04:53:05Z","title":"Motif 3: Technical Report","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-11T23:12:09.967546Z"},"links":{"citing_paper":"/paper/2608.09119"},"observation_digest":"sha256:35dba3a0c73559eddc9ed2a13ac7734b0da9c049efb683e3a7245ef18a087216","observation_id":"5c2e2b74-fd1e-488c-90a6-2d3ddfe1ccba","resolution":{"observed_at":"2026-08-11T23:12:12.562956Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2507.20534","last_updated":"2026-02-03T04:57:00Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-07-28T05:35:43Z","title":"Kimi K2: Open Agentic Intelligence","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2507.20534","snapshot_observed_at":"2026-08-11T23:12:09.972456Z","title":"Kimi K2: Open agentic intelligence.arXiv preprint arXiv:2507.20534, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.09119","last_updated":"2026-08-10T04:53:05Z","snapshot_observed_at":"2026-08-16T00:01:56.727123Z","submitted_at":"2026-08-10T04:53:05Z","title":"Motif 3: Technical Report","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-11T23:12:09.972456Z"},"links":{"cited_paper":"/paper/2507.20534","citing_paper":"/paper/2608.09119"},"observation_digest":"sha256:12d709f9b7dd706a8f7561769a54b5aa2f95c78806ee6a7e340a92e3a948775f","observation_id":"03783b4a-ceea-4732-92b8-3b051137d883","resolution":{"observed_at":"2026-08-11T23:12:09.972456Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2602.02276","last_updated":"2026-02-02T16:17:38Z","snapshot_observed_at":"2026-08-12T00:25:39.214406Z","submitted_at":"2026-02-02T16:17:38Z","title":"Kimi K2.5: Visual Agentic Intelligence","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2602.02276","snapshot_observed_at":"2026-08-11T23:12:09.977432Z","title":"Kimi K2.5: Visual agentic intelligence.arXiv preprint arXiv:2602.02276, February 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.09119","last_updated":"2026-08-10T04:53:05Z","snapshot_observed_at":"2026-08-16T00:01:56.727123Z","submitted_at":"2026-08-10T04:53:05Z","title":"Motif 3: Technical Report","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-11T23:12:09.977432Z"},"links":{"cited_paper":"/paper/2602.02276","citing_paper":"/paper/2608.09119"},"observation_digest":"sha256:58cd45713b0340d5bc8dd3a3d36635a355e4197950c2b3743cb0b2e92457c3e1","observation_id":"0e065b7b-3567-4d23-a895-c6ee4e169766","resolution":{"observed_at":"2026-08-11T23:12:09.977432Z","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-08-11T23:12:09.982830Z","title":"Gonzalez, Hao Zhang, and Ion Stoica","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.09119","last_updated":"2026-08-10T04:53:05Z","snapshot_observed_at":"2026-08-16T00:01:56.727123Z","submitted_at":"2026-08-10T04:53:05Z","title":"Motif 3: Technical Report","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-11T23:12:09.982830Z"},"links":{"citing_paper":"/paper/2608.09119"},"observation_digest":"sha256:7d104237fd6d088b747299afd859b71dba4d52f8e5592e26b73bc1603f77b540","observation_id":"0071cf32-e991-49d1-bede-73c3b89a0af7","resolution":{"observed_at":"2026-08-11T23:12:09.982830Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.06511","last_updated":"2025-06-07T19:16:22Z","snapshot_observed_at":"2026-08-12T22:27:39.491552Z","submitted_at":"2024-10-09T03:26:11Z","title":"TorchTitan: One-stop PyTorch native solution for production ready LLM pre-training","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.06511","snapshot_observed_at":"2026-08-11T23:12:09.988368Z","title":"TorchTitan: One-stop PyTorch-native solution for production-ready LLM pre-training","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.09119","last_updated":"2026-08-10T04:53:05Z","snapshot_observed_at":"2026-08-16T00:01:56.727123Z","submitted_at":"2026-08-10T04:53:05Z","title":"Motif 3: Technical Report","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-11T23:12:09.988368Z"},"links":{"cited_paper":"/paper/2410.06511","citing_paper":"/paper/2608.09119"},"observation_digest":"sha256:8bf2b24d6d90a528c726de38598bdb12384a584b0694da543b6d08d8797807bb","observation_id":"8ca5d116-f7fb-4b0d-90d6-2ac85455ca3e","resolution":{"observed_at":"2026-08-11T23:12:09.988368Z","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-08-11T23:12:09.993766Z","title":"Motif 2 12.7b technical report.arXiv preprint arXiv:2511.07464, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.09119","last_updated":"2026-08-10T04:53:05Z","snapshot_observed_at":"2026-08-16T00:01:56.727123Z","submitted_at":"2026-08-10T04:53:05Z","title":"Motif 3: Technical Report","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-11T23:12:09.993766Z"},"links":{"citing_paper":"/paper/2608.09119"},"observation_digest":"sha256:1636952565421710f02a8472ff7a3b773f9cbe837197f8012c9da87a1a054546","observation_id":"4e3c003a-1cc6-4aa6-bfa8-fc59fbd83a1d","resolution":{"observed_at":"2026-08-11T23:12:09.993766Z","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-08-11T23:12:09.998809Z","title":"Every step evolves: Scaling reinforcement learning for trillion-scale thinking model.arXiv preprint arXiv:2510.18855, 2025","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.09119","last_updated":"2026-08-10T04:53:05Z","snapshot_observed_at":"2026-08-16T00:01:56.727123Z","submitted_at":"2026-08-10T04:53:05Z","title":"Motif 3: Technical Report","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-11T23:12:09.998809Z"},"links":{"citing_paper":"/paper/2608.09119"},"observation_digest":"sha256:72ec32a7f9f2ebfaf642789b7fcc33c777275d1ddf082b920a6ad3b4e2ea1f4f","observation_id":"01144cd2-f180-4711-8d7e-67887affa96e","resolution":{"observed_at":"2026-08-11T23:12:09.998809Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.13423","last_updated":"2025-08-26T18:43:00Z","snapshot_observed_at":"2026-08-14T14:04:35.980116Z","submitted_at":"2025-03-17T17:53:23Z","title":"SuperBPE: Space Travel for Language Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.13423","snapshot_observed_at":"2026-08-11T23:12:10.004036Z","title":"Smith, and Yejin Choi","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.09119","last_updated":"2026-08-10T04:53:05Z","snapshot_observed_at":"2026-08-16T00:01:56.727123Z","submitted_at":"2026-08-10T04:53:05Z","title":"Motif 3: Technical Report","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-11T23:12:10.004036Z"},"links":{"cited_paper":"/paper/2503.13423","citing_paper":"/paper/2608.09119"},"observation_digest":"sha256:597f60c16086697be893cbc5c1b8295760a055f0896c07dc6c590739a591df15","observation_id":"194d245f-806a-4e4b-aa45-421f97a75a4c","resolution":{"observed_at":"2026-08-11T23:12:10.004036Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.01889","last_updated":"2023-11-27T06:38:47Z","snapshot_observed_at":"2026-08-14T10:14:18.862721Z","submitted_at":"2023-10-03T08:44:50Z","title":"Ring Attention with Blockwise Transformers for Near-Infinite Context","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.01889","snapshot_observed_at":"2026-08-11T23:12:10.009526Z","title":"Ring attention with blockwise transformers for near- infinite context.arXiv preprint arXiv:2310.01889, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.09119","last_updated":"2026-08-10T04:53:05Z","snapshot_observed_at":"2026-08-16T00:01:56.727123Z","submitted_at":"2026-08-10T04:53:05Z","title":"Motif 3: Technical Report","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-11T23:12:10.009526Z"},"links":{"cited_paper":"/paper/2310.01889","citing_paper":"/paper/2608.09119"},"observation_digest":"sha256:5b4bd44975f9f76aea2d1cd36276e7e89e3fb46bbbb635125aa305c64ba3f029","observation_id":"62623cfa-e887-45df-be92-d580fb9462ee","resolution":{"observed_at":"2026-08-11T23:12:10.009526Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.16982","last_updated":"2025-02-24T09:12:29Z","snapshot_observed_at":"2026-08-02T00:32:51.000665Z","submitted_at":"2025-02-24T09:12:29Z","title":"Muon is Scalable for LLM Training","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.16982","snapshot_observed_at":"2026-08-11T23:12:10.014334Z","title":"Muon is scalable for LLM training.arXiv preprint arXiv:2502.16982, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.09119","last_updated":"2026-08-10T04:53:05Z","snapshot_observed_at":"2026-08-16T00:01:56.727123Z","submitted_at":"2026-08-10T04:53:05Z","title":"Motif 3: Technical Report","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-11T23:12:10.014334Z"},"links":{"cited_paper":"/paper/2502.16982","citing_paper":"/paper/2608.09119"},"observation_digest":"sha256:e0905351266b71818d3c01143bec8c7cce4d0bb187acf78ccfe6ff5c5b68cf97","observation_id":"cb7fa046-b61b-45ad-9634-2c906667a580","resolution":{"observed_at":"2026-08-11T23:12:10.014334Z","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-08-11T23:12:10.019631Z","title":"Towards robust mathematical reasoning","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.09119","last_updated":"2026-08-10T04:53:05Z","snapshot_observed_at":"2026-08-16T00:01:56.727123Z","submitted_at":"2026-08-10T04:53:05Z","title":"Motif 3: Technical Report","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-11T23:12:10.019631Z"},"links":{"citing_paper":"/paper/2608.09119"},"observation_digest":"sha256:67632bcb44d3a161575b4f7018090e0a19386091a2e126b30cd6f4771a2be23a","observation_id":"cd137cd5-4779-4fa2-9e77-d3ebc0ac8e99","resolution":{"observed_at":"2026-08-11T23:12:10.019631Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T23:12:12.517360Z","title":"Terminal-bench: Benchmarking agents on hard, realistic tasks in command line interfaces","venue":null,"work_id":"db0bc3d1-8ff8-42b0-a307-d6f6185d6d81","year":2026},"citing_paper":{"arxiv_id":"2608.09119","last_updated":"2026-08-10T04:53:05Z","snapshot_observed_at":"2026-08-16T00:01:56.727123Z","submitted_at":"2026-08-10T04:53:05Z","title":"Motif 3: Technical Report","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-11T23:12:10.024237Z"},"links":{"citing_paper":"/paper/2608.09119"},"observation_digest":"sha256:02b7e3ef9e53ba29940f28956b9a07028abee3dfbba4c25d399192e821991f70","observation_id":"638ea282-a2b2-4fbd-8cc9-111502ca2e14","resolution":{"observed_at":"2026-08-11T23:12:12.523344Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.08027","last_updated":"2025-08-18T19:51:06Z","snapshot_observed_at":"2026-08-13T17:08:54.114895Z","submitted_at":"2025-05-30T21:08:15Z","title":"Recipes for Pre-training LLMs with MXFP8","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.08027","snapshot_observed_at":"2026-08-11T23:12:10.029200Z","title":"Recipes for pre-training LLMs with MXFP8.arXiv preprint arXiv:2506.08027, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.09119","last_updated":"2026-08-10T04:53:05Z","snapshot_observed_at":"2026-08-16T00:01:56.727123Z","submitted_at":"2026-08-10T04:53:05Z","title":"Motif 3: Technical Report","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-11T23:12:10.029200Z"},"links":{"cited_paper":"/paper/2506.08027","citing_paper":"/paper/2608.09119"},"observation_digest":"sha256:66d884c2651ca91715de5c757e14b89755f38ed0f827b6c21473b5ec5338de17","observation_id":"b5f5423a-0c9f-4548-9faa-4ef49be4751d","resolution":{"observed_at":"2026-08-11T23:12:10.029200Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T23:12:12.497181Z","title":"Jordan, and Ion Stoica","venue":null,"work_id":"cf557bba-3a18-439c-a9a5-5b632b54accc","year":2018},"citing_paper":{"arxiv_id":"2608.09119","last_updated":"2026-08-10T04:53:05Z","snapshot_observed_at":"2026-08-16T00:01:56.727123Z","submitted_at":"2026-08-10T04:53:05Z","title":"Motif 3: Technical Report","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-11T23:12:10.034216Z"},"links":{"citing_paper":"/paper/2608.09119"},"observation_digest":"sha256:157288da611bbac36591e1966aea2ae8a12e7a4dc84be619942e0b79e079299d","observation_id":"c9449845-72c5-4ff1-a580-2de88c5682c9","resolution":{"observed_at":"2026-08-11T23:12:12.504267Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T23:12:12.477056Z","title":"Motif 3 training example","venue":null,"work_id":"04003950-a931-44a0-81e3-61aed05395e5","year":2026},"citing_paper":{"arxiv_id":"2608.09119","last_updated":"2026-08-10T04:53:05Z","snapshot_observed_at":"2026-08-16T00:01:56.727123Z","submitted_at":"2026-08-10T04:53:05Z","title":"Motif 3: Technical Report","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-11T23:12:10.039368Z"},"links":{"citing_paper":"/paper/2608.09119"},"observation_digest":"sha256:7610de960f566d99e26dbc581a14542f8bee5524a04237627bfaf205b048a0d5","observation_id":"65642ad7-ac59-48e1-bfc5-1ace938c1f21","resolution":{"observed_at":"2026-08-11T23:12:12.482443Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T23:12:10.044081Z","title":"Scalable training of mixture-of-experts models with megatron core.arXiv preprint arXiv:2603.07685, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.09119","last_updated":"2026-08-10T04:53:05Z","snapshot_observed_at":"2026-08-16T00:01:56.727123Z","submitted_at":"2026-08-10T04:53:05Z","title":"Motif 3: Technical Report","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-11T23:12:10.044081Z"},"links":{"citing_paper":"/paper/2608.09119"},"observation_digest":"sha256:5e7a74d58be63390f201819f36ec2e294fd442f403c69a427b8d61e0cc6789e4","observation_id":"2f79ac33-eac1-4e0d-893a-0f71b3cbd299","resolution":{"observed_at":"2026-08-11T23:12:10.044081Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T23:12:12.456161Z","title":"Nemotron post-training v3","venue":null,"work_id":"340df9a7-2b43-4bbf-a380-546cfffe0ce1","year":2026},"citing_paper":{"arxiv_id":"2608.09119","last_updated":"2026-08-10T04:53:05Z","snapshot_observed_at":"2026-08-16T00:01:56.727123Z","submitted_at":"2026-08-10T04:53:05Z","title":"Motif 3: Technical Report","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-11T23:12:10.048895Z"},"links":{"citing_paper":"/paper/2608.09119"},"observation_digest":"sha256:3e5bd7ec2f5e73229db15850726fa11f0a0a56767344c672e6d53ce3325db847","observation_id":"c69914e2-01a5-4b36-9d00-c8d3757c2d83","resolution":{"observed_at":"2026-08-11T23:12:12.462590Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T23:12:12.437488Z","title":"Nemotron pre-training datasets","venue":null,"work_id":"3ef75f66-85f6-40b5-b95e-9c3e68943d24","year":2026},"citing_paper":{"arxiv_id":"2608.09119","last_updated":"2026-08-10T04:53:05Z","snapshot_observed_at":"2026-08-16T00:01:56.727123Z","submitted_at":"2026-08-10T04:53:05Z","title":"Motif 3: Technical Report","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-11T23:12:10.053750Z"},"links":{"citing_paper":"/paper/2608.09119"},"observation_digest":"sha256:e9137459dc0c27b262137034332d16f1b663c151913f0a9085697cce2ca9027b","observation_id":"bf27e2ef-21f7-4b22-b3ca-33a0ed3e5e65","resolution":{"observed_at":"2026-08-11T23:12:12.443282Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T23:12:12.419750Z","title":"NeMo Gym: Environments for evaluating and improving models and agents","venue":null,"work_id":"dcf02afd-03bd-4bf5-a0e0-0e4346d5f8e6","year":2026},"citing_paper":{"arxiv_id":"2608.09119","last_updated":"2026-08-10T04:53:05Z","snapshot_observed_at":"2026-08-16T00:01:56.727123Z","submitted_at":"2026-08-10T04:53:05Z","title":"Motif 3: Technical Report","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-11T23:12:10.058846Z"},"links":{"citing_paper":"/paper/2608.09119"},"observation_digest":"sha256:e64e731935c43c2bc88449bc15bf4a87286c60f331da316f7ec6c34a8a1ed49c","observation_id":"f06151ac-f6c9-46e6-88f2-f881a7c2196c","resolution":{"observed_at":"2026-08-11T23:12:12.425302Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T23:12:12.399209Z","title":"NeMo RL: A scalable and efficient post-training library","venue":null,"work_id":"b9762236-2274-4c52-8914-84ea7244ba85","year":2026},"citing_paper":{"arxiv_id":"2608.09119","last_updated":"2026-08-10T04:53:05Z","snapshot_observed_at":"2026-08-16T00:01:56.727123Z","submitted_at":"2026-08-10T04:53:05Z","title":"Motif 3: Technical Report","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-11T23:12:10.063668Z"},"links":{"citing_paper":"/paper/2608.09119"},"observation_digest":"sha256:a7034bb581b2d4d949fc8686feb940b5374e034a9893c844faf560e925f56f51","observation_id":"6ee8c42a-f812-4fe4-a905-c26b76c62e5c","resolution":{"observed_at":"2026-08-11T23:12:12.406166Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.48550/arxiv.2606.15007","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T23:12:10.628317Z","title":"Nemotron 3 Ultra: Open, efficient mixture-of-experts hybrid mamba-transformer model for agentic reasoning.arXiv preprint arXiv:2606.15007, 2026","venue":null,"work_id":"925dc058-ab35-4f79-8fb1-e7e102d20f6c","year":2026},"citing_paper":{"arxiv_id":"2608.09119","last_updated":"2026-08-10T04:53:05Z","snapshot_observed_at":"2026-08-16T00:01:56.727123Z","submitted_at":"2026-08-10T04:53:05Z","title":"Motif 3: Technical Report","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-11T23:12:10.068239Z"},"links":{"citing_paper":"/paper/2608.09119"},"observation_digest":"sha256:00105c8225ac59c01f801b74031497416bf0b056205d056957e3c3f32b5f8607","observation_id":"4f0b6eab-fa09-42d0-8eee-4c506f806ed5","resolution":{"observed_at":"2026-08-11T23:12:10.634258Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T23:12:12.379568Z","title":"gpt-oss: Reference implementations for gpt-oss-120b and gpt-oss-20b","venue":null,"work_id":"25c7d2a0-c6c7-4ff2-941a-02dea916b929","year":null},"citing_paper":{"arxiv_id":"2608.09119","last_updated":"2026-08-10T04:53:05Z","snapshot_observed_at":"2026-08-16T00:01:56.727123Z","submitted_at":"2026-08-10T04:53:05Z","title":"Motif 3: Technical Report","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-11T23:12:10.073048Z"},"links":{"citing_paper":"/paper/2608.09119"},"observation_digest":"sha256:d1bd5be71d76403569df4634e6d0c44e685905acd238ca888c24af92c5e7ee16","observation_id":"cce1f40d-086c-48e6-b247-19cfc96c0975","resolution":{"observed_at":"2026-08-11T23:12:12.386399Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T23:12:12.342524Z","title":"TorchAO: PyTorch-native training-to-serving model optimization.ICML Workshop on Championing Open-source Development, 2025","venue":null,"work_id":"cc2d37e3-41eb-4eef-9993-983ad8ab7550","year":2025},"citing_paper":{"arxiv_id":"2608.09119","last_updated":"2026-08-10T04:53:05Z","snapshot_observed_at":"2026-08-16T00:01:56.727123Z","submitted_at":"2026-08-10T04:53:05Z","title":"Motif 3: Technical Report","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-11T23:12:10.088862Z"},"links":{"citing_paper":"/paper/2608.09119"},"observation_digest":"sha256:da4dd1d13f9a66189fd8800b6da8eb4fd9553e8cc381f928d2b4c495ca9acabd","observation_id":"0e720d45-4fbf-4372-ba4a-9280a982f235","resolution":{"observed_at":"2026-08-11T23:12:12.348690Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T23:12:12.326351Z","title":"Gdpval: Evaluating ai model performance on real-world economically valuable tasks","venue":null,"work_id":"e06ba958-f1b8-4a85-87ec-4761600255eb","year":2026},"citing_paper":{"arxiv_id":"2608.09119","last_updated":"2026-08-10T04:53:05Z","snapshot_observed_at":"2026-08-16T00:01:56.727123Z","submitted_at":"2026-08-10T04:53:05Z","title":"Motif 3: Technical Report","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-11T23:12:10.095075Z"},"links":{"citing_paper":"/paper/2608.09119"},"observation_digest":"sha256:c6898e4a6c9f87de685d44fab442aea8506f25bbdbd5d565ac54f5f9af9f2b97","observation_id":"5bd55e93-7cab-4b2f-9add-de6afb2e3fe8","resolution":{"observed_at":"2026-08-11T23:12:12.331577Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.14249","last_updated":"2026-02-20T04:23:01Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-01-24T05:27:46Z","title":"Humanity's Last Exam","version":10},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.14249","snapshot_observed_at":"2026-08-11T23:12:10.100397Z","title":"Humanity’s last exam.arXiv preprint arXiv:2501.14249, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.09119","last_updated":"2026-08-10T04:53:05Z","snapshot_observed_at":"2026-08-16T00:01:56.727123Z","submitted_at":"2026-08-10T04:53:05Z","title":"Motif 3: Technical Report","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-11T23:12:10.100397Z"},"links":{"cited_paper":"/paper/2501.14249","citing_paper":"/paper/2608.09119"},"observation_digest":"sha256:b94099ea9482556aead826c878a2d8e8a90817c791f849c5f04c1af70197cdde","observation_id":"8d7537e0-6840-4ccc-b39f-3756a90d6595","resolution":{"observed_at":"2026-08-11T23:12:10.100397Z","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-08-11T23:12:10.105901Z","title":"On data engineering for scaling llm terminal capabilities, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.09119","last_updated":"2026-08-10T04:53:05Z","snapshot_observed_at":"2026-08-16T00:01:56.727123Z","submitted_at":"2026-08-10T04:53:05Z","title":"Motif 3: Technical Report","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-11T23:12:10.105901Z"},"links":{"citing_paper":"/paper/2608.09119"},"observation_digest":"sha256:10db0da0e24f3926224dfdc78d8029e7c11ed6248ab1e75ac65642c05ec842c0","observation_id":"658b672c-b141-44bc-8c72-634020f74e42","resolution":{"observed_at":"2026-08-11T23:12:10.105901Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T23:12:12.310239Z","title":"Generalizing verifiable instruction following.Advances in Neural Information Processing Systems, 38, 2025","venue":null,"work_id":"4227b4a3-855f-42ea-9548-b83a166c60f7","year":2025},"citing_paper":{"arxiv_id":"2608.09119","last_updated":"2026-08-10T04:53:05Z","snapshot_observed_at":"2026-08-16T00:01:56.727123Z","submitted_at":"2026-08-10T04:53:05Z","title":"Motif 3: Technical Report","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-11T23:12:10.110791Z"},"links":{"citing_paper":"/paper/2608.09119"},"observation_digest":"sha256:99ed6cd2372c87a8531ef9c39d4a96b59f3246ac1390434761f9f4a9ee1558aa","observation_id":"130bbe81-6b5c-4f1b-82c2-3a8874152cdf","resolution":{"observed_at":"2026-08-11T23:12:12.315765Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.06708","last_updated":"2025-05-10T17:15:49Z","snapshot_observed_at":"2026-08-14T13:38:50.524779Z","submitted_at":"2025-05-10T17:15:49Z","title":"Gated Attention for Large Language Models: Non-linearity, Sparsity, and Attention-Sink-Free","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.06708","snapshot_observed_at":"2026-08-11T23:12:10.115800Z","title":"Gated attention for large language models: Non-linearity, sparsity, and attention-sink-free.arXiv preprint arXiv:2505.06708,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.09119","last_updated":"2026-08-10T04:53:05Z","snapshot_observed_at":"2026-08-16T00:01:56.727123Z","submitted_at":"2026-08-10T04:53:05Z","title":"Motif 3: Technical Report","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-11T23:12:10.115800Z"},"links":{"cited_paper":"/paper/2505.06708","citing_paper":"/paper/2608.09119"},"observation_digest":"sha256:ab380aacce6b36174ef3ce3c4cc7bbef13a78df04c1a2ab76b259045516beec5","observation_id":"9f3b0e17-5fb2-4950-8600-2c48208ebd01","resolution":{"observed_at":"2026-08-11T23:12:10.115800Z","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-08-11T23:12:10.128680Z","title":"A unified view of attention and residual sinks: Outlier-driven rescaling is essential for transformer training.arXiv preprint arXiv:2601.22966, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.09119","last_updated":"2026-08-10T04:53:05Z","snapshot_observed_at":"2026-08-16T00:01:56.727123Z","submitted_at":"2026-08-10T04:53:05Z","title":"Motif 3: Technical Report","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-11T23:12:10.128680Z"},"links":{"citing_paper":"/paper/2608.09119"},"observation_digest":"sha256:143c4ce45b3a7f5249c4c7b2ba7cb8a445168def36d4c88259cd87ccc39f794b","observation_id":"590e99df-d25f-49e7-84fc-51ee9d765e66","resolution":{"observed_at":"2026-08-11T23:12:10.128680Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.06708","last_updated":"2025-05-10T17:15:49Z","snapshot_observed_at":"2026-08-14T13:38:50.524779Z","submitted_at":"2025-05-10T17:15:49Z","title":"Gated Attention for Large Language Models: Non-linearity, Sparsity, and Attention-Sink-Free","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.06708","snapshot_observed_at":"2026-08-11T23:12:10.121953Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.09119","last_updated":"2026-08-10T04:53:05Z","snapshot_observed_at":"2026-08-16T00:01:56.727123Z","submitted_at":"2026-08-10T04:53:05Z","title":"Motif 3: Technical Report","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-11T23:12:10.121953Z"},"links":{"cited_paper":"/paper/2505.06708","citing_paper":"/paper/2608.09119"},"observation_digest":"sha256:0d7bcdb81c21d967a17f04cb53dc8536dd08fd1ab6fc8274b3650b039b2ef6d0","observation_id":"fc397ad8-5560-48ee-88ca-4c6fcab0ce3c","resolution":{"observed_at":"2026-08-11T23:12:10.121953Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2311.12022","last_updated":"2023-11-20T18:57:34Z","snapshot_observed_at":"2026-08-16T07:06:07.822225Z","submitted_at":"2023-11-20T18:57:34Z","title":"GPQA: A Graduate-Level Google-Proof Q&A Benchmark","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.12022","snapshot_observed_at":"2026-08-11T23:12:10.138847Z","title":"Gpqa: A graduate-level google-proof q&a benchmark.arXiv preprint arXiv:2311.12022, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.09119","last_updated":"2026-08-10T04:53:05Z","snapshot_observed_at":"2026-08-16T00:01:56.727123Z","submitted_at":"2026-08-10T04:53:05Z","title":"Motif 3: Technical Report","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-11T23:12:10.138847Z"},"links":{"cited_paper":"/paper/2311.12022","citing_paper":"/paper/2608.09119"},"observation_digest":"sha256:089b2e06d17087439d3bc16b41d8cef8d19c2cb4b827ed4856c7f2b366094e95","observation_id":"01c20e77-eb16-4dc3-a761-18865c2bea1d","resolution":{"observed_at":"2026-08-11T23:12:10.138847Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T23:12:12.293400Z","title":"Qwen3-Next: Towards ultimate training and inference efficiency.https://qwen.ai/ blog?id=4074cca80393150c248e508aa62983f9cb7d27cd, September 2025","venue":null,"work_id":"3323fff0-a913-49c2-b656-b59fc74293f4","year":2025},"citing_paper":{"arxiv_id":"2608.09119","last_updated":"2026-08-10T04:53:05Z","snapshot_observed_at":"2026-08-16T00:01:56.727123Z","submitted_at":"2026-08-10T04:53:05Z","title":"Motif 3: Technical Report","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-11T23:12:10.133972Z"},"links":{"citing_paper":"/paper/2608.09119"},"observation_digest":"sha256:3d245a0005f4f65b826f0a88505fdcccd8ca8f6dc507b7008f3f2e3bc256c5f8","observation_id":"07f3b8d8-1fb7-46bb-8a01-8fd87e5e148a","resolution":{"observed_at":"2026-08-11T23:12:12.299158Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T23:12:12.276300Z","title":"WinoGrande: An adver- sarial winograd schema challenge at scale.Proceedings of the AAAI Conference on Artificial Intelligence, 2020","venue":null,"work_id":"f1f6a8b9-6b14-4133-a16a-08c21ba7a38f","year":2020},"citing_paper":{"arxiv_id":"2608.09119","last_updated":"2026-08-10T04:53:05Z","snapshot_observed_at":"2026-08-16T00:01:56.727123Z","submitted_at":"2026-08-10T04:53:05Z","title":"Motif 3: Technical Report","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-11T23:12:10.149664Z"},"links":{"citing_paper":"/paper/2608.09119"},"observation_digest":"sha256:972b680223b49ea858a2868cd630c82cd1910c2253b4b6b6337607b400383b56","observation_id":"90de544c-c905-4a0a-bdc2-63e3b7083dfd","resolution":{"observed_at":"2026-08-11T23:12:12.281957Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.10537","last_updated":"2023-10-19T16:38:33Z","snapshot_observed_at":"2026-08-13T05:48:18.482494Z","submitted_at":"2023-10-16T16:07:41Z","title":"Microscaling Data Formats for Deep Learning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.10537","snapshot_observed_at":"2026-08-11T23:12:10.143929Z","title":"Microscaling data formats for deep learning.arXiv preprint arXiv:2310.10537, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.09119","last_updated":"2026-08-10T04:53:05Z","snapshot_observed_at":"2026-08-16T00:01:56.727123Z","submitted_at":"2026-08-10T04:53:05Z","title":"Motif 3: Technical Report","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-11T23:12:10.143929Z"},"links":{"cited_paper":"/paper/2310.10537","citing_paper":"/paper/2608.09119"},"observation_digest":"sha256:b86a28907411cd7922075faeadac93c627cb100494693a05dff51cb4d2618f0f","observation_id":"88f16c11-468e-465d-97e0-d854675b5a6f","resolution":{"observed_at":"2026-08-11T23:12:10.143929Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2104.09864","last_updated":"2023-11-08T13:36:32Z","snapshot_observed_at":"2026-08-14T03:33:46.294739Z","submitted_at":"2021-04-20T09:54:06Z","title":"RoFormer: Enhanced Transformer with Rotary Position Embedding","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2104.09864","snapshot_observed_at":"2026-08-11T23:12:10.165525Z","title":"RoFormer: Enhanced transformer with rotary position embedding.arXiv preprint arXiv:2104.09864, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2608.09119","last_updated":"2026-08-10T04:53:05Z","snapshot_observed_at":"2026-08-16T00:01:56.727123Z","submitted_at":"2026-08-10T04:53:05Z","title":"Motif 3: Technical Report","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-11T23:12:10.165525Z"},"links":{"cited_paper":"/paper/2104.09864","citing_paper":"/paper/2608.09119"},"observation_digest":"sha256:0a13c3a5befc57aca669069e3b01eda6d0cce566e282a73995bdd5f28b244518","observation_id":"565090d2-b164-4bfe-b451-899deedc8326","resolution":{"observed_at":"2026-08-11T23:12:10.165525Z","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-08-11T23:12:10.154236Z","title":"τ-knowledge: Evaluating conversational agents over unstructured knowledge.arXiv preprint arXiv:2603.04370,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.09119","last_updated":"2026-08-10T04:53:05Z","snapshot_observed_at":"2026-08-16T00:01:56.727123Z","submitted_at":"2026-08-10T04:53:05Z","title":"Motif 3: Technical Report","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-11T23:12:10.154236Z"},"links":{"citing_paper":"/paper/2608.09119"},"observation_digest":"sha256:2eb03c30a394e633bd4c63890663b043ea2c8edee603717fd6d33442ceb16bd9","observation_id":"48333d04-8b1c-4600-a18e-41b7daa79b4e","resolution":{"observed_at":"2026-08-11T23:12:10.154236Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T23:12:12.258383Z","title":"Scicode: A research coding benchmark curated by scientists","venue":null,"work_id":"a5243379-e6f2-4012-8d3e-0a55e6811edd","year":2024},"citing_paper":{"arxiv_id":"2608.09119","last_updated":"2026-08-10T04:53:05Z","snapshot_observed_at":"2026-08-16T00:01:56.727123Z","submitted_at":"2026-08-10T04:53:05Z","title":"Motif 3: Technical Report","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-11T23:12:10.177476Z"},"links":{"citing_paper":"/paper/2608.09119"},"observation_digest":"sha256:ad2d5bf1bf7e9b5d9f4bead03fcc91f322beca62cae2fcb765a8a9f856dab273","observation_id":"3e4ebf87-4881-4c90-a692-b24580d2b981","resolution":{"observed_at":"2026-08-11T23:12:12.263876Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2408.15664","last_updated":"2024-08-28T09:31:09Z","snapshot_observed_at":"2026-08-15T04:59:51.918109Z","submitted_at":"2024-08-28T09:31:09Z","title":"Auxiliary-Loss-Free Load Balancing Strategy for Mixture-of-Experts","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.15664","snapshot_observed_at":"2026-08-11T23:12:10.183916Z","title":"Auxiliary-loss-free load balancing strategy for mixture-of-experts.arXiv preprint arXiv:2408.15664, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.09119","last_updated":"2026-08-10T04:53:05Z","snapshot_observed_at":"2026-08-16T00:01:56.727123Z","submitted_at":"2026-08-10T04:53:05Z","title":"Motif 3: Technical Report","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-11T23:12:10.183916Z"},"links":{"cited_paper":"/paper/2408.15664","citing_paper":"/paper/2608.09119"},"observation_digest":"sha256:611c8fda9cdac2f9ce122ed00797f89211b4d9fa264e39cbbd2ce5eb094eaadd","observation_id":"04c7a0ca-2322-4b10-8f51-e40767904f10","resolution":{"observed_at":"2026-08-11T23:12:10.183916Z","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-08-11T23:12:10.171334Z","title":"Grouped differential attention.arXiv preprint arXiv:2510.06949, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.09119","last_updated":"2026-08-10T04:53:05Z","snapshot_observed_at":"2026-08-16T00:01:56.727123Z","submitted_at":"2026-08-10T04:53:05Z","title":"Motif 3: Technical Report","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-11T23:12:10.171334Z"},"links":{"citing_paper":"/paper/2608.09119"},"observation_digest":"sha256:8716583720f37f7f79f0c0369dfbdfa1b6f5fde387a4bb1bb882be6486e2b985","observation_id":"51eec268-e592-44dc-924e-ce6a116d184f","resolution":{"observed_at":"2026-08-11T23:12:10.171334Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2601.02780","last_updated":"2026-01-08T05:52:17Z","snapshot_observed_at":"2026-08-14T07:48:23.313445Z","submitted_at":"2026-01-06T07:31:47Z","title":"MiMo-V2-Flash Technical Report","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2601.02780","snapshot_observed_at":"2026-08-11T23:12:10.194310Z","title":"MiMo-V2-Flash technical report.arXiv preprint arXiv:2601.02780, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.09119","last_updated":"2026-08-10T04:53:05Z","snapshot_observed_at":"2026-08-16T00:01:56.727123Z","submitted_at":"2026-08-10T04:53:05Z","title":"Motif 3: Technical Report","version":1},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-11T23:12:10.194310Z"},"links":{"cited_paper":"/paper/2601.02780","citing_paper":"/paper/2608.09119"},"observation_digest":"sha256:a4f250f9a84c4aafcf97609286534c90aba8665fe8a703eb5b55a35dd37a952d","observation_id":"5a88bcdc-bf30-4dce-bd24-8813af3a57db","resolution":{"observed_at":"2026-08-11T23:12:10.194310Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2512.24880","last_updated":"2026-01-05T16:51:18Z","snapshot_observed_at":"2026-08-03T01:54:33.526522Z","submitted_at":"2025-12-31T14:16:26Z","title":"mHC: Manifold-Constrained Hyper-Connections","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2512.24880","snapshot_observed_at":"2026-08-11T23:12:10.200467Z","title":"mHC: Manifold-constrained hyper-connections.arXiv preprint arXiv:2512.24880, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.09119","last_updated":"2026-08-10T04:53:05Z","snapshot_observed_at":"2026-08-16T00:01:56.727123Z","submitted_at":"2026-08-10T04:53:05Z","title":"Motif 3: Technical Report","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-11T23:12:10.200467Z"},"links":{"cited_paper":"/paper/2512.24880","citing_paper":"/paper/2608.09119"},"observation_digest":"sha256:44b485ecf807c581b1094ff238a561a9d5c878232b9438772933c01682dbb609","observation_id":"56d9fe3b-f351-46a0-98fe-19a3e70a3d33","resolution":{"observed_at":"2026-08-11T23:12:10.200467Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.01574","last_updated":"2024-11-06T02:54:00Z","snapshot_observed_at":"2026-08-06T00:29:17.674418Z","submitted_at":"2024-06-03T17:53:00Z","title":"MMLU-Pro: A More Robust and Challenging Multi-Task Language Understanding Benchmark","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.01574","snapshot_observed_at":"2026-08-11T23:12:10.189128Z","title":"MMLU-Pro: A more robust and challenging multi-task language understanding benchmark.arXiv preprint arXiv:2406.01574, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.09119","last_updated":"2026-08-10T04:53:05Z","snapshot_observed_at":"2026-08-16T00:01:56.727123Z","submitted_at":"2026-08-10T04:53:05Z","title":"Motif 3: Technical Report","version":1},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-11T23:12:10.189128Z"},"links":{"cited_paper":"/paper/2406.01574","citing_paper":"/paper/2608.09119"},"observation_digest":"sha256:761088fa499df6bb5d822ab5a103b1bf3c1fa627e06e3918c293119c66307161","observation_id":"4283f41e-ee27-4cf0-a41e-cf74fe4107e5","resolution":{"observed_at":"2026-08-11T23:12:10.189128Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.05258","last_updated":"2025-04-07T12:04:28Z","snapshot_observed_at":"2026-08-14T14:31:09.403736Z","submitted_at":"2024-10-07T17:57:38Z","title":"Differential Transformer","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.05258","snapshot_observed_at":"2026-08-11T23:12:10.212539Z","title":"Differential transformer.arXiv preprint arXiv:2410.05258, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.09119","last_updated":"2026-08-10T04:53:05Z","snapshot_observed_at":"2026-08-16T00:01:56.727123Z","submitted_at":"2026-08-10T04:53:05Z","title":"Motif 3: Technical Report","version":1},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-11T23:12:10.212539Z"},"links":{"cited_paper":"/paper/2410.05258","citing_paper":"/paper/2608.09119"},"observation_digest":"sha256:d39335ad399b46b7013bd01db99097d7f7ad272c3a6760c1fbdc6f9ae5ffd3a2","observation_id":"ffd0b996-51c0-41a8-8970-e8ca0bcbc285","resolution":{"observed_at":"2026-08-11T23:12:10.212539Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.14476","last_updated":"2025-05-20T01:37:34Z","snapshot_observed_at":"2026-08-02T01:40:54.187278Z","submitted_at":"2025-03-18T17:49:06Z","title":"DAPO: An Open-Source LLM Reinforcement Learning System at Scale","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.14476","snapshot_observed_at":"2026-08-11T23:12:10.219549Z","title":"DAPO: An open-source LLM reinforcement learning system at scale.arXiv preprint arXiv:2503.14476, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.09119","last_updated":"2026-08-10T04:53:05Z","snapshot_observed_at":"2026-08-16T00:01:56.727123Z","submitted_at":"2026-08-10T04:53:05Z","title":"Motif 3: Technical Report","version":1},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-08-11T23:12:10.219549Z"},"links":{"cited_paper":"/paper/2503.14476","citing_paper":"/paper/2608.09119"},"observation_digest":"sha256:59c5bb5d88363d1c18eee64fa38701e89ac9cc79b905fdb6bb29a44e42d92dcc","observation_id":"cb82c6f1-1220-44de-9e27-cfd765db5d69","resolution":{"observed_at":"2026-08-11T23:12:10.219549Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-08-11T23:12:10.206551Z","title":"Qwen3 technical report.arXiv preprint arXiv:2505.09388, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.09119","last_updated":"2026-08-10T04:53:05Z","snapshot_observed_at":"2026-08-16T00:01:56.727123Z","submitted_at":"2026-08-10T04:53:05Z","title":"Motif 3: Technical Report","version":1},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-08-11T23:12:10.206551Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2608.09119"},"observation_digest":"sha256:822e4997b3bbd7aad9fdf9d1fae75e04b57ffdaec09b49ce2205f7418b3ff1af","observation_id":"45f55783-e7a0-4d88-ac15-aff26dbe55d6","resolution":{"observed_at":"2026-08-11T23:12:10.206551Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T23:12:12.241548Z","title":"HellaSwag: Can a machine really finish your sentence?Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics, 2019","venue":null,"work_id":"85a25cc0-69d3-4ad6-b7b3-607c55629f2c","year":2019},"citing_paper":{"arxiv_id":"2608.09119","last_updated":"2026-08-10T04:53:05Z","snapshot_observed_at":"2026-08-16T00:01:56.727123Z","submitted_at":"2026-08-10T04:53:05Z","title":"Motif 3: Technical Report","version":1},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-08-11T23:12:10.232283Z"},"links":{"citing_paper":"/paper/2608.09119"},"observation_digest":"sha256:c830c3a0a2601f83101ee2263ab681c4ab016be7a73f2e63bd9f87723e4c4326","observation_id":"c6ae2597-b3ff-49f5-8d85-f660c0340cbf","resolution":{"observed_at":"2026-08-11T23:12:12.247609Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1910.07467","last_updated":"2019-10-16T16:44:22Z","snapshot_observed_at":"2026-08-08T08:22:25.110228Z","submitted_at":"2019-10-16T16:44:22Z","title":"Root Mean Square Layer Normalization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1910.07467","snapshot_observed_at":"2026-08-11T23:12:10.237953Z","title":"Root mean square layer normalization.arXiv preprint arXiv:1910.07467, 2019","venue":null,"work_id":null,"year":1910},"citing_paper":{"arxiv_id":"2608.09119","last_updated":"2026-08-10T04:53:05Z","snapshot_observed_at":"2026-08-16T00:01:56.727123Z","submitted_at":"2026-08-10T04:53:05Z","title":"Motif 3: Technical Report","version":1},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-08-11T23:12:10.237953Z"},"links":{"cited_paper":"/paper/1910.07467","citing_paper":"/paper/2608.09119"},"observation_digest":"sha256:780a7f42fd041a6ef979dd8e2a094fcf4da8420535b2d542cf87f928ae1c7b68","observation_id":"ce6ea7e8-7939-4eb5-aabb-4d35bab167b3","resolution":{"observed_at":"2026-08-11T23:12:10.237953Z","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-08-11T23:12:10.226491Z","title":"FlashAttention-4: Algorithm and kernel pipelining co-design for asymmetric hardware scaling","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.09119","last_updated":"2026-08-10T04:53:05Z","snapshot_observed_at":"2026-08-16T00:01:56.727123Z","submitted_at":"2026-08-10T04:53:05Z","title":"Motif 3: Technical Report","version":1},"reference_index":75,"source":"pdf_text","source_observed_at":"2026-08-11T23:12:10.226491Z"},"links":{"citing_paper":"/paper/2608.09119"},"observation_digest":"sha256:867e3e8154234e7c979c81d4c0207e16ce1d7ebf30996a6e0e11a821e22eb43b","observation_id":"be72b3b2-2e39-439b-a457-401f577ca6fc","resolution":{"observed_at":"2026-08-11T23:12:10.226491Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2509.26574","last_updated":"2026-05-08T21:22:01Z","snapshot_observed_at":"2026-08-12T16:45:40.750345Z","submitted_at":"2025-09-30T17:34:03Z","title":"Probing the Critical Point (CritPt) of AI Reasoning: a Frontier Physics Research Benchmark","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2509.26574","snapshot_observed_at":"2026-08-11T23:12:10.251313Z","title":"Probing the critical point (critpt) of ai reasoning: a frontier physics research benchmark.arXiv preprint arXiv:2509.26574, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.09119","last_updated":"2026-08-10T04:53:05Z","snapshot_observed_at":"2026-08-16T00:01:56.727123Z","submitted_at":"2026-08-10T04:53:05Z","title":"Motif 3: Technical Report","version":1},"reference_index":76,"source":"pdf_text","source_observed_at":"2026-08-11T23:12:10.251313Z"},"links":{"cited_paper":"/paper/2509.26574","citing_paper":"/paper/2608.09119"},"observation_digest":"sha256:3e8fc4d889ec8c2b8fa082023455bf095237b47be84f3d733a021a10b7d46256","observation_id":"ddf7eaa0-a3fb-4bf7-a84c-d0a9f0a7c522","resolution":{"observed_at":"2026-08-11T23:12:10.251313Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T23:12:12.208431Z","title":"[ˆ\\r\\n\\p{L}\\p{N}]?[\\p{Lu}\\p{Lt}\\p{Lm}\\p{Lo}\\p{M}]*[\\p{Ll}\\p{Lm}\\p{Lo}\\p{M}]+","venue":null,"work_id":"f24c57dc-4621-4d0b-8e83-990f0f8d776d","year":2024},"citing_paper":{"arxiv_id":"2608.09119","last_updated":"2026-08-10T04:53:05Z","snapshot_observed_at":"2026-08-16T00:01:56.727123Z","submitted_at":"2026-08-10T04:53:05Z","title":"Motif 3: Technical Report","version":1},"reference_index":77,"source":"pdf_text","source_observed_at":"2026-08-11T23:12:10.257064Z"},"links":{"citing_paper":"/paper/2608.09119"},"observation_digest":"sha256:a8b1f5e45fd83f24e5e9621560e2992b5ea55bb00d7b004b692ee990abf8a345","observation_id":"742f5b50-d7ae-4c5e-941d-5c718e20fb1f","resolution":{"observed_at":"2026-08-11T23:12:12.213039Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T23:12:12.224283Z","title":"Gonzalez, Clark Barrett, and Ying Sheng","venue":null,"work_id":"c50a86d7-a0a0-4ef1-ab37-6741a77d14f0","year":2024},"citing_paper":{"arxiv_id":"2608.09119","last_updated":"2026-08-10T04:53:05Z","snapshot_observed_at":"2026-08-16T00:01:56.727123Z","submitted_at":"2026-08-10T04:53:05Z","title":"Motif 3: Technical Report","version":1},"reference_index":78,"source":"pdf_text","source_observed_at":"2026-08-11T23:12:10.244630Z"},"links":{"citing_paper":"/paper/2608.09119"},"observation_digest":"sha256:01355cadaffaf67b1101f1bf4f86c9b7045d34aad7bf779498a089f944a2f5d3","observation_id":"090c824f-4a9c-472a-92ff-8136d99e22bb","resolution":{"observed_at":"2026-08-11T23:12:12.229861Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T23:12:12.360373Z","title":null,"venue":null,"work_id":"fa1b7114-a4e2-4bf7-9682-f8783e9860ce","year":null},"citing_paper":{"arxiv_id":"2608.09119","last_updated":"2026-08-10T04:53:05Z","snapshot_observed_at":"2026-08-16T00:01:56.727123Z","submitted_at":"2026-08-10T04:53:05Z","title":"Motif 3: Technical Report","version":1},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-11T23:12:10.078240Z"},"links":{"citing_paper":"/paper/2608.09119"},"observation_digest":"sha256:14a4d361806bc22069fac34092de520aab59788fcaf905c2d8127f013e61a987","observation_id":"e207c589-2198-4d99-bb29-b737b23e5835","resolution":{"observed_at":"2026-08-11T23:12:12.365678Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.48550/arxiv.2603.04370","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T23:12:10.514079Z","title":null,"venue":null,"work_id":"7cd3010e-d345-42b4-b0e6-4edf23401ae1","year":null},"citing_paper":{"arxiv_id":"2608.09119","last_updated":"2026-08-10T04:53:05Z","snapshot_observed_at":"2026-08-16T00:01:56.727123Z","submitted_at":"2026-08-10T04:53:05Z","title":"Motif 3: Technical Report","version":1},"reference_index":2026,"source":"pdf_text","source_observed_at":"2026-08-11T23:12:10.159635Z"},"links":{"citing_paper":"/paper/2608.09119"},"observation_digest":"sha256:e4384f7714779bd38a9e6fc104d6a7894f3798107be31da60a6e7ea45100391f","observation_id":"c73b670a-145d-4993-b16a-88cb5e224723","resolution":{"observed_at":"2026-08-11T23:12:10.523657Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-07-14T18:20:22.396846+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-14T18:20:22.396846+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2608.09119","last_updated":"2026-08-10T04:53:05Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-16T00:01:56.727123Z","submitted_at":"2026-08-10T04:53:05Z","title":"Motif 3: Technical Report"},"reference_resolution":{"displayed":80,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":53,"verified_exact":2,"verified_fuzzy":25},"total_outbound_references":80},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 80 of 80 outbound references and 0 inbound Pith citation observations for arXiv:2608.09119."}