{"as_of":"2026-08-18T07:35:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6828a8e6c84bbdc1e99668a2a16bd7e43eda68768b4a4185f148a01bdd3b7eca","coverage":[{"denominator":71,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":71,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T21:23:50.837908Z","state":"measured"},{"denominator":71,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":71,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+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/2501.05051/citation-record","integrity":"/paper/2501.05051/integrity","json":"/paper/2501.05051/citation-record.json","paper":"/paper/2501.05051"},"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-10T21:23:51.444042Z","title":"Toward deep learning software repositories,","venue":null,"work_id":"cad7d359-8a17-49d0-bd7e-f8a82a9da640","year":2015},"citing_paper":{"arxiv_id":"2501.05051","last_updated":"2025-01-09T08:20:42Z","snapshot_observed_at":"2026-08-17T20:48:37.533049Z","submitted_at":"2025-01-09T08:20:42Z","title":"On the Generalizability of Transformer Models to Code Completions of Different Lengths","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-10T21:23:50.622176Z"},"links":{"citing_paper":"/paper/2501.05051"},"observation_digest":"sha256:933127bcfa5d6b07767b9f9eb6f0217cc8c3af6ed1503ed744464f93d5e0594b","observation_id":"0ffdd0d6-00f9-43b3-baa5-e123e51d152f","resolution":{"observed_at":"2026-08-10T21:23:51.446998Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T21:23:51.434221Z","title":"An empirical study on the usage of transformer models for code completion,","venue":null,"work_id":"793508ff-4d4f-4a56-a340-1b2b36fc9da5","year":2021},"citing_paper":{"arxiv_id":"2501.05051","last_updated":"2025-01-09T08:20:42Z","snapshot_observed_at":"2026-08-17T20:48:37.533049Z","submitted_at":"2025-01-09T08:20:42Z","title":"On the Generalizability of Transformer Models to Code Completions of Different Lengths","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-10T21:23:50.626133Z"},"links":{"citing_paper":"/paper/2501.05051"},"observation_digest":"sha256:fb414dfbab8e73c794fceb8d54b09bc2c909afdda15ff75bf60c0da2884e8143","observation_id":"5cb7f04b-ecb4-4652-b78d-31d86138d0db","resolution":{"observed_at":"2026-08-10T21:23:51.437971Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T21:23:51.426251Z","title":"Using pre-trained models to boost code review automa- tion,","venue":null,"work_id":"4d3540b3-fbb1-4f20-9dbe-bff432f1e0af","year":2022},"citing_paper":{"arxiv_id":"2501.05051","last_updated":"2025-01-09T08:20:42Z","snapshot_observed_at":"2026-08-17T20:48:37.533049Z","submitted_at":"2025-01-09T08:20:42Z","title":"On the Generalizability of Transformer Models to Code Completions of Different Lengths","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-10T21:23:50.629277Z"},"links":{"citing_paper":"/paper/2501.05051"},"observation_digest":"sha256:a8084da2c294e297ae9522d4b785cd976473dafa2d88c34c645e23e387ace8b8","observation_id":"9427dc71-e9df-4a93-a44e-611f0c72afbf","resolution":{"observed_at":"2026-08-10T21:23:51.429415Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T21:23:51.417799Z","title":"Recommendations for datasets for source code summarization,","venue":null,"work_id":"16e048fe-0aed-4069-8e05-ff5f2da0291f","year":2019},"citing_paper":{"arxiv_id":"2501.05051","last_updated":"2025-01-09T08:20:42Z","snapshot_observed_at":"2026-08-17T20:48:37.533049Z","submitted_at":"2025-01-09T08:20:42Z","title":"On the Generalizability of Transformer Models to Code Completions of Different Lengths","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-10T21:23:50.632022Z"},"links":{"citing_paper":"/paper/2501.05051"},"observation_digest":"sha256:2a545c67a199c6cc9953a778c0caf9010e4cd4684034396aa1693cd713be2a5c","observation_id":"e5bb5f20-49c9-4f4e-86ee-22968c049a17","resolution":{"observed_at":"2026-08-10T21:23:51.421039Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T21:23:51.407998Z","title":"An Empirical Study on Learning Bug-Fixing Patches in the Wild via Neural Machine Translation,","venue":null,"work_id":"c84bd18c-9dff-4d32-b708-ce37619fa7f6","year":2019},"citing_paper":{"arxiv_id":"2501.05051","last_updated":"2025-01-09T08:20:42Z","snapshot_observed_at":"2026-08-17T20:48:37.533049Z","submitted_at":"2025-01-09T08:20:42Z","title":"On the Generalizability of Transformer Models to Code Completions of Different Lengths","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-10T21:23:50.634509Z"},"links":{"citing_paper":"/paper/2501.05051"},"observation_digest":"sha256:138b0e197b454ef5fc4e1ca0276806a9fa055d480139f17bd91a510c2c6ef29d","observation_id":"6fc10309-4709-4d05-9db0-c8e1fc19a374","resolution":{"observed_at":"2026-08-10T21:23:51.410946Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1901.01808","last_updated":"2019-09-09T06:21:27Z","snapshot_observed_at":"2026-08-14T17:38:48.595236Z","submitted_at":"2018-12-24T18:04:14Z","title":"SequenceR: Sequence-to-Sequence Learning for End-to-End Program Repair","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1901.01808","snapshot_observed_at":"2026-08-10T21:23:50.638147Z","title":"Sequencer: Sequence-to-sequence learning for end-to- end program repair,","venue":null,"work_id":null,"year":1901},"citing_paper":{"arxiv_id":"2501.05051","last_updated":"2025-01-09T08:20:42Z","snapshot_observed_at":"2026-08-17T20:48:37.533049Z","submitted_at":"2025-01-09T08:20:42Z","title":"On the Generalizability of Transformer Models to Code Completions of Different Lengths","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-10T21:23:50.638147Z"},"links":{"cited_paper":"/paper/1901.01808","citing_paper":"/paper/2501.05051"},"observation_digest":"sha256:f8eae78ef0294ecb71b19f2e039323bffd6b2088d3a32d9a200b334dee97253e","observation_id":"428acb83-63b4-4dc6-8b22-ed8d9878855a","resolution":{"observed_at":"2026-08-10T21:23:50.638147Z","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-10T21:23:51.400413Z","title":"On learning meaningful assert statements for unit test cases,","venue":null,"work_id":"c27b41b2-fbb9-4829-97b4-75acfb174305","year":2020},"citing_paper":{"arxiv_id":"2501.05051","last_updated":"2025-01-09T08:20:42Z","snapshot_observed_at":"2026-08-17T20:48:37.533049Z","submitted_at":"2025-01-09T08:20:42Z","title":"On the Generalizability of Transformer Models to Code Completions of Different Lengths","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-10T21:23:50.642044Z"},"links":{"citing_paper":"/paper/2501.05051"},"observation_digest":"sha256:df4f34a0e5f126dc9e6d9385faa216c16e382eee7c5f1e28bce85c64d4a5d3fb","observation_id":"66420f03-6b7a-4d70-84f9-c286709725bd","resolution":{"observed_at":"2026-08-10T21:23:51.403351Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T21:23:51.392156Z","title":"Learning how to mutate source code from bug-fixes,","venue":null,"work_id":"07ea6a8e-6c91-4556-8f46-4f4fafa3b61c","year":2019},"citing_paper":{"arxiv_id":"2501.05051","last_updated":"2025-01-09T08:20:42Z","snapshot_observed_at":"2026-08-17T20:48:37.533049Z","submitted_at":"2025-01-09T08:20:42Z","title":"On the Generalizability of Transformer Models to Code Completions of Different Lengths","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-10T21:23:50.645779Z"},"links":{"citing_paper":"/paper/2501.05051"},"observation_digest":"sha256:37fb9250173c04881fc2cd0ab62de9cab0bf164502c9ce673725e2b80bc9c0ac","observation_id":"141b7b8a-13c6-41d0-a2fd-4d7ca9c25556","resolution":{"observed_at":"2026-08-10T21:23:51.395321Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:23:50.649064Z","title":"A systematic literature review on the use of deep learning in software engineering research,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2501.05051","last_updated":"2025-01-09T08:20:42Z","snapshot_observed_at":"2026-08-17T20:48:37.533049Z","submitted_at":"2025-01-09T08:20:42Z","title":"On the Generalizability of Transformer Models to Code Completions of Different Lengths","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-10T21:23:50.649064Z"},"links":{"citing_paper":"/paper/2501.05051"},"observation_digest":"sha256:30234b3d2590ef8e03d8fc3fb060610bc1abd47aaf4d1333b4df1dd136bde789","observation_id":"ad20ed06-7cbe-4f56-a5bc-f0c8d8882500","resolution":{"observed_at":"2026-08-10T21:23:50.649064Z","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-10T21:23:51.378771Z","title":"Using transfer learning for code- related tasks,","venue":null,"work_id":"e2c537dc-4042-4f96-a750-5167ed4255ef","year":2022},"citing_paper":{"arxiv_id":"2501.05051","last_updated":"2025-01-09T08:20:42Z","snapshot_observed_at":"2026-08-17T20:48:37.533049Z","submitted_at":"2025-01-09T08:20:42Z","title":"On the Generalizability of Transformer Models to Code Completions of Different Lengths","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-10T21:23:50.651850Z"},"links":{"citing_paper":"/paper/2501.05051"},"observation_digest":"sha256:45e251d73a6a14d95a918afe975c4a33f1e0b2a2570ea738d1d7a763b59e8805","observation_id":"0d7c8564-2d74-4d48-92aa-bf2d51c6882b","resolution":{"observed_at":"2026-08-10T21:23:51.381921Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T21:23:51.370311Z","title":"On learning meaningful code changes via neural machine translation,","venue":null,"work_id":"9ee6b32f-1641-460f-a49e-34faafba4588","year":2019},"citing_paper":{"arxiv_id":"2501.05051","last_updated":"2025-01-09T08:20:42Z","snapshot_observed_at":"2026-08-17T20:48:37.533049Z","submitted_at":"2025-01-09T08:20:42Z","title":"On the Generalizability of Transformer Models to Code Completions of Different Lengths","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-10T21:23:50.654483Z"},"links":{"citing_paper":"/paper/2501.05051"},"observation_digest":"sha256:850e9ba93a218f60f986e0795326db652754a4755287064e2ab619b8ddbc4739","observation_id":"64485ede-bf68-458f-aa73-562767c71ba2","resolution":{"observed_at":"2026-08-10T21:23:51.373189Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:23:50.658480Z","title":"Attention is all you need,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2501.05051","last_updated":"2025-01-09T08:20:42Z","snapshot_observed_at":"2026-08-17T20:48:37.533049Z","submitted_at":"2025-01-09T08:20:42Z","title":"On the Generalizability of Transformer Models to Code Completions of Different Lengths","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-10T21:23:50.658480Z"},"links":{"citing_paper":"/paper/2501.05051"},"observation_digest":"sha256:f8d82915788af7ab80a701f19c3f037c9d361e4626344460d27b6d5995e33443","observation_id":"26057cc0-0743-478a-9a9e-3b462a395203","resolution":{"observed_at":"2026-08-10T21:23:50.658480Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:23:50.662126Z","title":"Learning internal representations by error propagation,","venue":null,"work_id":null,"year":1985},"citing_paper":{"arxiv_id":"2501.05051","last_updated":"2025-01-09T08:20:42Z","snapshot_observed_at":"2026-08-17T20:48:37.533049Z","submitted_at":"2025-01-09T08:20:42Z","title":"On the Generalizability of Transformer Models to Code Completions of Different Lengths","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-10T21:23:50.662126Z"},"links":{"citing_paper":"/paper/2501.05051"},"observation_digest":"sha256:e215a67dd99082a8c2190365f43831e4508039d4ff8079e3b6b5b853bce325f4","observation_id":"54f13ef3-ebf5-4804-bcb5-80e89e84a2a3","resolution":{"observed_at":"2026-08-10T21:23:50.662126Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2107.03374","last_updated":"2021-07-14T17:16:02Z","snapshot_observed_at":"2026-08-08T11:58:24.516369Z","submitted_at":"2021-07-07T17:41:24Z","title":"Evaluating Large Language Models Trained on Code","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2107.03374","snapshot_observed_at":"2026-08-10T21:23:50.665165Z","title":"Evaluating large language models trained on code,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2501.05051","last_updated":"2025-01-09T08:20:42Z","snapshot_observed_at":"2026-08-17T20:48:37.533049Z","submitted_at":"2025-01-09T08:20:42Z","title":"On the Generalizability of Transformer Models to Code Completions of Different Lengths","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-10T21:23:50.665165Z"},"links":{"cited_paper":"/paper/2107.03374","citing_paper":"/paper/2501.05051"},"observation_digest":"sha256:7ebe1a186feb1d7a2896b8d0365d6b46835c51f79af09a8b8e2a25be0ee670c6","observation_id":"6efc2ee2-c3aa-4aca-a5e6-c576ed35a91b","resolution":{"observed_at":"2026-08-10T21:23:50.665165Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2108.07732","last_updated":"2021-08-16T03:57:30Z","snapshot_observed_at":"2026-08-15T17:40:38.050939Z","submitted_at":"2021-08-16T03:57:30Z","title":"Program Synthesis with Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2108.07732","snapshot_observed_at":"2026-08-10T21:23:50.669210Z","title":"Program synthesis with large language models,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2501.05051","last_updated":"2025-01-09T08:20:42Z","snapshot_observed_at":"2026-08-17T20:48:37.533049Z","submitted_at":"2025-01-09T08:20:42Z","title":"On the Generalizability of Transformer Models to Code Completions of Different Lengths","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-10T21:23:50.669210Z"},"links":{"cited_paper":"/paper/2108.07732","citing_paper":"/paper/2501.05051"},"observation_digest":"sha256:136fcff169f8e6b95996837be90580737c8950f8f375306ece92ed9cef9aec93","observation_id":"1c87da3a-25ac-4db1-b1a0-2a2c61934c4e","resolution":{"observed_at":"2026-08-10T21:23:50.669210Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2204.05999","last_updated":"2023-04-09T14:31:40Z","snapshot_observed_at":"2026-08-13T02:34:38.117682Z","submitted_at":"2022-04-12T16:25:26Z","title":"InCoder: A Generative Model for Code Infilling and Synthesis","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2204.05999","snapshot_observed_at":"2026-08-10T21:23:50.673255Z","title":"Incoder: A generative model for code infilling and synthesis,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2501.05051","last_updated":"2025-01-09T08:20:42Z","snapshot_observed_at":"2026-08-17T20:48:37.533049Z","submitted_at":"2025-01-09T08:20:42Z","title":"On the Generalizability of Transformer Models to Code Completions of Different Lengths","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-10T21:23:50.673255Z"},"links":{"cited_paper":"/paper/2204.05999","citing_paper":"/paper/2501.05051"},"observation_digest":"sha256:2d4807c8bff7bcdb3a2b0268f28ead7a1723de5b90756c5b1ed8c3cab524a39d","observation_id":"2c7cab47-1261-451e-abc7-f7150f029377","resolution":{"observed_at":"2026-08-10T21:23:50.673255Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2012.15832","last_updated":"2021-06-03T02:14:46Z","snapshot_observed_at":"2026-08-16T18:55:00.707835Z","submitted_at":"2020-12-31T18:52:59Z","title":"Shortformer: Better Language Modeling using Shorter Inputs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2012.15832","snapshot_observed_at":"2026-08-10T21:23:50.677911Z","title":"Shortformer: Better language modeling using shorter inputs,","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2501.05051","last_updated":"2025-01-09T08:20:42Z","snapshot_observed_at":"2026-08-17T20:48:37.533049Z","submitted_at":"2025-01-09T08:20:42Z","title":"On the Generalizability of Transformer Models to Code Completions of Different Lengths","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-10T21:23:50.677911Z"},"links":{"cited_paper":"/paper/2012.15832","citing_paper":"/paper/2501.05051"},"observation_digest":"sha256:be95edc49f794234d5a58ba2d17c76ebc135063a635879c0fe6b04e17602a54b","observation_id":"2c43d8f4-5c55-4daa-9abf-2e9c30b76dc1","resolution":{"observed_at":"2026-08-10T21:23:50.677911Z","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-10T21:23:51.354879Z","title":"Train short, test long: Attention with linear biases enables input length extrapolation,","venue":null,"work_id":"efe1e237-8b16-478e-b933-d01f3d34a2db","year":2022},"citing_paper":{"arxiv_id":"2501.05051","last_updated":"2025-01-09T08:20:42Z","snapshot_observed_at":"2026-08-17T20:48:37.533049Z","submitted_at":"2025-01-09T08:20:42Z","title":"On the Generalizability of Transformer Models to Code Completions of Different Lengths","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-10T21:23:50.681997Z"},"links":{"citing_paper":"/paper/2501.05051"},"observation_digest":"sha256:4293544b912f13c1d26e330c6b8d6566cbc3056d0ab0736aad3ec5bbfa7377de","observation_id":"11aaa426-f66a-42dc-8285-129878424584","resolution":{"observed_at":"2026-08-10T21:23:51.357784Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1901.02860","last_updated":"2019-06-02T21:21:48Z","snapshot_observed_at":"2026-08-16T17:45:52.864524Z","submitted_at":"2019-01-09T18:28:19Z","title":"Transformer-XL: Attentive Language Models Beyond a Fixed-Length Context","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1901.02860","snapshot_observed_at":"2026-08-10T21:23:50.685007Z","title":"Transformer-xl: Attentive language models beyond a fixed-length context,","venue":null,"work_id":null,"year":1901},"citing_paper":{"arxiv_id":"2501.05051","last_updated":"2025-01-09T08:20:42Z","snapshot_observed_at":"2026-08-17T20:48:37.533049Z","submitted_at":"2025-01-09T08:20:42Z","title":"On the Generalizability of Transformer Models to Code Completions of Different Lengths","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-10T21:23:50.685007Z"},"links":{"cited_paper":"/paper/1901.02860","citing_paper":"/paper/2501.05051"},"observation_digest":"sha256:a5af9e07280f2a804ab882679bc8e1ec1a6eff755bc0ddc224a4e16d46da454b","observation_id":"11fdf168-1b64-4648-9457-f334f8e13992","resolution":{"observed_at":"2026-08-10T21:23:50.685007Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:23:50.688723Z","title":"Exploring the limits of transfer learning with a unified text-to-text transformer","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2501.05051","last_updated":"2025-01-09T08:20:42Z","snapshot_observed_at":"2026-08-17T20:48:37.533049Z","submitted_at":"2025-01-09T08:20:42Z","title":"On the Generalizability of Transformer Models to Code Completions of Different Lengths","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-10T21:23:50.688723Z"},"links":{"citing_paper":"/paper/2501.05051"},"observation_digest":"sha256:524d0ae5e4a91d6d44fa19849850b9f434ac95004dad03b6952d72fdde36b8e1","observation_id":"82d224e3-fd30-4e9e-b176-9b5bbf616f51","resolution":{"observed_at":"2026-08-10T21:23:50.688723Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2212.10554","last_updated":"2022-12-20T18:56:20Z","snapshot_observed_at":"2026-08-16T16:07:11.256874Z","submitted_at":"2022-12-20T18:56:20Z","title":"A Length-Extrapolatable Transformer","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2212.10554","snapshot_observed_at":"2026-08-10T21:23:50.692218Z","title":"A length-extrapolatable transformer,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2501.05051","last_updated":"2025-01-09T08:20:42Z","snapshot_observed_at":"2026-08-17T20:48:37.533049Z","submitted_at":"2025-01-09T08:20:42Z","title":"On the Generalizability of Transformer Models to Code Completions of Different Lengths","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-10T21:23:50.692218Z"},"links":{"cited_paper":"/paper/2212.10554","citing_paper":"/paper/2501.05051"},"observation_digest":"sha256:df440c47783e42d2585f5e62e372d11c3f3a3fc11de6de1585a610e2ac2c89d3","observation_id":"46efd67f-8c2c-4493-9a63-a336ad53171f","resolution":{"observed_at":"2026-08-10T21:23:50.692218Z","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-10T21:23:51.342263Z","title":"Github copilot your ai pair programmer,","venue":null,"work_id":"2c99c5fa-87db-4ddc-9f8a-d759b67b23b1","year":2023},"citing_paper":{"arxiv_id":"2501.05051","last_updated":"2025-01-09T08:20:42Z","snapshot_observed_at":"2026-08-17T20:48:37.533049Z","submitted_at":"2025-01-09T08:20:42Z","title":"On the Generalizability of Transformer Models to Code Completions of Different Lengths","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-10T21:23:50.695526Z"},"links":{"citing_paper":"/paper/2501.05051"},"observation_digest":"sha256:8f82162a492469d99e6ec981ea7656f75c25164c4dcb2c947c35b6f69041b156","observation_id":"781c145c-384e-4acf-b68d-08211ef0507b","resolution":{"observed_at":"2026-08-10T21:23:51.345606Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2104.09864","last_updated":"2023-11-08T13:36:32Z","snapshot_observed_at":"2026-08-17T06:56:20.644738Z","submitted_at":"2021-04-20T09:54:06Z","title":"RoFormer: Enhanced Transformer with Rotary Position Embedding","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2104.09864","snapshot_observed_at":"2026-08-10T21:23:50.697724Z","title":"Roformer: Enhanced transformer with rotary position embedding,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2501.05051","last_updated":"2025-01-09T08:20:42Z","snapshot_observed_at":"2026-08-17T20:48:37.533049Z","submitted_at":"2025-01-09T08:20:42Z","title":"On the Generalizability of Transformer Models to Code Completions of Different Lengths","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-10T21:23:50.697724Z"},"links":{"cited_paper":"/paper/2104.09864","citing_paper":"/paper/2501.05051"},"observation_digest":"sha256:7f5541c0a5a13fc0cb0818bcfa71443a172fb3fcbfc44d412578de8ce8b9a58b","observation_id":"9f62f19e-6458-41e6-8741-4974be8e7c82","resolution":{"observed_at":"2026-08-10T21:23:50.697724Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1508.07909","last_updated":"2016-06-10T14:45:08Z","snapshot_observed_at":"2026-08-17T07:28:37.146698Z","submitted_at":"2015-08-31T16:37:31Z","title":"Neural Machine Translation of Rare Words with Subword Units","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1508.07909","snapshot_observed_at":"2026-08-10T21:23:50.700095Z","title":"Neural machine translation of rare words with subword units,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2501.05051","last_updated":"2025-01-09T08:20:42Z","snapshot_observed_at":"2026-08-17T20:48:37.533049Z","submitted_at":"2025-01-09T08:20:42Z","title":"On the Generalizability of Transformer Models to Code Completions of Different Lengths","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-10T21:23:50.700095Z"},"links":{"cited_paper":"/paper/1508.07909","citing_paper":"/paper/2501.05051"},"observation_digest":"sha256:32e1ae6ee61c73a93bdd8189cf47760ecf8f8b02249c8bb66ca58a7c48b4bfc0","observation_id":"fb2a77a3-3c27-4277-a226-1ea1d79c0af0","resolution":{"observed_at":"2026-08-10T21:23:50.700095Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:23:50.702315Z","title":"On the naturalness of software,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2501.05051","last_updated":"2025-01-09T08:20:42Z","snapshot_observed_at":"2026-08-17T20:48:37.533049Z","submitted_at":"2025-01-09T08:20:42Z","title":"On the Generalizability of Transformer Models to Code Completions of Different Lengths","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-10T21:23:50.702315Z"},"links":{"citing_paper":"/paper/2501.05051"},"observation_digest":"sha256:5bd514409b568b1d83b40e55b1402d80db5bb7b93733311fb375bcc6ebda55c6","observation_id":"54054874-cd11-40b2-9499-c3fe75684d9d","resolution":{"observed_at":"2026-08-10T21:23:50.702315Z","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-10T21:23:51.328480Z","title":"On the localness of software,","venue":null,"work_id":"d16c3b53-1276-413a-80da-28a70f65fc28","year":2014},"citing_paper":{"arxiv_id":"2501.05051","last_updated":"2025-01-09T08:20:42Z","snapshot_observed_at":"2026-08-17T20:48:37.533049Z","submitted_at":"2025-01-09T08:20:42Z","title":"On the Generalizability of Transformer Models to Code Completions of Different Lengths","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-10T21:23:50.705084Z"},"links":{"citing_paper":"/paper/2501.05051"},"observation_digest":"sha256:f7c76a4f9e7a6e3954466d551b98499a9ec02e2d0ae22ae07885673707762384","observation_id":"ac86c3c2-5eae-43f8-9a9e-b158fde83b5c","resolution":{"observed_at":"2026-08-10T21:23:51.331479Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T21:23:51.319933Z","title":"When code completion fails: A case study on real-world completions,","venue":null,"work_id":"4bda6559-9580-43cb-ab56-716fee004489","year":2019},"citing_paper":{"arxiv_id":"2501.05051","last_updated":"2025-01-09T08:20:42Z","snapshot_observed_at":"2026-08-17T20:48:37.533049Z","submitted_at":"2025-01-09T08:20:42Z","title":"On the Generalizability of Transformer Models to Code Completions of Different Lengths","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-10T21:23:50.707832Z"},"links":{"citing_paper":"/paper/2501.05051"},"observation_digest":"sha256:0a48aebb1541df55ff4efd1db2272a0babac776b59fa24aa9ad4621f8fd92571","observation_id":"e4079d69-ed0f-450d-a7d8-fd284059a612","resolution":{"observed_at":"2026-08-10T21:23:51.322777Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T21:23:51.312509Z","title":"Code completion with statistical language models,","venue":null,"work_id":"d0c9185e-362e-4177-9a94-40ef9a005fd9","year":2014},"citing_paper":{"arxiv_id":"2501.05051","last_updated":"2025-01-09T08:20:42Z","snapshot_observed_at":"2026-08-17T20:48:37.533049Z","submitted_at":"2025-01-09T08:20:42Z","title":"On the Generalizability of Transformer Models to Code Completions of Different Lengths","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-10T21:23:50.711228Z"},"links":{"citing_paper":"/paper/2501.05051"},"observation_digest":"sha256:4a91bad8994c673e1712e50b64c0a829012c94d0b09ec309f7c094e751ddeb43","observation_id":"c21161d2-03fe-4724-8cf0-147933b67b3c","resolution":{"observed_at":"2026-08-10T21:23:51.315360Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:23:50.713740Z","title":"Learning from examples to improve code completion systems,","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2501.05051","last_updated":"2025-01-09T08:20:42Z","snapshot_observed_at":"2026-08-17T20:48:37.533049Z","submitted_at":"2025-01-09T08:20:42Z","title":"On the Generalizability of Transformer Models to Code Completions of Different Lengths","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-10T21:23:50.713740Z"},"links":{"citing_paper":"/paper/2501.05051"},"observation_digest":"sha256:f7b50cfa96abbe50eec5faaa529464b2672dcdbf9f90452a953ff147bacbd850","observation_id":"6080bed7-0d61-458f-a761-049e57d7cdae","resolution":{"observed_at":"2026-08-10T21:23:50.713740Z","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-10T21:23:51.301797Z","title":"The hidden cost of code completion: Understand- ing the impact of the recommendation-list length on its efficiency,","venue":null,"work_id":"4fe3fe9a-ffdc-4333-9e3f-37efca5e6051","year":2018},"citing_paper":{"arxiv_id":"2501.05051","last_updated":"2025-01-09T08:20:42Z","snapshot_observed_at":"2026-08-17T20:48:37.533049Z","submitted_at":"2025-01-09T08:20:42Z","title":"On the Generalizability of Transformer Models to Code Completions of Different Lengths","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-10T21:23:50.716940Z"},"links":{"citing_paper":"/paper/2501.05051"},"observation_digest":"sha256:040e2905c4f1ee3e1d7f0103ef6660c88bba4d3b07b72556cb6e6f84c44b82d3","observation_id":"7dddc465-a427-4fc9-adc7-9e7393a7c49a","resolution":{"observed_at":"2026-08-10T21:23:51.304109Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2202.06689","last_updated":"2022-02-14T13:26:54Z","snapshot_observed_at":"2026-08-16T17:21:29.826468Z","submitted_at":"2022-02-14T13:26:54Z","title":"CodeFill: Multi-token Code Completion by Jointly Learning from Structure and Naming Sequences","version":1},"cited_work":{"arxiv_id":"2202.06689","doi":null,"metadata_source":"pith","pith_arxiv_id":"2202.06689","snapshot_observed_at":"2026-08-10T21:23:50.934406Z","title":"CodeFill: Multi-token Code Completion by Jointly Learning from Structure and Naming Sequences","venue":"cs.SE","work_id":"9736910c-43c9-454a-b5fa-fc755fe4802d","year":2022},"citing_paper":{"arxiv_id":"2501.05051","last_updated":"2025-01-09T08:20:42Z","snapshot_observed_at":"2026-08-17T20:48:37.533049Z","submitted_at":"2025-01-09T08:20:42Z","title":"On the Generalizability of Transformer Models to Code Completions of Different Lengths","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-10T21:23:50.719644Z"},"links":{"cited_paper":"/paper/2202.06689","citing_paper":"/paper/2501.05051"},"observation_digest":"sha256:473f0834ded03099b0b7ed38527cc72c50ccc32757c2deac83bf426961da628c","observation_id":"62a469af-ac5d-49cd-a3b2-64a92ba55e80","resolution":{"observed_at":"2026-08-10T21:23:50.939400Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T21:23:51.294769Z","title":"Learning autocompletion from real- world datasets,","venue":null,"work_id":"7997dae1-079d-4493-ac9b-638260f5ffdc","year":2021},"citing_paper":{"arxiv_id":"2501.05051","last_updated":"2025-01-09T08:20:42Z","snapshot_observed_at":"2026-08-17T20:48:37.533049Z","submitted_at":"2025-01-09T08:20:42Z","title":"On the Generalizability of Transformer Models to Code Completions of Different Lengths","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-10T21:23:50.722749Z"},"links":{"citing_paper":"/paper/2501.05051"},"observation_digest":"sha256:5853114201b4dc5bf84396019b7af563953cbb5f7a602013a5612c7355040c20","observation_id":"47b6799e-1418-44bd-b3fe-599c8d7eef7d","resolution":{"observed_at":"2026-08-10T21:23:51.297692Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T21:23:51.287820Z","title":"Are deep neural networks the best choice for modeling source code?","venue":null,"work_id":"57d4529a-8ef4-48dc-b976-fc7b6a35f9f0","year":2017},"citing_paper":{"arxiv_id":"2501.05051","last_updated":"2025-01-09T08:20:42Z","snapshot_observed_at":"2026-08-17T20:48:37.533049Z","submitted_at":"2025-01-09T08:20:42Z","title":"On the Generalizability of Transformer Models to Code Completions of Different Lengths","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-10T21:23:50.725910Z"},"links":{"citing_paper":"/paper/2501.05051"},"observation_digest":"sha256:50ba490eb6c1a06482fcac3a6425bc0de01c55384302610ebab02749a878716f","observation_id":"a90d1b4b-23f9-4273-9424-e816933f473c","resolution":{"observed_at":"2026-08-10T21:23:51.290470Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T21:23:51.280798Z","title":"Towards a better code completion system by api grouping, filtering, and popularity-based ranking,","venue":null,"work_id":"b9768e96-4567-4b05-84f2-8f421c57fa7e","year":2010},"citing_paper":{"arxiv_id":"2501.05051","last_updated":"2025-01-09T08:20:42Z","snapshot_observed_at":"2026-08-17T20:48:37.533049Z","submitted_at":"2025-01-09T08:20:42Z","title":"On the Generalizability of Transformer Models to Code Completions of Different Lengths","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-10T21:23:50.728422Z"},"links":{"citing_paper":"/paper/2501.05051"},"observation_digest":"sha256:a7465731f70a74d9e2f35ae873e7f0f7b445942af0d2903005291b1f49ffa3b7","observation_id":"f8c5d791-d484-4adb-8d5f-fe3ce42737c8","resolution":{"observed_at":"2026-08-10T21:23:51.283333Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T21:23:51.272244Z","title":"Combining program anal- ysis and statistical language model for code statement completion,","venue":null,"work_id":"f5470a77-06ca-4308-a884-eb00c98eeff6","year":2019},"citing_paper":{"arxiv_id":"2501.05051","last_updated":"2025-01-09T08:20:42Z","snapshot_observed_at":"2026-08-17T20:48:37.533049Z","submitted_at":"2025-01-09T08:20:42Z","title":"On the Generalizability of Transformer Models to Code Completions of Different Lengths","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-10T21:23:50.730921Z"},"links":{"citing_paper":"/paper/2501.05051"},"observation_digest":"sha256:83db94b825e0d6f84d45a57fa32479e0ad39c356fbcff09acca7f48fdefe123f","observation_id":"951840bd-02b1-40b8-9b0f-8908f3303190","resolution":{"observed_at":"2026-08-10T21:23:51.275140Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T21:23:51.262003Z","title":"How program history can improve code completion,","venue":null,"work_id":"71ea35e4-d2a5-4809-bbad-2504079fce5f","year":2008},"citing_paper":{"arxiv_id":"2501.05051","last_updated":"2025-01-09T08:20:42Z","snapshot_observed_at":"2026-08-17T20:48:37.533049Z","submitted_at":"2025-01-09T08:20:42Z","title":"On the Generalizability of Transformer Models to Code Completions of Different Lengths","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-10T21:23:50.733888Z"},"links":{"citing_paper":"/paper/2501.05051"},"observation_digest":"sha256:838b9c354625ce695a4337a162eaa1c2616dcc17e27d19229ee4ad4c38bc2043","observation_id":"968a5ec7-2db9-4741-a3cd-13c3cd8068bd","resolution":{"observed_at":"2026-08-10T21:23:51.265048Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T21:23:51.252689Z","title":"Improving code completion with program history,","venue":null,"work_id":"eb583f6a-290d-4027-a1d6-d8b817fb91b4","year":2010},"citing_paper":{"arxiv_id":"2501.05051","last_updated":"2025-01-09T08:20:42Z","snapshot_observed_at":"2026-08-17T20:48:37.533049Z","submitted_at":"2025-01-09T08:20:42Z","title":"On the Generalizability of Transformer Models to Code Completions of Different Lengths","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-10T21:23:50.737352Z"},"links":{"citing_paper":"/paper/2501.05051"},"observation_digest":"sha256:dee88f9e02bdcb504d1ff7f609a53434b7e8eb314cd28c630ba558b8512c4b26","observation_id":"d0a8538f-3ae8-44f9-b27d-11058cba9256","resolution":{"observed_at":"2026-08-10T21:23:51.256326Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:23:50.740846Z","title":"Fast and memory-efficient neural code completion,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2501.05051","last_updated":"2025-01-09T08:20:42Z","snapshot_observed_at":"2026-08-17T20:48:37.533049Z","submitted_at":"2025-01-09T08:20:42Z","title":"On the Generalizability of Transformer Models to Code Completions of Different Lengths","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-10T21:23:50.740846Z"},"links":{"citing_paper":"/paper/2501.05051"},"observation_digest":"sha256:bba5061c21eacd1b6b7dffa03d922eeb4d02fd27bdcb042d238004d43aaf1164","observation_id":"bb335e3c-f184-4f2e-ba9c-fab174ea0734","resolution":{"observed_at":"2026-08-10T21:23:50.740846Z","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-10T21:23:51.240490Z","title":"Pythia: Ai- assisted code completion system,","venue":null,"work_id":"229cd3b7-b48f-4891-a888-64150feac364","year":2019},"citing_paper":{"arxiv_id":"2501.05051","last_updated":"2025-01-09T08:20:42Z","snapshot_observed_at":"2026-08-17T20:48:37.533049Z","submitted_at":"2025-01-09T08:20:42Z","title":"On the Generalizability of Transformer Models to Code Completions of Different Lengths","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-10T21:23:50.743864Z"},"links":{"citing_paper":"/paper/2501.05051"},"observation_digest":"sha256:01e3ca55477e93666614b9199eb52d84897a008233a26e04d92d3f06dd1fd443","observation_id":"e11c1a69-e3ba-4dcf-b37b-8d6bda690386","resolution":{"observed_at":"2026-08-10T21:23:51.243675Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T21:23:51.230698Z","title":"A language model for statements of software code,","venue":null,"work_id":"08fc26ab-3f8c-4ffd-b5df-1e35953a2937","year":2017},"citing_paper":{"arxiv_id":"2501.05051","last_updated":"2025-01-09T08:20:42Z","snapshot_observed_at":"2026-08-17T20:48:37.533049Z","submitted_at":"2025-01-09T08:20:42Z","title":"On the Generalizability of Transformer Models to Code Completions of Different Lengths","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-10T21:23:50.746332Z"},"links":{"citing_paper":"/paper/2501.05051"},"observation_digest":"sha256:01a2cf6a217830edb26014a54bf77e82b539051a6b157f7842fa9d14135c268d","observation_id":"dd73604a-fbbc-4992-ae3d-f72e7e8f8d6d","resolution":{"observed_at":"2026-08-10T21:23:51.234285Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2203.13474","last_updated":"2023-02-27T21:26:48Z","snapshot_observed_at":"2026-08-13T14:36:56.609471Z","submitted_at":"2022-03-25T06:55:15Z","title":"CodeGen: An Open Large Language Model for Code with Multi-Turn Program Synthesis","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2203.13474","snapshot_observed_at":"2026-08-10T21:23:50.748922Z","title":"Codegen: An open large language model for code with multi-turn program synthesis,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2501.05051","last_updated":"2025-01-09T08:20:42Z","snapshot_observed_at":"2026-08-17T20:48:37.533049Z","submitted_at":"2025-01-09T08:20:42Z","title":"On the Generalizability of Transformer Models to Code Completions of Different Lengths","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-10T21:23:50.748922Z"},"links":{"cited_paper":"/paper/2203.13474","citing_paper":"/paper/2501.05051"},"observation_digest":"sha256:2c9d1429919a8aeaaac9a9746a91f0aa9c0821cb045376c6f19a2e12f47f1455","observation_id":"fef474c2-0765-49c1-b336-38543cdb2d44","resolution":{"observed_at":"2026-08-10T21:23:50.748922Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2301.03988","last_updated":"2023-02-24T09:53:40Z","snapshot_observed_at":"2026-08-16T16:03:40.539365Z","submitted_at":"2023-01-09T10:52:35Z","title":"SantaCoder: don't reach for the stars!","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2301.03988","snapshot_observed_at":"2026-08-10T21:23:50.752228Z","title":"Santacoder: don’t reach for the stars!","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.05051","last_updated":"2025-01-09T08:20:42Z","snapshot_observed_at":"2026-08-17T20:48:37.533049Z","submitted_at":"2025-01-09T08:20:42Z","title":"On the Generalizability of Transformer Models to Code Completions of Different Lengths","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-10T21:23:50.752228Z"},"links":{"cited_paper":"/paper/2301.03988","citing_paper":"/paper/2501.05051"},"observation_digest":"sha256:9c10a2ca8092c5f770eb86a4a8684a0a890614ca768b8d04d80bffc4b36fc972","observation_id":"66718e34-6cf9-414a-99e0-d1587502ac22","resolution":{"observed_at":"2026-08-10T21:23:50.752228Z","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-10T21:23:51.220875Z","title":"Jungloid mining: helping to navigate the api jungle,","venue":null,"work_id":"92ae0365-b2c4-4b81-a575-17238dbf48a8","year":2005},"citing_paper":{"arxiv_id":"2501.05051","last_updated":"2025-01-09T08:20:42Z","snapshot_observed_at":"2026-08-17T20:48:37.533049Z","submitted_at":"2025-01-09T08:20:42Z","title":"On the Generalizability of Transformer Models to Code Completions of Different Lengths","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-10T21:23:50.754382Z"},"links":{"citing_paper":"/paper/2501.05051"},"observation_digest":"sha256:c6e8332178c101d11413cea38723c6f216a5fe800a8171e2f0e612124bde7b52","observation_id":"c7ba8b8e-abf9-4bac-be32-e4b87f246d15","resolution":{"observed_at":"2026-08-10T21:23:51.223898Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T21:23:51.212833Z","title":"Codegen: An open large language model for code with multi-turn program synthesis,","venue":null,"work_id":"a6202bef-fcdf-4498-a638-9a523ea5c217","year":2023},"citing_paper":{"arxiv_id":"2501.05051","last_updated":"2025-01-09T08:20:42Z","snapshot_observed_at":"2026-08-17T20:48:37.533049Z","submitted_at":"2025-01-09T08:20:42Z","title":"On the Generalizability of Transformer Models to Code Completions of Different Lengths","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-10T21:23:50.756933Z"},"links":{"citing_paper":"/paper/2501.05051"},"observation_digest":"sha256:4f132dacc5e3954181d69c872aefbc2d7a0d8aae77b3a4e8c04fd2093dcacb0e","observation_id":"5ee19850-cfef-41e7-96c8-1f00aa0da232","resolution":{"observed_at":"2026-08-10T21:23:51.215935Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2105.09938","last_updated":"2021-11-08T21:16:44Z","snapshot_observed_at":"2026-08-14T15:19:05.440904Z","submitted_at":"2021-05-20T17:58:42Z","title":"Measuring Coding Challenge Competence With APPS","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2105.09938","snapshot_observed_at":"2026-08-10T21:23:50.759098Z","title":"Measuring coding challenge competence with apps,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2501.05051","last_updated":"2025-01-09T08:20:42Z","snapshot_observed_at":"2026-08-17T20:48:37.533049Z","submitted_at":"2025-01-09T08:20:42Z","title":"On the Generalizability of Transformer Models to Code Completions of Different Lengths","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-10T21:23:50.759098Z"},"links":{"cited_paper":"/paper/2105.09938","citing_paper":"/paper/2501.05051"},"observation_digest":"sha256:a44b06fd255484409324002380c11c9e89aec8def688d0037b01c5d5338f3173","observation_id":"011f901c-2cff-480c-baca-e1c4c4f75547","resolution":{"observed_at":"2026-08-10T21:23:50.759098Z","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-10T21:23:51.205491Z","title":"On the relation between position informa- tion and sentence length in neural machine translation,","venue":null,"work_id":"d80b9716-a81a-4f91-b18a-86af6da8ab5f","year":2019},"citing_paper":{"arxiv_id":"2501.05051","last_updated":"2025-01-09T08:20:42Z","snapshot_observed_at":"2026-08-17T20:48:37.533049Z","submitted_at":"2025-01-09T08:20:42Z","title":"On the Generalizability of Transformer Models to Code Completions of Different Lengths","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-10T21:23:50.762070Z"},"links":{"citing_paper":"/paper/2501.05051"},"observation_digest":"sha256:a50b8bdbb4aa1c53a979911cc41756d402551846abd69dbcedb833626ebd5dca","observation_id":"4e064b47-267d-4df1-a75f-98b250079aaf","resolution":{"observed_at":"2026-08-10T21:23:51.208338Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T21:23:51.197526Z","title":"Location Attention for Extrapolation to Longer Sequences,","venue":null,"work_id":"d8e181de-2fb9-4a73-a55c-4b588ca20da5","year":2020},"citing_paper":{"arxiv_id":"2501.05051","last_updated":"2025-01-09T08:20:42Z","snapshot_observed_at":"2026-08-17T20:48:37.533049Z","submitted_at":"2025-01-09T08:20:42Z","title":"On the Generalizability of Transformer Models to Code Completions of Different Lengths","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-10T21:23:50.764969Z"},"links":{"citing_paper":"/paper/2501.05051"},"observation_digest":"sha256:0c5c33145bc7e4224b797f1dad628b6ccbdeba2f2df2ade5b45bc231c987b608","observation_id":"29c3e8dc-f58e-4fed-ba1e-dad2d0e1c3b7","resolution":{"observed_at":"2026-08-10T21:23:51.200303Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2010.07174","last_updated":"2020-10-14T15:46:17Z","snapshot_observed_at":"2026-08-16T19:13:31.936558Z","submitted_at":"2020-10-14T15:46:17Z","title":"The EOS Decision and Length Extrapolation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2010.07174","snapshot_observed_at":"2026-08-10T21:23:50.768579Z","title":"The eos decision and length extrapolation,","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2501.05051","last_updated":"2025-01-09T08:20:42Z","snapshot_observed_at":"2026-08-17T20:48:37.533049Z","submitted_at":"2025-01-09T08:20:42Z","title":"On the Generalizability of Transformer Models to Code Completions of Different Lengths","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-10T21:23:50.768579Z"},"links":{"cited_paper":"/paper/2010.07174","citing_paper":"/paper/2501.05051"},"observation_digest":"sha256:5208b709c7acad199dfcecff51ab8f49a967ad10e47afa8087408c6b9aa1560b","observation_id":"e3dfee8f-bf14-49c2-88a4-a9444bf3c694","resolution":{"observed_at":"2026-08-10T21:23:50.768579Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2109.05644","last_updated":"2021-09-13T00:10:02Z","snapshot_observed_at":"2026-08-16T17:57:10.637850Z","submitted_at":"2021-09-13T00:10:02Z","title":"SHAPE: Shifted Absolute Position Embedding for Transformers","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2109.05644","snapshot_observed_at":"2026-08-10T21:23:50.772171Z","title":"Shape: Shifted absolute position embedding for transformers,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2501.05051","last_updated":"2025-01-09T08:20:42Z","snapshot_observed_at":"2026-08-17T20:48:37.533049Z","submitted_at":"2025-01-09T08:20:42Z","title":"On the Generalizability of Transformer Models to Code Completions of Different Lengths","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-10T21:23:50.772171Z"},"links":{"cited_paper":"/paper/2109.05644","citing_paper":"/paper/2501.05051"},"observation_digest":"sha256:9842350d8d3aabaf2651ca22ec510e33740eedbfde6523ac5161fc46f7c21f42","observation_id":"0e157900-8e67-4726-902f-aa5f3863f49f","resolution":{"observed_at":"2026-08-10T21:23:50.772171Z","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-10T21:23:51.190313Z","title":"Cape: Encoding relative positions with continuous augmented positional embeddings,","venue":null,"work_id":"0debcb6a-e15e-4dd4-af6f-bd63e554c4d4","year":2021},"citing_paper":{"arxiv_id":"2501.05051","last_updated":"2025-01-09T08:20:42Z","snapshot_observed_at":"2026-08-17T20:48:37.533049Z","submitted_at":"2025-01-09T08:20:42Z","title":"On the Generalizability of Transformer Models to Code Completions of Different Lengths","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-10T21:23:50.775068Z"},"links":{"citing_paper":"/paper/2501.05051"},"observation_digest":"sha256:162069b3a9e44377d9cd5506b6ebc8b896f2abba5e83c38273626bf3d72714ee","observation_id":"288c10c5-c920-42ab-83db-b0e329092455","resolution":{"observed_at":"2026-08-10T21:23:51.193050Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T21:23:51.182796Z","title":"Analysis of positional encodings for neural machine translation,","venue":null,"work_id":"dc068da5-0366-42d2-a9d5-56a61791bc05","year":2019},"citing_paper":{"arxiv_id":"2501.05051","last_updated":"2025-01-09T08:20:42Z","snapshot_observed_at":"2026-08-17T20:48:37.533049Z","submitted_at":"2025-01-09T08:20:42Z","title":"On the Generalizability of Transformer Models to Code Completions of Different Lengths","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-10T21:23:50.777436Z"},"links":{"citing_paper":"/paper/2501.05051"},"observation_digest":"sha256:8548841b094c26ebdd675005578b30b90376abfe58a56d4ff6066bc0b76d9700","observation_id":"624f7d7f-f214-4815-a6d7-c8b36d2230cc","resolution":{"observed_at":"2026-08-10T21:23:51.185666Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:23:50.780442Z","title":"Generalization without systematicity: On the compositional skills of sequence-to-sequence recurrent networks,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2501.05051","last_updated":"2025-01-09T08:20:42Z","snapshot_observed_at":"2026-08-17T20:48:37.533049Z","submitted_at":"2025-01-09T08:20:42Z","title":"On the Generalizability of Transformer Models to Code Completions of Different Lengths","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-10T21:23:50.780442Z"},"links":{"citing_paper":"/paper/2501.05051"},"observation_digest":"sha256:4af2cd0eded1ef3345e62239baefa1ca3bfbe60994a6bb972f411efe9b99f961","observation_id":"82dff388-5b0b-4499-9216-a001a804f7f0","resolution":{"observed_at":"2026-08-10T21:23:50.780442Z","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-10T21:23:51.172020Z","title":"Compositionality decomposed: How do neural networks generalise?","venue":null,"work_id":"46b0f979-4d2e-4303-ae43-f1685da3615c","year":2020},"citing_paper":{"arxiv_id":"2501.05051","last_updated":"2025-01-09T08:20:42Z","snapshot_observed_at":"2026-08-17T20:48:37.533049Z","submitted_at":"2025-01-09T08:20:42Z","title":"On the Generalizability of Transformer Models to Code Completions of Different Lengths","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-10T21:23:50.783412Z"},"links":{"citing_paper":"/paper/2501.05051"},"observation_digest":"sha256:234113a1f8f649aa47c79455ae8554d975cca4a18ee323a79c4aad1a51fb7038","observation_id":"190ca89f-9634-4a3b-97d8-969efe24dec9","resolution":{"observed_at":"2026-08-10T21:23:51.174509Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T21:23:51.165184Z","title":"Sampling projects in github for MSR studies,","venue":null,"work_id":"14d987d0-e318-475d-82b1-46715d2d44ab","year":2021},"citing_paper":{"arxiv_id":"2501.05051","last_updated":"2025-01-09T08:20:42Z","snapshot_observed_at":"2026-08-17T20:48:37.533049Z","submitted_at":"2025-01-09T08:20:42Z","title":"On the Generalizability of Transformer Models to Code Completions of Different Lengths","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-10T21:23:50.786383Z"},"links":{"citing_paper":"/paper/2501.05051"},"observation_digest":"sha256:e186f22f06f2f251b959f0f1ffbe3a71df3c8600d3acc99138fcaa9e4d841af7","observation_id":"437d31c2-4ec0-4fd3-8dfc-bc1a00e40da1","resolution":{"observed_at":"2026-08-10T21:23:51.167478Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2009.05617","last_updated":"2021-05-20T23:11:01Z","snapshot_observed_at":"2026-08-16T20:50:56.360501Z","submitted_at":"2020-09-11T18:57:36Z","title":"Unit Test Case Generation with Transformers and Focal Context","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2009.05617","snapshot_observed_at":"2026-08-10T21:23:50.789211Z","title":"Unit test case generation with transform- ers,","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2501.05051","last_updated":"2025-01-09T08:20:42Z","snapshot_observed_at":"2026-08-17T20:48:37.533049Z","submitted_at":"2025-01-09T08:20:42Z","title":"On the Generalizability of Transformer Models to Code Completions of Different Lengths","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-10T21:23:50.789211Z"},"links":{"cited_paper":"/paper/2009.05617","citing_paper":"/paper/2501.05051"},"observation_digest":"sha256:1c6195c28eb6b3bb9e6d87519ab7f9d0511045883bd9aefb76872cec34bf4045","observation_id":"012635fd-3300-45a4-af5e-f45fdeee3ea9","resolution":{"observed_at":"2026-08-10T21:23:50.789211Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:23:50.792293Z","title":"Adam: A method for stochastic optimization,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2501.05051","last_updated":"2025-01-09T08:20:42Z","snapshot_observed_at":"2026-08-17T20:48:37.533049Z","submitted_at":"2025-01-09T08:20:42Z","title":"On the Generalizability of Transformer Models to Code Completions of Different Lengths","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-10T21:23:50.792293Z"},"links":{"citing_paper":"/paper/2501.05051"},"observation_digest":"sha256:8ebeb9286560b17318a5b8f0e0863dc157391ea285b9fdf483bfb5b81b72620d","observation_id":"285e8d52-71ff-4980-a903-2be252eac60f","resolution":{"observed_at":"2026-08-10T21:23:50.792293Z","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-10T21:23:51.067576Z","title":"X-transformers,","venue":null,"work_id":"3448f0dd-cf16-42f7-a71e-bb72c42d0396","year":2023},"citing_paper":{"arxiv_id":"2501.05051","last_updated":"2025-01-09T08:20:42Z","snapshot_observed_at":"2026-08-17T20:48:37.533049Z","submitted_at":"2025-01-09T08:20:42Z","title":"On the Generalizability of Transformer Models to Code Completions of Different Lengths","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-10T21:23:50.794829Z"},"links":{"citing_paper":"/paper/2501.05051"},"observation_digest":"sha256:d041a65d9179b6acfdde77c7df69049db74b3fddb48f4a6fb238dfd395d3ae5c","observation_id":"f8614806-5cd3-497b-8a5c-5686c015f502","resolution":{"observed_at":"2026-08-10T21:23:51.156413Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T21:23:51.059412Z","title":"PyTorch Lightning,","venue":null,"work_id":"60ee246a-70ca-43d4-9e67-06902476c6c4","year":null},"citing_paper":{"arxiv_id":"2501.05051","last_updated":"2025-01-09T08:20:42Z","snapshot_observed_at":"2026-08-17T20:48:37.533049Z","submitted_at":"2025-01-09T08:20:42Z","title":"On the Generalizability of Transformer Models to Code Completions of Different Lengths","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-10T21:23:50.797259Z"},"links":{"citing_paper":"/paper/2501.05051"},"observation_digest":"sha256:b44f45ce39ff3f368a3e7bc8d31446dccc968c77f245ab0c014c109957bf0e1a","observation_id":"37604923-8ae4-4bfe-ad9b-5cea5b7df7b5","resolution":{"observed_at":"2026-08-10T21:23:51.062084Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1904.09751","last_updated":"2020-02-14T21:56:30Z","snapshot_observed_at":"2026-07-06T07:47:32.745963Z","submitted_at":"2019-04-22T07:17:18Z","title":"The Curious Case of Neural Text Degeneration","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1904.09751","snapshot_observed_at":"2026-08-10T21:23:50.804388Z","title":"The curious case of neural text degeneration,","venue":null,"work_id":null,"year":1904},"citing_paper":{"arxiv_id":"2501.05051","last_updated":"2025-01-09T08:20:42Z","snapshot_observed_at":"2026-08-17T20:48:37.533049Z","submitted_at":"2025-01-09T08:20:42Z","title":"On the Generalizability of Transformer Models to Code Completions of Different Lengths","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-10T21:23:50.804388Z"},"links":{"cited_paper":"/paper/1904.09751","citing_paper":"/paper/2501.05051"},"observation_digest":"sha256:16ed09e5abc968262d3da0e674dedac0cd581617bfbf84cc699cbc254b0c5d2e","observation_id":"a925fe28-47f4-4d8b-a75d-ab5838bd1d23","resolution":{"observed_at":"2026-08-10T21:23:50.804388Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:23:50.807964Z","title":"Bleu: a method for automatic evaluation of machine translation,","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2501.05051","last_updated":"2025-01-09T08:20:42Z","snapshot_observed_at":"2026-08-17T20:48:37.533049Z","submitted_at":"2025-01-09T08:20:42Z","title":"On the Generalizability of Transformer Models to Code Completions of Different Lengths","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-10T21:23:50.807964Z"},"links":{"citing_paper":"/paper/2501.05051"},"observation_digest":"sha256:15746229d5b81dedc8f01975c69c7bfed7419ba3d0a75e0b11d257834ffa1ad0","observation_id":"f1e29f1e-7a34-4f55-8e93-e1d32f794e19","resolution":{"observed_at":"2026-08-10T21:23:50.807964Z","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-10T21:23:51.041158Z","title":"chrf: character n-gram f-score for automatic mt evalu- ation,","venue":null,"work_id":"c0b8f58d-4c6a-4f29-bce9-faa629b53878","year":2015},"citing_paper":{"arxiv_id":"2501.05051","last_updated":"2025-01-09T08:20:42Z","snapshot_observed_at":"2026-08-17T20:48:37.533049Z","submitted_at":"2025-01-09T08:20:42Z","title":"On the Generalizability of Transformer Models to Code Completions of Different Lengths","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-10T21:23:50.810785Z"},"links":{"citing_paper":"/paper/2501.05051"},"observation_digest":"sha256:6c3376088bc0b1fe403dfac1403aaa06867b89f317383a41d47b6d71c20a9616","observation_id":"c59f157e-1eda-4b08-96e5-48eb2156be97","resolution":{"observed_at":"2026-08-10T21:23:51.044152Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T21:23:51.033044Z","title":"Binary codes capable of correcting deletions, insertions, and reversals,","venue":null,"work_id":"8a2730c0-90cb-4bac-b1c3-e1bf35e7fa37","year":1966},"citing_paper":{"arxiv_id":"2501.05051","last_updated":"2025-01-09T08:20:42Z","snapshot_observed_at":"2026-08-17T20:48:37.533049Z","submitted_at":"2025-01-09T08:20:42Z","title":"On the Generalizability of Transformer Models to Code Completions of Different Lengths","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-10T21:23:50.813363Z"},"links":{"citing_paper":"/paper/2501.05051"},"observation_digest":"sha256:628b1db32ae67e4a88935dfccfede1a21de523aecbc3a5ee4a7cd0cdc7fade55","observation_id":"e033dda5-73bb-4438-ac3b-01da11382e9d","resolution":{"observed_at":"2026-08-10T21:23:51.036460Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:23:50.815441Z","title":"Rouge: A package for automatic evaluation of summaries,","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2501.05051","last_updated":"2025-01-09T08:20:42Z","snapshot_observed_at":"2026-08-17T20:48:37.533049Z","submitted_at":"2025-01-09T08:20:42Z","title":"On the Generalizability of Transformer Models to Code Completions of Different Lengths","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-10T21:23:50.815441Z"},"links":{"citing_paper":"/paper/2501.05051"},"observation_digest":"sha256:6e19cbcd5a5278699ce072586580aa20f08b9c9783c695303dfbd20302992cdf","observation_id":"cb3b8a9a-9820-4407-8c30-3e076302b6e6","resolution":{"observed_at":"2026-08-10T21:23:50.815441Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:23:50.818936Z","title":"Meteor: An automatic metric for mt evalua- tion with improved correlation with human judgments,","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2501.05051","last_updated":"2025-01-09T08:20:42Z","snapshot_observed_at":"2026-08-17T20:48:37.533049Z","submitted_at":"2025-01-09T08:20:42Z","title":"On the Generalizability of Transformer Models to Code Completions of Different Lengths","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-10T21:23:50.818936Z"},"links":{"citing_paper":"/paper/2501.05051"},"observation_digest":"sha256:33df715ebd7a6987a2b521225d06fa1a1639fa8016b5f42fb922ff6ca0b7d0b8","observation_id":"4420f57d-b3d9-41c9-ac63-bed86ce9196a","resolution":{"observed_at":"2026-08-10T21:23:50.818936Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2102.04664","last_updated":"2021-03-16T08:28:37Z","snapshot_observed_at":"2026-08-17T12:20:19.399739Z","submitted_at":"2021-02-09T06:16:25Z","title":"CodeXGLUE: A Machine Learning Benchmark Dataset for Code Understanding and Generation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2102.04664","snapshot_observed_at":"2026-08-10T21:23:50.822467Z","title":"Codexglue: A machine learning benchmark dataset for code understanding and generation,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2501.05051","last_updated":"2025-01-09T08:20:42Z","snapshot_observed_at":"2026-08-17T20:48:37.533049Z","submitted_at":"2025-01-09T08:20:42Z","title":"On the Generalizability of Transformer Models to Code Completions of Different Lengths","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-10T21:23:50.822467Z"},"links":{"cited_paper":"/paper/2102.04664","citing_paper":"/paper/2501.05051"},"observation_digest":"sha256:3bada3f3da5f965901f7a65a37a8cb518cea128580850a1812f6c5211bf28da5","observation_id":"19ee0467-e294-4c62-b5ee-4d2edf59d231","resolution":{"observed_at":"2026-08-10T21:23:50.822467Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2208.03133","last_updated":"2023-05-10T11:14:17Z","snapshot_observed_at":"2026-08-16T16:40:57.248833Z","submitted_at":"2022-08-05T13:00:16Z","title":"Out of the BLEU: how should we assess quality of the Code Generation models?","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2208.03133","snapshot_observed_at":"2026-08-10T21:23:50.825452Z","title":"Out of the bleu: how should we assess quality of the code generation models?","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2501.05051","last_updated":"2025-01-09T08:20:42Z","snapshot_observed_at":"2026-08-17T20:48:37.533049Z","submitted_at":"2025-01-09T08:20:42Z","title":"On the Generalizability of Transformer Models to Code Completions of Different Lengths","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-10T21:23:50.825452Z"},"links":{"cited_paper":"/paper/2208.03133","citing_paper":"/paper/2501.05051"},"observation_digest":"sha256:89803d07bd39aed9e3ffe422d25358fc50ce92f9f107dd06d865fb2617b8062e","observation_id":"aa6b1302-408f-4953-bbfc-5e343099f79e","resolution":{"observed_at":"2026-08-10T21:23:50.825452Z","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-10T21:23:51.015603Z","title":"Cooper and R","venue":null,"work_id":"8360e668-94e5-47c9-8b97-2bf95ca2704d","year":null},"citing_paper":{"arxiv_id":"2501.05051","last_updated":"2025-01-09T08:20:42Z","snapshot_observed_at":"2026-08-17T20:48:37.533049Z","submitted_at":"2025-01-09T08:20:42Z","title":"On the Generalizability of Transformer Models to Code Completions of Different Lengths","version":1},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-10T21:23:50.829168Z"},"links":{"citing_paper":"/paper/2501.05051"},"observation_digest":"sha256:e8950276b45fe05f347b59d1a270b17e879c4552445e6db8cdc19272d850196a","observation_id":"cd84e402-a23b-48d7-a165-638124679eee","resolution":{"observed_at":"2026-08-10T21:23:51.019225Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T21:23:51.006185Z","title":"Datasets: A community library for natural language processing,","venue":null,"work_id":"f22f33eb-deb0-4e10-a854-1abc405edd3a","year":2021},"citing_paper":{"arxiv_id":"2501.05051","last_updated":"2025-01-09T08:20:42Z","snapshot_observed_at":"2026-08-17T20:48:37.533049Z","submitted_at":"2025-01-09T08:20:42Z","title":"On the Generalizability of Transformer Models to Code Completions of Different Lengths","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-10T21:23:50.832340Z"},"links":{"citing_paper":"/paper/2501.05051"},"observation_digest":"sha256:42f0c0a2027ab5e5e17caf47237b282c5b115615e637129f514dc8cf03727820","observation_id":"22dc5931-1ada-45ab-a147-afa59226a65e","resolution":{"observed_at":"2026-08-10T21:23:51.009132Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T21:23:50.998170Z","title":"The adverse effects of code duplication in machine learning models of code,","venue":null,"work_id":"3970f8c2-c54b-42cb-a350-8e8d3b2cfc39","year":2019},"citing_paper":{"arxiv_id":"2501.05051","last_updated":"2025-01-09T08:20:42Z","snapshot_observed_at":"2026-08-17T20:48:37.533049Z","submitted_at":"2025-01-09T08:20:42Z","title":"On the Generalizability of Transformer Models to Code Completions of Different Lengths","version":1},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-10T21:23:50.834766Z"},"links":{"citing_paper":"/paper/2501.05051"},"observation_digest":"sha256:4ae2aeee15c2703248ab8b2f7901894837ab7fe0dbe9d653a2415c14a2f32753","observation_id":"23f1ffa4-35f3-414d-ad89-50da1cf8eb0a","resolution":{"observed_at":"2026-08-10T21:23:51.001224Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2009.10297","last_updated":"2020-09-27T04:07:11Z","snapshot_observed_at":"2026-08-12T14:26:33.940158Z","submitted_at":"2020-09-22T03:10:49Z","title":"CodeBLEU: a Method for Automatic Evaluation of Code Synthesis","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2009.10297","snapshot_observed_at":"2026-08-10T21:23:50.837908Z","title":"Codebleu: a method for automatic evaluation of code synthesis,","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2501.05051","last_updated":"2025-01-09T08:20:42Z","snapshot_observed_at":"2026-08-17T20:48:37.533049Z","submitted_at":"2025-01-09T08:20:42Z","title":"On the Generalizability of Transformer Models to Code Completions of Different Lengths","version":1},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-10T21:23:50.837908Z"},"links":{"cited_paper":"/paper/2009.10297","citing_paper":"/paper/2501.05051"},"observation_digest":"sha256:2129362ddcb2fc08e6561e71e3b49cc09f2d64a8003b77df11ae3cb8b5c5701a","observation_id":"2b8f35d8-707b-4c23-a451-2f6786271f91","resolution":{"observed_at":"2026-08-10T21:23:50.837908Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:23:50.801359Z","title":"Available: https://github.com/Lightning-AI/lightning","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.05051","last_updated":"2025-01-09T08:20:42Z","snapshot_observed_at":"2026-08-17T20:48:37.533049Z","submitted_at":"2025-01-09T08:20:42Z","title":"On the Generalizability of Transformer Models to Code Completions of Different Lengths","version":1},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-10T21:23:50.801359Z"},"links":{"citing_paper":"/paper/2501.05051"},"observation_digest":"sha256:81647ce2079c92b77d62c3f22423379385404772aae224bff2e2821206d04a70","observation_id":"b5e1344e-4829-4ee3-acbe-6b456ba25850","resolution":{"observed_at":"2026-08-10T21:23:50.801359Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2501.05051","last_updated":"2025-01-09T08:20:42Z","latest_version":1,"primary_category":"cs.SE","snapshot_observed_at":"2026-08-17T20:48:37.533049Z","submitted_at":"2025-01-09T08:20:42Z","title":"On the Generalizability of Transformer Models to Code Completions of Different Lengths"},"reference_resolution":{"displayed":71,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":32,"verified_exact":1,"verified_fuzzy":38},"total_outbound_references":71},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 71 of 71 outbound references and 0 inbound Pith citation observations for arXiv:2501.05051."}