{"as_of":"2026-08-09T18:46:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7508b097a69d9d3126c0abba84b4e1cd34f2f5d1b835c0c77243e622e0af5ad0","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":23,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":23,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":23,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":23,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T12:37:25.734725Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"arxiv_reference","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":2,"observed_at":"2026-08-05T02:28:24.338817Z","source":"arxiv_reference"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2412.00535","last_updated":"2025-05-12T10:24:14Z","snapshot_observed_at":"2026-07-06T19:59:28.832182Z","submitted_at":"2024-11-30T16:58:42Z","title":"FullStack Bench: Evaluating LLMs as Full Stack Coders","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.00535","snapshot_observed_at":"2026-08-08T12:37:25.734725Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.07487","last_updated":"2025-02-11T11:46:38Z","snapshot_observed_at":"2026-08-08T12:32:06.365109Z","submitted_at":"2025-02-11T11:46:38Z","title":"Multi-Agent Collaboration for Multilingual Code Instruction Tuning","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-08T12:37:25.734725Z"},"links":{"cited_paper":"/paper/2412.00535","citing_paper":"/paper/2502.07487"},"observation_digest":"sha256:223bf57c3eddd39bf3042a571a7978d65f6b0a556f1bc9341dc6bcdc6ab52218","observation_id":"36a40ee4-029d-4743-aa5e-5805644c6875","resolution":{"observed_at":"2026-08-08T12:37:25.734725Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.00535","last_updated":"2025-05-12T10:24:14Z","snapshot_observed_at":"2026-07-06T19:59:28.832182Z","submitted_at":"2024-11-30T16:58:42Z","title":"FullStack Bench: Evaluating LLMs as Full Stack Coders","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.00535","snapshot_observed_at":"2026-08-07T11:04:56.816308Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.03524","last_updated":"2025-06-05T03:26:05Z","snapshot_observed_at":"2026-08-09T04:58:38.414289Z","submitted_at":"2025-06-04T03:17:19Z","title":"Seed-Coder: Let the Code Model Curate Data for Itself","version":2},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-07T11:04:56.816308Z"},"links":{"cited_paper":"/paper/2412.00535","citing_paper":"/paper/2506.03524"},"observation_digest":"sha256:5b27cfd7ca24dd0168b094e75af9d14581712659106813292054467a55bd04aa","observation_id":"4e36ea01-a816-479b-8e55-e5e83f090ed0","resolution":{"observed_at":"2026-08-07T11:04:56.816308Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.00535","last_updated":"2025-05-12T10:24:14Z","snapshot_observed_at":"2026-07-06T19:59:28.832182Z","submitted_at":"2024-11-30T16:58:42Z","title":"FullStack Bench: Evaluating LLMs as Full Stack Coders","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.00535","snapshot_observed_at":"2026-08-07T10:16:52.892806Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.05817","last_updated":"2025-06-06T07:29:01Z","snapshot_observed_at":"2026-08-09T09:46:15.359418Z","submitted_at":"2025-06-06T07:29:01Z","title":"CodeContests+: High-Quality Test Case Generation for Competitive Programming","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T10:16:52.892806Z"},"links":{"cited_paper":"/paper/2412.00535","citing_paper":"/paper/2506.05817"},"observation_digest":"sha256:f50a8795e6b81c3b36dbd802b131f6fe2d50b92f9e365e6616e7e9f1f83ca379","observation_id":"3685dfb9-cbbf-440f-81cb-00da98b0e11c","resolution":{"observed_at":"2026-08-07T10:16:52.892806Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.00535","last_updated":"2025-05-12T10:24:14Z","snapshot_observed_at":"2026-07-06T19:59:28.832182Z","submitted_at":"2024-11-30T16:58:42Z","title":"FullStack Bench: Evaluating LLMs as Full Stack Coders","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.00535","snapshot_observed_at":"2026-08-07T04:30:43.658947Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.10525","last_updated":"2025-06-12T09:43:48Z","snapshot_observed_at":"2026-08-08T21:26:08.789047Z","submitted_at":"2025-06-12T09:43:48Z","title":"AdaptiveLLM: A Framework for Selecting Optimal Cost-Efficient LLM for Code-Generation Based on CoT Length","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-07T04:30:43.658947Z"},"links":{"cited_paper":"/paper/2412.00535","citing_paper":"/paper/2506.10525"},"observation_digest":"sha256:72a5d6958715707a5ac228bf989da4bd7c33facf8dd11062fe0e25527237456d","observation_id":"4e68e30d-277c-49e1-95bf-b374a7ea367d","resolution":{"observed_at":"2026-08-07T04:30:43.658947Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.00535","last_updated":"2025-05-12T10:24:14Z","snapshot_observed_at":"2026-07-06T19:59:28.832182Z","submitted_at":"2024-11-30T16:58:42Z","title":"FullStack Bench: Evaluating LLMs as Full Stack Coders","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.00535","snapshot_observed_at":"2026-08-06T17:51:13.610216Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.09866","last_updated":"2025-07-14T02:36:27Z","snapshot_observed_at":"2026-08-09T06:49:53.008039Z","submitted_at":"2025-07-14T02:36:27Z","title":"Turning the Tide: Repository-based Code Reflection","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-06T17:51:13.610216Z"},"links":{"cited_paper":"/paper/2412.00535","citing_paper":"/paper/2507.09866"},"observation_digest":"sha256:d8b19e3ae1cade42a03e95367b128b529252539ebd0c627201913ed7bce71c2d","observation_id":"bc990494-3d29-4615-ba53-57ab17dee1af","resolution":{"observed_at":"2026-08-06T17:51:13.610216Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.00535","last_updated":"2025-05-12T10:24:14Z","snapshot_observed_at":"2026-07-06T19:59:28.832182Z","submitted_at":"2024-11-30T16:58:42Z","title":"FullStack Bench: Evaluating LLMs as Full Stack Coders","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.00535","snapshot_observed_at":"2026-08-06T11:44:34.021098Z","title":"Fullstack bench: Evaluating llms as full stack coder","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.22462","last_updated":"2025-08-01T10:07:37Z","snapshot_observed_at":"2026-08-09T15:17:03.370644Z","submitted_at":"2025-07-30T08:08:48Z","title":"IFEvalCode: Controlled Code Generation","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-06T11:44:34.021098Z"},"links":{"cited_paper":"/paper/2412.00535","citing_paper":"/paper/2507.22462"},"observation_digest":"sha256:6b3b0ad88b3990342656771073cc08ea6eec3f32ff6388d49a5c40a2d451c79c","observation_id":"cc06240c-ddf5-42b5-bc80-efc8a971c01d","resolution":{"observed_at":"2026-08-06T11:44:34.021098Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.00535","last_updated":"2025-05-12T10:24:14Z","snapshot_observed_at":"2026-07-06T19:59:28.832182Z","submitted_at":"2024-11-30T16:58:42Z","title":"FullStack Bench: Evaluating LLMs as Full Stack Coders","version":6},"cited_work":{"arxiv_id":"2412.00535","doi":"10.48550/arxiv.2412.00535","metadata_source":"arxiv_reference","pith_arxiv_id":"2412.00535","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Fullstackbench: Evaluatingllmsasfullstackcoders","venue":"arXiv (Cornell University)","work_id":"569bc5cb-f61d-4b46-8553-07cf2b67cece","year":2024},"citing_paper":{"arxiv_id":"2508.05748","last_updated":"2025-09-01T03:21:53Z","snapshot_observed_at":"2026-08-03T10:59:41.466285Z","submitted_at":"2025-08-07T18:03:50Z","title":"WebWatcher: Breaking New Frontier of Vision-Language Deep Research Agent","version":3},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-15T18:56:23.817544Z"},"links":{"cited_paper":"/paper/2412.00535","citing_paper":"/paper/2508.05748"},"observation_digest":"sha256:abd4d2c1e00dfe0639d0bea7a97590f204d53e3cc9c4cd735e4e3743324e351e","observation_id":"06a31577-b3b6-41d8-a96b-58f6ee127d9c","resolution":{"observed_at":"2026-05-15T18:56:23.902839Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.00535","last_updated":"2025-05-12T10:24:14Z","snapshot_observed_at":"2026-07-06T19:59:28.832182Z","submitted_at":"2024-11-30T16:58:42Z","title":"FullStack Bench: Evaluating LLMs as Full Stack Coders","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.00535","snapshot_observed_at":"2026-08-05T22:28:15.505496Z","title":"Fullstack bench: Evaluating llms as full stack coders,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.06921","last_updated":"2025-08-18T06:09:55Z","snapshot_observed_at":"2026-08-07T13:19:56.946488Z","submitted_at":"2025-08-09T10:22:48Z","title":"Vibration-Based Energy Metric for Restoring Needle Alignment in Autonomous Robotic Ultrasound","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-05T22:28:15.505496Z"},"links":{"cited_paper":"/paper/2412.00535","citing_paper":"/paper/2508.06921"},"observation_digest":"sha256:4b928797465760d678680b09c8183dc0bb28a4ee0a0bb47856292b916aa2436e","observation_id":"691aaab4-f958-4149-b143-d5c85afa298b","resolution":{"observed_at":"2026-08-05T22:28:15.505496Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.00535","last_updated":"2025-05-12T10:24:14Z","snapshot_observed_at":"2026-07-06T19:59:28.832182Z","submitted_at":"2024-11-30T16:58:42Z","title":"FullStack Bench: Evaluating LLMs as Full Stack Coders","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.00535","snapshot_observed_at":"2026-08-05T12:56:35.116898Z","title":"Fullstack bench: Evaluating llms as full stack coder","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.01142","last_updated":"2025-09-01T05:30:56Z","snapshot_observed_at":"2026-08-08T06:17:53.010186Z","submitted_at":"2025-09-01T05:30:56Z","title":"Dream-Coder 7B: An Open Diffusion Language Model for Code","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-05T12:56:35.116898Z"},"links":{"cited_paper":"/paper/2412.00535","citing_paper":"/paper/2509.01142"},"observation_digest":"sha256:e9a5505dbf6e42f7e8fa49804334e20860111cd984e2f1aa171b6ce84bed00f9","observation_id":"84d01275-a476-432f-adc0-7b9059005a7f","resolution":{"observed_at":"2026-08-05T12:56:35.116898Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.00535","last_updated":"2025-05-12T10:24:14Z","snapshot_observed_at":"2026-07-06T19:59:28.832182Z","submitted_at":"2024-11-30T16:58:42Z","title":"FullStack Bench: Evaluating LLMs as Full Stack Coders","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.00535","snapshot_observed_at":"2026-08-04T09:39:47.399871Z","title":"5 Pierre Chambon, Baptiste Roziere, Benoit Sagot, and Gabriel Synnaeve","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2510.17868","last_updated":"2026-07-15T10:42:46Z","snapshot_observed_at":"2026-08-08T11:51:53.258994Z","submitted_at":"2025-10-16T05:07:12Z","title":"UniCode: Augmenting Evaluation for Code Reasoning","version":3},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-04T09:39:47.399871Z"},"links":{"cited_paper":"/paper/2412.00535","citing_paper":"/paper/2510.17868"},"observation_digest":"sha256:edf6ff29d5944b8a29aaae5732a4150b687b37b5817e6327067ca6bcfc5a81d0","observation_id":"2078eff1-5f64-449f-ac54-1769f309f2dc","resolution":{"observed_at":"2026-08-04T09:39:47.399871Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.00535","last_updated":"2025-05-12T10:24:14Z","snapshot_observed_at":"2026-07-06T19:59:28.832182Z","submitted_at":"2024-11-30T16:58:42Z","title":"FullStack Bench: Evaluating LLMs as Full Stack Coders","version":6},"cited_work":{"arxiv_id":"2412.00535","doi":"10.48550/arxiv.2412.00535","metadata_source":"arxiv_reference","pith_arxiv_id":"2412.00535","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Fullstackbench: Evaluatingllmsasfullstackcoders","venue":"arXiv (Cornell University)","work_id":"569bc5cb-f61d-4b46-8553-07cf2b67cece","year":2024},"citing_paper":{"arxiv_id":"2601.04809","last_updated":"2026-05-04T13:55:24Z","snapshot_observed_at":"2026-07-06T22:41:05.793337Z","submitted_at":"2026-01-08T10:42:04Z","title":"SCALER:Synthetic Scalable Adaptive Learning Environment for Reasoning","version":5},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-16T16:24:04.132572Z"},"links":{"cited_paper":"/paper/2412.00535","citing_paper":"/paper/2601.04809"},"observation_digest":"sha256:e886ce4d082603571ed15a9d9191cb5d71b005cdcb23a1894d210c0c6ccd990c","observation_id":"6d7713cf-1c96-4680-9b4b-8991009a3ea7","resolution":{"observed_at":"2026-05-16T16:28:05.743083Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.00535","last_updated":"2025-05-12T10:24:14Z","snapshot_observed_at":"2026-07-06T19:59:28.832182Z","submitted_at":"2024-11-30T16:58:42Z","title":"FullStack Bench: Evaluating LLMs as Full Stack Coders","version":6},"cited_work":{"arxiv_id":"2412.00535","doi":"10.48550/arxiv.2412.00535","metadata_source":"arxiv_reference","pith_arxiv_id":"2412.00535","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Fullstackbench: Evaluatingllmsasfullstackcoders","venue":"arXiv (Cornell University)","work_id":"569bc5cb-f61d-4b46-8553-07cf2b67cece","year":2024},"citing_paper":{"arxiv_id":"2604.02794","last_updated":"2026-04-03T07:02:13Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-04-03T07:02:13Z","title":"CharTool: Tool-Integrated Visual Reasoning for Chart Understanding","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-05-13T20:07:23.153064Z"},"links":{"cited_paper":"/paper/2412.00535","citing_paper":"/paper/2604.02794"},"observation_digest":"sha256:45d5baa19d793270a358e6f3920e7ed2a79e36a01bcb11a4acd7825402ef024b","observation_id":"3ea0ae09-9371-4ef4-aeb6-37c6c3c4553a","resolution":{"observed_at":"2026-05-13T20:08:12.681617Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.00535","last_updated":"2025-05-12T10:24:14Z","snapshot_observed_at":"2026-07-06T19:59:28.832182Z","submitted_at":"2024-11-30T16:58:42Z","title":"FullStack Bench: Evaluating LLMs as Full Stack Coders","version":6},"cited_work":{"arxiv_id":"2412.00535","doi":"10.48550/arxiv.2412.00535","metadata_source":"arxiv_reference","pith_arxiv_id":"2412.00535","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Fullstackbench: Evaluatingllmsasfullstackcoders","venue":"arXiv (Cornell University)","work_id":"569bc5cb-f61d-4b46-8553-07cf2b67cece","year":2024},"citing_paper":{"arxiv_id":"2604.03144","last_updated":"2026-04-03T16:06:25Z","snapshot_observed_at":"2026-07-06T22:52:25.307426Z","submitted_at":"2026-04-03T16:06:25Z","title":"InCoder-32B-Thinking: Industrial Code World Model for Thinking","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-05-13T18:56:31.975626Z"},"links":{"cited_paper":"/paper/2412.00535","citing_paper":"/paper/2604.03144"},"observation_digest":"sha256:c41918372f52736cbc3c46b224569e07d339d18dc92c9ce51cffa7a6eff0acc8","observation_id":"1d632ded-40aa-4766-a353-f0309625ad76","resolution":{"observed_at":"2026-05-13T18:58:08.705577Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.00535","last_updated":"2025-05-12T10:24:14Z","snapshot_observed_at":"2026-07-06T19:59:28.832182Z","submitted_at":"2024-11-30T16:58:42Z","title":"FullStack Bench: Evaluating LLMs as Full Stack Coders","version":6},"cited_work":{"arxiv_id":"2412.00535","doi":"10.48550/arxiv.2412.00535","metadata_source":"arxiv_reference","pith_arxiv_id":"2412.00535","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Fullstackbench: Evaluatingllmsasfullstackcoders","venue":"arXiv (Cornell University)","work_id":"569bc5cb-f61d-4b46-8553-07cf2b67cece","year":2024},"citing_paper":{"arxiv_id":"2604.04017","last_updated":"2026-04-05T08:29:52Z","snapshot_observed_at":"2026-07-06T22:53:06.517678Z","submitted_at":"2026-04-05T08:29:52Z","title":"GeoBrowse: A Geolocation Benchmark for Agentic Tool Use with Expert-Annotated Reasoning Traces","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-13T17:31:08.575993Z"},"links":{"cited_paper":"/paper/2412.00535","citing_paper":"/paper/2604.04017"},"observation_digest":"sha256:ebc2be3302212024b31ad47075b8fd020e5b0e30630ce2e562d50a7b9356a82d","observation_id":"d20db14b-b003-45d1-a46d-1714cf89a392","resolution":{"observed_at":"2026-05-13T17:33:02.359854Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.00535","last_updated":"2025-05-12T10:24:14Z","snapshot_observed_at":"2026-07-06T19:59:28.832182Z","submitted_at":"2024-11-30T16:58:42Z","title":"FullStack Bench: Evaluating LLMs as Full Stack Coders","version":6},"cited_work":{"arxiv_id":"2412.00535","doi":"10.48550/arxiv.2412.00535","metadata_source":"arxiv_reference","pith_arxiv_id":"2412.00535","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Fullstackbench: Evaluatingllmsasfullstackcoders","venue":"arXiv (Cornell University)","work_id":"569bc5cb-f61d-4b46-8553-07cf2b67cece","year":2024},"citing_paper":{"arxiv_id":"2605.04637","last_updated":"2026-05-06T08:30:37Z","snapshot_observed_at":"2026-07-06T23:17:23.641984Z","submitted_at":"2026-05-06T08:30:37Z","title":"SWE-WebDevBench: Evaluating Coding Agent Application Platforms as Virtual Software Agencies","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-08T16:24:49.710882Z"},"links":{"cited_paper":"/paper/2412.00535","citing_paper":"/paper/2605.04637"},"observation_digest":"sha256:c8eb828b988ad578bb51c960525c2a6593081aadbdb6d396aafbda433cc28213","observation_id":"6ea69460-01e2-4c41-a164-69ea5768da40","resolution":{"observed_at":"2026-05-11T18:16:08.964076Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.00535","last_updated":"2025-05-12T10:24:14Z","snapshot_observed_at":"2026-07-06T19:59:28.832182Z","submitted_at":"2024-11-30T16:58:42Z","title":"FullStack Bench: Evaluating LLMs as Full Stack Coders","version":6},"cited_work":{"arxiv_id":"2412.00535","doi":"10.48550/arxiv.2412.00535","metadata_source":"arxiv_reference","pith_arxiv_id":"2412.00535","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Fullstackbench: Evaluatingllmsasfullstackcoders","venue":"arXiv (Cornell University)","work_id":"569bc5cb-f61d-4b46-8553-07cf2b67cece","year":2024},"citing_paper":{"arxiv_id":"2605.13641","last_updated":"2026-05-13T15:05:18Z","snapshot_observed_at":"2026-07-06T23:25:11.623026Z","submitted_at":"2026-05-13T15:05:18Z","title":"Multi-Objective and Mixed-Reward Reinforcement Learning via Reward-Decorrelated Policy Optimization","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-14T19:24:05.375951Z"},"links":{"cited_paper":"/paper/2412.00535","citing_paper":"/paper/2605.13641"},"observation_digest":"sha256:26565d60d3b5c7a92e4342285ce191f60c3109dd526db5becafc0c3b9a5a77c5","observation_id":"711bdc2f-7f5b-4f60-a1e0-2f4d27955f21","resolution":{"observed_at":"2026-05-14T19:27:52.265134Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.00535","last_updated":"2025-05-12T10:24:14Z","snapshot_observed_at":"2026-07-06T19:59:28.832182Z","submitted_at":"2024-11-30T16:58:42Z","title":"FullStack Bench: Evaluating LLMs as Full Stack Coders","version":6},"cited_work":{"arxiv_id":"2412.00535","doi":"10.48550/arxiv.2412.00535","metadata_source":"arxiv_reference","pith_arxiv_id":"2412.00535","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Fullstackbench: Evaluatingllmsasfullstackcoders","venue":"arXiv (Cornell University)","work_id":"569bc5cb-f61d-4b46-8553-07cf2b67cece","year":2024},"citing_paper":{"arxiv_id":"2605.13641","last_updated":"2026-05-13T15:05:18Z","snapshot_observed_at":"2026-07-06T23:25:11.623026Z","submitted_at":"2026-05-13T15:05:18Z","title":"Multi-Objective and Mixed-Reward Reinforcement Learning via Reward-Decorrelated Policy Optimization","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-14T19:24:05.375951Z"},"links":{"cited_paper":"/paper/2412.00535","citing_paper":"/paper/2605.13641"},"observation_digest":"sha256:37def4ac01ee9a3f36412c3f2e2d851d713fb12cf6c536079ebbad6075a73edb","observation_id":"45947a59-3b54-4b42-8481-4ef33ceb4fbe","resolution":{"observed_at":"2026-05-14T19:27:51.248601Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.00535","last_updated":"2025-05-12T10:24:14Z","snapshot_observed_at":"2026-07-06T19:59:28.832182Z","submitted_at":"2024-11-30T16:58:42Z","title":"FullStack Bench: Evaluating LLMs as Full Stack Coders","version":6},"cited_work":{"arxiv_id":"2412.00535","doi":"10.48550/arxiv.2412.00535","metadata_source":"arxiv_reference","pith_arxiv_id":"2412.00535","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Fullstackbench: Evaluatingllmsasfullstackcoders","venue":"arXiv (Cornell University)","work_id":"569bc5cb-f61d-4b46-8553-07cf2b67cece","year":2024},"citing_paper":{"arxiv_id":"2605.22138","last_updated":"2026-05-21T08:11:54Z","snapshot_observed_at":"2026-07-06T23:32:30.578213Z","submitted_at":"2026-05-21T08:11:54Z","title":"Efficient Agentic Reasoning Through Self-Regulated Simulative Planning","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-22T06:33:36.846345Z"},"links":{"cited_paper":"/paper/2412.00535","citing_paper":"/paper/2605.22138"},"observation_digest":"sha256:368aed257f60941ea919718faa08fb2ccfc1d37a804ac06fe4d056a2f99dbc53","observation_id":"2b27823f-fdf5-4492-9a77-6ad80320d633","resolution":{"observed_at":"2026-05-22T06:34:40.962219Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.00535","last_updated":"2025-05-12T10:24:14Z","snapshot_observed_at":"2026-07-06T19:59:28.832182Z","submitted_at":"2024-11-30T16:58:42Z","title":"FullStack Bench: Evaluating LLMs as Full Stack Coders","version":6},"cited_work":{"arxiv_id":"2412.00535","doi":"10.48550/arxiv.2412.00535","metadata_source":"arxiv_reference","pith_arxiv_id":"2412.00535","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Fullstackbench: Evaluatingllmsasfullstackcoders","venue":"arXiv (Cornell University)","work_id":"569bc5cb-f61d-4b46-8553-07cf2b67cece","year":2024},"citing_paper":{"arxiv_id":"2605.22642","last_updated":"2026-05-21T15:47:41Z","snapshot_observed_at":"2026-08-04T04:25:21.624775Z","submitted_at":"2026-05-21T15:47:41Z","title":"Spreadsheet-RL: Advancing Large Language Model Agents on Realistic Spreadsheet Tasks via Reinforcement Learning","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-22T05:44:12.807291Z"},"links":{"cited_paper":"/paper/2412.00535","citing_paper":"/paper/2605.22642"},"observation_digest":"sha256:953f9add92da0a6ddbb60b69c0ff1cbdb6e1db9d6fd1b39c1837b52af6ef6ee5","observation_id":"76f0cbe1-a7f7-4592-a315-fb39d240f6d6","resolution":{"observed_at":"2026-05-22T05:44:38.479911Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.00535","last_updated":"2025-05-12T10:24:14Z","snapshot_observed_at":"2026-07-06T19:59:28.832182Z","submitted_at":"2024-11-30T16:58:42Z","title":"FullStack Bench: Evaluating LLMs as Full Stack Coders","version":6},"cited_work":{"arxiv_id":"2412.00535","doi":"10.48550/arxiv.2412.00535","metadata_source":"arxiv_reference","pith_arxiv_id":"2412.00535","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Fullstackbench: Evaluatingllmsasfullstackcoders","venue":"arXiv (Cornell University)","work_id":"569bc5cb-f61d-4b46-8553-07cf2b67cece","year":2024},"citing_paper":{"arxiv_id":"2605.26842","last_updated":"2026-05-26T10:56:20Z","snapshot_observed_at":"2026-08-02T04:41:45.987582Z","submitted_at":"2026-05-26T10:56:20Z","title":"MONA: Muon Optimizer with Nesterov Acceleration for Scalable Language Model Training","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-06-29T19:15:49.229099Z"},"links":{"cited_paper":"/paper/2412.00535","citing_paper":"/paper/2605.26842"},"observation_digest":"sha256:22fd7abbe79ad858fb6019aadb748ed474264ea98274ccc080e12278be0119d6","observation_id":"7bb56558-e906-442b-a332-b3fcc8b46601","resolution":{"observed_at":"2026-06-29T19:23:54.161758Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.00535","last_updated":"2025-05-12T10:24:14Z","snapshot_observed_at":"2026-07-06T19:59:28.832182Z","submitted_at":"2024-11-30T16:58:42Z","title":"FullStack Bench: Evaluating LLMs as Full Stack Coders","version":6},"cited_work":{"arxiv_id":"2412.00535","doi":"10.48550/arxiv.2412.00535","metadata_source":"arxiv_reference","pith_arxiv_id":"2412.00535","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Fullstackbench: Evaluatingllmsasfullstackcoders","venue":"arXiv (Cornell University)","work_id":"569bc5cb-f61d-4b46-8553-07cf2b67cece","year":2024},"citing_paper":{"arxiv_id":"2606.15079","last_updated":"2026-06-13T03:21:49Z","snapshot_observed_at":"2026-07-06T23:52:28.557859Z","submitted_at":"2026-06-13T03:21:49Z","title":"Ling and Ring 2.6 Technical Report: Efficient and Instant Agentic Intelligence at Trillion-Parameter Scale","version":1},"reference_index":188,"source":"arxiv_source","source_observed_at":"2026-07-02T22:10:59.568675Z"},"links":{"cited_paper":"/paper/2412.00535","citing_paper":"/paper/2606.15079"},"observation_digest":"sha256:748c2bbef18914fb1e6d3a8a782ab1826e25df5a835150bedc42cc7fda657012","observation_id":"ffa1d5e4-05c8-44ec-80ad-3116e8cad077","resolution":{"observed_at":"2026-07-02T22:17:25.583378Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.00535","last_updated":"2025-05-12T10:24:14Z","snapshot_observed_at":"2026-07-06T19:59:28.832182Z","submitted_at":"2024-11-30T16:58:42Z","title":"FullStack Bench: Evaluating LLMs as Full Stack Coders","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.00535","snapshot_observed_at":"2026-08-01T11:14:59.621613Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.19966","last_updated":"2026-07-22T09:50:01Z","snapshot_observed_at":"2026-08-04T18:22:33.545707Z","submitted_at":"2026-07-22T09:50:01Z","title":"Towards Reliable C-to-Rust Translation with Rule-Guided Reasoning and Reinforcement Learning","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-01T11:14:59.621613Z"},"links":{"cited_paper":"/paper/2412.00535","citing_paper":"/paper/2607.19966"},"observation_digest":"sha256:dc60f3a9aa63c955fc1520b963165db512fb254c90ce955024dcbdbab4874773","observation_id":"84725537-852c-47a6-b27d-5ac3754f5fe3","resolution":{"observed_at":"2026-08-01T11:14:59.621613Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.00535","last_updated":"2025-05-12T10:24:14Z","snapshot_observed_at":"2026-07-06T19:59:28.832182Z","submitted_at":"2024-11-30T16:58:42Z","title":"FullStack Bench: Evaluating LLMs as Full Stack Coders","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.00535","snapshot_observed_at":"2026-08-01T10:42:39.936078Z","title":"CoRR , volume =","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.20145","last_updated":"2026-07-30T09:30:44Z","snapshot_observed_at":"2026-08-03T18:47:24.558536Z","submitted_at":"2026-07-22T13:49:17Z","title":"SLAI T-Rex: Full-Parameter Post-training of the DeepSeek-V4 Family on Ascend SuperPOD","version":2},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-01T10:42:39.936078Z"},"links":{"cited_paper":"/paper/2412.00535","citing_paper":"/paper/2607.20145"},"observation_digest":"sha256:a6d35cc15b2cfdd7c2f0620b6b984b01ca187b9a06909b906645a1fc9882f3a1","observation_id":"00da7b69-8be1-4464-ae4f-fdaf423434fb","resolution":{"observed_at":"2026-08-01T10:42:39.936078Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2412.00535/citation-record","integrity":"/paper/2412.00535/integrity","json":"/paper/2412.00535/citation-record.json","paper":"/paper/2412.00535"},"outbound":[],"paper":{"arxiv_id":"2412.00535","last_updated":"2025-05-12T10:24:14Z","latest_version":6,"primary_category":"cs.AI","snapshot_observed_at":"2026-07-06T19:59:28.832182Z","submitted_at":"2024-11-30T16:58:42Z","title":"FullStack Bench: Evaluating LLMs as Full Stack Coders"},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 23 inbound Pith citation observations for arXiv:2412.00535."}