{"as_of":"2026-08-20T06:56:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:65d7f76e995f3d137cb803cb3ce9988cc0e70b5b413e9587327e63a9c44b328f","coverage":[{"denominator":26,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":26,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T11:31:17.522279Z","state":"measured"},{"denominator":26,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":26,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-20T06:33:59.587034+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/2510.04349/citation-record","integrity":"/paper/2510.04349/integrity","json":"/paper/2510.04349/citation-record.json","paper":"/paper/2510.04349"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T11:31:14.083254Z","title":"CodeFill: Multi-Token Code Completion by Jointly Learning from Structure and Naming Sequences,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2510.04349","last_updated":"2025-10-05T20:18:34Z","snapshot_observed_at":"2026-08-16T20:21:58.221391Z","submitted_at":"2025-10-05T20:18:34Z","title":"Challenge on Optimization of Context Collection for Code Completion","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-04T11:31:14.083254Z"},"links":{"citing_paper":"/paper/2510.04349"},"observation_digest":"sha256:c606f84e7134c1e64983b2ecfb6f8996f84580f488ec99ef98ee8cb4a1b7b113","observation_id":"d380bd81-9759-42fc-9b23-03e63ae6914c","resolution":{"observed_at":"2026-08-04T11:31:14.083254Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2207.14255","last_updated":"2022-07-28T17:40:47Z","snapshot_observed_at":"2026-08-12T15:32:23.741504Z","submitted_at":"2022-07-28T17:40:47Z","title":"Efficient Training of Language Models to Fill in the Middle","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2207.14255","snapshot_observed_at":"2026-08-04T11:31:14.200122Z","title":"Efficient Training of Language Models to Fill in the Middle,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2510.04349","last_updated":"2025-10-05T20:18:34Z","snapshot_observed_at":"2026-08-16T20:21:58.221391Z","submitted_at":"2025-10-05T20:18:34Z","title":"Challenge on Optimization of Context Collection for Code Completion","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-04T11:31:14.200122Z"},"links":{"cited_paper":"/paper/2207.14255","citing_paper":"/paper/2510.04349"},"observation_digest":"sha256:51ad6f4fd8685e0d0ffc991572b7d1cf27c8d507c7b7ff4aacebf40e571e22dc","observation_id":"c5dffb69-9a84-4c24-9156-9546edf6607f","resolution":{"observed_at":"2026-08-04T11:31:14.200122Z","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-04T11:31:14.386517Z","title":"RepoCoder: Repository-Level Code Completion Through Iterative Retrieval and Generation,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2510.04349","last_updated":"2025-10-05T20:18:34Z","snapshot_observed_at":"2026-08-16T20:21:58.221391Z","submitted_at":"2025-10-05T20:18:34Z","title":"Challenge on Optimization of Context Collection for Code Completion","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-04T11:31:14.386517Z"},"links":{"citing_paper":"/paper/2510.04349"},"observation_digest":"sha256:bd1bb8c0bd06b29818cd9c16fffc532663bdc43f35f98933b12d4cf93d0abced","observation_id":"0f70af23-5de3-4348-9774-c9a728543595","resolution":{"observed_at":"2026-08-04T11:31:14.386517Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2308.12950","last_updated":"2024-01-31T19:47:26Z","snapshot_observed_at":"2026-08-18T03:59:39.242039Z","submitted_at":"2023-08-24T17:39:13Z","title":"Code Llama: Open Foundation Models for Code","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.12950","snapshot_observed_at":"2026-08-04T11:31:14.490597Z","title":"Code Llama: Open Foundation Models for Code,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2510.04349","last_updated":"2025-10-05T20:18:34Z","snapshot_observed_at":"2026-08-16T20:21:58.221391Z","submitted_at":"2025-10-05T20:18:34Z","title":"Challenge on Optimization of Context Collection for Code Completion","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-04T11:31:14.490597Z"},"links":{"cited_paper":"/paper/2308.12950","citing_paper":"/paper/2510.04349"},"observation_digest":"sha256:04771028f40e93faf4991657d1e91dab1c25120471b7955c2853c044dc962a8f","observation_id":"ee273345-7e22-4e8f-9672-ccccd44d727a","resolution":{"observed_at":"2026-08-04T11:31:14.490597Z","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-04T11:31:14.685637Z","title":"Repo- former: Selective Retrieval for Repository-Level Code Completion,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2510.04349","last_updated":"2025-10-05T20:18:34Z","snapshot_observed_at":"2026-08-16T20:21:58.221391Z","submitted_at":"2025-10-05T20:18:34Z","title":"Challenge on Optimization of Context Collection for Code Completion","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-04T11:31:14.685637Z"},"links":{"citing_paper":"/paper/2510.04349"},"observation_digest":"sha256:7fda9a3e1f8910740e8fdf2a25abc429be27070f4dd4f93a41f2ec2887bd4bf7","observation_id":"1cd29534-a351-4c1a-b20f-4cecb5c83336","resolution":{"observed_at":"2026-08-04T11:31:14.685637Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.11612","last_updated":"2024-06-17T14:58:29Z","snapshot_observed_at":"2026-08-20T01:01:36.039627Z","submitted_at":"2024-06-17T14:58:29Z","title":"Long Code Arena: a Set of Benchmarks for Long-Context Code Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.11612","snapshot_observed_at":"2026-08-04T11:31:14.818029Z","title":"Long Code Arena: A Set of Benchmarks for Long-Context Code Models,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2510.04349","last_updated":"2025-10-05T20:18:34Z","snapshot_observed_at":"2026-08-16T20:21:58.221391Z","submitted_at":"2025-10-05T20:18:34Z","title":"Challenge on Optimization of Context Collection for Code Completion","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-04T11:31:14.818029Z"},"links":{"cited_paper":"/paper/2406.11612","citing_paper":"/paper/2510.04349"},"observation_digest":"sha256:246a47834b4e88e2e064194fad57a9e3ee0a5688a88fe8dfb6e30f6edeeb81a2","observation_id":"66ce6d34-2170-418d-b7a0-581063e5c713","resolution":{"observed_at":"2026-08-04T11:31:14.818029Z","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-04T11:31:14.938166Z","title":"On Pretraining For Project-Level Code Completion,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2510.04349","last_updated":"2025-10-05T20:18:34Z","snapshot_observed_at":"2026-08-16T20:21:58.221391Z","submitted_at":"2025-10-05T20:18:34Z","title":"Challenge on Optimization of Context Collection for Code Completion","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-04T11:31:14.938166Z"},"links":{"citing_paper":"/paper/2510.04349"},"observation_digest":"sha256:2f6d040b06d1117497e4fd3bea658676adfa7f6198808a2e9d2f3a3be781bb2a","observation_id":"70c20d1c-9e46-45de-8b4c-ce9faa2ae12c","resolution":{"observed_at":"2026-08-04T11:31:14.938166Z","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-04T11:31:15.086996Z","title":"RLCoder: Reinforcement Learning for Repository-Level Code Com- pletion,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2510.04349","last_updated":"2025-10-05T20:18:34Z","snapshot_observed_at":"2026-08-16T20:21:58.221391Z","submitted_at":"2025-10-05T20:18:34Z","title":"Challenge on Optimization of Context Collection for Code Completion","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-04T11:31:15.086996Z"},"links":{"citing_paper":"/paper/2510.04349"},"observation_digest":"sha256:5401f14394ddc9c7b29c1fe33d91a5b1d718c18dec7fe98ee75005f6cfc3e926","observation_id":"c1b70284-5756-468f-a283-5086b1b857d3","resolution":{"observed_at":"2026-08-04T11:31:15.086996Z","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-04T11:31:15.235418Z","title":"Repohyper: Search-Expand-Refine on Semantic Graphs for Repository-Level Code Completion,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2510.04349","last_updated":"2025-10-05T20:18:34Z","snapshot_observed_at":"2026-08-16T20:21:58.221391Z","submitted_at":"2025-10-05T20:18:34Z","title":"Challenge on Optimization of Context Collection for Code Completion","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-04T11:31:15.235418Z"},"links":{"citing_paper":"/paper/2510.04349"},"observation_digest":"sha256:c1283fbbb401bad79df04c5b95a40035c2dc72b3ab369844f66019d78d411e04","observation_id":"22b7bfb3-09b6-40a1-9a6d-0c48b9a8c883","resolution":{"observed_at":"2026-08-04T11:31:15.235418Z","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-04T11:31:15.296006Z","title":"Codestral,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2510.04349","last_updated":"2025-10-05T20:18:34Z","snapshot_observed_at":"2026-08-16T20:21:58.221391Z","submitted_at":"2025-10-05T20:18:34Z","title":"Challenge on Optimization of Context Collection for Code Completion","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-04T11:31:15.296006Z"},"links":{"citing_paper":"/paper/2510.04349"},"observation_digest":"sha256:81bc2470bb271ea8a27fe3cd538a0304028809ec279b494c179422766641f282","observation_id":"6b3ef6bb-0625-429e-bce8-bc3e0fc3529e","resolution":{"observed_at":"2026-08-04T11:31:15.296006Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.12186","last_updated":"2024-11-12T13:24:25Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-09-18T17:57:57Z","title":"Qwen2.5-Coder Technical Report","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.12186","snapshot_observed_at":"2026-08-04T11:31:15.406003Z","title":"Qwen2.5-Coder Technical Report,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2510.04349","last_updated":"2025-10-05T20:18:34Z","snapshot_observed_at":"2026-08-16T20:21:58.221391Z","submitted_at":"2025-10-05T20:18:34Z","title":"Challenge on Optimization of Context Collection for Code Completion","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-04T11:31:15.406003Z"},"links":{"cited_paper":"/paper/2409.12186","citing_paper":"/paper/2510.04349"},"observation_digest":"sha256:862590eede66c0d808a0a3a8bf8d9ad8069d71474b7e90cd670a644e193946bd","observation_id":"99bc3523-b9be-4f15-af76-14af28ad7e07","resolution":{"observed_at":"2026-08-04T11:31:15.406003Z","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-04T11:31:15.504403Z","title":"Introducing Mellum: JetBrains’ New LLM Built for Developers,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2510.04349","last_updated":"2025-10-05T20:18:34Z","snapshot_observed_at":"2026-08-16T20:21:58.221391Z","submitted_at":"2025-10-05T20:18:34Z","title":"Challenge on Optimization of Context Collection for Code Completion","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-04T11:31:15.504403Z"},"links":{"citing_paper":"/paper/2510.04349"},"observation_digest":"sha256:8b7c79fd1953fe0464e54217bb34a3ff3516eacd837d35086183022357866bea","observation_id":"6e1013d0-dec0-433a-bf37-79d2541b55da","resolution":{"observed_at":"2026-08-04T11:31:15.504403Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.16511","last_updated":"2023-09-28T15:18:35Z","snapshot_observed_at":"2026-08-16T14:56:49.068587Z","submitted_at":"2023-09-28T15:18:35Z","title":"Toloka Visual Question Answering Benchmark","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.16511","snapshot_observed_at":"2026-08-04T11:31:15.618220Z","title":"Toloka visual question answering benchmark,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2510.04349","last_updated":"2025-10-05T20:18:34Z","snapshot_observed_at":"2026-08-16T20:21:58.221391Z","submitted_at":"2025-10-05T20:18:34Z","title":"Challenge on Optimization of Context Collection for Code Completion","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-04T11:31:15.618220Z"},"links":{"cited_paper":"/paper/2309.16511","citing_paper":"/paper/2510.04349"},"observation_digest":"sha256:7900044db6aa614106ba04ecfc0933e899f6affbb8bcd9aa0d2a3e562a8e5872","observation_id":"984d8992-c238-442b-9cf3-945890a1e413","resolution":{"observed_at":"2026-08-04T11:31:15.618220Z","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-04T11:31:15.802300Z","title":"Out of the BLEU: How Should We Assess Quality of the Code Generation Models?","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2510.04349","last_updated":"2025-10-05T20:18:34Z","snapshot_observed_at":"2026-08-16T20:21:58.221391Z","submitted_at":"2025-10-05T20:18:34Z","title":"Challenge on Optimization of Context Collection for Code Completion","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-04T11:31:15.802300Z"},"links":{"citing_paper":"/paper/2510.04349"},"observation_digest":"sha256:b967498f28f891c25b5449209cc0c5a9d2656889e25858281d72d8779bb264bd","observation_id":"de24c9ab-154b-463a-acd6-b7aa376634d2","resolution":{"observed_at":"2026-08-04T11:31:15.802300Z","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-04T11:31:15.956061Z","title":"chrF: Character n-gram F-score for Automatic MT Eval- uation,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2510.04349","last_updated":"2025-10-05T20:18:34Z","snapshot_observed_at":"2026-08-16T20:21:58.221391Z","submitted_at":"2025-10-05T20:18:34Z","title":"Challenge on Optimization of Context Collection for Code Completion","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-04T11:31:15.956061Z"},"links":{"citing_paper":"/paper/2510.04349"},"observation_digest":"sha256:2bc4cd568e00d9d17b91a5a226d4b8f6809d0140c8eb2cdc81056a2d156c2181","observation_id":"b0d8738d-0064-410c-b14e-b4ffef699d18","resolution":{"observed_at":"2026-08-04T11:31:15.956061Z","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-04T11:31:16.104436Z","title":"From Commit Message Generation to History-Aware Commit Message Completion,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2510.04349","last_updated":"2025-10-05T20:18:34Z","snapshot_observed_at":"2026-08-16T20:21:58.221391Z","submitted_at":"2025-10-05T20:18:34Z","title":"Challenge on Optimization of Context Collection for Code Completion","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-04T11:31:16.104436Z"},"links":{"citing_paper":"/paper/2510.04349"},"observation_digest":"sha256:d832cfeb02142b444c56bc7cccf4d6f45d3036370bc5f9a06bf0da4847125742","observation_id":"1c711525-f3ce-4287-bace-3d316958fde4","resolution":{"observed_at":"2026-08-04T11:31:16.104436Z","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-04T11:31:16.298405Z","title":"The Probabilistic Relevance Framework: BM25 and Beyond,","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2510.04349","last_updated":"2025-10-05T20:18:34Z","snapshot_observed_at":"2026-08-16T20:21:58.221391Z","submitted_at":"2025-10-05T20:18:34Z","title":"Challenge on Optimization of Context Collection for Code Completion","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-04T11:31:16.298405Z"},"links":{"citing_paper":"/paper/2510.04349"},"observation_digest":"sha256:48f93eb14917786a622992d712d5820472bc194aea3ce8d2e12ebe0a478ccdcf","observation_id":"d95c1481-f92d-4865-ae16-e57fdd8543a5","resolution":{"observed_at":"2026-08-04T11:31:16.298405Z","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-04T11:31:16.465925Z","title":"Dataset for the ASE 2025 Challenge on Code Completion Context Collection Optimization","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2510.04349","last_updated":"2025-10-05T20:18:34Z","snapshot_observed_at":"2026-08-16T20:21:58.221391Z","submitted_at":"2025-10-05T20:18:34Z","title":"Challenge on Optimization of Context Collection for Code Completion","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-04T11:31:16.465925Z"},"links":{"citing_paper":"/paper/2510.04349"},"observation_digest":"sha256:22147f23b4138ec549940da2178f9b31b5c4457ca226232fe5cbb251a3fcec9f","observation_id":"d68dfd43-97fd-492d-9a28-dd22498e104e","resolution":{"observed_at":"2026-08-04T11:31:16.465925Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1902.03570","last_updated":"2019-02-10T10:34:54Z","snapshot_observed_at":"2026-08-14T17:18:34.363648Z","submitted_at":"2019-02-10T10:34:54Z","title":"EvalAI: Towards Better Evaluation Systems for AI Agents","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1902.03570","snapshot_observed_at":"2026-08-04T11:31:16.555067Z","title":"Evalai: Towards better evaluation systems for ai agents,","venue":null,"work_id":null,"year":1902},"citing_paper":{"arxiv_id":"2510.04349","last_updated":"2025-10-05T20:18:34Z","snapshot_observed_at":"2026-08-16T20:21:58.221391Z","submitted_at":"2025-10-05T20:18:34Z","title":"Challenge on Optimization of Context Collection for Code Completion","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-04T11:31:16.555067Z"},"links":{"cited_paper":"/paper/1902.03570","citing_paper":"/paper/2510.04349"},"observation_digest":"sha256:5678e1235d5138e0783c03049f5b383e92a18841f91e834f812ba6161d048d12","observation_id":"73a0d5c2-cc08-422c-9714-a1aee6e7497d","resolution":{"observed_at":"2026-08-04T11:31:16.555067Z","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-04T11:31:16.721163Z","title":"Exploration of Structural Code Relationship Space for Context Collection,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2510.04349","last_updated":"2025-10-05T20:18:34Z","snapshot_observed_at":"2026-08-16T20:21:58.221391Z","submitted_at":"2025-10-05T20:18:34Z","title":"Challenge on Optimization of Context Collection for Code Completion","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-04T11:31:16.721163Z"},"links":{"citing_paper":"/paper/2510.04349"},"observation_digest":"sha256:d2b4165b5c559be259b15c70b74f96626389763d9f45a2bd929d10b15b4cd566","observation_id":"c615eff9-08de-4e29-a30b-bbf1e04bcb78","resolution":{"observed_at":"2026-08-04T11:31:16.721163Z","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-04T11:31:16.827456Z","title":"Billion-scale Similarity Search with GPUs,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2510.04349","last_updated":"2025-10-05T20:18:34Z","snapshot_observed_at":"2026-08-16T20:21:58.221391Z","submitted_at":"2025-10-05T20:18:34Z","title":"Challenge on Optimization of Context Collection for Code Completion","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-04T11:31:16.827456Z"},"links":{"citing_paper":"/paper/2510.04349"},"observation_digest":"sha256:3c4704571851175bff51c294404ddf6db4745ff815765508ee3ab859bc291d01","observation_id":"7e87bd8a-b82d-4868-b438-99a17c50a4b4","resolution":{"observed_at":"2026-08-04T11:31:16.827456Z","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-04T11:31:16.998818Z","title":"Sentence-BERT: Sentence Embeddings using Siamese BERT-Networks,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2510.04349","last_updated":"2025-10-05T20:18:34Z","snapshot_observed_at":"2026-08-16T20:21:58.221391Z","submitted_at":"2025-10-05T20:18:34Z","title":"Challenge on Optimization of Context Collection for Code Completion","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-04T11:31:16.998818Z"},"links":{"citing_paper":"/paper/2510.04349"},"observation_digest":"sha256:6da11b0baa98714e220e7b2aba383028de007cfd7ca22689aa418529f7706aba","observation_id":"205e57ac-09d0-4b0b-a0f6-feae5e7ae103","resolution":{"observed_at":"2026-08-04T11:31:16.998818Z","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-04T11:31:17.108857Z","title":"Relative Positioning Based Code Chunking Method For Rich Context Retrieval In Repository Level Code Completion Task With Code Language Model,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2510.04349","last_updated":"2025-10-05T20:18:34Z","snapshot_observed_at":"2026-08-16T20:21:58.221391Z","submitted_at":"2025-10-05T20:18:34Z","title":"Challenge on Optimization of Context Collection for Code Completion","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-04T11:31:17.108857Z"},"links":{"citing_paper":"/paper/2510.04349"},"observation_digest":"sha256:eadccdaa8853af5794bbaafde9a88e7a8bf78c92eafc4c2c3a920d9f2d0ff42e","observation_id":"d8073706-0edd-4ac0-8236-5dc1d1d07d67","resolution":{"observed_at":"2026-08-04T11:31:17.108857Z","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-04T11:31:17.287548Z","title":"Beyond More Context: How Granularity and Order Drive Code Completion Quality,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2510.04349","last_updated":"2025-10-05T20:18:34Z","snapshot_observed_at":"2026-08-16T20:21:58.221391Z","submitted_at":"2025-10-05T20:18:34Z","title":"Challenge on Optimization of Context Collection for Code Completion","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-04T11:31:17.287548Z"},"links":{"citing_paper":"/paper/2510.04349"},"observation_digest":"sha256:8815538bf9d01c7c0a4cef75c96c0aa396a33f78624e16bc9ca5aa87d0e29ea2","observation_id":"e7162df8-c440-4427-a4a5-e80efd3ea429","resolution":{"observed_at":"2026-08-04T11:31:17.287548Z","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-04T11:31:17.395226Z","title":"On the Importance of Con- text Filtering in Retrieval-Augmented Code Completion,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2510.04349","last_updated":"2025-10-05T20:18:34Z","snapshot_observed_at":"2026-08-16T20:21:58.221391Z","submitted_at":"2025-10-05T20:18:34Z","title":"Challenge on Optimization of Context Collection for Code Completion","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-04T11:31:17.395226Z"},"links":{"citing_paper":"/paper/2510.04349"},"observation_digest":"sha256:d53ca93431d0d96ecd03a8063a82cc44d837d92f30051c19800bd6fdf8996e80","observation_id":"4e4cbd0b-7a95-4aea-ad4c-a78a43fb4199","resolution":{"observed_at":"2026-08-04T11:31:17.395226Z","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-04T11:31:17.522279Z","title":"SpareCodeSearch: Searching for Code Context When You Have No Spare GPU,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2510.04349","last_updated":"2025-10-05T20:18:34Z","snapshot_observed_at":"2026-08-16T20:21:58.221391Z","submitted_at":"2025-10-05T20:18:34Z","title":"Challenge on Optimization of Context Collection for Code Completion","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-04T11:31:17.522279Z"},"links":{"citing_paper":"/paper/2510.04349"},"observation_digest":"sha256:471401f6ef9639ab3cc70c87e9c91deabd9490321869820d8702edd633bd5fbc","observation_id":"b87904e8-fae6-428b-b96d-74f314607089","resolution":{"observed_at":"2026-08-04T11:31:17.522279Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2510.04349","last_updated":"2025-10-05T20:18:34Z","latest_version":1,"primary_category":"cs.SE","snapshot_observed_at":"2026-08-16T20:21:58.221391Z","submitted_at":"2025-10-05T20:18:34Z","title":"Challenge on Optimization of Context Collection for Code Completion"},"reference_resolution":{"displayed":26,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":26,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":26},"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-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 26 of 26 outbound references and 0 inbound Pith citation observations for arXiv:2510.04349."}