{"as_of":"2026-08-04T21:01:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:34bb367b9dc63d5ead7847cd202e02ba36b2c6f34a5ff568b7196779e7008cc3","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":33,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":33,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-04T06:34:03.388597+00:00","state":"measured"},{"denominator":33,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":33,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T16:07:38.099803Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-10T12:15:01.137692Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2506.10910","last_updated":"2025-06-12T17:22:37Z","snapshot_observed_at":"2026-07-06T21:41:09.873575Z","submitted_at":"2025-06-12T17:22:37Z","title":"Magistral","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.10910","snapshot_observed_at":"2026-08-04T16:07:38.099803Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.16679","last_updated":"2025-09-20T13:11:28Z","snapshot_observed_at":"2026-08-04T16:07:24.699834Z","submitted_at":"2025-09-20T13:11:28Z","title":"Reinforcement Learning Meets Large Language Models: A Survey of Advancements and Applications Across the LLM Lifecycle","version":1},"reference_index":144,"source":"pdf_text","source_observed_at":"2026-08-04T16:07:38.099803Z"},"links":{"cited_paper":"/paper/2506.10910","citing_paper":"/paper/2509.16679"},"observation_digest":"sha256:428c538bdac1d796d8bb8dc711f4e4b7bd7e44916b99ebc2eb336d42a423c55d","observation_id":"cd458219-c9f1-439e-ba58-d2f6ef8fa086","resolution":{"observed_at":"2026-08-04T16:07:38.099803Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.10910","last_updated":"2025-06-12T17:22:37Z","snapshot_observed_at":"2026-07-06T21:41:09.873575Z","submitted_at":"2025-06-12T17:22:37Z","title":"Magistral","version":1},"cited_work":{"arxiv_id":"2506.10910","doi":"10.48550/arxiv.2506.10910","metadata_source":"arxiv_reference","pith_arxiv_id":"2506.10910","snapshot_observed_at":"2026-07-10T12:15:01.137692Z","title":"Magistral","venue":null,"work_id":"ae3fa57b-d81e-4022-ab02-51763900103b","year":2025},"citing_paper":{"arxiv_id":"2510.07239","last_updated":"2026-05-17T13:01:38Z","snapshot_observed_at":"2026-08-02T19:25:51.433055Z","submitted_at":"2025-10-08T17:06:20Z","title":"Red-Bandit: Test-Time Adaptation for LLM Red-Teaming via Bandit-Guided LoRA Experts","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-05-21T20:53:58.198974Z"},"links":{"cited_paper":"/paper/2506.10910","citing_paper":"/paper/2510.07239"},"observation_digest":"sha256:ef6d4538dfb1e689a49d67642d92ef57056a93b6b301f618470dae233b3f43c1","observation_id":"6bfc45b6-5981-4322-8ba9-320755b5e74a","resolution":{"observed_at":"2026-05-21T20:54:21.599958Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-05-23T10:52:47.043971+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-23T10:52:47.043971+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.10910","last_updated":"2025-06-12T17:22:37Z","snapshot_observed_at":"2026-07-06T21:41:09.873575Z","submitted_at":"2025-06-12T17:22:37Z","title":"Magistral","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.10910","snapshot_observed_at":"2026-08-04T10:07:52.637167Z","title":"Magistral","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2510.11713","last_updated":"2026-06-01T17:06:08Z","snapshot_observed_at":"2026-08-04T10:07:47.942078Z","submitted_at":"2025-10-13T17:59:35Z","title":"Are Large Reasoning Models Interruptible?","version":4},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-04T10:07:52.637167Z"},"links":{"cited_paper":"/paper/2506.10910","citing_paper":"/paper/2510.11713"},"observation_digest":"sha256:4dea6260977cea92f90aae340f2fc053eb9f3b30223738ecd61e1f2fb3d72ef1","observation_id":"f6298168-ee72-4d00-936c-212358e8e52e","resolution":{"observed_at":"2026-08-04T10:07:52.637167Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.10910","last_updated":"2025-06-12T17:22:37Z","snapshot_observed_at":"2026-07-06T21:41:09.873575Z","submitted_at":"2025-06-12T17:22:37Z","title":"Magistral","version":1},"cited_work":{"arxiv_id":"2506.10910","doi":"10.48550/arxiv.2506.10910","metadata_source":"arxiv_reference","pith_arxiv_id":"2506.10910","snapshot_observed_at":"2026-07-10T12:15:01.137692Z","title":"Magistral","venue":null,"work_id":"ae3fa57b-d81e-4022-ab02-51763900103b","year":2025},"citing_paper":{"arxiv_id":"2601.08584","last_updated":"2026-01-13T14:06:03Z","snapshot_observed_at":"2026-08-04T17:10:53.354037Z","submitted_at":"2026-01-13T14:06:03Z","title":"Ministral 3","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-05-14T19:12:24.627033Z"},"links":{"cited_paper":"/paper/2506.10910","citing_paper":"/paper/2601.08584"},"observation_digest":"sha256:dde90102be834b334acd9fd87557fa3bbb6e04d5babd068cef091d0ae22c495e","observation_id":"8f14ebbe-2e79-4187-a375-14693ba94948","resolution":{"observed_at":"2026-05-14T19:12:24.787396Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-05-23T10:52:47.043971+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-23T10:52:47.043971+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.10910","last_updated":"2025-06-12T17:22:37Z","snapshot_observed_at":"2026-07-06T21:41:09.873575Z","submitted_at":"2025-06-12T17:22:37Z","title":"Magistral","version":1},"cited_work":{"arxiv_id":"2506.10910","doi":"10.48550/arxiv.2506.10910","metadata_source":"arxiv_reference","pith_arxiv_id":"2506.10910","snapshot_observed_at":"2026-07-10T12:15:01.137692Z","title":"Magistral","venue":null,"work_id":"ae3fa57b-d81e-4022-ab02-51763900103b","year":2025},"citing_paper":{"arxiv_id":"2601.18734","last_updated":"2026-03-20T15:40:19Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-01-26T17:56:50Z","title":"Self-Distilled Reasoner: On-Policy Self-Distillation for Large Language Models","version":3},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-12T03:54:30.992080Z"},"links":{"cited_paper":"/paper/2506.10910","citing_paper":"/paper/2601.18734"},"observation_digest":"sha256:8bc87c58a86cd1fdd82f75fea4c4304d6cf6169aaee5cb905ca4c91f29c0acc4","observation_id":"44d95e98-01b7-446c-8e6f-a5982282210a","resolution":{"observed_at":"2026-05-12T03:54:31.109524Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-05-23T10:52:47.043971+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-23T10:52:47.043971+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.10910","last_updated":"2025-06-12T17:22:37Z","snapshot_observed_at":"2026-07-06T21:41:09.873575Z","submitted_at":"2025-06-12T17:22:37Z","title":"Magistral","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.10910","snapshot_observed_at":"2026-08-03T00:57:01.017891Z","title":"URL https: //doi.org/10.48550/arXiv.2506.10910","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2602.11072","last_updated":"2026-07-22T13:29:14Z","snapshot_observed_at":"2026-08-04T01:10:08.112767Z","submitted_at":"2026-02-11T17:41:01Z","title":"Simultaneous Speech-to-Speech Translation Without Aligned Data","version":2},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-03T00:57:01.017891Z"},"links":{"cited_paper":"/paper/2506.10910","citing_paper":"/paper/2602.11072"},"observation_digest":"sha256:b042bfeac063bb8d6c5b0bd9899ac900fc5ca703041f4135daab69534b37b3bf","observation_id":"66e62282-7e92-4464-b7fd-5efd6a4a2270","resolution":{"observed_at":"2026-08-03T00:57:01.017891Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.10910","last_updated":"2025-06-12T17:22:37Z","snapshot_observed_at":"2026-07-06T21:41:09.873575Z","submitted_at":"2025-06-12T17:22:37Z","title":"Magistral","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.10910","snapshot_observed_at":"2026-08-02T23:14:39.407159Z","title":"Rastogi, A","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.14862","last_updated":"2026-05-27T11:05:26Z","snapshot_observed_at":"2026-08-02T23:14:37.517873Z","submitted_at":"2026-02-16T15:54:52Z","title":"The Well-Tempered Classifier: Some Elementary Properties of Temperature Scaling","version":2},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-02T23:14:39.407159Z"},"links":{"cited_paper":"/paper/2506.10910","citing_paper":"/paper/2602.14862"},"observation_digest":"sha256:98e3c8a46b26e581e5aa8ea7565b8dd465b8bbba95c2f38ba44e74bce696c1cd","observation_id":"7f4e80d6-e4f4-42ed-ba6b-3d5c09ab1a63","resolution":{"observed_at":"2026-08-02T23:14:39.407159Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.10910","last_updated":"2025-06-12T17:22:37Z","snapshot_observed_at":"2026-07-06T21:41:09.873575Z","submitted_at":"2025-06-12T17:22:37Z","title":"Magistral","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.10910","snapshot_observed_at":"2026-08-02T20:07:28.015727Z","title":"arXiv preprint arXiv:2506.10910 (2025)","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.24060","last_updated":"2026-02-27T14:49:05Z","snapshot_observed_at":"2026-08-02T20:07:26.879619Z","submitted_at":"2026-02-27T14:49:05Z","title":"Task Complexity Matters: An Empirical Study of Reasoning in LLMs for Sentiment Analysis","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-02T20:07:28.015727Z"},"links":{"cited_paper":"/paper/2506.10910","citing_paper":"/paper/2602.24060"},"observation_digest":"sha256:c7d7dd95b317017df27da79940bee677df75b945c7aed99448a8cde105238904","observation_id":"2f7f2d9e-b2fd-4310-9f85-63e6be00e0ed","resolution":{"observed_at":"2026-08-02T20:07:28.015727Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.10910","last_updated":"2025-06-12T17:22:37Z","snapshot_observed_at":"2026-07-06T21:41:09.873575Z","submitted_at":"2025-06-12T17:22:37Z","title":"Magistral","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.10910","snapshot_observed_at":"2026-08-02T20:05:40.456510Z","title":"arXiv preprint arXiv:2506.10910 (2025)","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.24068","last_updated":"2026-02-27T14:58:13Z","snapshot_observed_at":"2026-08-02T20:05:38.920487Z","submitted_at":"2026-02-27T14:58:13Z","title":"A Novel Hierarchical Multi-Agent System for Payments Using LLMs","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-02T20:05:40.456510Z"},"links":{"cited_paper":"/paper/2506.10910","citing_paper":"/paper/2602.24068"},"observation_digest":"sha256:5846014cf98c289352063ff244e35224d39a263c1422d038fc59be81f13a6ab8","observation_id":"4c23408e-dc3c-4095-a984-bb2e6ebd51b7","resolution":{"observed_at":"2026-08-02T20:05:40.456510Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.10910","last_updated":"2025-06-12T17:22:37Z","snapshot_observed_at":"2026-07-06T21:41:09.873575Z","submitted_at":"2025-06-12T17:22:37Z","title":"Magistral","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.10910","snapshot_observed_at":"2026-08-02T20:05:56.999962Z","title":"Magistral.arXiv preprint arXiv:2506.10910,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.24173","last_updated":"2026-06-22T14:14:54Z","snapshot_observed_at":"2026-08-02T20:05:54.597975Z","submitted_at":"2026-02-27T16:52:52Z","title":"LemmaBench: A Live, Research-Level Benchmark to Evaluate LLM Capabilities in Mathematics","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-02T20:05:56.999962Z"},"links":{"cited_paper":"/paper/2506.10910","citing_paper":"/paper/2602.24173"},"observation_digest":"sha256:5e20330ebd897c85fb65e516da33cef2d32b2135ede2adaee5ee56f43f5da228","observation_id":"44806c9e-e9ac-4a7b-916d-e5f39cb499c4","resolution":{"observed_at":"2026-08-02T20:05:56.999962Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.10910","last_updated":"2025-06-12T17:22:37Z","snapshot_observed_at":"2026-07-06T21:41:09.873575Z","submitted_at":"2025-06-12T17:22:37Z","title":"Magistral","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.10910","snapshot_observed_at":"2026-08-02T17:05:14.494409Z","title":"arXiv preprint arXiv:2506.10910 (2025) 18 Authors Suppressed Due to Excessive Length","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2603.29759","last_updated":"2026-07-16T04:13:36Z","snapshot_observed_at":"2026-08-02T17:05:12.091673Z","submitted_at":"2026-03-31T14:00:10Z","title":"TSHA: A Benchmark for Visual Language Models in Trustworthy Safety Hazard Assessment Scenarios","version":3},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-02T17:05:14.494409Z"},"links":{"cited_paper":"/paper/2506.10910","citing_paper":"/paper/2603.29759"},"observation_digest":"sha256:4b3ad2a1d905eb9918f85a9f14895622a9b313c159646e26df967641297c2845","observation_id":"fee22f91-491a-47a8-8cf6-b9927dcdba70","resolution":{"observed_at":"2026-08-02T17:05:14.494409Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.10910","last_updated":"2025-06-12T17:22:37Z","snapshot_observed_at":"2026-07-06T21:41:09.873575Z","submitted_at":"2025-06-12T17:22:37Z","title":"Magistral","version":1},"cited_work":{"arxiv_id":"2506.10910","doi":"10.48550/arxiv.2506.10910","metadata_source":"arxiv_reference","pith_arxiv_id":"2506.10910","snapshot_observed_at":"2026-07-10T12:15:01.137692Z","title":"Magistral","venue":null,"work_id":"ae3fa57b-d81e-4022-ab02-51763900103b","year":2025},"citing_paper":{"arxiv_id":"2604.13371","last_updated":"2026-04-15T00:35:22Z","snapshot_observed_at":"2026-08-02T09:56:14.451966Z","submitted_at":"2026-04-15T00:35:22Z","title":"Empirical Evidence of Complexity-Induced Limits in Large Language Models on Finite Discrete State-Space Problems with Explicit Validity Constraints","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-05-10T14:12:45.438246Z"},"links":{"cited_paper":"/paper/2506.10910","citing_paper":"/paper/2604.13371"},"observation_digest":"sha256:37c86711a122d36d05f51c3edac0d2ee1b005c36a82b456e0a6c9311fa52ccfb","observation_id":"8a26308b-c52a-449b-b4aa-de02d9f608a0","resolution":{"observed_at":"2026-05-10T14:15:29.394776Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-05-23T10:52:47.043971+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-23T10:52:47.043971+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.10910","last_updated":"2025-06-12T17:22:37Z","snapshot_observed_at":"2026-07-06T21:41:09.873575Z","submitted_at":"2025-06-12T17:22:37Z","title":"Magistral","version":1},"cited_work":{"arxiv_id":"2506.10910","doi":"10.48550/arxiv.2506.10910","metadata_source":"arxiv_reference","pith_arxiv_id":"2506.10910","snapshot_observed_at":"2026-07-10T12:15:01.137692Z","title":"Magistral","venue":null,"work_id":"ae3fa57b-d81e-4022-ab02-51763900103b","year":2025},"citing_paper":{"arxiv_id":"2604.16259","last_updated":"2026-04-17T17:17:55Z","snapshot_observed_at":"2026-07-06T23:03:39.351412Z","submitted_at":"2026-04-17T17:17:55Z","title":"Beyond Distribution Sharpening: The Importance of Task Rewards","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-05-10T08:07:14.691463Z"},"links":{"cited_paper":"/paper/2506.10910","citing_paper":"/paper/2604.16259"},"observation_digest":"sha256:07f472b64c782ee100cbd56e4eff2b3d8417feea75ba1caee3d456c507f997b5","observation_id":"54215b74-247f-4322-b231-219345a6c660","resolution":{"observed_at":"2026-05-10T09:08:27.020410Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-05-23T10:52:47.043971+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-23T10:52:47.043971+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.10910","last_updated":"2025-06-12T17:22:37Z","snapshot_observed_at":"2026-07-06T21:41:09.873575Z","submitted_at":"2025-06-12T17:22:37Z","title":"Magistral","version":1},"cited_work":{"arxiv_id":"2506.10910","doi":"10.48550/arxiv.2506.10910","metadata_source":"arxiv_reference","pith_arxiv_id":"2506.10910","snapshot_observed_at":"2026-07-10T12:15:01.137692Z","title":"Magistral","venue":null,"work_id":"ae3fa57b-d81e-4022-ab02-51763900103b","year":2025},"citing_paper":{"arxiv_id":"2604.17614","last_updated":"2026-04-19T20:58:25Z","snapshot_observed_at":"2026-08-01T22:49:57.966435Z","submitted_at":"2026-04-19T20:58:25Z","title":"Characterizing Model-Native Skills","version":1},"reference_index":82,"source":"arxiv_source","source_observed_at":"2026-05-10T05:42:49.694715Z"},"links":{"cited_paper":"/paper/2506.10910","citing_paper":"/paper/2604.17614"},"observation_digest":"sha256:ae0ebe5f7388e8953d3a8ad1493f76f9d89a236a7123f13260a9c404944ecfdb","observation_id":"034b9bc8-cef4-4c22-ae27-69e9705552b9","resolution":{"observed_at":"2026-05-10T06:06:19.473510Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-05-23T10:52:47.043971+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-23T10:52:47.043971+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.10910","last_updated":"2025-06-12T17:22:37Z","snapshot_observed_at":"2026-07-06T21:41:09.873575Z","submitted_at":"2025-06-12T17:22:37Z","title":"Magistral","version":1},"cited_work":{"arxiv_id":"2506.10910","doi":"10.48550/arxiv.2506.10910","metadata_source":"arxiv_reference","pith_arxiv_id":"2506.10910","snapshot_observed_at":"2026-07-10T12:15:01.137692Z","title":"Magistral","venue":null,"work_id":"ae3fa57b-d81e-4022-ab02-51763900103b","year":2025},"citing_paper":{"arxiv_id":"2604.17957","last_updated":"2026-04-20T08:39:13Z","snapshot_observed_at":"2026-07-06T23:04:55.190916Z","submitted_at":"2026-04-20T08:39:13Z","title":"Process Reward Models Meet Planning: Generating Precise and Scalable Datasets for Step-Level Rewards","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-05-10T04:40:52.854907Z"},"links":{"cited_paper":"/paper/2506.10910","citing_paper":"/paper/2604.17957"},"observation_digest":"sha256:0d42747b30c1fa50890cc40690940afa8a39a51694dcf7ab3c1b13d5a44a06eb","observation_id":"fe227479-5036-4c4e-9c4a-efa2eac81788","resolution":{"observed_at":"2026-05-10T04:45:21.193991Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-05-23T10:52:47.043971+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-23T10:52:47.043971+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.10910","last_updated":"2025-06-12T17:22:37Z","snapshot_observed_at":"2026-07-06T21:41:09.873575Z","submitted_at":"2025-06-12T17:22:37Z","title":"Magistral","version":1},"cited_work":{"arxiv_id":"2506.10910","doi":"10.48550/arxiv.2506.10910","metadata_source":"arxiv_reference","pith_arxiv_id":"2506.10910","snapshot_observed_at":"2026-07-10T12:15:01.137692Z","title":"Magistral","venue":null,"work_id":"ae3fa57b-d81e-4022-ab02-51763900103b","year":2025},"citing_paper":{"arxiv_id":"2604.19440","last_updated":"2026-04-21T13:16:45Z","snapshot_observed_at":"2026-08-03T04:28:53.538807Z","submitted_at":"2026-04-21T13:16:45Z","title":"What Makes an LLM a Good Optimizer? A Trajectory Analysis of LLM-Guided Evolutionary Search","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-10T02:19:18.121220Z"},"links":{"cited_paper":"/paper/2506.10910","citing_paper":"/paper/2604.19440"},"observation_digest":"sha256:11a9eb46578827af21640681e0628e50dc6accf8a7296dbe0900b9f63c8dff44","observation_id":"58c87324-1eda-4b9c-9218-514685fecf62","resolution":{"observed_at":"2026-05-11T13:06:05.595526Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-05-23T10:52:47.043971+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-23T10:52:47.043971+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.10910","last_updated":"2025-06-12T17:22:37Z","snapshot_observed_at":"2026-07-06T21:41:09.873575Z","submitted_at":"2025-06-12T17:22:37Z","title":"Magistral","version":1},"cited_work":{"arxiv_id":"2506.10910","doi":"10.48550/arxiv.2506.10910","metadata_source":"arxiv_reference","pith_arxiv_id":"2506.10910","snapshot_observed_at":"2026-07-10T12:15:01.137692Z","title":"Magistral","venue":null,"work_id":"ae3fa57b-d81e-4022-ab02-51763900103b","year":2025},"citing_paper":{"arxiv_id":"2604.21593","last_updated":"2026-05-03T05:05:27Z","snapshot_observed_at":"2026-08-02T15:02:48.325985Z","submitted_at":"2026-04-23T12:19:14Z","title":"Language as a Latent Variable for Reasoning Optimization","version":2},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-05-09T21:40:37.499246Z"},"links":{"cited_paper":"/paper/2506.10910","citing_paper":"/paper/2604.21593"},"observation_digest":"sha256:14cb84c988022ea37c194373d9964486659c45f0d5697d01fe5a82806af308b4","observation_id":"68576317-78a5-4df6-8851-12825ea438f8","resolution":{"observed_at":"2026-05-11T14:31:06.613349Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-05-23T10:52:47.043971+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-23T10:52:47.043971+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.10910","last_updated":"2025-06-12T17:22:37Z","snapshot_observed_at":"2026-07-06T21:41:09.873575Z","submitted_at":"2025-06-12T17:22:37Z","title":"Magistral","version":1},"cited_work":{"arxiv_id":"2506.10910","doi":"10.48550/arxiv.2506.10910","metadata_source":"arxiv_reference","pith_arxiv_id":"2506.10910","snapshot_observed_at":"2026-07-10T12:15:01.137692Z","title":"Magistral","venue":null,"work_id":"ae3fa57b-d81e-4022-ab02-51763900103b","year":2025},"citing_paper":{"arxiv_id":"2604.23813","last_updated":"2026-04-26T17:26:06Z","snapshot_observed_at":"2026-07-06T23:09:58.193241Z","submitted_at":"2026-04-26T17:26:06Z","title":"ShredBench: Evaluating the Semantic Reasoning Capabilities of Multimodal LLMs in Document Reconstruction","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-08T06:34:56.032634Z"},"links":{"cited_paper":"/paper/2506.10910","citing_paper":"/paper/2604.23813"},"observation_digest":"sha256:282601adda5f11c7123bad51a0e816acfc317b8cf55cd349c24819f81a6701ef","observation_id":"163e5329-0c8b-416f-b23e-05fd51ef83ca","resolution":{"observed_at":"2026-05-11T21:11:15.966281Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-05-23T10:52:47.043971+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-23T10:52:47.043971+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.10910","last_updated":"2025-06-12T17:22:37Z","snapshot_observed_at":"2026-07-06T21:41:09.873575Z","submitted_at":"2025-06-12T17:22:37Z","title":"Magistral","version":1},"cited_work":{"arxiv_id":"2506.10910","doi":"10.48550/arxiv.2506.10910","metadata_source":"arxiv_reference","pith_arxiv_id":"2506.10910","snapshot_observed_at":"2026-07-10T12:15:01.137692Z","title":"Magistral","venue":null,"work_id":"ae3fa57b-d81e-4022-ab02-51763900103b","year":2025},"citing_paper":{"arxiv_id":"2605.00817","last_updated":"2026-08-03T16:34:49Z","snapshot_observed_at":"2026-08-04T20:21:39.332839Z","submitted_at":"2026-05-01T17:55:47Z","title":"When LLMs Stop Following Steps: A Diagnostic Study of Procedural Execution in Language Models","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-05-09T18:51:59.402906Z"},"links":{"cited_paper":"/paper/2506.10910","citing_paper":"/paper/2605.00817"},"observation_digest":"sha256:43ba01289512962c73176aad3ea305add834eb6287580e53ed06b8c772f04c78","observation_id":"3288c138-cde4-4090-805b-18756e46e300","resolution":{"observed_at":"2026-05-11T16:06:06.496149Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-05-23T10:52:47.043971+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-23T10:52:47.043971+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.10910","last_updated":"2025-06-12T17:22:37Z","snapshot_observed_at":"2026-07-06T21:41:09.873575Z","submitted_at":"2025-06-12T17:22:37Z","title":"Magistral","version":1},"cited_work":{"arxiv_id":"2506.10910","doi":"10.48550/arxiv.2506.10910","metadata_source":"arxiv_reference","pith_arxiv_id":"2506.10910","snapshot_observed_at":"2026-07-10T12:15:01.137692Z","title":"Magistral","venue":null,"work_id":"ae3fa57b-d81e-4022-ab02-51763900103b","year":2025},"citing_paper":{"arxiv_id":"2605.00817","last_updated":"2026-08-03T16:34:49Z","snapshot_observed_at":"2026-08-04T20:21:39.332839Z","submitted_at":"2026-05-01T17:55:47Z","title":"When LLMs Stop Following Steps: A Diagnostic Study of Procedural Execution in Language Models","version":3},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-07-01T07:48:28.381924Z"},"links":{"cited_paper":"/paper/2506.10910","citing_paper":"/paper/2605.00817"},"observation_digest":"sha256:8dce37a06ea5d38d41748ce468648b8efdf8562344d6c78d97ded8d32f3f10d9","observation_id":"79c6f8be-3c78-4651-b24a-d1ed5273043c","resolution":{"observed_at":"2026-07-01T07:55:31.085847Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-05-23T10:52:47.043971+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-23T10:52:47.043971+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.10910","last_updated":"2025-06-12T17:22:37Z","snapshot_observed_at":"2026-07-06T21:41:09.873575Z","submitted_at":"2025-06-12T17:22:37Z","title":"Magistral","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.10910","snapshot_observed_at":"2026-08-04T05:20:33.269530Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2605.00817","last_updated":"2026-08-03T16:34:49Z","snapshot_observed_at":"2026-08-04T20:21:39.332839Z","submitted_at":"2026-05-01T17:55:47Z","title":"When LLMs Stop Following Steps: A Diagnostic Study of Procedural Execution in Language Models","version":4},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-04T05:20:33.269530Z"},"links":{"cited_paper":"/paper/2506.10910","citing_paper":"/paper/2605.00817"},"observation_digest":"sha256:8eeff3afa4a1b36002570770aa8b9cf33ce0844ebddc848f8af6fbc0290c690b","observation_id":"a26de0a7-cdf0-4b87-9f9f-cda7263cef3d","resolution":{"observed_at":"2026-08-04T05:20:33.269530Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.10910","last_updated":"2025-06-12T17:22:37Z","snapshot_observed_at":"2026-07-06T21:41:09.873575Z","submitted_at":"2025-06-12T17:22:37Z","title":"Magistral","version":1},"cited_work":{"arxiv_id":"2506.10910","doi":"10.48550/arxiv.2506.10910","metadata_source":"arxiv_reference","pith_arxiv_id":"2506.10910","snapshot_observed_at":"2026-07-10T12:15:01.137692Z","title":"Magistral","venue":null,"work_id":"ae3fa57b-d81e-4022-ab02-51763900103b","year":2025},"citing_paper":{"arxiv_id":"2605.17497","last_updated":"2026-05-17T15:14:24Z","snapshot_observed_at":"2026-08-02T00:48:07.019962Z","submitted_at":"2026-05-17T15:14:24Z","title":"Self-Supervised On-Policy Distillation for Reasoning Language Models","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-05-20T14:42:55.368104Z"},"links":{"cited_paper":"/paper/2506.10910","citing_paper":"/paper/2605.17497"},"observation_digest":"sha256:087823c197621699a88a1fad68f6ee418841d906ab12122b8161ead848951041","observation_id":"8ba3c1fa-e843-4348-b259-15b6efe9335f","resolution":{"observed_at":"2026-05-20T14:43:21.816674Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-05-23T10:52:47.043971+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-23T10:52:47.043971+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.10910","last_updated":"2025-06-12T17:22:37Z","snapshot_observed_at":"2026-07-06T21:41:09.873575Z","submitted_at":"2025-06-12T17:22:37Z","title":"Magistral","version":1},"cited_work":{"arxiv_id":"2506.10910","doi":"10.48550/arxiv.2506.10910","metadata_source":"arxiv_reference","pith_arxiv_id":"2506.10910","snapshot_observed_at":"2026-07-10T12:15:01.137692Z","title":"Magistral","venue":null,"work_id":"ae3fa57b-d81e-4022-ab02-51763900103b","year":2025},"citing_paper":{"arxiv_id":"2605.23926","last_updated":"2026-04-21T05:32:02Z","snapshot_observed_at":"2026-07-06T23:34:03.934151Z","submitted_at":"2026-04-21T05:32:02Z","title":"How Much Thinking is Enough? Quantifying and Understanding Redundancy in LLM Reasoning","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-05T10:18:18.717871Z"},"links":{"cited_paper":"/paper/2506.10910","citing_paper":"/paper/2605.23926"},"observation_digest":"sha256:b0bbb8384f63d9d94b7a784fd339e5c6e08afc0371225b046ed7798ca2d21e9c","observation_id":"3b6793d2-7bf7-4271-80e8-b6900abc0ea9","resolution":{"observed_at":"2026-07-05T10:20:57.186398Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-05-23T10:52:47.043971+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-23T10:52:47.043971+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.10910","last_updated":"2025-06-12T17:22:37Z","snapshot_observed_at":"2026-07-06T21:41:09.873575Z","submitted_at":"2025-06-12T17:22:37Z","title":"Magistral","version":1},"cited_work":{"arxiv_id":"2506.10910","doi":"10.48550/arxiv.2506.10910","metadata_source":"arxiv_reference","pith_arxiv_id":"2506.10910","snapshot_observed_at":"2026-07-10T12:15:01.137692Z","title":"Magistral","venue":null,"work_id":"ae3fa57b-d81e-4022-ab02-51763900103b","year":2025},"citing_paper":{"arxiv_id":"2606.02113","last_updated":"2026-06-01T11:45:50Z","snapshot_observed_at":"2026-07-06T23:42:35.063977Z","submitted_at":"2026-06-01T11:45:50Z","title":"A Primer in Post-Training Reasoning Data: What We Know About How It Works","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-06-28T14:40:21.583101Z"},"links":{"cited_paper":"/paper/2506.10910","citing_paper":"/paper/2606.02113"},"observation_digest":"sha256:57d07bf80eee5116dba8475daebcdfa290490a8512c99963ac70cc98c3cc5f3a","observation_id":"1b858ce7-4e44-4d77-a08b-8ca5bbb14aa8","resolution":{"observed_at":"2026-07-01T23:06:20.508069Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-05-23T10:52:47.043971+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-23T10:52:47.043971+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.10910","last_updated":"2025-06-12T17:22:37Z","snapshot_observed_at":"2026-07-06T21:41:09.873575Z","submitted_at":"2025-06-12T17:22:37Z","title":"Magistral","version":1},"cited_work":{"arxiv_id":"2506.10910","doi":"10.48550/arxiv.2506.10910","metadata_source":"arxiv_reference","pith_arxiv_id":"2506.10910","snapshot_observed_at":"2026-07-10T12:15:01.137692Z","title":"Magistral","venue":null,"work_id":"ae3fa57b-d81e-4022-ab02-51763900103b","year":2025},"citing_paper":{"arxiv_id":"2606.07422","last_updated":"2026-06-08T19:53:59Z","snapshot_observed_at":"2026-08-02T12:02:10.674820Z","submitted_at":"2026-06-05T16:16:59Z","title":"The Masked Advantage: Uncovering Local-Language Access to Cultural Knowledge in LLMs","version":2},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-06-27T22:08:45.988451Z"},"links":{"cited_paper":"/paper/2506.10910","citing_paper":"/paper/2606.07422"},"observation_digest":"sha256:8ad75ab0d113dc8bc92b48ea02db20e793de40a7f285d9805a089216ec00048d","observation_id":"a2212d16-e9e4-4e84-9124-6dc20dae2279","resolution":{"observed_at":"2026-07-02T17:07:13.147843Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-05-23T10:52:47.043971+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-23T10:52:47.043971+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.10910","last_updated":"2025-06-12T17:22:37Z","snapshot_observed_at":"2026-07-06T21:41:09.873575Z","submitted_at":"2025-06-12T17:22:37Z","title":"Magistral","version":1},"cited_work":{"arxiv_id":"2506.10910","doi":"10.48550/arxiv.2506.10910","metadata_source":"arxiv_reference","pith_arxiv_id":"2506.10910","snapshot_observed_at":"2026-07-10T12:15:01.137692Z","title":"Magistral","venue":null,"work_id":"ae3fa57b-d81e-4022-ab02-51763900103b","year":2025},"citing_paper":{"arxiv_id":"2606.17220","last_updated":"2026-06-15T19:09:31Z","snapshot_observed_at":"2026-07-06T23:52:52.701429Z","submitted_at":"2026-06-15T19:09:31Z","title":"When Rules Learn: A Self-Evolving Agent for Legal Case Retrieval","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-06-27T03:35:30.841853Z"},"links":{"cited_paper":"/paper/2506.10910","citing_paper":"/paper/2606.17220"},"observation_digest":"sha256:514859eafe058cfded0127f11e45bf68d29c240af91fda1bac8943d2f441be31","observation_id":"25d944ad-0225-4817-aa40-72d6a6956ee1","resolution":{"observed_at":"2026-07-03T17:58:47.158738Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-05-23T10:52:47.043971+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-23T10:52:47.043971+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.10910","last_updated":"2025-06-12T17:22:37Z","snapshot_observed_at":"2026-07-06T21:41:09.873575Z","submitted_at":"2025-06-12T17:22:37Z","title":"Magistral","version":1},"cited_work":{"arxiv_id":"2506.10910","doi":"10.48550/arxiv.2506.10910","metadata_source":"arxiv_reference","pith_arxiv_id":"2506.10910","snapshot_observed_at":"2026-07-10T12:15:01.137692Z","title":"Magistral","venue":null,"work_id":"ae3fa57b-d81e-4022-ab02-51763900103b","year":2025},"citing_paper":{"arxiv_id":"2606.18284","last_updated":"2026-06-10T02:04:29Z","snapshot_observed_at":"2026-07-06T23:53:45.117607Z","submitted_at":"2026-06-10T02:04:29Z","title":"Breaking the Solver Bottleneck: Training Task Generators at the Learnable Frontier","version":1},"reference_index":133,"source":"arxiv_source","source_observed_at":"2026-06-27T10:36:09.211639Z"},"links":{"cited_paper":"/paper/2506.10910","citing_paper":"/paper/2606.18284"},"observation_digest":"sha256:b1b9d01d01af6264a5ba103acc1272dd33c59ccbc1f925412ac1101f5bcf7369","observation_id":"3658b2d5-21c7-4ed9-b73f-9483efdbd014","resolution":{"observed_at":"2026-07-03T09:07:47.307984Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-05-23T10:52:47.043971+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-23T10:52:47.043971+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.10910","last_updated":"2025-06-12T17:22:37Z","snapshot_observed_at":"2026-07-06T21:41:09.873575Z","submitted_at":"2025-06-12T17:22:37Z","title":"Magistral","version":1},"cited_work":{"arxiv_id":"2506.10910","doi":"10.48550/arxiv.2506.10910","metadata_source":"arxiv_reference","pith_arxiv_id":"2506.10910","snapshot_observed_at":"2026-07-10T12:15:01.137692Z","title":"Magistral","venue":null,"work_id":"ae3fa57b-d81e-4022-ab02-51763900103b","year":2025},"citing_paper":{"arxiv_id":"2606.30789","last_updated":"2026-07-01T14:28:25Z","snapshot_observed_at":"2026-08-03T01:34:16.719337Z","submitted_at":"2026-06-29T18:19:09Z","title":"Predictable GRPO: A Closed-Form Model of Training Dynamics","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-01T06:40:47.911021Z"},"links":{"cited_paper":"/paper/2506.10910","citing_paper":"/paper/2606.30789"},"observation_digest":"sha256:b27e3465fa4cb7f7c1371a886d43a0b184e61003f93d9c22d54cf22eff15a8d8","observation_id":"91a0ab2b-7c07-45aa-9722-061ead9fff09","resolution":{"observed_at":"2026-07-01T06:45:29.603748Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-05-23T10:52:47.043971+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-23T10:52:47.043971+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.10910","last_updated":"2025-06-12T17:22:37Z","snapshot_observed_at":"2026-07-06T21:41:09.873575Z","submitted_at":"2025-06-12T17:22:37Z","title":"Magistral","version":1},"cited_work":{"arxiv_id":"2506.10910","doi":"10.48550/arxiv.2506.10910","metadata_source":"arxiv_reference","pith_arxiv_id":"2506.10910","snapshot_observed_at":"2026-07-10T12:15:01.137692Z","title":"Magistral","venue":null,"work_id":"ae3fa57b-d81e-4022-ab02-51763900103b","year":2025},"citing_paper":{"arxiv_id":"2606.30789","last_updated":"2026-07-01T14:28:25Z","snapshot_observed_at":"2026-08-03T01:34:16.719337Z","submitted_at":"2026-06-29T18:19:09Z","title":"Predictable GRPO: A Closed-Form Model of Training Dynamics","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-02T20:26:15.667646Z"},"links":{"cited_paper":"/paper/2506.10910","citing_paper":"/paper/2606.30789"},"observation_digest":"sha256:47d66a89f419b968fc2e4a3ab7bd0bd91747ab099d0a6a9546d7cf95f22f5911","observation_id":"c4f07051-995b-4380-ae9c-81404c659281","resolution":{"observed_at":"2026-07-02T20:27:21.687480Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-05-23T10:52:47.043971+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-23T10:52:47.043971+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.10910","last_updated":"2025-06-12T17:22:37Z","snapshot_observed_at":"2026-07-06T21:41:09.873575Z","submitted_at":"2025-06-12T17:22:37Z","title":"Magistral","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.10910","snapshot_observed_at":"2026-07-14T14:12:44.286699Z","title":null,"venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.10114","last_updated":"2026-07-11T04:30:43Z","snapshot_observed_at":"2026-07-16T23:18:11.869146Z","submitted_at":"2026-07-11T04:30:43Z","title":"Cost of Reasoning in non-English Languages: A Case Study on Japanese","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-07-14T14:12:44.286699Z"},"links":{"cited_paper":"/paper/2506.10910","citing_paper":"/paper/2607.10114"},"observation_digest":"sha256:5251b90bd371d43d252bdf23ae60ab23816ca143d55fb89ed9e1f68050433c71","observation_id":"7dbec6d2-9bca-4ca5-9c09-a0e8a27e7e55","resolution":{"observed_at":"2026-07-14T14:12:44.286699Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.10910","last_updated":"2025-06-12T17:22:37Z","snapshot_observed_at":"2026-07-06T21:41:09.873575Z","submitted_at":"2025-06-12T17:22:37Z","title":"Magistral","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.10910","snapshot_observed_at":"2026-08-01T08:36:30.534949Z","title":"arXiv preprint arXiv:2506.10910 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.21090","last_updated":"2026-07-23T09:20:38Z","snapshot_observed_at":"2026-08-03T19:12:57.157884Z","submitted_at":"2026-07-23T09:20:38Z","title":"Training Large Language Models for Self-Explanation Faithfulness","version":1},"reference_index":145,"source":"arxiv_source","source_observed_at":"2026-08-01T08:36:30.534949Z"},"links":{"cited_paper":"/paper/2506.10910","citing_paper":"/paper/2607.21090"},"observation_digest":"sha256:2a5b0878e0e7b973882ddf84a2fa059248853f60456415a15ce52ba22bff5888","observation_id":"1941e2df-6267-42b0-98bb-c2f57dc50f90","resolution":{"observed_at":"2026-08-01T08:36:30.534949Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.10910","last_updated":"2025-06-12T17:22:37Z","snapshot_observed_at":"2026-07-06T21:41:09.873575Z","submitted_at":"2025-06-12T17:22:37Z","title":"Magistral","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.10910","snapshot_observed_at":"2026-08-01T11:48:50.895042Z","title":"In Proceedings of the Ninth Conference on Machine Translation, pages 1440–1453, Miami, Florida, USA","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.26640","last_updated":"2026-07-29T09:01:59Z","snapshot_observed_at":"2026-08-01T23:27:59.275842Z","submitted_at":"2026-07-29T09:01:59Z","title":"Contrastive ESA: Human Evaluation of Multiple Translations at Once","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-01T11:48:50.895042Z"},"links":{"cited_paper":"/paper/2506.10910","citing_paper":"/paper/2607.26640"},"observation_digest":"sha256:080d04172709b89abc44106bfea8a06429096434f4695c7f8004dc71c49e2b48","observation_id":"b9076e27-ef59-4b11-8172-d2e50da442da","resolution":{"observed_at":"2026-08-01T11:48:50.895042Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.10910","last_updated":"2025-06-12T17:22:37Z","snapshot_observed_at":"2026-07-06T21:41:09.873575Z","submitted_at":"2025-06-12T17:22:37Z","title":"Magistral","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.10910","snapshot_observed_at":"2026-08-04T10:56:20.082102Z","title":"Magistral.arXiv preprint arXiv:2506.10910, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.02238","last_updated":"2026-08-03T13:51:12Z","snapshot_observed_at":"2026-08-04T20:22:27.389229Z","submitted_at":"2026-08-03T13:51:12Z","title":"Trustworthy AI in Digital Health: A Comprehensive Review of Robustness and Explainability","version":1},"reference_index":108,"source":"pdf_text","source_observed_at":"2026-08-04T10:56:20.082102Z"},"links":{"cited_paper":"/paper/2506.10910","citing_paper":"/paper/2608.02238"},"observation_digest":"sha256:6b98bb9d41ff2679e62036ff57a52aa805b902ddf01381b9609ff42972b39b78","observation_id":"ebb49bd1-9cb4-4867-8d6d-5f47806d1d42","resolution":{"observed_at":"2026-08-04T10:56:20.082102Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2506.10910/citation-record","integrity":"/paper/2506.10910/integrity","json":"/paper/2506.10910/citation-record.json","paper":"/paper/2506.10910"},"outbound":[],"paper":{"arxiv_id":"2506.10910","last_updated":"2025-06-12T17:22:37Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-07-06T21:41:09.873575Z","submitted_at":"2025-06-12T17:22:37Z","title":"Magistral"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"thesis":"As of 4 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 33 inbound Pith citation observations for arXiv:2506.10910."}