{"as_of":"2026-08-17T05:17:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d7beccbc21d1d362d4f6e13deb0e802d1f5e294a9c96e6d64175bfd467db023c","coverage":[{"denominator":35,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":35,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-10T19:48:27.137130Z","state":"measured"},{"denominator":35,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":35,"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/2607.07748/citation-record","integrity":"/paper/2607.07748/integrity","json":"/paper/2607.07748/citation-record.json","paper":"/paper/2607.07748"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T19:57:34.510736Z","title":null,"venue":null,"work_id":"1ef7e3e0-a9ab-42e0-a671-dacbcded25c4","year":2026},"citing_paper":{"arxiv_id":"2607.07748","last_updated":"2026-07-08T09:18:56Z","snapshot_observed_at":"2026-08-06T15:26:59.961118Z","submitted_at":"2026-07-08T09:18:56Z","title":"Selective Left-Shift: Turning Test-Time Compute and Difficulty-based Curation into Training Data for Low-Resource Code Generation","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-10T19:48:27.137130Z"},"links":{"citing_paper":"/paper/2607.07748"},"observation_digest":"sha256:cb7241c3469c977cc6ec7c692729f5c1c317dbc13c9a379602b893dcf5e1dc0a","observation_id":"8c0c143a-fb12-466e-9108-0b5861ea2bfb","resolution":{"observed_at":"2026-07-10T19:57:34.511787Z","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":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T19:57:34.512279Z","title":null,"venue":null,"work_id":"2534bc21-3a8b-489d-aa93-9aaeaf3c229d","year":2024},"citing_paper":{"arxiv_id":"2607.07748","last_updated":"2026-07-08T09:18:56Z","snapshot_observed_at":"2026-08-06T15:26:59.961118Z","submitted_at":"2026-07-08T09:18:56Z","title":"Selective Left-Shift: Turning Test-Time Compute and Difficulty-based Curation into Training Data for Low-Resource Code Generation","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-10T19:48:27.137130Z"},"links":{"citing_paper":"/paper/2607.07748"},"observation_digest":"sha256:d090219daf959ede66147388f887126fa8927981672b1a5c8ef897f56ec9a3b2","observation_id":"544c1288-2636-4655-9039-0b0ac3ede5c7","resolution":{"observed_at":"2026-07-10T19:57:34.513304Z","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":"2023.326744","doi":"10.1109/tse.2023.3267446","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"MultiPL-E","venue":"IEEE Transactions on Software Engineering","work_id":"cd20429c-983c-4cb2-97c2-67e040191652","year":2023},"citing_paper":{"arxiv_id":"2607.07748","last_updated":"2026-07-08T09:18:56Z","snapshot_observed_at":"2026-08-06T15:26:59.961118Z","submitted_at":"2026-07-08T09:18:56Z","title":"Selective Left-Shift: Turning Test-Time Compute and Difficulty-based Curation into Training Data for Low-Resource Code Generation","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-10T19:48:27.137130Z"},"links":{"citing_paper":"/paper/2607.07748"},"observation_digest":"sha256:2f7345a276898bc43a9970a7ce52d2714d3f71d7bf25f0ac38d7997196d9c8c1","observation_id":"2f0a1cad-49e7-4175-aa2b-34a280f9f2b1","resolution":{"observed_at":"2026-07-10T19:57:33.985642Z","resolver_source":"arxiv_id","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-09T08:48:42.365354+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T08:48:42.365354+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2207.10397","last_updated":"2022-11-23T07:42:10Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2022-07-21T10:18:37Z","title":"CodeT: Code Generation with Generated Tests","version":2},"cited_work":{"arxiv_id":"2207.10397","doi":"10.48550/arxiv.2207.10397","metadata_source":"pith","pith_arxiv_id":"2207.10397","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"CodeT: Code Generation with Generated Tests","venue":"cs.CL","work_id":"1280b158-2c5d-444c-8584-ae187cbe83af","year":2022},"citing_paper":{"arxiv_id":"2607.07748","last_updated":"2026-07-08T09:18:56Z","snapshot_observed_at":"2026-08-06T15:26:59.961118Z","submitted_at":"2026-07-08T09:18:56Z","title":"Selective Left-Shift: Turning Test-Time Compute and Difficulty-based Curation into Training Data for Low-Resource Code Generation","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-10T19:48:27.137130Z"},"links":{"cited_paper":"/paper/2207.10397","citing_paper":"/paper/2607.07748"},"observation_digest":"sha256:04358bf3de610b3c77841dcebf27f4a5af830afa2b2ee4e521c1598d126bc00b","observation_id":"b9f80bde-db26-4554-8104-e8d6166c90a6","resolution":{"observed_at":"2026-07-10T19:57:34.130922Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"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.22375","last_updated":"2025-05-29T01:59:00Z","snapshot_observed_at":"2026-08-12T21:53:57.227850Z","submitted_at":"2025-05-28T14:03:02Z","title":"Pangu Embedded: An Efficient Dual-system LLM Reasoner with Metacognition","version":2},"cited_work":{"arxiv_id":"2505.22375","doi":"10.48550/arxiv.2505.22375","metadata_source":"pith","pith_arxiv_id":"2505.22375","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Pangu embedded: An efficient dual-system llm reasoner with metacognition","venue":"cs.CL","work_id":"48eb26ab-dce4-4bb6-9a0c-2376e9449315","year":2025},"citing_paper":{"arxiv_id":"2607.07748","last_updated":"2026-07-08T09:18:56Z","snapshot_observed_at":"2026-08-06T15:26:59.961118Z","submitted_at":"2026-07-08T09:18:56Z","title":"Selective Left-Shift: Turning Test-Time Compute and Difficulty-based Curation into Training Data for Low-Resource Code Generation","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-10T19:48:27.137130Z"},"links":{"cited_paper":"/paper/2505.22375","citing_paper":"/paper/2607.07748"},"observation_digest":"sha256:1ac0c9675c70c0f3150f4bb2f4ffff5959f954faab0e6ccc5b4e9a2c198d658c","observation_id":"d0518ce9-d002-4400-bcb1-44e9d83a7900","resolution":{"observed_at":"2026-07-10T19:57:34.123828Z","resolver_source":"local_arxiv","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":{"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":"2107.03374","doi":"10.48550/arxiv.2107.03374","metadata_source":"pith","pith_arxiv_id":"2107.03374","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Evaluating Large Language Models Trained on Code","venue":"cs.LG","work_id":"042493e9-b26f-4b4e-bbde-382072ca9b08","year":2021},"citing_paper":{"arxiv_id":"2607.07748","last_updated":"2026-07-08T09:18:56Z","snapshot_observed_at":"2026-08-06T15:26:59.961118Z","submitted_at":"2026-07-08T09:18:56Z","title":"Selective Left-Shift: Turning Test-Time Compute and Difficulty-based Curation into Training Data for Low-Resource Code Generation","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-10T19:48:27.137130Z"},"links":{"cited_paper":"/paper/2107.03374","citing_paper":"/paper/2607.07748"},"observation_digest":"sha256:c98ee9b3505ae1bd248d22fae63a7c937632c7da902f025464a162f773b5e353","observation_id":"f51021e3-d02b-486b-aea6-e272281e68aa","resolution":{"observed_at":"2026-07-10T19:57:34.128567Z","resolver_source":"local_arxiv","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-01T08:08:23.404839+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-01T08:08:23.404839+00:00","source":"openalex_status_cache"},{"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-07-10T19:57:34.509153Z","title":null,"venue":null,"work_id":"483f3dc5-0cf1-4079-8a09-cdeabc87c6d1","year":2024},"citing_paper":{"arxiv_id":"2607.07748","last_updated":"2026-07-08T09:18:56Z","snapshot_observed_at":"2026-08-06T15:26:59.961118Z","submitted_at":"2026-07-08T09:18:56Z","title":"Selective Left-Shift: Turning Test-Time Compute and Difficulty-based Curation into Training Data for Low-Resource Code Generation","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-10T19:48:27.137130Z"},"links":{"citing_paper":"/paper/2607.07748"},"observation_digest":"sha256:9bc64f14a5f3fd073824ad93bc8289bedcbbbcf2f83d9d87e0bf2e316e48065d","observation_id":"dde4939d-5345-460b-b370-43d3802d270f","resolution":{"observed_at":"2026-07-10T19:57:34.510178Z","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":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T19:57:34.505816Z","title":"Anders Ericsson","venue":null,"work_id":"d87beb01-1e22-485c-ae0e-041ec8648556","year":2008},"citing_paper":{"arxiv_id":"2607.07748","last_updated":"2026-07-08T09:18:56Z","snapshot_observed_at":"2026-08-06T15:26:59.961118Z","submitted_at":"2026-07-08T09:18:56Z","title":"Selective Left-Shift: Turning Test-Time Compute and Difficulty-based Curation into Training Data for Low-Resource Code Generation","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-10T19:48:27.137130Z"},"links":{"citing_paper":"/paper/2607.07748"},"observation_digest":"sha256:96aecbc2d5e5a5d0b5b2907db5c67b56ba0384ca5e6341a05f4b5abcfa800c52","observation_id":"ae35710f-ad26-408a-b17b-a97fbb60db34","resolution":{"observed_at":"2026-07-10T19:57:34.506881Z","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.19085","last_updated":"2025-01-31T12:23:28Z","snapshot_observed_at":"2026-08-15T23:46:26.406277Z","submitted_at":"2025-01-31T12:23:28Z","title":"Enhancing Code Generation for Low-Resource Languages: No Silver Bullet","version":1},"cited_work":{"arxiv_id":"2501.19085","doi":null,"metadata_source":"pith","pith_arxiv_id":"2501.19085","snapshot_observed_at":"2026-07-10T19:57:34.124979Z","title":"Enhanc- ing code generation for low-resource languages: No silver bullet","venue":"cs.SE","work_id":"083884d7-6ef4-4e4a-9044-dadb97670289","year":2025},"citing_paper":{"arxiv_id":"2607.07748","last_updated":"2026-07-08T09:18:56Z","snapshot_observed_at":"2026-08-06T15:26:59.961118Z","submitted_at":"2026-07-08T09:18:56Z","title":"Selective Left-Shift: Turning Test-Time Compute and Difficulty-based Curation into Training Data for Low-Resource Code Generation","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-10T19:48:27.137130Z"},"links":{"cited_paper":"/paper/2501.19085","citing_paper":"/paper/2607.07748"},"observation_digest":"sha256:977cc35674be05fd2e8427fa9dac4308494295cd3d8aa696b79602dc7b451340","observation_id":"4d7c8950-1bef-455b-9a65-c149fb8b9798","resolution":{"observed_at":"2026-07-10T19:57:34.126205Z","resolver_source":"local_arxiv","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":{"arxiv_id":"2312.13010","last_updated":"2024-05-24T11:47:24Z","snapshot_observed_at":"2026-08-14T19:02:11.924748Z","submitted_at":"2023-12-20T13:22:41Z","title":"AgentCoder: Multi-Agent-based Code Generation with Iterative Testing and Optimisation","version":3},"cited_work":{"arxiv_id":"2312.13010","doi":"10.48550/arxiv.2312.13010","metadata_source":"pith","pith_arxiv_id":"2312.13010","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"AgentCoder: Multi-Agent-based Code Generation with Iterative Testing and Optimisation","venue":"cs.CL","work_id":"a59b2f13-e7d4-4d8b-bffd-504f2417da02","year":2023},"citing_paper":{"arxiv_id":"2607.07748","last_updated":"2026-07-08T09:18:56Z","snapshot_observed_at":"2026-08-06T15:26:59.961118Z","submitted_at":"2026-07-08T09:18:56Z","title":"Selective Left-Shift: Turning Test-Time Compute and Difficulty-based Curation into Training Data for Low-Resource Code Generation","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-10T19:48:27.137130Z"},"links":{"cited_paper":"/paper/2312.13010","citing_paper":"/paper/2607.07748"},"observation_digest":"sha256:341972ec2ce2ef59a8392c72296213882f548cd7ece02824b4b56c32a82ab10b","observation_id":"3771f683-7833-4b35-8edd-d3e4b779728a","resolution":{"observed_at":"2026-07-10T19:57:34.145380Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"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":"2411.04905","last_updated":"2025-03-20T03:28:56Z","snapshot_observed_at":"2026-08-16T13:02:01.818557Z","submitted_at":"2024-11-07T17:47:25Z","title":"OpenCoder: The Open Cookbook for Top-Tier Code Large Language Models","version":3},"cited_work":{"arxiv_id":"2411.04905","doi":null,"metadata_source":"pith","pith_arxiv_id":"2411.04905","snapshot_observed_at":"2026-07-10T19:57:34.136782Z","title":"Opencoder: The open cookbook for top-tier code large language models","venue":"cs.CL","work_id":"9b3533e7-febf-47c1-8e10-ac79d3b3cce9","year":2024},"citing_paper":{"arxiv_id":"2607.07748","last_updated":"2026-07-08T09:18:56Z","snapshot_observed_at":"2026-08-06T15:26:59.961118Z","submitted_at":"2026-07-08T09:18:56Z","title":"Selective Left-Shift: Turning Test-Time Compute and Difficulty-based Curation into Training Data for Low-Resource Code Generation","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-10T19:48:27.137130Z"},"links":{"cited_paper":"/paper/2411.04905","citing_paper":"/paper/2607.07748"},"observation_digest":"sha256:92e8ed386bcb41e41d1e986b6353a2f7c676e29dba7f037856dfbbeb6d002ef8","observation_id":"533e1119-df07-4c52-a795-d3e245d046eb","resolution":{"observed_at":"2026-07-10T19:57:34.138023Z","resolver_source":"local_arxiv","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-07-10T19:57:34.507415Z","title":"Ashraful Islam, Mohammed Eunus Ali, and Md Rizwan Parvez","venue":null,"work_id":"ddc1d726-e740-47f9-8430-c80f6fe3367b","year":2025},"citing_paper":{"arxiv_id":"2607.07748","last_updated":"2026-07-08T09:18:56Z","snapshot_observed_at":"2026-08-06T15:26:59.961118Z","submitted_at":"2026-07-08T09:18:56Z","title":"Selective Left-Shift: Turning Test-Time Compute and Difficulty-based Curation into Training Data for Low-Resource Code Generation","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-10T19:48:27.137130Z"},"links":{"citing_paper":"/paper/2607.07748"},"observation_digest":"sha256:8435edb699f04255b2a823942c4a3b2837628d124f88e663ad8510f83a8d71c6","observation_id":"c5991e34-fa62-44cf-aff7-bbdf06c6836a","resolution":{"observed_at":"2026-07-10T19:57:34.508631Z","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":"2403.07974","last_updated":"2024-06-06T17:41:21Z","snapshot_observed_at":"2026-08-16T07:05:57.323612Z","submitted_at":"2024-03-12T17:58:04Z","title":"LiveCodeBench: Holistic and Contamination Free Evaluation of Large Language Models for Code","version":2},"cited_work":{"arxiv_id":"2403.07974","doi":"10.1109/icsme52107.2021.00025","metadata_source":"pith","pith_arxiv_id":"2403.07974","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"LiveCodeBench: Holistic and Contamination Free Evaluation of Large Language Models for Code","venue":"cs.SE","work_id":"ea9e51ce-1e75-4182-92d8-4d25f70d2ee4","year":2024},"citing_paper":{"arxiv_id":"2607.07748","last_updated":"2026-07-08T09:18:56Z","snapshot_observed_at":"2026-08-06T15:26:59.961118Z","submitted_at":"2026-07-08T09:18:56Z","title":"Selective Left-Shift: Turning Test-Time Compute and Difficulty-based Curation into Training Data for Low-Resource Code Generation","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-07-10T19:48:27.137130Z"},"links":{"cited_paper":"/paper/2403.07974","citing_paper":"/paper/2607.07748"},"observation_digest":"sha256:7b49085bb4c26fe7a56d83b0338ddff4d23b9caa95816ba2b6edb38523f657c7","observation_id":"02ec05b9-a66f-48a8-aa31-4aa4a48a25c6","resolution":{"observed_at":"2026-07-10T19:57:34.147763Z","resolver_source":"local_arxiv","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-07-10T19:57:34.501022Z","title":null,"venue":null,"work_id":"97c621aa-5ad4-4eb6-be9d-25e7cf1c7932","year":2024},"citing_paper":{"arxiv_id":"2607.07748","last_updated":"2026-07-08T09:18:56Z","snapshot_observed_at":"2026-08-06T15:26:59.961118Z","submitted_at":"2026-07-08T09:18:56Z","title":"Selective Left-Shift: Turning Test-Time Compute and Difficulty-based Curation into Training Data for Low-Resource Code Generation","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-07-10T19:48:27.137130Z"},"links":{"citing_paper":"/paper/2607.07748"},"observation_digest":"sha256:b79a4422b54680fc7866064a213d10d7e21de21e7b4cb06bec66e5011adc39a7","observation_id":"fe029a10-c021-4d0a-8af1-ee395951904f","resolution":{"observed_at":"2026-07-10T19:57:34.502096Z","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":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T19:57:34.502664Z","title":null,"venue":null,"work_id":"8f236151-b3b6-4948-ab0f-375eb334bc20","year":2022},"citing_paper":{"arxiv_id":"2607.07748","last_updated":"2026-07-08T09:18:56Z","snapshot_observed_at":"2026-08-06T15:26:59.961118Z","submitted_at":"2026-07-08T09:18:56Z","title":"Selective Left-Shift: Turning Test-Time Compute and Difficulty-based Curation into Training Data for Low-Resource Code Generation","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-07-10T19:48:27.137130Z"},"links":{"citing_paper":"/paper/2607.07748"},"observation_digest":"sha256:d1c071585e414560b9a0431f68077dd267997543089f44831d6cd1a0f168179f","observation_id":"23b5adab-23a4-41fc-810f-0f144ef6426c","resolution":{"observed_at":"2026-07-10T19:57:34.503723Z","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":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T19:57:34.504260Z","title":null,"venue":null,"work_id":"db3d9937-f0a4-48d8-b9c1-7c539baa0815","year":2025},"citing_paper":{"arxiv_id":"2607.07748","last_updated":"2026-07-08T09:18:56Z","snapshot_observed_at":"2026-08-06T15:26:59.961118Z","submitted_at":"2026-07-08T09:18:56Z","title":"Selective Left-Shift: Turning Test-Time Compute and Difficulty-based Curation into Training Data for Low-Resource Code Generation","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-10T19:48:27.137130Z"},"links":{"citing_paper":"/paper/2607.07748"},"observation_digest":"sha256:9379082d9cd3a8b640bbe0ff4844d25407c94765ebac2e6ce5fff4b2fe4d641f","observation_id":"3fb2deec-8c50-4dd1-b7de-2c488485b05a","resolution":{"observed_at":"2026-07-10T19:57:34.505277Z","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":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T19:57:34.497873Z","title":null,"venue":null,"work_id":"b72e8884-5ab0-4cd0-9305-ea4bb4f9846f","year":2024},"citing_paper":{"arxiv_id":"2607.07748","last_updated":"2026-07-08T09:18:56Z","snapshot_observed_at":"2026-08-06T15:26:59.961118Z","submitted_at":"2026-07-08T09:18:56Z","title":"Selective Left-Shift: Turning Test-Time Compute and Difficulty-based Curation into Training Data for Low-Resource Code Generation","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-07-10T19:48:27.137130Z"},"links":{"citing_paper":"/paper/2607.07748"},"observation_digest":"sha256:db0bcb16cbd575fee4dd19c1e8cedc456adf4112de3d74881936726380cca328","observation_id":"659d87a5-44ad-437b-861a-0b8f060e8743","resolution":{"observed_at":"2026-07-10T19:57:34.498915Z","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":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T19:57:34.499439Z","title":null,"venue":null,"work_id":"6bca50ae-6fd7-4668-951c-4d8c2a365c0b","year":2026},"citing_paper":{"arxiv_id":"2607.07748","last_updated":"2026-07-08T09:18:56Z","snapshot_observed_at":"2026-08-06T15:26:59.961118Z","submitted_at":"2026-07-08T09:18:56Z","title":"Selective Left-Shift: Turning Test-Time Compute and Difficulty-based Curation into Training Data for Low-Resource Code Generation","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-07-10T19:48:27.137130Z"},"links":{"citing_paper":"/paper/2607.07748"},"observation_digest":"sha256:2c11182ee8749c29ec72f8f6e543c655a001730c697f7c20fbc0337e2127f66e","observation_id":"c130d950-b488-491a-8c08-169df4166f16","resolution":{"observed_at":"2026-07-10T19:57:34.500445Z","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":"2508.14094","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T19:57:34.156285Z","title":"Hard examples are all you need: Maximizing grpo post-training under annotation budgets","venue":null,"work_id":"93a1e3bf-eaca-49cf-95a6-3a1811f39e7f","year":2025},"citing_paper":{"arxiv_id":"2607.07748","last_updated":"2026-07-08T09:18:56Z","snapshot_observed_at":"2026-08-06T15:26:59.961118Z","submitted_at":"2026-07-08T09:18:56Z","title":"Selective Left-Shift: Turning Test-Time Compute and Difficulty-based Curation into Training Data for Low-Resource Code Generation","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-07-10T19:48:27.137130Z"},"links":{"citing_paper":"/paper/2607.07748"},"observation_digest":"sha256:c2f43a30e1ad03c1e0e24a76b3907a5dd16e06f2d1f6f5257c2c11b0cdfc8691","observation_id":"84fb8d01-be36-465d-8a2e-5d09323af903","resolution":{"observed_at":"2026-07-10T19:57:34.157887Z","resolver_source":"arxiv_id","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":{"arxiv_id":"2105.12655","last_updated":"2021-08-29T19:43:43Z","snapshot_observed_at":"2026-08-16T18:22:32.184164Z","submitted_at":"2021-05-25T00:13:29Z","title":"CodeNet: A Large-Scale AI for Code Dataset for Learning a Diversity of Coding Tasks","version":2},"cited_work":{"arxiv_id":"2105.12655","doi":"10.48550/arxiv.2105.12655","metadata_source":"pith","pith_arxiv_id":"2105.12655","snapshot_observed_at":"2026-07-10T19:57:34.119876Z","title":"Kung, Geert Janssen, Wei Zhang, Giacomo Domeniconi, Vladimir Zolotov, and et al","venue":"cs.SE","work_id":"de7ef41d-380b-45d3-8ea7-d7c8f9a288d7","year":2021},"citing_paper":{"arxiv_id":"2607.07748","last_updated":"2026-07-08T09:18:56Z","snapshot_observed_at":"2026-08-06T15:26:59.961118Z","submitted_at":"2026-07-08T09:18:56Z","title":"Selective Left-Shift: Turning Test-Time Compute and Difficulty-based Curation into Training Data for Low-Resource Code Generation","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-07-10T19:48:27.137130Z"},"links":{"cited_paper":"/paper/2105.12655","citing_paper":"/paper/2607.07748"},"observation_digest":"sha256:5d01f01c0bd1550582cea75cb6efd0dfac75d54fe8d58ea8d60cccb280e20f92","observation_id":"639f633b-2faa-4d57-9117-6e49f63e1713","resolution":{"observed_at":"2026-07-10T19:57:34.121221Z","resolver_source":"local_arxiv","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":{"arxiv_id":"2501.01257","last_updated":"2025-01-03T16:36:12Z","snapshot_observed_at":"2026-08-15T21:08:10.475006Z","submitted_at":"2025-01-02T13:49:00Z","title":"CodeElo: Benchmarking Competition-level Code Generation of LLMs with Human-comparable Elo Ratings","version":2},"cited_work":{"arxiv_id":"2501.01257","doi":"10.48550/arxiv.2501.01257","metadata_source":"pith","pith_arxiv_id":"2501.01257","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Codeelo: Benchmarking competition-level code generation of llms with human-comparable elo ratings","venue":"cs.CL","work_id":"0e51dc65-57bb-4087-88e2-fae021a4fec7","year":2025},"citing_paper":{"arxiv_id":"2607.07748","last_updated":"2026-07-08T09:18:56Z","snapshot_observed_at":"2026-08-06T15:26:59.961118Z","submitted_at":"2026-07-08T09:18:56Z","title":"Selective Left-Shift: Turning Test-Time Compute and Difficulty-based Curation into Training Data for Low-Resource Code Generation","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-07-10T19:48:27.137130Z"},"links":{"cited_paper":"/paper/2501.01257","citing_paper":"/paper/2607.07748"},"observation_digest":"sha256:434443898fb1c55866bd14ed0375e4af58da8ff3e8c4e97fa462657fbeaee347","observation_id":"673b4857-0913-4c36-9044-6e0828a42c0f","resolution":{"observed_at":"2026-07-10T19:57:34.142769Z","resolver_source":"local_arxiv","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":{"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":"2505.09388","doi":"10.1016/j.aiopen.2022.12","metadata_source":"pith","pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"Qwen3 Technical Report","venue":"cs.CL","work_id":"25a4e30c-1232-48e7-9925-02fa12ba7c9e","year":2025},"citing_paper":{"arxiv_id":"2607.07748","last_updated":"2026-07-08T09:18:56Z","snapshot_observed_at":"2026-08-06T15:26:59.961118Z","submitted_at":"2026-07-08T09:18:56Z","title":"Selective Left-Shift: Turning Test-Time Compute and Difficulty-based Curation into Training Data for Low-Resource Code Generation","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-07-10T19:48:27.137130Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2607.07748"},"observation_digest":"sha256:d070d1ebcaf13dccbd87ae329f18bf96a6ce898303a712537951a4546f78d67e","observation_id":"8c78f7fc-7133-4393-9d50-b760d9ddf4db","resolution":{"observed_at":"2026-07-10T19:57:34.118692Z","resolver_source":"local_arxiv","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-07-10T19:57:34.494628Z","title":null,"venue":null,"work_id":"25dc1fb5-a760-4825-9ea8-5395a63ffc32","year":2023},"citing_paper":{"arxiv_id":"2607.07748","last_updated":"2026-07-08T09:18:56Z","snapshot_observed_at":"2026-08-06T15:26:59.961118Z","submitted_at":"2026-07-08T09:18:56Z","title":"Selective Left-Shift: Turning Test-Time Compute and Difficulty-based Curation into Training Data for Low-Resource Code Generation","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-07-10T19:48:27.137130Z"},"links":{"citing_paper":"/paper/2607.07748"},"observation_digest":"sha256:c467531c4b2e9e1fae7d004ef2307d7dfd8e27dbb82fea4c8e38dd95dddc01f9","observation_id":"d712bd66-3fbd-4d4a-a28d-3ae64945583e","resolution":{"observed_at":"2026-07-10T19:57:34.495734Z","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":{"arxiv_id":"2405.17057","last_updated":"2025-05-29T12:34:04Z","snapshot_observed_at":"2026-08-16T13:49:05.797366Z","submitted_at":"2024-05-27T11:27:00Z","title":"ReflectionCoder: Learning from Reflection Sequence for Enhanced One-off Code Generation","version":2},"cited_work":{"arxiv_id":"2405.17057","doi":null,"metadata_source":"pith","pith_arxiv_id":"2405.17057","snapshot_observed_at":"2026-07-10T19:57:34.134385Z","title":"ReflectionCoder: Learning from Reflection Sequence for Enhanced One-off Code Generation","venue":"cs.CL","work_id":"6ef30b3e-b141-4862-b5b1-be04e9c2162b","year":2024},"citing_paper":{"arxiv_id":"2607.07748","last_updated":"2026-07-08T09:18:56Z","snapshot_observed_at":"2026-08-06T15:26:59.961118Z","submitted_at":"2026-07-08T09:18:56Z","title":"Selective Left-Shift: Turning Test-Time Compute and Difficulty-based Curation into Training Data for Low-Resource Code Generation","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-07-10T19:48:27.137130Z"},"links":{"cited_paper":"/paper/2405.17057","citing_paper":"/paper/2607.07748"},"observation_digest":"sha256:235d8fa131f9df68a2b3af8314742952d1b7b09a0bff24e0f51ed370e335ce22","observation_id":"bdb721b2-48de-4e2c-b42e-443df1ebe335","resolution":{"observed_at":"2026-07-10T19:57:34.135573Z","resolver_source":"local_arxiv","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-07-10T19:57:34.496241Z","title":null,"venue":null,"work_id":"9f1f3d38-ab45-47c2-9514-9d361fbebce0","year":2021},"citing_paper":{"arxiv_id":"2607.07748","last_updated":"2026-07-08T09:18:56Z","snapshot_observed_at":"2026-08-06T15:26:59.961118Z","submitted_at":"2026-07-08T09:18:56Z","title":"Selective Left-Shift: Turning Test-Time Compute and Difficulty-based Curation into Training Data for Low-Resource Code Generation","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-07-10T19:48:27.137130Z"},"links":{"citing_paper":"/paper/2607.07748"},"observation_digest":"sha256:7931daeb4cadccc9254bbd14865b5440b415f4ac6b3a49138fd60aaa968979ef","observation_id":"3e722b6e-8df5-4e6b-97ee-00fd989a49bf","resolution":{"observed_at":"2026-07-10T19:57:34.497335Z","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":{"arxiv_id":"2402.03300","last_updated":"2024-04-27T15:25:53Z","snapshot_observed_at":"2026-08-06T14:58:42.911363Z","submitted_at":"2024-02-05T18:55:32Z","title":"DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Models","version":3},"cited_work":{"arxiv_id":"2402.03300","doi":"10.1016/0004-3702(73)90011-8","metadata_source":"pith","pith_arxiv_id":"2402.03300","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Models","venue":"cs.CL","work_id":"c5006563-f3ec-438a-9e35-b7b484f34828","year":2024},"citing_paper":{"arxiv_id":"2607.07748","last_updated":"2026-07-08T09:18:56Z","snapshot_observed_at":"2026-08-06T15:26:59.961118Z","submitted_at":"2026-07-08T09:18:56Z","title":"Selective Left-Shift: Turning Test-Time Compute and Difficulty-based Curation into Training Data for Low-Resource Code Generation","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-07-10T19:48:27.137130Z"},"links":{"cited_paper":"/paper/2402.03300","citing_paper":"/paper/2607.07748"},"observation_digest":"sha256:ba149a0b2cf392d7c87ed6825bb7a63ec18253fe13b24501e3568f872928ed4a","observation_id":"8cdd45ec-5917-4310-9a5e-2cd0c1a0a858","resolution":{"observed_at":"2026-07-10T19:57:34.140283Z","resolver_source":"local_arxiv","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-07-10T19:57:34.513902Z","title":null,"venue":null,"work_id":"37f70653-eb10-4786-a06a-7464254faaf4","year":2023},"citing_paper":{"arxiv_id":"2607.07748","last_updated":"2026-07-08T09:18:56Z","snapshot_observed_at":"2026-08-06T15:26:59.961118Z","submitted_at":"2026-07-08T09:18:56Z","title":"Selective Left-Shift: Turning Test-Time Compute and Difficulty-based Curation into Training Data for Low-Resource Code Generation","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-07-10T19:48:27.137130Z"},"links":{"citing_paper":"/paper/2607.07748"},"observation_digest":"sha256:6370b36ed3d2497bda770961753d6aa83a8a3035f88605480278ddb516663d21","observation_id":"4dda5f17-2eb8-4af0-8a6d-fc20d60a9f62","resolution":{"observed_at":"2026-07-10T19:57:34.514947Z","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":{"arxiv_id":"2507.17548","last_updated":"2025-07-23T14:26:58Z","snapshot_observed_at":"2026-08-15T16:35:32.231406Z","submitted_at":"2025-07-23T14:26:58Z","title":"CodeReasoner: Enhancing the Code Reasoning Ability with Reinforcement Learning","version":1},"cited_work":{"arxiv_id":"2507.17548","doi":null,"metadata_source":"pith","pith_arxiv_id":"2507.17548","snapshot_observed_at":"2026-07-10T19:57:34.114468Z","title":"Codereasoner: Enhancing the code reasoning ability with reinforcement learning","venue":"cs.SE","work_id":"615654f3-ede8-499c-8511-2ff7374139fc","year":2025},"citing_paper":{"arxiv_id":"2607.07748","last_updated":"2026-07-08T09:18:56Z","snapshot_observed_at":"2026-08-06T15:26:59.961118Z","submitted_at":"2026-07-08T09:18:56Z","title":"Selective Left-Shift: Turning Test-Time Compute and Difficulty-based Curation into Training Data for Low-Resource Code Generation","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-07-10T19:48:27.137130Z"},"links":{"cited_paper":"/paper/2507.17548","citing_paper":"/paper/2607.07748"},"observation_digest":"sha256:6fbde4e9a41b351bc3efc8194265e036e3bacc8a1eb0df4c69fdd0804b47fc85","observation_id":"d1a31d9b-6b2f-4e9b-8b8e-b837f5762374","resolution":{"observed_at":"2026-07-10T19:57:34.115953Z","resolver_source":"local_arxiv","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-07-10T19:57:34.491456Z","title":"Hashimoto","venue":null,"work_id":"d685bea4-f4e2-4cc8-bbc9-52b0a79b3761","year":2023},"citing_paper":{"arxiv_id":"2607.07748","last_updated":"2026-07-08T09:18:56Z","snapshot_observed_at":"2026-08-06T15:26:59.961118Z","submitted_at":"2026-07-08T09:18:56Z","title":"Selective Left-Shift: Turning Test-Time Compute and Difficulty-based Curation into Training Data for Low-Resource Code Generation","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-07-10T19:48:27.137130Z"},"links":{"citing_paper":"/paper/2607.07748"},"observation_digest":"sha256:fdc1248768e4d0a7c4766218c931b5f2120471794022b2461941161dfc7ac015","observation_id":"3d170f11-04f6-49f4-95ef-f5d084fcbcd0","resolution":{"observed_at":"2026-07-10T19:57:34.492538Z","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":"2510.00501","last_updated":"2026-08-05T06:01:15Z","snapshot_observed_at":"2026-08-09T15:30:29.509516Z","submitted_at":"2025-10-01T04:33:53Z","title":"CodeChemist: Test-Time Scaling for Low-Resource Code Generation via Functional Knowledge Transfer","version":3},"cited_work":{"arxiv_id":"2510.00501","doi":null,"metadata_source":"pith","pith_arxiv_id":"2510.00501","snapshot_observed_at":"2026-07-10T19:57:34.132033Z","title":"CodeChemist: Functional Knowledge Transfer for Low-Resource Code Generation via Test-Time Scaling","venue":"cs.SE","work_id":"456c8334-46f2-40de-87a9-1ee7a8462707","year":2025},"citing_paper":{"arxiv_id":"2607.07748","last_updated":"2026-07-08T09:18:56Z","snapshot_observed_at":"2026-08-06T15:26:59.961118Z","submitted_at":"2026-07-08T09:18:56Z","title":"Selective Left-Shift: Turning Test-Time Compute and Difficulty-based Curation into Training Data for Low-Resource Code Generation","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-07-10T19:48:27.137130Z"},"links":{"cited_paper":"/paper/2510.00501","citing_paper":"/paper/2607.07748"},"observation_digest":"sha256:b41039048cc076e1f36423c2df243764d0b11d85450e4911d84ec0c2aa223834","observation_id":"103ea8b5-7eec-4a47-aa67-1bfd0c94dad7","resolution":{"observed_at":"2026-07-10T19:57:34.133239Z","resolver_source":"local_arxiv","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-07-10T19:57:34.489859Z","title":null,"venue":null,"work_id":"5186590f-b4fb-4fdf-b67a-3e87822551a9","year":2024},"citing_paper":{"arxiv_id":"2607.07748","last_updated":"2026-07-08T09:18:56Z","snapshot_observed_at":"2026-08-06T15:26:59.961118Z","submitted_at":"2026-07-08T09:18:56Z","title":"Selective Left-Shift: Turning Test-Time Compute and Difficulty-based Curation into Training Data for Low-Resource Code Generation","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-07-10T19:48:27.137130Z"},"links":{"citing_paper":"/paper/2607.07748"},"observation_digest":"sha256:a562c188412e2cab77d57af647e77263ed552d0f1bb2ad21ed28aca5b1a9b43a","observation_id":"063746e0-7e79-4157-b4bf-e89252d2288f","resolution":{"observed_at":"2026-07-10T19:57:34.490873Z","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":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T19:57:34.493081Z","title":null,"venue":null,"work_id":"75e4d352-7188-49dc-a0dc-22084843c767","year":null},"citing_paper":{"arxiv_id":"2607.07748","last_updated":"2026-07-08T09:18:56Z","snapshot_observed_at":"2026-08-06T15:26:59.961118Z","submitted_at":"2026-07-08T09:18:56Z","title":"Selective Left-Shift: Turning Test-Time Compute and Difficulty-based Curation into Training Data for Low-Resource Code Generation","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-07-10T19:48:27.137130Z"},"links":{"citing_paper":"/paper/2607.07748"},"observation_digest":"sha256:42d27deae8d6f49f243a065050b6461b4d2c54eff101fba978a7bd76bd724f72","observation_id":"fa73e3f3-a363-42af-ae54-032137cc2dc6","resolution":{"observed_at":"2026-07-10T19:57:34.494103Z","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":{"arxiv_id":"2503.02951","last_updated":"2025-07-12T02:08:21Z","snapshot_observed_at":"2026-08-16T12:53:05.855883Z","submitted_at":"2025-03-04T19:17:36Z","title":"KodCode: A Diverse, Challenging, and Verifiable Synthetic Dataset for Coding","version":2},"cited_work":{"arxiv_id":"2503.02951","doi":"10.48550/arxiv.2503.02951","metadata_source":"pith","pith_arxiv_id":"2503.02951","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"KodCode: A di- verse, challenging, and verifiable synthetic dataset for coding.arXiv preprint","venue":"cs.LG","work_id":"7a8a1722-94c4-4a65-9391-3ffde48c168a","year":2025},"citing_paper":{"arxiv_id":"2607.07748","last_updated":"2026-07-08T09:18:56Z","snapshot_observed_at":"2026-08-06T15:26:59.961118Z","submitted_at":"2026-07-08T09:18:56Z","title":"Selective Left-Shift: Turning Test-Time Compute and Difficulty-based Curation into Training Data for Low-Resource Code Generation","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-07-10T19:48:27.137130Z"},"links":{"cited_paper":"/paper/2503.02951","citing_paper":"/paper/2607.07748"},"observation_digest":"sha256:6468da68bc228c64a6d7876af90d4ffe1a9a17fa27f2df8df64a588f8a86201a","observation_id":"32c6cc84-9aad-480c-9451-a4d867a98f44","resolution":{"observed_at":"2026-07-10T19:57:34.152440Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"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":"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":"2503.14476","doi":"10.48550/arxiv.2503.14476","metadata_source":"pith","pith_arxiv_id":"2503.14476","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"DAPO: An Open-Source LLM Reinforcement Learning System at Scale","venue":"cs.LG","work_id":"64019d00-0b11-4bbd-b173-b46c8fad0157","year":2025},"citing_paper":{"arxiv_id":"2607.07748","last_updated":"2026-07-08T09:18:56Z","snapshot_observed_at":"2026-08-06T15:26:59.961118Z","submitted_at":"2026-07-08T09:18:56Z","title":"Selective Left-Shift: Turning Test-Time Compute and Difficulty-based Curation into Training Data for Low-Resource Code Generation","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-07-10T19:48:27.137130Z"},"links":{"cited_paper":"/paper/2503.14476","citing_paper":"/paper/2607.07748"},"observation_digest":"sha256:b542e4773c5d7ffe35cd6dcab1cb4ce4404606e7fdb7a7acc121b927d6e577c5","observation_id":"23c13b20-3d93-49f0-8fa1-22ef952ae8b7","resolution":{"observed_at":"2026-07-10T19:57:34.150101Z","resolver_source":"local_arxiv","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-08T16:08:20.547492+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-08T16:08:20.547492+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2511.16602","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T19:57:34.153578Z","title":null,"venue":null,"work_id":"3af86fcf-99e8-4c89-a463-33c38623c492","year":2025},"citing_paper":{"arxiv_id":"2607.07748","last_updated":"2026-07-08T09:18:56Z","snapshot_observed_at":"2026-08-06T15:26:59.961118Z","submitted_at":"2026-07-08T09:18:56Z","title":"Selective Left-Shift: Turning Test-Time Compute and Difficulty-based Curation into Training Data for Low-Resource Code Generation","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-07-10T19:48:27.137130Z"},"links":{"citing_paper":"/paper/2607.07748"},"observation_digest":"sha256:9bea8892275ee0498bcd56e06c8185a55df62c23adf6706714707b29af1d55aa","observation_id":"bfd85b2c-e9df-48fa-bb51-cf5913131c60","resolution":{"observed_at":"2026-07-10T19:57:34.154957Z","resolver_source":"arxiv_id","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"}}],"paper":{"arxiv_id":"2607.07748","last_updated":"2026-07-08T09:18:56Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-06T15:26:59.961118Z","submitted_at":"2026-07-08T09:18:56Z","title":"Selective Left-Shift: Turning Test-Time Compute and Difficulty-based Curation into Training Data for Low-Resource Code Generation"},"reference_resolution":{"displayed":35,"state_counts":{"malformed_identifier":0,"metadata_mismatch":3,"parse_uncertain":0,"unresolved":13,"verified_exact":16,"verified_fuzzy":3},"total_outbound_references":35},"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 17 August 2026, this Paper Citation Record lists 35 of 35 outbound references and 0 inbound Pith citation observations for arXiv:2607.07748."}