{"as_of":"2026-08-11T12:20:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f363e75e9eeacedd35efe1d795a06ffb5646e41784c0cdcf4788bc2ec72e3a35","coverage":[{"denominator":30,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":30,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T01:07:40.389625Z","state":"measured"},{"denominator":31,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":31,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-27T00:13:28.707612Z","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":0,"observed_at":"2026-08-05T02:28:24.338817Z","source":"arxiv_reference"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2508.03931","last_updated":"2025-08-05T21:50:52Z","snapshot_observed_at":"2026-08-09T15:58:10.666761Z","submitted_at":"2025-08-05T21:50:52Z","title":"Analyzing Prominent LLMs: An Empirical Study of Performance and Complexity in Solving LeetCode Problems","version":1},"cited_work":{"arxiv_id":"2508.03931","doi":"10.48550/arxiv.2508.03931","metadata_source":"arxiv_reference","pith_arxiv_id":"2508.03931","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"& Nelapati, A","venue":"arXiv (Cornell University)","work_id":"b162f339-d0a0-4388-b1d6-8a72869c18c8","year":2025},"citing_paper":{"arxiv_id":"2606.17514","last_updated":"2026-06-16T04:47:42Z","snapshot_observed_at":"2026-08-07T12:52:16.926133Z","submitted_at":"2026-06-16T04:47:42Z","title":"Unlocking LLM Code Correction with Iterative Feedback Loops","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-06-27T00:13:28.707612Z"},"links":{"cited_paper":"/paper/2508.03931","citing_paper":"/paper/2606.17514"},"observation_digest":"sha256:99d5795417a9b3a62f8724b013f022b892b1aa2e13934d62d7977fc455cd2eaa","observation_id":"931d7938-ed02-4e76-8d6e-35757bb86571","resolution":{"observed_at":"2026-06-27T00:20:16.767351Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2508.03931/citation-record","integrity":"/paper/2508.03931/integrity","json":"/paper/2508.03931/citation-record.json","paper":"/paper/2508.03931"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T01:07:45.625502Z","title":"Learning to represent edits","venue":null,"work_id":"358f60a6-0ed3-4978-a62f-98c030cef6fa","year":null},"citing_paper":{"arxiv_id":"2508.03931","last_updated":"2025-08-05T21:50:52Z","snapshot_observed_at":"2026-08-09T15:58:10.666761Z","submitted_at":"2025-08-05T21:50:52Z","title":"Analyzing Prominent LLMs: An Empirical Study of Performance and Complexity in Solving LeetCode Problems","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T01:07:37.765614Z"},"links":{"citing_paper":"/paper/2508.03931"},"observation_digest":"sha256:eb43d135a8da4b8fbc6c468e3b4140951491bf32d0b0c3387f254f48bf00c77f","observation_id":"00743ab9-597e-4aef-be7e-b012b5301004","resolution":{"observed_at":"2026-08-06T01:07:45.725448Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T01:07:45.463428Z","title":"Recode: Benchmarking language models for code repair and generation","venue":null,"work_id":"c215b8b3-903e-4de9-a1d9-5e48196f5e01","year":2023},"citing_paper":{"arxiv_id":"2508.03931","last_updated":"2025-08-05T21:50:52Z","snapshot_observed_at":"2026-08-09T15:58:10.666761Z","submitted_at":"2025-08-05T21:50:52Z","title":"Analyzing Prominent LLMs: An Empirical Study of Performance and Complexity in Solving LeetCode Problems","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T01:07:37.826445Z"},"links":{"citing_paper":"/paper/2508.03931"},"observation_digest":"sha256:68e6cc72bb6936ac2e9e0dc9640b67ea87a5459356adcd7af33fdc157cfefd88","observation_id":"e8476e4a-dc6e-4108-b58b-91de64731a22","resolution":{"observed_at":"2026-08-06T01:07:45.542379Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T01:07:45.257974Z","title":"B., AND POLIKARPOVA , N","venue":null,"work_id":"b07514fb-2b62-4f59-9dcc-8e976b5a7426","year":2022},"citing_paper":{"arxiv_id":"2508.03931","last_updated":"2025-08-05T21:50:52Z","snapshot_observed_at":"2026-08-09T15:58:10.666761Z","submitted_at":"2025-08-05T21:50:52Z","title":"Analyzing Prominent LLMs: An Empirical Study of Performance and Complexity in Solving LeetCode Problems","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T01:07:37.915003Z"},"links":{"citing_paper":"/paper/2508.03931"},"observation_digest":"sha256:5e1abda540aa960c73fc929ac5e84016c8a271e9086ea48cb01ce3a94de164a2","observation_id":"c98b8282-5169-407c-9b30-c3933057bd1b","resolution":{"observed_at":"2026-08-06T01:07:45.371841Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T01:07:45.023205Z","title":"M., G EBRU , T., M CMILLAN -MAJOR , A., AND SHMITCHELL , S","venue":null,"work_id":"c749b3d1-e2a1-4d30-bf53-9cc9a020afed","year":2021},"citing_paper":{"arxiv_id":"2508.03931","last_updated":"2025-08-05T21:50:52Z","snapshot_observed_at":"2026-08-09T15:58:10.666761Z","submitted_at":"2025-08-05T21:50:52Z","title":"Analyzing Prominent LLMs: An Empirical Study of Performance and Complexity in Solving LeetCode Problems","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T01:07:37.978887Z"},"links":{"citing_paper":"/paper/2508.03931"},"observation_digest":"sha256:a6d47978975b6b63e4501f3c33fd6bcc183152a7a5906c4cdfb112e9cc0044ba","observation_id":"616a26a5-ed52-4cdd-91c2-8d054aa32b02","resolution":{"observed_at":"2026-08-06T01:07:45.152146Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T01:07:44.870796Z","title":"Supersonic: Learning to generate source code optimizations in c/c++","venue":null,"work_id":"11b93b13-17ec-423b-96dc-f5eb04fe00fd","year":2024},"citing_paper":{"arxiv_id":"2508.03931","last_updated":"2025-08-05T21:50:52Z","snapshot_observed_at":"2026-08-09T15:58:10.666761Z","submitted_at":"2025-08-05T21:50:52Z","title":"Analyzing Prominent LLMs: An Empirical Study of Performance and Complexity in Solving LeetCode Problems","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T01:07:38.081299Z"},"links":{"citing_paper":"/paper/2508.03931"},"observation_digest":"sha256:30aea348d0301e2fb2a9a9be7f78c1b57cf74d1bb5ef8960d79b6247603c7619","observation_id":"d2b95be4-2e0b-44f2-88b6-bbc8c272cbae","resolution":{"observed_at":"2026-08-06T01:07:44.948298Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T01:07:44.703153Z","title":"Codereval: A benchmark for evaluating code generation models, 2022","venue":null,"work_id":"38297148-4c24-4d1d-b6a3-e3db25c93e75","year":2022},"citing_paper":{"arxiv_id":"2508.03931","last_updated":"2025-08-05T21:50:52Z","snapshot_observed_at":"2026-08-09T15:58:10.666761Z","submitted_at":"2025-08-05T21:50:52Z","title":"Analyzing Prominent LLMs: An Empirical Study of Performance and Complexity in Solving LeetCode Problems","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T01:07:38.157209Z"},"links":{"citing_paper":"/paper/2508.03931"},"observation_digest":"sha256:de020645dd99b00859e6828119153c2e27d1c9ac31999721e0abf2d546429b2f","observation_id":"d12a5467-900b-46e0-bd6f-ee60f1a6da74","resolution":{"observed_at":"2026-08-06T01:07:44.761972Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T01:07:44.558747Z","title":"A performance study of llm-generated code on leetcode","venue":null,"work_id":"9d672407-78dc-45ab-88c7-01df16806463","year":2024},"citing_paper":{"arxiv_id":"2508.03931","last_updated":"2025-08-05T21:50:52Z","snapshot_observed_at":"2026-08-09T15:58:10.666761Z","submitted_at":"2025-08-05T21:50:52Z","title":"Analyzing Prominent LLMs: An Empirical Study of Performance and Complexity in Solving LeetCode Problems","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T01:07:38.220636Z"},"links":{"citing_paper":"/paper/2508.03931"},"observation_digest":"sha256:9d20ad9cee4356dfdce7b4698c4c62ac9fdac015db1ab0e295bd90647998d64c","observation_id":"ab303350-cddd-43c4-a448-b4298882c11e","resolution":{"observed_at":"2026-08-06T01:07:44.632009Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T01:07:44.397755Z","title":"E., AND COMBE - MALE , B","venue":null,"work_id":"f306ab0c-305d-4d1d-8214-95cba062b131","year":2023},"citing_paper":{"arxiv_id":"2508.03931","last_updated":"2025-08-05T21:50:52Z","snapshot_observed_at":"2026-08-09T15:58:10.666761Z","submitted_at":"2025-08-05T21:50:52Z","title":"Analyzing Prominent LLMs: An Empirical Study of Performance and Complexity in Solving LeetCode Problems","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T01:07:38.305622Z"},"links":{"citing_paper":"/paper/2508.03931"},"observation_digest":"sha256:588e419081d6e30445d38fafd0290a3bf37763f6476b396c90fef39c169a472a","observation_id":"494f5109-342e-4705-9664-40374b18ebe4","resolution":{"observed_at":"2026-08-06T01:07:44.486414Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T01:07:44.240658Z","title":null,"venue":null,"work_id":"0bdb187d-3fa9-4e0e-b780-bcad573d5086","year":2021},"citing_paper":{"arxiv_id":"2508.03931","last_updated":"2025-08-05T21:50:52Z","snapshot_observed_at":"2026-08-09T15:58:10.666761Z","submitted_at":"2025-08-05T21:50:52Z","title":"Analyzing Prominent LLMs: An Empirical Study of Performance and Complexity in Solving LeetCode Problems","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T01:07:38.404282Z"},"links":{"citing_paper":"/paper/2508.03931"},"observation_digest":"sha256:d8ee5c08b7ea8c1a3ea1c72d7ae397a6bd0d5002c43ba356efc1eb4843bd8cfb","observation_id":"26ce8f52-4d4c-4af4-8245-6375461c1cc6","resolution":{"observed_at":"2026-08-06T01:07:44.307227Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T01:07:44.093857Z","title":"Evaluating large language models trained on code, 2021","venue":null,"work_id":"03e67ee6-25d0-4db6-95be-2892d6b0db62","year":2021},"citing_paper":{"arxiv_id":"2508.03931","last_updated":"2025-08-05T21:50:52Z","snapshot_observed_at":"2026-08-09T15:58:10.666761Z","submitted_at":"2025-08-05T21:50:52Z","title":"Analyzing Prominent LLMs: An Empirical Study of Performance and Complexity in Solving LeetCode Problems","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T01:07:38.485056Z"},"links":{"citing_paper":"/paper/2508.03931"},"observation_digest":"sha256:74cc1643369e70ce7560ab9f47e436f47a36778e49e0a6c59bff5d7c340ecc63","observation_id":"742f2b8c-4c87-4f1a-ada9-bfdb1e775057","resolution":{"observed_at":"2026-08-06T01:07:44.134215Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T01:07:43.908204Z","title":"Codebert: A pre-trained model for programming and natural languages","venue":null,"work_id":"8cdeb41a-f9c3-49b0-99c2-d85723536b20","year":2020},"citing_paper":{"arxiv_id":"2508.03931","last_updated":"2025-08-05T21:50:52Z","snapshot_observed_at":"2026-08-09T15:58:10.666761Z","submitted_at":"2025-08-05T21:50:52Z","title":"Analyzing Prominent LLMs: An Empirical Study of Performance and Complexity in Solving LeetCode Problems","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T01:07:38.560465Z"},"links":{"citing_paper":"/paper/2508.03931"},"observation_digest":"sha256:f4999db0b2ad8925ae5fbadecdb8885a7c32654651edbe87a73900b42562de7c","observation_id":"d7d986d6-4eb4-4f33-8bff-405f90d77f8b","resolution":{"observed_at":"2026-08-06T01:07:43.998206Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T01:07:43.759270Z","title":"Z., C LEMENT , C","venue":null,"work_id":"f9b5b742-3a14-4ce7-be18-e8a116d2fed7","year":2022},"citing_paper":{"arxiv_id":"2508.03931","last_updated":"2025-08-05T21:50:52Z","snapshot_observed_at":"2026-08-09T15:58:10.666761Z","submitted_at":"2025-08-05T21:50:52Z","title":"Analyzing Prominent LLMs: An Empirical Study of Performance and Complexity in Solving LeetCode Problems","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T01:07:38.668841Z"},"links":{"citing_paper":"/paper/2508.03931"},"observation_digest":"sha256:3c4e9429b87cdb49b5bf8db9f7cc982bb1c572c5475854e0de82226c1c328ff7","observation_id":"2819c5af-fb66-4789-bff1-5f46e84f4cb1","resolution":{"observed_at":"2026-08-06T01:07:43.827188Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T01:07:43.587075Z","title":"T., AND MORGAN , E","venue":null,"work_id":"37724406-9dab-4191-8885-4b4448b1bf9d","year":2023},"citing_paper":{"arxiv_id":"2508.03931","last_updated":"2025-08-05T21:50:52Z","snapshot_observed_at":"2026-08-09T15:58:10.666761Z","submitted_at":"2025-08-05T21:50:52Z","title":"Analyzing Prominent LLMs: An Empirical Study of Performance and Complexity in Solving LeetCode Problems","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T01:07:38.769303Z"},"links":{"citing_paper":"/paper/2508.03931"},"observation_digest":"sha256:ec44679338678e1d7c8c3456dc578dc1d94826e939468e984eb4d6d6377cc322","observation_id":"383971be-ca75-4ec6-bc5a-520775ed125d","resolution":{"observed_at":"2026-08-06T01:07:43.671126Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T01:07:43.439101Z","title":"Beyond code generation: An observational study of chatgpt usage in software engineering practice","venue":null,"work_id":"a5a69ad8-f757-48f7-8ba2-4cfd12368780","year":2024},"citing_paper":{"arxiv_id":"2508.03931","last_updated":"2025-08-05T21:50:52Z","snapshot_observed_at":"2026-08-09T15:58:10.666761Z","submitted_at":"2025-08-05T21:50:52Z","title":"Analyzing Prominent LLMs: An Empirical Study of Performance and Complexity in Solving LeetCode Problems","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T01:07:38.857750Z"},"links":{"citing_paper":"/paper/2508.03931"},"observation_digest":"sha256:fb9b8712839dc497e386c5cdf1edffda65b5aef0d0603fcd7b28271c083d115a","observation_id":"e6a3de81-b89f-4536-befe-4c877070e263","resolution":{"observed_at":"2026-08-06T01:07:43.514703Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T01:07:43.284474Z","title":"Leetcode: The world’s leading online programming learn- ing platform","venue":null,"work_id":"430dbb49-2e76-4d04-9695-503dd7849fee","year":2024},"citing_paper":{"arxiv_id":"2508.03931","last_updated":"2025-08-05T21:50:52Z","snapshot_observed_at":"2026-08-09T15:58:10.666761Z","submitted_at":"2025-08-05T21:50:52Z","title":"Analyzing Prominent LLMs: An Empirical Study of Performance and Complexity in Solving LeetCode Problems","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T01:07:38.948786Z"},"links":{"citing_paper":"/paper/2508.03931"},"observation_digest":"sha256:c9517db80dcb296579aa268486f2a9b232d979c03a3e8fa738383f02ab33f1bd","observation_id":"8779f534-bf4b-4401-a9ac-1e37225db3d2","resolution":{"observed_at":"2026-08-06T01:07:43.342901Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T01:07:43.094860Z","title":"S., W ANG , Y., AND ZHANG , L","venue":null,"work_id":"f9cc29b3-5ce2-46fe-acd2-3cd2edb7732c","year":2023},"citing_paper":{"arxiv_id":"2508.03931","last_updated":"2025-08-05T21:50:52Z","snapshot_observed_at":"2026-08-09T15:58:10.666761Z","submitted_at":"2025-08-05T21:50:52Z","title":"Analyzing Prominent LLMs: An Empirical Study of Performance and Complexity in Solving LeetCode Problems","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T01:07:39.051830Z"},"links":{"citing_paper":"/paper/2508.03931"},"observation_digest":"sha256:2259faa37659353982af72fda7d9c855b3fa8671e5e5530ed5501421f741c89e","observation_id":"9141ac25-bcd1-4f7f-8eaa-000ec524f2e2","resolution":{"observed_at":"2026-08-06T01:07:43.196160Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T01:07:42.781744Z","title":"Ai software reliability: Concepts and related domains","venue":null,"work_id":"336c5e55-f11b-4cb4-aa41-4c3243a89d84","year":2023},"citing_paper":{"arxiv_id":"2508.03931","last_updated":"2025-08-05T21:50:52Z","snapshot_observed_at":"2026-08-09T15:58:10.666761Z","submitted_at":"2025-08-05T21:50:52Z","title":"Analyzing Prominent LLMs: An Empirical Study of Performance and Complexity in Solving LeetCode Problems","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T01:07:39.124147Z"},"links":{"citing_paper":"/paper/2508.03931"},"observation_digest":"sha256:c4cbcce3f18bce88a4271c528887fc1a19e619ac21ee03eeec1948f98d7700d5","observation_id":"4be7029a-896c-4948-881c-7f5c7fc89252","resolution":{"observed_at":"2026-08-06T01:07:42.915820Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T01:07:42.507268Z","title":"B., D RAIN , D., B ING , L., Z HOU , M., AND SUNDARE - SAN , N","venue":null,"work_id":"8384c6f0-93de-4756-b69f-7fe6c90bf857","year":2021},"citing_paper":{"arxiv_id":"2508.03931","last_updated":"2025-08-05T21:50:52Z","snapshot_observed_at":"2026-08-09T15:58:10.666761Z","submitted_at":"2025-08-05T21:50:52Z","title":"Analyzing Prominent LLMs: An Empirical Study of Performance and Complexity in Solving LeetCode Problems","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T01:07:39.225187Z"},"links":{"citing_paper":"/paper/2508.03931"},"observation_digest":"sha256:5e4dc6cd4198cbbea48bf67be9c66851659c2976c286038dafd50be5ac0d956f","observation_id":"f4980b23-e637-451b-a705-405212e85dca","resolution":{"observed_at":"2026-08-06T01:07:42.638507Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T01:07:42.260050Z","title":"Artificial in- telligence versus software engineers: An evidence-based assessment focusing on non-functional requirements","venue":null,"work_id":"762e7b85-3af9-4059-a301-07dbd8dde525","year":2023},"citing_paper":{"arxiv_id":"2508.03931","last_updated":"2025-08-05T21:50:52Z","snapshot_observed_at":"2026-08-09T15:58:10.666761Z","submitted_at":"2025-08-05T21:50:52Z","title":"Analyzing Prominent LLMs: An Empirical Study of Performance and Complexity in Solving LeetCode Problems","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T01:07:39.329438Z"},"links":{"citing_paper":"/paper/2508.03931"},"observation_digest":"sha256:9a64c169d71916b66e3f6b17d55c0aea0864634a409b40d6014c91be7c12bca9","observation_id":"d04c6f3e-5186-492c-b39b-d0d22d0aee1e","resolution":{"observed_at":"2026-08-06T01:07:42.391818Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2307.06435","last_updated":"2024-10-17T01:10:40Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-07-12T20:01:52Z","title":"A Comprehensive Overview of Large Language Models","version":10},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.06435","snapshot_observed_at":"2026-08-06T01:07:39.423507Z","title":"H., S HAIKH , A., M UMTAZ , A., A SLAM , A., AND ILYAS, A","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2508.03931","last_updated":"2025-08-05T21:50:52Z","snapshot_observed_at":"2026-08-09T15:58:10.666761Z","submitted_at":"2025-08-05T21:50:52Z","title":"Analyzing Prominent LLMs: An Empirical Study of Performance and Complexity in Solving LeetCode Problems","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-06T01:07:39.423507Z"},"links":{"cited_paper":"/paper/2307.06435","citing_paper":"/paper/2508.03931"},"observation_digest":"sha256:4f6236dfff07340a2388bac0fc2c26eb6c626fd7f8641532979535e05f8c3168","observation_id":"f00245ef-d78a-4dc6-aa5d-6f4f34a12ea2","resolution":{"observed_at":"2026-08-06T01:07:39.423507Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T01:07:42.014643Z","title":"An empirical evaluation of github copilot’s code suggestions","venue":null,"work_id":"f6446fa5-4cf8-429d-a64b-77b6cac9f3ac","year":2022},"citing_paper":{"arxiv_id":"2508.03931","last_updated":"2025-08-05T21:50:52Z","snapshot_observed_at":"2026-08-09T15:58:10.666761Z","submitted_at":"2025-08-05T21:50:52Z","title":"Analyzing Prominent LLMs: An Empirical Study of Performance and Complexity in Solving LeetCode Problems","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-06T01:07:39.526712Z"},"links":{"citing_paper":"/paper/2508.03931"},"observation_digest":"sha256:fc13902c7961775829d6f040d84caae665045792aeca4688e84634da202107b3","observation_id":"69055221-dc5e-434a-8325-af9d7c922386","resolution":{"observed_at":"2026-08-06T01:07:42.102725Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T01:07:41.826107Z","title":"Gpt-4 technical report, 2024","venue":null,"work_id":"9e28f742-b688-4002-b295-cd643770bc4a","year":2024},"citing_paper":{"arxiv_id":"2508.03931","last_updated":"2025-08-05T21:50:52Z","snapshot_observed_at":"2026-08-09T15:58:10.666761Z","submitted_at":"2025-08-05T21:50:52Z","title":"Analyzing Prominent LLMs: An Empirical Study of Performance and Complexity in Solving LeetCode Problems","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-06T01:07:39.612826Z"},"links":{"citing_paper":"/paper/2508.03931"},"observation_digest":"sha256:66f485f423cb183593ef8dc4387c756dc2bfcf43f561613a2011d23df4351d89","observation_id":"97159fbe-296d-4a00-9997-248e2a1359bf","resolution":{"observed_at":"2026-08-06T01:07:41.899097Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T01:07:41.621557Z","title":null,"venue":null,"work_id":"ce64647f-0aa0-4213-8466-6c0c84aefcfd","year":2024},"citing_paper":{"arxiv_id":"2508.03931","last_updated":"2025-08-05T21:50:52Z","snapshot_observed_at":"2026-08-09T15:58:10.666761Z","submitted_at":"2025-08-05T21:50:52Z","title":"Analyzing Prominent LLMs: An Empirical Study of Performance and Complexity in Solving LeetCode Problems","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-06T01:07:39.691462Z"},"links":{"citing_paper":"/paper/2508.03931"},"observation_digest":"sha256:05bd925f934ace93752eea3b8c330ad014973025db5c7a9316caf52fa2fb1a52","observation_id":"5d563f0e-0f7d-4f9a-8690-f0399272f6c4","resolution":{"observed_at":"2026-08-06T01:07:41.722154Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T01:07:41.375709Z","title":"Choose your pro- gramming copilot: A comparison of the program synthesis performance of github copilot and genetic programming","venue":null,"work_id":"da8838fa-8ed5-4500-894f-0c4d58bf5bca","year":2022},"citing_paper":{"arxiv_id":"2508.03931","last_updated":"2025-08-05T21:50:52Z","snapshot_observed_at":"2026-08-09T15:58:10.666761Z","submitted_at":"2025-08-05T21:50:52Z","title":"Analyzing Prominent LLMs: An Empirical Study of Performance and Complexity in Solving LeetCode Problems","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-06T01:07:39.805619Z"},"links":{"citing_paper":"/paper/2508.03931"},"observation_digest":"sha256:4f6c50cb69a1d39183ae2e053e3eaafae4d1818c0a2dc059de82ebab3aa26fb3","observation_id":"db60303d-a9c2-4e6e-a870-07a667680631","resolution":{"observed_at":"2026-08-06T01:07:41.478963Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T01:07:41.173582Z","title":"Stratascratch: Real-world data science coding chal- lenges","venue":null,"work_id":"eab3cc4d-52ca-421b-a736-3d2fc68e7bd3","year":2022},"citing_paper":{"arxiv_id":"2508.03931","last_updated":"2025-08-05T21:50:52Z","snapshot_observed_at":"2026-08-09T15:58:10.666761Z","submitted_at":"2025-08-05T21:50:52Z","title":"Analyzing Prominent LLMs: An Empirical Study of Performance and Complexity in Solving LeetCode Problems","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-06T01:07:39.897855Z"},"links":{"citing_paper":"/paper/2508.03931"},"observation_digest":"sha256:bda5d2f9240903f612439a8f4f128cdbbd8c65c811ffb1b6bfd8bb7103412d2f","observation_id":"16a71d48-7acc-4ce0-be26-a09f69aabb41","resolution":{"observed_at":"2026-08-06T01:07:41.245765Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T01:07:40.915395Z","title":"K., F U, S., AND SUNDARESAN , N","venue":null,"work_id":"43faabb1-d5b7-4c15-bdf8-b9cd2544baee","year":2022},"citing_paper":{"arxiv_id":"2508.03931","last_updated":"2025-08-05T21:50:52Z","snapshot_observed_at":"2026-08-09T15:58:10.666761Z","submitted_at":"2025-08-05T21:50:52Z","title":"Analyzing Prominent LLMs: An Empirical Study of Performance and Complexity in Solving LeetCode Problems","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-06T01:07:39.961387Z"},"links":{"citing_paper":"/paper/2508.03931"},"observation_digest":"sha256:4614b0104757f5f4b833d7601a78da04dff017bb92b52b05bd0f8e92bf73e245","observation_id":"c3c88cb7-39a9-44fe-bd32-11d2e32d635b","resolution":{"observed_at":"2026-08-06T01:07:41.061451Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T01:07:40.744522Z","title":"Expectation vs","venue":null,"work_id":"95cc53a9-0f04-432f-a71f-7eb629ef05b3","year":2022},"citing_paper":{"arxiv_id":"2508.03931","last_updated":"2025-08-05T21:50:52Z","snapshot_observed_at":"2026-08-09T15:58:10.666761Z","submitted_at":"2025-08-05T21:50:52Z","title":"Analyzing Prominent LLMs: An Empirical Study of Performance and Complexity in Solving LeetCode Problems","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-06T01:07:40.094265Z"},"links":{"citing_paper":"/paper/2508.03931"},"observation_digest":"sha256:6d071a1140e7b4eaf556d180aba74db36473e11f9def8b5b734681caec0fe264","observation_id":"b8b3a4f1-732e-43e0-af5b-ed9321f7c557","resolution":{"observed_at":"2026-08-06T01:07:40.814188Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T01:07:40.560638Z","title":"V., AND VAUGHAN , J","venue":null,"work_id":"f1ced146-ec46-4c94-9224-db77c64af5ba","year":2024},"citing_paper":{"arxiv_id":"2508.03931","last_updated":"2025-08-05T21:50:52Z","snapshot_observed_at":"2026-08-09T15:58:10.666761Z","submitted_at":"2025-08-05T21:50:52Z","title":"Analyzing Prominent LLMs: An Empirical Study of Performance and Complexity in Solving LeetCode Problems","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-06T01:07:40.136653Z"},"links":{"citing_paper":"/paper/2508.03931"},"observation_digest":"sha256:98db6f64d1425c4c27f453c401de0ac8fd207554a797c63bcd16ee49eea0882b","observation_id":"563a90e9-4844-4286-b268-dba247cc0dc0","resolution":{"observed_at":"2026-08-06T01:07:40.625871Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2302.11382","last_updated":"2023-02-21T12:42:44Z","snapshot_observed_at":"2026-07-06T14:54:37.559648Z","submitted_at":"2023-02-21T12:42:44Z","title":"A Prompt Pattern Catalog to Enhance Prompt Engineering with ChatGPT","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.11382","snapshot_observed_at":"2026-08-06T01:07:40.262015Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2508.03931","last_updated":"2025-08-05T21:50:52Z","snapshot_observed_at":"2026-08-09T15:58:10.666761Z","submitted_at":"2025-08-05T21:50:52Z","title":"Analyzing Prominent LLMs: An Empirical Study of Performance and Complexity in Solving LeetCode Problems","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-06T01:07:40.262015Z"},"links":{"cited_paper":"/paper/2302.11382","citing_paper":"/paper/2508.03931"},"observation_digest":"sha256:7dce2692e02db684f59191dd1016531af03af4bf6816c921588a307fb5a26545","observation_id":"6d0520ab-1ca3-40e9-96dc-2032cc54343c","resolution":{"observed_at":"2026-08-06T01:07:40.262015Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2202.13169","last_updated":"2022-05-04T16:08:31Z","snapshot_observed_at":"2026-08-06T20:27:50.671898Z","submitted_at":"2022-02-26T15:53:55Z","title":"A Systematic Evaluation of Large Language Models of Code","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2202.13169","snapshot_observed_at":"2026-08-06T01:07:40.389625Z","title":"F., A LON , U., AND NEUBIG , G","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2508.03931","last_updated":"2025-08-05T21:50:52Z","snapshot_observed_at":"2026-08-09T15:58:10.666761Z","submitted_at":"2025-08-05T21:50:52Z","title":"Analyzing Prominent LLMs: An Empirical Study of Performance and Complexity in Solving LeetCode Problems","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-06T01:07:40.389625Z"},"links":{"cited_paper":"/paper/2202.13169","citing_paper":"/paper/2508.03931"},"observation_digest":"sha256:f7e4bd5b18f35fcce5144fe0f0f197823119f0974d21cfaaf984fc4d0132c58c","observation_id":"f52ab0a2-1e64-468d-a84c-dc4bf98f0200","resolution":{"observed_at":"2026-08-06T01:07:40.389625Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2508.03931","last_updated":"2025-08-05T21:50:52Z","latest_version":1,"primary_category":"cs.SE","snapshot_observed_at":"2026-08-09T15:58:10.666761Z","submitted_at":"2025-08-05T21:50:52Z","title":"Analyzing Prominent LLMs: An Empirical Study of Performance and Complexity in Solving LeetCode Problems"},"reference_resolution":{"displayed":30,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":5,"verified_exact":0,"verified_fuzzy":25},"total_outbound_references":30},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 30 of 30 outbound references and 1 inbound Pith citation observation for arXiv:2508.03931."}