{"as_of":"2026-08-09T17:24:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:125eddee6a2bc886e8f0363de99e1b6fd495a6057e145f1b049fd96ca796ee26","coverage":[{"denominator":79,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":79,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T18:19:58.571730Z","state":"measured"},{"denominator":79,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":79,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+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/2507.08671/citation-record","integrity":"/paper/2507.08671/integrity","json":"/paper/2507.08671/citation-record.json","paper":"/paper/2507.08671"},"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-06T18:19:59.656620Z","title":"Software documentation: The practi- tioners’ perspective,","venue":null,"work_id":"7bcec75d-8061-4e9c-9741-e8c27244bd07","year":2020},"citing_paper":{"arxiv_id":"2507.08671","last_updated":"2025-07-11T15:11:27Z","snapshot_observed_at":"2026-08-09T14:17:23.242678Z","submitted_at":"2025-07-11T15:11:27Z","title":"LLMCup: Ranking-Enhanced Comment Updating with LLMs","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T18:18:57.794253Z"},"links":{"citing_paper":"/paper/2507.08671"},"observation_digest":"sha256:d91a1dab081307b9494a4b734308328b8d8b8a2dee73d953fcc6d9be67fbaae5","observation_id":"8fa56023-b82c-4b50-a11a-2e364d4eca2b","resolution":{"observed_at":"2026-08-06T18:19:59.665668Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:19:59.642745Z","title":"A human study of comprehension and code sum- marization,","venue":null,"work_id":"3db178ea-792a-4149-bac8-2337d652a8dc","year":2020},"citing_paper":{"arxiv_id":"2507.08671","last_updated":"2025-07-11T15:11:27Z","snapshot_observed_at":"2026-08-09T14:17:23.242678Z","submitted_at":"2025-07-11T15:11:27Z","title":"LLMCup: Ranking-Enhanced Comment Updating with LLMs","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T18:19:58.179913Z"},"links":{"citing_paper":"/paper/2507.08671"},"observation_digest":"sha256:eca9af0619e5f0bee983c1f986d3dfaf383a26b0ba56043bf50244ce66ef0fe2","observation_id":"ecf96a1e-2c7f-4e45-8c8f-853fbaeee8e3","resolution":{"observed_at":"2026-08-06T18:19:59.646773Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:19:59.627684Z","title":"Understanding source code comments at large-scale,","venue":null,"work_id":"86027cee-b3df-4060-a2fd-e59e1a895dd5","year":2019},"citing_paper":{"arxiv_id":"2507.08671","last_updated":"2025-07-11T15:11:27Z","snapshot_observed_at":"2026-08-09T14:17:23.242678Z","submitted_at":"2025-07-11T15:11:27Z","title":"LLMCup: Ranking-Enhanced Comment Updating with LLMs","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T18:19:58.201898Z"},"links":{"citing_paper":"/paper/2507.08671"},"observation_digest":"sha256:fb0665bc8f86a12a0aaf05b7c2a4e0531eba3311f3eeb0833006240a34e2e77d","observation_id":"2223ee5c-d82f-44bb-861c-3971a1658dca","resolution":{"observed_at":"2026-08-06T18:19:59.633785Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:19:59.614601Z","title":"Using traceability links to recommend adaptive changes for documentation evolution,","venue":null,"work_id":"5f7106e4-8871-4223-a3ef-3d80ff0986a3","year":2014},"citing_paper":{"arxiv_id":"2507.08671","last_updated":"2025-07-11T15:11:27Z","snapshot_observed_at":"2026-08-09T14:17:23.242678Z","submitted_at":"2025-07-11T15:11:27Z","title":"LLMCup: Ranking-Enhanced Comment Updating with LLMs","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T18:19:58.222759Z"},"links":{"citing_paper":"/paper/2507.08671"},"observation_digest":"sha256:d75443eb4624425e3cc8eff3979eb76e99c3fc18ec9268255764d8d52e40fea5","observation_id":"96732c60-e225-4f7e-9f2f-286362c02c68","resolution":{"observed_at":"2026-08-06T18:19:59.619608Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:19:59.603167Z","title":"Large language models are few-shot summarizers: Multi-intent comment generation via in-context learning,","venue":null,"work_id":"9a8fc7a9-9ba7-4d12-aa93-199edf85d670","year":2024},"citing_paper":{"arxiv_id":"2507.08671","last_updated":"2025-07-11T15:11:27Z","snapshot_observed_at":"2026-08-09T14:17:23.242678Z","submitted_at":"2025-07-11T15:11:27Z","title":"LLMCup: Ranking-Enhanced Comment Updating with LLMs","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T18:19:58.234789Z"},"links":{"citing_paper":"/paper/2507.08671"},"observation_digest":"sha256:40d18f6651d088645f0c3f98bfc8fbde93f707a5e554c98d1bd1badb88b777c7","observation_id":"dd63a83d-d81f-47e4-936a-b1d260fd0b36","resolution":{"observed_at":"2026-08-06T18:19:59.607487Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:19:59.587886Z","title":"Automated comment update: How far are we?","venue":null,"work_id":"2cadbe6e-d0f6-440c-bfb3-e42a00a94d96","year":2021},"citing_paper":{"arxiv_id":"2507.08671","last_updated":"2025-07-11T15:11:27Z","snapshot_observed_at":"2026-08-09T14:17:23.242678Z","submitted_at":"2025-07-11T15:11:27Z","title":"LLMCup: Ranking-Enhanced Comment Updating with LLMs","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T18:19:58.245545Z"},"links":{"citing_paper":"/paper/2507.08671"},"observation_digest":"sha256:257bbed8f57b8ac7b45db96fdc1ef8fe90ee0a894fbdb56d0daf8610e14d2b86","observation_id":"630d30bc-2203-4217-9210-db970472f0f5","resolution":{"observed_at":"2026-08-06T18:19:59.596204Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:19:59.575031Z","title":"Automating just-in-time comment updating,","venue":null,"work_id":"3859fc5c-81ef-4211-82ad-fbdea9889607","year":2020},"citing_paper":{"arxiv_id":"2507.08671","last_updated":"2025-07-11T15:11:27Z","snapshot_observed_at":"2026-08-09T14:17:23.242678Z","submitted_at":"2025-07-11T15:11:27Z","title":"LLMCup: Ranking-Enhanced Comment Updating with LLMs","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T18:19:58.258635Z"},"links":{"citing_paper":"/paper/2507.08671"},"observation_digest":"sha256:0a0f3f147c3e1270345413465bb77050099d01377e08e29e01f59d4657da1028","observation_id":"7d4f60ad-82ed-4636-a6b5-6d71d148acd5","resolution":{"observed_at":"2026-08-06T18:19:59.578967Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2302.09210","last_updated":"2023-02-18T02:11:36Z","snapshot_observed_at":"2026-08-09T14:17:01.779895Z","submitted_at":"2023-02-18T02:11:36Z","title":"How Good Are GPT Models at Machine Translation? A Comprehensive Evaluation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.09210","snapshot_observed_at":"2026-08-06T18:19:58.268546Z","title":"How good are gpt models at machine translation? a comprehensive evaluation,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.08671","last_updated":"2025-07-11T15:11:27Z","snapshot_observed_at":"2026-08-09T14:17:23.242678Z","submitted_at":"2025-07-11T15:11:27Z","title":"LLMCup: Ranking-Enhanced Comment Updating with LLMs","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T18:19:58.268546Z"},"links":{"cited_paper":"/paper/2302.09210","citing_paper":"/paper/2507.08671"},"observation_digest":"sha256:ce5da64bd22c8a7de3c79e186c77cddb31c53a0b397a2e55379d2e3f59c5324a","observation_id":"057de0a2-a0d8-48b4-9f1c-a0f925420254","resolution":{"observed_at":"2026-08-06T18:19:58.268546Z","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-06T18:19:59.564417Z","title":"Lamner: code comment generation using character language model and named entity recognition,","venue":null,"work_id":"63064ace-55ea-4293-b0e2-13f0a8257be3","year":2022},"citing_paper":{"arxiv_id":"2507.08671","last_updated":"2025-07-11T15:11:27Z","snapshot_observed_at":"2026-08-09T14:17:23.242678Z","submitted_at":"2025-07-11T15:11:27Z","title":"LLMCup: Ranking-Enhanced Comment Updating with LLMs","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T18:19:58.287589Z"},"links":{"citing_paper":"/paper/2507.08671"},"observation_digest":"sha256:4cfe4320287af9f9b212b8e4f0f50b8b26bafee40674a1eaa532a730bd2fc164","observation_id":"7aa52b37-805d-4ca0-8c90-96de86d6d7e2","resolution":{"observed_at":"2026-08-06T18:19:59.568718Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:19:59.553922Z","title":"Few-shot training llms for project-specific code-summarization,","venue":null,"work_id":"0e2df8b4-77b9-4f98-a6b6-b7119b061e7b","year":2022},"citing_paper":{"arxiv_id":"2507.08671","last_updated":"2025-07-11T15:11:27Z","snapshot_observed_at":"2026-08-09T14:17:23.242678Z","submitted_at":"2025-07-11T15:11:27Z","title":"LLMCup: Ranking-Enhanced Comment Updating with LLMs","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T18:19:58.299232Z"},"links":{"citing_paper":"/paper/2507.08671"},"observation_digest":"sha256:765eaeec45454e7dcc0e71885e06141899fb8dd73a5ea0cfd2c9113bd14d2d0c","observation_id":"5b57e28b-66be-4fe9-acf3-7864eeea19db","resolution":{"observed_at":"2026-08-06T18:19:59.557859Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:19:59.544805Z","title":"Source code summarization in the era of large language models,","venue":null,"work_id":"447a203b-98de-4141-9116-1c460262563c","year":2024},"citing_paper":{"arxiv_id":"2507.08671","last_updated":"2025-07-11T15:11:27Z","snapshot_observed_at":"2026-08-09T14:17:23.242678Z","submitted_at":"2025-07-11T15:11:27Z","title":"LLMCup: Ranking-Enhanced Comment Updating with LLMs","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T18:19:58.310400Z"},"links":{"citing_paper":"/paper/2507.08671"},"observation_digest":"sha256:3ade5b33721b77170b457bbf45abff11ff97de32927d38ced3144aaf1fa3e384","observation_id":"ac4c8b58-a7e5-4d17-accc-af075d521346","resolution":{"observed_at":"2026-08-06T18:19:59.548430Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:19:59.535502Z","title":"Palm: Scaling language modeling with pathways,","venue":null,"work_id":"4d7ec1bb-d503-4690-82f6-257d9d2f5605","year":2022},"citing_paper":{"arxiv_id":"2507.08671","last_updated":"2025-07-11T15:11:27Z","snapshot_observed_at":"2026-08-09T14:17:23.242678Z","submitted_at":"2025-07-11T15:11:27Z","title":"LLMCup: Ranking-Enhanced Comment Updating with LLMs","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T18:19:58.313849Z"},"links":{"citing_paper":"/paper/2507.08671"},"observation_digest":"sha256:c44b1c148cf0ba97ae650847412d023bc70090cd2a5636cd8eb59352e08f5bb4","observation_id":"8edb5f31-433c-490a-92a7-2e49000b28e0","resolution":{"observed_at":"2026-08-06T18:19:59.538891Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2206.07682","last_updated":"2022-10-26T05:06:24Z","snapshot_observed_at":"2026-08-02T15:56:35.249569Z","submitted_at":"2022-06-15T17:32:01Z","title":"Emergent Abilities of Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2206.07682","snapshot_observed_at":"2026-08-06T18:19:58.320291Z","title":"Emergent abilities of large language models,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2507.08671","last_updated":"2025-07-11T15:11:27Z","snapshot_observed_at":"2026-08-09T14:17:23.242678Z","submitted_at":"2025-07-11T15:11:27Z","title":"LLMCup: Ranking-Enhanced Comment Updating with LLMs","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T18:19:58.320291Z"},"links":{"cited_paper":"/paper/2206.07682","citing_paper":"/paper/2507.08671"},"observation_digest":"sha256:770d6508467e5fcb8982d7717498cb83756f09d05d73fb57fa40f027c21c7ca0","observation_id":"99434c18-78a6-4c42-af32-86b5eb2abded","resolution":{"observed_at":"2026-08-06T18:19:58.320291Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.06825","last_updated":"2023-10-10T17:54:58Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-10-10T17:54:58Z","title":"Mistral 7B","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.06825","snapshot_observed_at":"2026-08-06T18:19:58.324263Z","title":"Mistral 7b,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.08671","last_updated":"2025-07-11T15:11:27Z","snapshot_observed_at":"2026-08-09T14:17:23.242678Z","submitted_at":"2025-07-11T15:11:27Z","title":"LLMCup: Ranking-Enhanced Comment Updating with LLMs","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T18:19:58.324263Z"},"links":{"cited_paper":"/paper/2310.06825","citing_paper":"/paper/2507.08671"},"observation_digest":"sha256:cd04a38223bd1d7f8ab0f29a528d8b1233cc4abd83510b38c1a8cd672627004d","observation_id":"0236c077-30a1-403d-8805-329058bd1e06","resolution":{"observed_at":"2026-08-06T18:19:58.324263Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.01210","last_updated":"2023-10-30T19:37:09Z","snapshot_observed_at":"2026-08-09T13:00:51.978208Z","submitted_at":"2023-05-02T05:46:48Z","title":"Is Your Code Generated by ChatGPT Really Correct? Rigorous Evaluation of Large Language Models for Code Generation","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.01210","snapshot_observed_at":"2026-08-06T18:19:58.328528Z","title":"Is your code generated by chatgpt really correct? rigorous evaluation of large language models for code generation,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.08671","last_updated":"2025-07-11T15:11:27Z","snapshot_observed_at":"2026-08-09T14:17:23.242678Z","submitted_at":"2025-07-11T15:11:27Z","title":"LLMCup: Ranking-Enhanced Comment Updating with LLMs","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T18:19:58.328528Z"},"links":{"cited_paper":"/paper/2305.01210","citing_paper":"/paper/2507.08671"},"observation_digest":"sha256:345de9c5ab05295a604bd35271d5672c76595c27447c773b2e1fbc3cad318435","observation_id":"74ff57c7-988d-4879-8a1a-4999167ea8b0","resolution":{"observed_at":"2026-08-06T18:19:58.328528Z","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-06T18:19:58.332385Z","title":"Evaluating large language models trained on code,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2507.08671","last_updated":"2025-07-11T15:11:27Z","snapshot_observed_at":"2026-08-09T14:17:23.242678Z","submitted_at":"2025-07-11T15:11:27Z","title":"LLMCup: Ranking-Enhanced Comment Updating with LLMs","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T18:19:58.332385Z"},"links":{"cited_paper":"/paper/2107.03374","citing_paper":"/paper/2507.08671"},"observation_digest":"sha256:2fd9586a4874f541c5bd53c5fc6f2d86e738167461423a82d7923663349240b1","observation_id":"52caf5a4-d5b0-4c1a-a26a-b56b770b6b0a","resolution":{"observed_at":"2026-08-06T18:19:58.332385Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2208.10099","last_updated":"2022-08-22T07:18:23Z","snapshot_observed_at":"2026-08-03T16:37:33.412817Z","submitted_at":"2022-08-22T07:18:23Z","title":"Recent Advances in Text-to-SQL: A Survey of What We Have and What We Expect","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2208.10099","snapshot_observed_at":"2026-08-06T18:19:58.336439Z","title":"Recent advances in text-to-sql: A sur- vey of what we have and what we expect,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2507.08671","last_updated":"2025-07-11T15:11:27Z","snapshot_observed_at":"2026-08-09T14:17:23.242678Z","submitted_at":"2025-07-11T15:11:27Z","title":"LLMCup: Ranking-Enhanced Comment Updating with LLMs","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T18:19:58.336439Z"},"links":{"cited_paper":"/paper/2208.10099","citing_paper":"/paper/2507.08671"},"observation_digest":"sha256:dafc0939b909f7f128916857cca315b6d7c040b39a903a7ed2350c440c370d1e","observation_id":"0e01bc3e-4013-4ef9-99f4-1bd09162f3a2","resolution":{"observed_at":"2026-08-06T18:19:58.336439Z","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-06T18:19:59.527160Z","title":"An extensive study on pre-trained models for program understanding and generation,","venue":null,"work_id":"86c895fb-8a5a-417f-9227-1345343722fd","year":2022},"citing_paper":{"arxiv_id":"2507.08671","last_updated":"2025-07-11T15:11:27Z","snapshot_observed_at":"2026-08-09T14:17:23.242678Z","submitted_at":"2025-07-11T15:11:27Z","title":"LLMCup: Ranking-Enhanced Comment Updating with LLMs","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T18:19:58.340275Z"},"links":{"citing_paper":"/paper/2507.08671"},"observation_digest":"sha256:b89c29e0f4d925d72b8fa153f06ddd8f304985366b43eff5148db985105e1b61","observation_id":"80c3a426-4a53-456e-85a8-a73d202fcffa","resolution":{"observed_at":"2026-08-06T18:19:59.530413Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.10996","last_updated":"2023-10-17T04:57:53Z","snapshot_observed_at":"2026-08-09T06:56:58.491528Z","submitted_at":"2023-10-17T04:57:53Z","title":"ClarifyGPT: Empowering LLM-based Code Generation with Intention Clarification","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.10996","snapshot_observed_at":"2026-08-06T18:19:58.344485Z","title":"Clarifygpt: Empowering llm-based code generation with intention clarification,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.08671","last_updated":"2025-07-11T15:11:27Z","snapshot_observed_at":"2026-08-09T14:17:23.242678Z","submitted_at":"2025-07-11T15:11:27Z","title":"LLMCup: Ranking-Enhanced Comment Updating with LLMs","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T18:19:58.344485Z"},"links":{"cited_paper":"/paper/2310.10996","citing_paper":"/paper/2507.08671"},"observation_digest":"sha256:f14404af210b845742f77476660542313d98ed4cbd813bccc720211a4cb13fdf","observation_id":"4f6943a8-ebac-41b9-8204-0c5e37975662","resolution":{"observed_at":"2026-08-06T18:19:58.344485Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2304.02014","last_updated":"2023-04-04T17:59:52Z","snapshot_observed_at":"2026-07-06T15:12:14.729772Z","submitted_at":"2023-04-04T17:59:52Z","title":"Large Language Models are Edge-Case Fuzzers: Testing Deep Learning Libraries via FuzzGPT","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2304.02014","snapshot_observed_at":"2026-08-06T18:19:58.348487Z","title":"Large language models are edge-case fuzzers: Testing deep learning libraries via fuzzgpt,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.08671","last_updated":"2025-07-11T15:11:27Z","snapshot_observed_at":"2026-08-09T14:17:23.242678Z","submitted_at":"2025-07-11T15:11:27Z","title":"LLMCup: Ranking-Enhanced Comment Updating with LLMs","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-06T18:19:58.348487Z"},"links":{"cited_paper":"/paper/2304.02014","citing_paper":"/paper/2507.08671"},"observation_digest":"sha256:8315e09695e55a3b716a94ebd672350e9b34c05eecfefd850ecce64132f6b9db","observation_id":"fe410d96-f086-430e-bdb4-978e9e01088c","resolution":{"observed_at":"2026-08-06T18:19:58.348487Z","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-06T18:19:59.518245Z","title":"Fuzz4all: Universal fuzzing with large language models,","venue":null,"work_id":"0708436a-eafb-4182-a1cd-99c43f152d9d","year":2024},"citing_paper":{"arxiv_id":"2507.08671","last_updated":"2025-07-11T15:11:27Z","snapshot_observed_at":"2026-08-09T14:17:23.242678Z","submitted_at":"2025-07-11T15:11:27Z","title":"LLMCup: Ranking-Enhanced Comment Updating with LLMs","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-06T18:19:58.353431Z"},"links":{"citing_paper":"/paper/2507.08671"},"observation_digest":"sha256:8d0406a172e8dea6741d2648620008973d4b9bb3ede34f7de7982ad87da02728","observation_id":"189fc815-21c3-4bda-a7df-94e5ae14635f","resolution":{"observed_at":"2026-08-06T18:19:59.521484Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:19:59.508027Z","title":"Learning loop invariants for program verification,","venue":null,"work_id":"0b765dd9-4dde-4b6e-81e1-045fbf37eba3","year":2018},"citing_paper":{"arxiv_id":"2507.08671","last_updated":"2025-07-11T15:11:27Z","snapshot_observed_at":"2026-08-09T14:17:23.242678Z","submitted_at":"2025-07-11T15:11:27Z","title":"LLMCup: Ranking-Enhanced Comment Updating with LLMs","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-06T18:19:58.358914Z"},"links":{"citing_paper":"/paper/2507.08671"},"observation_digest":"sha256:b14bf0b838c53ff8a1781a3fb31e5f3ed0f9eba7c34c20bcbf5f8d99467168fb","observation_id":"0d755543-fd3f-4ecb-9b1d-3f03238241bd","resolution":{"observed_at":"2026-08-06T18:19:59.512612Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:19:59.489357Z","title":"Can chatgpt support software verification?","venue":null,"work_id":"40f4553c-5389-4634-acd2-ec1971e84680","year":2023},"citing_paper":{"arxiv_id":"2507.08671","last_updated":"2025-07-11T15:11:27Z","snapshot_observed_at":"2026-08-09T14:17:23.242678Z","submitted_at":"2025-07-11T15:11:27Z","title":"LLMCup: Ranking-Enhanced Comment Updating with LLMs","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-06T18:19:58.363535Z"},"links":{"citing_paper":"/paper/2507.08671"},"observation_digest":"sha256:9747d50c86a73c722cf9412a029c7178427d9180712eb5c5482a3acafe2b0f51","observation_id":"67b70bc6-80e1-4160-a6b9-51e39bc206e6","resolution":{"observed_at":"2026-08-06T18:19:59.493537Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:19:59.479648Z","title":"Hello gpt-4o,","venue":null,"work_id":"fcc4b87e-1028-44c0-aa10-92e0decc562d","year":2024},"citing_paper":{"arxiv_id":"2507.08671","last_updated":"2025-07-11T15:11:27Z","snapshot_observed_at":"2026-08-09T14:17:23.242678Z","submitted_at":"2025-07-11T15:11:27Z","title":"LLMCup: Ranking-Enhanced Comment Updating with LLMs","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-06T18:19:58.366857Z"},"links":{"citing_paper":"/paper/2507.08671"},"observation_digest":"sha256:09c4a7466bf9cf414e0eb55eb80c1d47e70cd3d5a8d1989da569bfb8c176bfcc","observation_id":"f1140918-a5ec-451e-b273-0dd433b74822","resolution":{"observed_at":"2026-08-06T18:19:59.482754Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:19:59.470219Z","title":"The official meta llama 3 github site,","venue":null,"work_id":"985ae05f-20e5-4bfe-ab8f-24b02ad86f94","year":null},"citing_paper":{"arxiv_id":"2507.08671","last_updated":"2025-07-11T15:11:27Z","snapshot_observed_at":"2026-08-09T14:17:23.242678Z","submitted_at":"2025-07-11T15:11:27Z","title":"LLMCup: Ranking-Enhanced Comment Updating with LLMs","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-06T18:19:58.371372Z"},"links":{"citing_paper":"/paper/2507.08671"},"observation_digest":"sha256:d9248bac5a118813f52eefb51bf8fe27228095d884f43433418fbea8c757b052","observation_id":"53c1c4ed-8ab7-44b6-9f93-ba72fb532660","resolution":{"observed_at":"2026-08-06T18:19:59.473767Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2308.12950","last_updated":"2024-01-31T19:47:26Z","snapshot_observed_at":"2026-07-06T16:10:07.931347Z","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-06T18:19:58.380965Z","title":"Code llama: Open foundation models for code,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.08671","last_updated":"2025-07-11T15:11:27Z","snapshot_observed_at":"2026-08-09T14:17:23.242678Z","submitted_at":"2025-07-11T15:11:27Z","title":"LLMCup: Ranking-Enhanced Comment Updating with LLMs","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-06T18:19:58.380965Z"},"links":{"cited_paper":"/paper/2308.12950","citing_paper":"/paper/2507.08671"},"observation_digest":"sha256:3b3d5e4b11a8615b186ba54b0dc4facfec3e85a1148dc47a9653f807afd443c1","observation_id":"8cadaed0-87cf-4b15-9d9d-c3fdc03efe38","resolution":{"observed_at":"2026-08-06T18:19:58.380965Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.11931","last_updated":"2024-06-17T13:51:35Z","snapshot_observed_at":"2026-08-07T06:30:25.302107Z","submitted_at":"2024-06-17T13:51:35Z","title":"DeepSeek-Coder-V2: Breaking the Barrier of Closed-Source Models in Code Intelligence","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.11931","snapshot_observed_at":"2026-08-06T18:19:58.384632Z","title":"Deepseek-coder-v2: Breaking the barrier of closed-source models in code intelligence,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.08671","last_updated":"2025-07-11T15:11:27Z","snapshot_observed_at":"2026-08-09T14:17:23.242678Z","submitted_at":"2025-07-11T15:11:27Z","title":"LLMCup: Ranking-Enhanced Comment Updating with LLMs","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-06T18:19:58.384632Z"},"links":{"cited_paper":"/paper/2406.11931","citing_paper":"/paper/2507.08671"},"observation_digest":"sha256:ce33c2e6d7e5bd802e3a02fc5c7d2f8f8d89deb1099499c29ff08df2052a7513","observation_id":"227026d9-4785-42df-abed-e679e9a1ac95","resolution":{"observed_at":"2026-08-06T18:19:58.384632Z","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-06T18:19:59.446908Z","title":"Gemma: Open weights llm from google deepmind,","venue":null,"work_id":"e72c93c6-7bc4-4572-9aca-de3b3324005d","year":2024},"citing_paper":{"arxiv_id":"2507.08671","last_updated":"2025-07-11T15:11:27Z","snapshot_observed_at":"2026-08-09T14:17:23.242678Z","submitted_at":"2025-07-11T15:11:27Z","title":"LLMCup: Ranking-Enhanced Comment Updating with LLMs","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-06T18:19:58.389505Z"},"links":{"citing_paper":"/paper/2507.08671"},"observation_digest":"sha256:7dbb407ee7cd89cb9ff7fc8e0a562faea704ebad43000a8aa9683001adfbaa3b","observation_id":"ef56046e-422f-4939-9f69-72bccd79cf1d","resolution":{"observed_at":"2026-08-06T18:19:59.449764Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:19:59.435356Z","title":"Examining the evolution of code comments in postgresql,","venue":null,"work_id":"010c03bb-6687-42ba-b30a-b2b6d4c48f37","year":2006},"citing_paper":{"arxiv_id":"2507.08671","last_updated":"2025-07-11T15:11:27Z","snapshot_observed_at":"2026-08-09T14:17:23.242678Z","submitted_at":"2025-07-11T15:11:27Z","title":"LLMCup: Ranking-Enhanced Comment Updating with LLMs","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-06T18:19:58.394779Z"},"links":{"citing_paper":"/paper/2507.08671"},"observation_digest":"sha256:488d14ea0a67f72e11f882716a441e64720e4566e90baded91fada40627c900c","observation_id":"7529c894-064f-46f1-beca-1b593a83d846","resolution":{"observed_at":"2026-08-06T18:19:59.438695Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:19:59.420867Z","title":"Hatcup: Hybrid analysis and attention based just-in-time comment updating,","venue":null,"work_id":"0c29ac6d-0cc4-4bcb-a4bc-95c653c7ada8","year":2022},"citing_paper":{"arxiv_id":"2507.08671","last_updated":"2025-07-11T15:11:27Z","snapshot_observed_at":"2026-08-09T14:17:23.242678Z","submitted_at":"2025-07-11T15:11:27Z","title":"LLMCup: Ranking-Enhanced Comment Updating with LLMs","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-06T18:19:58.398947Z"},"links":{"citing_paper":"/paper/2507.08671"},"observation_digest":"sha256:21ed31a93026da1716f0b2cb855a056ec102cbebd3a7b3fc64b3ca0ca9afa2ec","observation_id":"651729c7-f4f5-4c0a-8358-616701184a50","resolution":{"observed_at":"2026-08-06T18:19:59.423975Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:19:59.410972Z","title":"Deep just-in-time consistent com- ment update via source code changes,","venue":null,"work_id":"e800f160-e97e-4856-9109-54f083ad8be3","year":2022},"citing_paper":{"arxiv_id":"2507.08671","last_updated":"2025-07-11T15:11:27Z","snapshot_observed_at":"2026-08-09T14:17:23.242678Z","submitted_at":"2025-07-11T15:11:27Z","title":"LLMCup: Ranking-Enhanced Comment Updating with LLMs","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-06T18:19:58.402756Z"},"links":{"citing_paper":"/paper/2507.08671"},"observation_digest":"sha256:f9ba144c0f991d9bdda164a0b4c967a7f7d8246ac2b9c1ba545db997409fc4eb","observation_id":"b7018f9d-8a5a-4232-9a84-e7e9a603aaba","resolution":{"observed_at":"2026-08-06T18:19:59.414243Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:19:59.402564Z","title":"On the use of automated text summarization techniques for summarizing source code,","venue":null,"work_id":"e59ec182-58b4-4c3e-9660-89070b0b4cce","year":2010},"citing_paper":{"arxiv_id":"2507.08671","last_updated":"2025-07-11T15:11:27Z","snapshot_observed_at":"2026-08-09T14:17:23.242678Z","submitted_at":"2025-07-11T15:11:27Z","title":"LLMCup: Ranking-Enhanced Comment Updating with LLMs","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-06T18:19:58.405811Z"},"links":{"citing_paper":"/paper/2507.08671"},"observation_digest":"sha256:84ffc3a6f46966496f27a7a06c7c1453bd6b84d4dae87f5abccf9066173ae5d7","observation_id":"dea758ce-8b19-4da3-b129-c29d45d0b76e","resolution":{"observed_at":"2026-08-06T18:19:59.405691Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:19:59.389944Z","title":"Evaluating source code summarization techniques: Replication and expansion,","venue":null,"work_id":"5352250e-ab70-474c-bd27-f11f9f88a253","year":2013},"citing_paper":{"arxiv_id":"2507.08671","last_updated":"2025-07-11T15:11:27Z","snapshot_observed_at":"2026-08-09T14:17:23.242678Z","submitted_at":"2025-07-11T15:11:27Z","title":"LLMCup: Ranking-Enhanced Comment Updating with LLMs","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-06T18:19:58.409225Z"},"links":{"citing_paper":"/paper/2507.08671"},"observation_digest":"sha256:392ecd59718b744a6f12cf4fe871c99256fb652ac96beacba0c28f9bf4d40eeb","observation_id":"9508923c-05d4-416e-8a33-df78532b752c","resolution":{"observed_at":"2026-08-06T18:19:59.397316Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:19:59.378310Z","title":"Supporting program com- prehension with source code summarization,","venue":null,"work_id":"afda96a2-db0c-41a0-ba51-c3b07f3eb13a","year":2010},"citing_paper":{"arxiv_id":"2507.08671","last_updated":"2025-07-11T15:11:27Z","snapshot_observed_at":"2026-08-09T14:17:23.242678Z","submitted_at":"2025-07-11T15:11:27Z","title":"LLMCup: Ranking-Enhanced Comment Updating with LLMs","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-06T18:19:58.412512Z"},"links":{"citing_paper":"/paper/2507.08671"},"observation_digest":"sha256:5325cfb3b2342720bca27a0def5d36587106a5510f8139dd114007c25b0f210c","observation_id":"bc828a24-a228-4959-b0d8-1ab38dc7d6aa","resolution":{"observed_at":"2026-08-06T18:19:59.381928Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:19:59.368955Z","title":"Towards automatically generating summary comments for java methods,","venue":null,"work_id":"bd1ca588-bf6a-4e23-9539-e01ed383cce6","year":2010},"citing_paper":{"arxiv_id":"2507.08671","last_updated":"2025-07-11T15:11:27Z","snapshot_observed_at":"2026-08-09T14:17:23.242678Z","submitted_at":"2025-07-11T15:11:27Z","title":"LLMCup: Ranking-Enhanced Comment Updating with LLMs","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-06T18:19:58.415999Z"},"links":{"citing_paper":"/paper/2507.08671"},"observation_digest":"sha256:b9680318cba05c62c91abf235b693a8e5c75ce65b8653966f35575246d9f80f5","observation_id":"c2cabb12-000b-4042-824d-96d954442853","resolution":{"observed_at":"2026-08-06T18:19:59.372293Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:19:59.358516Z","title":"Clocom: Mining existing source code for automatic comment generation,","venue":null,"work_id":"54004169-27d6-4a61-9ae2-e15e7b262eee","year":2015},"citing_paper":{"arxiv_id":"2507.08671","last_updated":"2025-07-11T15:11:27Z","snapshot_observed_at":"2026-08-09T14:17:23.242678Z","submitted_at":"2025-07-11T15:11:27Z","title":"LLMCup: Ranking-Enhanced Comment Updating with LLMs","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-06T18:19:58.419619Z"},"links":{"citing_paper":"/paper/2507.08671"},"observation_digest":"sha256:a7c4c58c0d9206360d2908d4293142673b8038896017f3ccfd3a3b5fb02217ee","observation_id":"728ed678-42d5-4e6f-8747-25404ae077a2","resolution":{"observed_at":"2026-08-06T18:19:59.361667Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:19:59.346801Z","title":"Extracting code segments and their descriptions from research articles,","venue":null,"work_id":"b8e3a1b4-ce68-45d9-9284-9a5af95def40","year":2017},"citing_paper":{"arxiv_id":"2507.08671","last_updated":"2025-07-11T15:11:27Z","snapshot_observed_at":"2026-08-09T14:17:23.242678Z","submitted_at":"2025-07-11T15:11:27Z","title":"LLMCup: Ranking-Enhanced Comment Updating with LLMs","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-06T18:19:58.422781Z"},"links":{"citing_paper":"/paper/2507.08671"},"observation_digest":"sha256:4471ee61810bf8b1bcfee580ccaaff52aebbee39c8f07f65044f4f447fac2455","observation_id":"82814ed2-3150-45a4-8695-a6cc34e43bee","resolution":{"observed_at":"2026-08-06T18:19:59.350600Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:19:59.331631Z","title":"Automatically generating commit messages from diffs using neural machine translation,","venue":null,"work_id":"120bb9e5-5aad-4a08-8713-032d3b603414","year":2017},"citing_paper":{"arxiv_id":"2507.08671","last_updated":"2025-07-11T15:11:27Z","snapshot_observed_at":"2026-08-09T14:17:23.242678Z","submitted_at":"2025-07-11T15:11:27Z","title":"LLMCup: Ranking-Enhanced Comment Updating with LLMs","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-06T18:19:58.425872Z"},"links":{"citing_paper":"/paper/2507.08671"},"observation_digest":"sha256:0ba48acfb08018e35227d3586ab216a0fc866135ee62ee5433f40418b25d774a","observation_id":"c02609b3-a98e-48db-a86b-ddf6a98de966","resolution":{"observed_at":"2026-08-06T18:19:59.340033Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:19:59.321369Z","title":"Autocomment: Mining question and answer sites for automatic comment generation,","venue":null,"work_id":"e1dfd5ab-608b-4a07-8c30-548fc68b1c79","year":2013},"citing_paper":{"arxiv_id":"2507.08671","last_updated":"2025-07-11T15:11:27Z","snapshot_observed_at":"2026-08-09T14:17:23.242678Z","submitted_at":"2025-07-11T15:11:27Z","title":"LLMCup: Ranking-Enhanced Comment Updating with LLMs","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-06T18:19:58.430227Z"},"links":{"citing_paper":"/paper/2507.08671"},"observation_digest":"sha256:c8bb5d5ff6af00a01801b6420607dd8c048f9150908b0da1c5d7fa04757b41c4","observation_id":"4033712e-602c-4dce-9d01-9815c364663c","resolution":{"observed_at":"2026-08-06T18:19:59.325582Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:19:59.305020Z","title":"Codeattention: translating source code to comments by exploiting the code constructs,","venue":null,"work_id":"5c550c93-1cb2-4d33-82a6-a6234489abcf","year":2018},"citing_paper":{"arxiv_id":"2507.08671","last_updated":"2025-07-11T15:11:27Z","snapshot_observed_at":"2026-08-09T14:17:23.242678Z","submitted_at":"2025-07-11T15:11:27Z","title":"LLMCup: Ranking-Enhanced Comment Updating with LLMs","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-06T18:19:58.433771Z"},"links":{"citing_paper":"/paper/2507.08671"},"observation_digest":"sha256:69a7d73d7501e2b9a26b2eb4d6ed2792a43f8b08785a288077d34975c04a1886","observation_id":"c6a3d772-e688-42b9-8e14-0d180e74614b","resolution":{"observed_at":"2026-08-06T18:19:59.312175Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:19:59.280415Z","title":"Summarizing source code using a neural attention model,","venue":null,"work_id":"84160c60-fc3b-4b7e-97c4-5a248c5f47be","year":2016},"citing_paper":{"arxiv_id":"2507.08671","last_updated":"2025-07-11T15:11:27Z","snapshot_observed_at":"2026-08-09T14:17:23.242678Z","submitted_at":"2025-07-11T15:11:27Z","title":"LLMCup: Ranking-Enhanced Comment Updating with LLMs","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-06T18:19:58.437802Z"},"links":{"citing_paper":"/paper/2507.08671"},"observation_digest":"sha256:70173f15618a85089f9612a97ac0f9bbc66f3198429d68e4ba97198db3f5e806","observation_id":"33b10fe8-f4e2-4ad7-9b60-da7358d9641c","resolution":{"observed_at":"2026-08-06T18:19:59.286011Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:19:59.264921Z","title":"Automatically gen- erating natural language descriptions for object-related statement se- quences,","venue":null,"work_id":"d2bab7f8-9834-42c6-b411-7a2ea132400e","year":2017},"citing_paper":{"arxiv_id":"2507.08671","last_updated":"2025-07-11T15:11:27Z","snapshot_observed_at":"2026-08-09T14:17:23.242678Z","submitted_at":"2025-07-11T15:11:27Z","title":"LLMCup: Ranking-Enhanced Comment Updating with LLMs","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-06T18:19:58.441745Z"},"links":{"citing_paper":"/paper/2507.08671"},"observation_digest":"sha256:a7407e32d4eb845fe15897672c285cb62b8ca7d3f904d7bd5a6e1ca25c146fb2","observation_id":"21f5b9a7-458d-4442-b397-07bbfb6302f1","resolution":{"observed_at":"2026-08-06T18:19:59.268513Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:19:59.252840Z","title":"Cider: Consensus-based image description evaluation,","venue":null,"work_id":"7b34a336-1b6f-4fc5-848c-1ab4e42da23e","year":2015},"citing_paper":{"arxiv_id":"2507.08671","last_updated":"2025-07-11T15:11:27Z","snapshot_observed_at":"2026-08-09T14:17:23.242678Z","submitted_at":"2025-07-11T15:11:27Z","title":"LLMCup: Ranking-Enhanced Comment Updating with LLMs","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-06T18:19:58.444723Z"},"links":{"citing_paper":"/paper/2507.08671"},"observation_digest":"sha256:701091ef3e4112ea74473d4fc1fdb45521bc812d8c8ebfc8555dfbdcbe0b6157","observation_id":"34eb0116-5dab-428d-8c67-1e95a8382d6e","resolution":{"observed_at":"2026-08-06T18:19:59.257317Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:19:59.240786Z","title":"Im- proving automatic source code summarization via deep reinforcement learning,","venue":null,"work_id":"381ca7bf-b043-4a23-9de4-3f68a03d2967","year":2018},"citing_paper":{"arxiv_id":"2507.08671","last_updated":"2025-07-11T15:11:27Z","snapshot_observed_at":"2026-08-09T14:17:23.242678Z","submitted_at":"2025-07-11T15:11:27Z","title":"LLMCup: Ranking-Enhanced Comment Updating with LLMs","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-06T18:19:58.447982Z"},"links":{"citing_paper":"/paper/2507.08671"},"observation_digest":"sha256:ba3a11676eb95b90b6b775c8c9ffb2e6889f6848799cc39a80d964470fbaa8c1","observation_id":"803f5dab-0402-49dd-b416-122995533e48","resolution":{"observed_at":"2026-08-06T18:19:59.245542Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:19:59.229990Z","title":"On the properties of neural machine translation: Encoder–decoder approaches,","venue":null,"work_id":"b35a2da5-f727-48ad-8e0b-41017efb1a4a","year":2014},"citing_paper":{"arxiv_id":"2507.08671","last_updated":"2025-07-11T15:11:27Z","snapshot_observed_at":"2026-08-09T14:17:23.242678Z","submitted_at":"2025-07-11T15:11:27Z","title":"LLMCup: Ranking-Enhanced Comment Updating with LLMs","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-06T18:19:58.450914Z"},"links":{"citing_paper":"/paper/2507.08671"},"observation_digest":"sha256:156a3af817e63f5f7ccb5c17e102882021cf36a4f4cdb14632e3ad6c92c8d775","observation_id":"909fe73e-2b7d-4565-a08d-546c45cfc417","resolution":{"observed_at":"2026-08-06T18:19:59.233710Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:19:59.219994Z","title":"How do professional developers comprehend software?","venue":null,"work_id":"a3057b84-88dd-4841-96ba-122b8fd049fc","year":2012},"citing_paper":{"arxiv_id":"2507.08671","last_updated":"2025-07-11T15:11:27Z","snapshot_observed_at":"2026-08-09T14:17:23.242678Z","submitted_at":"2025-07-11T15:11:27Z","title":"LLMCup: Ranking-Enhanced Comment Updating with LLMs","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-06T18:19:58.453842Z"},"links":{"citing_paper":"/paper/2507.08671"},"observation_digest":"sha256:6d3fa76cab418d7f4eef8775a028de6f9337c2444c19f37b168d45e436f40d26","observation_id":"9b537a72-d5be-48a1-9948-66a3e253bfb2","resolution":{"observed_at":"2026-08-06T18:19:59.223094Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1602.03001","last_updated":"2016-05-25T12:18:28Z","snapshot_observed_at":"2026-07-06T04:45:35.550830Z","submitted_at":"2016-02-09T14:36:49Z","title":"A Convolutional Attention Network for Extreme Summarization of Source Code","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1602.03001","snapshot_observed_at":"2026-08-06T18:19:58.457460Z","title":"A convolutional attention network for extreme summarization of source code,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2507.08671","last_updated":"2025-07-11T15:11:27Z","snapshot_observed_at":"2026-08-09T14:17:23.242678Z","submitted_at":"2025-07-11T15:11:27Z","title":"LLMCup: Ranking-Enhanced Comment Updating with LLMs","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-06T18:19:58.457460Z"},"links":{"cited_paper":"/paper/1602.03001","citing_paper":"/paper/2507.08671"},"observation_digest":"sha256:5839457f64388f82a9ffe8fab23f10c2dc4feca7b9e7b0b56195eee0334bb04c","observation_id":"cfbf13b2-b3d6-43f7-a40b-fa11b2e9ae3f","resolution":{"observed_at":"2026-08-06T18:19:58.457460Z","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-06T18:19:59.208133Z","title":"/*icomment: bugs or bad comments?*/,","venue":null,"work_id":"7742ad3f-ffb0-4950-8738-d16c1ba8cd66","year":2007},"citing_paper":{"arxiv_id":"2507.08671","last_updated":"2025-07-11T15:11:27Z","snapshot_observed_at":"2026-08-09T14:17:23.242678Z","submitted_at":"2025-07-11T15:11:27Z","title":"LLMCup: Ranking-Enhanced Comment Updating with LLMs","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-06T18:19:58.460898Z"},"links":{"citing_paper":"/paper/2507.08671"},"observation_digest":"sha256:8781a8b42a145c2972eb55a6a4c0da95700759dc7a25622eedb58478849b8ffd","observation_id":"c0ffd0d3-3142-4958-8222-88a7abccce8a","resolution":{"observed_at":"2026-08-06T18:19:59.212460Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:19:59.197088Z","title":"Automatic quality assessment of source code comments: The javadocminer,","venue":null,"work_id":"159e2805-fb22-4b7b-81ca-59b58dc65d53","year":2010},"citing_paper":{"arxiv_id":"2507.08671","last_updated":"2025-07-11T15:11:27Z","snapshot_observed_at":"2026-08-09T14:17:23.242678Z","submitted_at":"2025-07-11T15:11:27Z","title":"LLMCup: Ranking-Enhanced Comment Updating with LLMs","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-06T18:19:58.464310Z"},"links":{"citing_paper":"/paper/2507.08671"},"observation_digest":"sha256:1a060a3391a8e4bbd06c65acc28205cc794e691aa7f59f61703a2b70b68678c6","observation_id":"593d3c32-545c-49e7-afdb-449de0581c5f","resolution":{"observed_at":"2026-08-06T18:19:59.200387Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:19:59.181540Z","title":"@tcomment: Testing javadoc comments to detect comment-code inconsistencies,","venue":null,"work_id":"7c147b6d-3438-4f03-ada2-9f68d647de00","year":2012},"citing_paper":{"arxiv_id":"2507.08671","last_updated":"2025-07-11T15:11:27Z","snapshot_observed_at":"2026-08-09T14:17:23.242678Z","submitted_at":"2025-07-11T15:11:27Z","title":"LLMCup: Ranking-Enhanced Comment Updating with LLMs","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-06T18:19:58.468766Z"},"links":{"citing_paper":"/paper/2507.08671"},"observation_digest":"sha256:29aa13eac7611e779c254ee29f5a9cf2ba39119cbad11d921e88b9a65a0de027","observation_id":"30ccaf3a-6c3f-44cf-91db-266eade40bd2","resolution":{"observed_at":"2026-08-06T18:19:59.185339Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:19:59.170972Z","title":"Detecting fragile comments,","venue":null,"work_id":"124d2b33-acd9-4e74-ad21-59cafeab514c","year":2017},"citing_paper":{"arxiv_id":"2507.08671","last_updated":"2025-07-11T15:11:27Z","snapshot_observed_at":"2026-08-09T14:17:23.242678Z","submitted_at":"2025-07-11T15:11:27Z","title":"LLMCup: Ranking-Enhanced Comment Updating with LLMs","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-06T18:19:58.472069Z"},"links":{"citing_paper":"/paper/2507.08671"},"observation_digest":"sha256:2380cf1c46f1190f901832cf46648f15da0261305fff2da90e7b4a97b2e96a95","observation_id":"1adab188-aa84-4edc-a33a-5c24e40c24f7","resolution":{"observed_at":"2026-08-06T18:19:59.174622Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:19:59.159061Z","title":"Android studio,","venue":null,"work_id":"606a54b8-a1be-49db-988b-8a1726b1263f","year":2024},"citing_paper":{"arxiv_id":"2507.08671","last_updated":"2025-07-11T15:11:27Z","snapshot_observed_at":"2026-08-09T14:17:23.242678Z","submitted_at":"2025-07-11T15:11:27Z","title":"LLMCup: Ranking-Enhanced Comment Updating with LLMs","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-06T18:19:58.475274Z"},"links":{"citing_paper":"/paper/2507.08671"},"observation_digest":"sha256:c23efb86628c1e771078679d77682c2d41bb52b070c3b0cfbfd623187741c64e","observation_id":"bbf16b1e-e557-4cf3-a1f4-47727a95cc7c","resolution":{"observed_at":"2026-08-06T18:19:59.163478Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:19:59.147586Z","title":"Xinyu: An efficient llm-based system for commentary generation,","venue":null,"work_id":"b03aabca-810b-4faf-860d-45b1bf2df5ad","year":2024},"citing_paper":{"arxiv_id":"2507.08671","last_updated":"2025-07-11T15:11:27Z","snapshot_observed_at":"2026-08-09T14:17:23.242678Z","submitted_at":"2025-07-11T15:11:27Z","title":"LLMCup: Ranking-Enhanced Comment Updating with LLMs","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-06T18:19:58.478825Z"},"links":{"citing_paper":"/paper/2507.08671"},"observation_digest":"sha256:f5e03c0f048372b935049585cfdf63da12e34afbcb5ef89149db7c028c540428","observation_id":"8ccfa1e4-8bb4-4adf-b9ae-7f6a7e44f503","resolution":{"observed_at":"2026-08-06T18:19:59.150633Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:19:59.136763Z","title":"Detecting code comment inconsistencies using llm and program analysis,","venue":null,"work_id":"46ad56bf-267a-4d54-854e-0bcbe0b01c69","year":2024},"citing_paper":{"arxiv_id":"2507.08671","last_updated":"2025-07-11T15:11:27Z","snapshot_observed_at":"2026-08-09T14:17:23.242678Z","submitted_at":"2025-07-11T15:11:27Z","title":"LLMCup: Ranking-Enhanced Comment Updating with LLMs","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-06T18:19:58.485050Z"},"links":{"citing_paper":"/paper/2507.08671"},"observation_digest":"sha256:dbde40d72ae0c75631321c3662da086600f545b7755ee6eda0d7761156ddac05","observation_id":"0dcf8a5d-66f4-4b4e-8d3e-714331c1af3b","resolution":{"observed_at":"2026-08-06T18:19:59.141422Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:19:59.125757Z","title":"Chatunitest: A framework for llm-based test generation,","venue":null,"work_id":"1f42909a-9a39-445a-9489-bd07eeb54914","year":2024},"citing_paper":{"arxiv_id":"2507.08671","last_updated":"2025-07-11T15:11:27Z","snapshot_observed_at":"2026-08-09T14:17:23.242678Z","submitted_at":"2025-07-11T15:11:27Z","title":"LLMCup: Ranking-Enhanced Comment Updating with LLMs","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-06T18:19:58.488629Z"},"links":{"citing_paper":"/paper/2507.08671"},"observation_digest":"sha256:e929a09cde3c0efd4899b173359168d94570f2c521b169e929c110651566bf6c","observation_id":"3fc6b826-41c2-4c67-800e-3ccf24057073","resolution":{"observed_at":"2026-08-06T18:19:59.129426Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:19:59.111736Z","title":"Learning to rank using gradient descent,","venue":null,"work_id":"10f359db-a37e-472c-a4dd-98c119699012","year":2005},"citing_paper":{"arxiv_id":"2507.08671","last_updated":"2025-07-11T15:11:27Z","snapshot_observed_at":"2026-08-09T14:17:23.242678Z","submitted_at":"2025-07-11T15:11:27Z","title":"LLMCup: Ranking-Enhanced Comment Updating with LLMs","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-06T18:19:58.492085Z"},"links":{"citing_paper":"/paper/2507.08671"},"observation_digest":"sha256:c20a1d29d2139c2c00d927bc9fa372973940f4197518ad9392c8eae29a4427d9","observation_id":"485a302b-65a3-4eb4-bf0b-041d225eada8","resolution":{"observed_at":"2026-08-06T18:19:59.116152Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:19:59.092087Z","title":"Contrastive learning with hard negative samples,","venue":null,"work_id":"b9e29020-71dd-4044-9388-ceafd2211699","year":2021},"citing_paper":{"arxiv_id":"2507.08671","last_updated":"2025-07-11T15:11:27Z","snapshot_observed_at":"2026-08-09T14:17:23.242678Z","submitted_at":"2025-07-11T15:11:27Z","title":"LLMCup: Ranking-Enhanced Comment Updating with LLMs","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-06T18:19:58.497026Z"},"links":{"citing_paper":"/paper/2507.08671"},"observation_digest":"sha256:7a157d0d618506f3674480c706e316a462d557a723fc0e643c17b457d8253a38","observation_id":"ecf8f0b6-49dd-4393-b4a8-301ee70cf139","resolution":{"observed_at":"2026-08-06T18:19:59.102547Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:19:59.081245Z","title":"Approximate nearest neighbor negative contrastive learning for dense text retrieval,","venue":null,"work_id":"1a33da40-c628-49f9-a7e7-603d3ed1d616","year":2020},"citing_paper":{"arxiv_id":"2507.08671","last_updated":"2025-07-11T15:11:27Z","snapshot_observed_at":"2026-08-09T14:17:23.242678Z","submitted_at":"2025-07-11T15:11:27Z","title":"LLMCup: Ranking-Enhanced Comment Updating with LLMs","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-06T18:19:58.500653Z"},"links":{"citing_paper":"/paper/2507.08671"},"observation_digest":"sha256:9a75dfa89a5dcb1a9d423056da6ad4dafd77009e5f63f10afd8bdad2c86fc92f","observation_id":"2a75379e-7bef-477d-b7a4-68f49c396232","resolution":{"observed_at":"2026-08-06T18:19:59.085710Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1908.10084","last_updated":"2019-08-27T08:50:17Z","snapshot_observed_at":"2026-07-06T08:17:05.681370Z","submitted_at":"2019-08-27T08:50:17Z","title":"Sentence-BERT: Sentence Embeddings using Siamese BERT-Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1908.10084","snapshot_observed_at":"2026-08-06T18:19:58.503748Z","title":"Sentence-bert: Sentence embeddings using siamese bert- networks,","venue":null,"work_id":null,"year":1908},"citing_paper":{"arxiv_id":"2507.08671","last_updated":"2025-07-11T15:11:27Z","snapshot_observed_at":"2026-08-09T14:17:23.242678Z","submitted_at":"2025-07-11T15:11:27Z","title":"LLMCup: Ranking-Enhanced Comment Updating with LLMs","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-06T18:19:58.503748Z"},"links":{"cited_paper":"/paper/1908.10084","citing_paper":"/paper/2507.08671"},"observation_digest":"sha256:f082540f976cd1dd9bb2666fcf5144bc4aaef12537b89711877e5d2f21e3a0db","observation_id":"9e1a05d3-f18e-486c-a1a8-9ded85c1d4bd","resolution":{"observed_at":"2026-08-06T18:19:58.503748Z","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-06T18:19:59.067045Z","title":"Rethinking the role of demonstrations: What makes in-context learning work?","venue":null,"work_id":"d403a0be-ed2c-4f0a-a2ef-e31beb5cf551","year":2022},"citing_paper":{"arxiv_id":"2507.08671","last_updated":"2025-07-11T15:11:27Z","snapshot_observed_at":"2026-08-09T14:17:23.242678Z","submitted_at":"2025-07-11T15:11:27Z","title":"LLMCup: Ranking-Enhanced Comment Updating with LLMs","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-06T18:19:58.506669Z"},"links":{"citing_paper":"/paper/2507.08671"},"observation_digest":"sha256:9379956c1cd4a80c1e37f753cf8855496da181845576321b6281098918f48922","observation_id":"05ef7332-66ea-4cbf-ad4f-a49f8e522cf4","resolution":{"observed_at":"2026-08-06T18:19:59.073752Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:19:59.050441Z","title":"Retrieval-based prompt se- lection for code-related few-shot learning,","venue":null,"work_id":"5dcc2b12-2cf3-4958-8e19-8fd9cca57dc7","year":2023},"citing_paper":{"arxiv_id":"2507.08671","last_updated":"2025-07-11T15:11:27Z","snapshot_observed_at":"2026-08-09T14:17:23.242678Z","submitted_at":"2025-07-11T15:11:27Z","title":"LLMCup: Ranking-Enhanced Comment Updating with LLMs","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-06T18:19:58.510029Z"},"links":{"citing_paper":"/paper/2507.08671"},"observation_digest":"sha256:57df3979cd6ad67a9db953e297ee43de2d5ec66ae32ab68e60614f7a88cbd47a","observation_id":"8b0acf44-57aa-40b6-9c06-6caad31cda2f","resolution":{"observed_at":"2026-08-06T18:19:59.054859Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:19:59.036076Z","title":"Learning to retrieve prompts for in-context learning,","venue":null,"work_id":"575f7467-f359-4979-8965-a364c963bf95","year":2022},"citing_paper":{"arxiv_id":"2507.08671","last_updated":"2025-07-11T15:11:27Z","snapshot_observed_at":"2026-08-09T14:17:23.242678Z","submitted_at":"2025-07-11T15:11:27Z","title":"LLMCup: Ranking-Enhanced Comment Updating with LLMs","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-06T18:19:58.512987Z"},"links":{"citing_paper":"/paper/2507.08671"},"observation_digest":"sha256:a1e82e0964812fd8c1aa53d369924f68d87717500c230a0e2b5735ae9ed62a2a","observation_id":"097f30b4-be34-4d1d-bae1-90d231f33b53","resolution":{"observed_at":"2026-08-06T18:19:59.040958Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:19:58.516807Z","title":"Retrieval-based prompt se- lection for code-related few-shot learning,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.08671","last_updated":"2025-07-11T15:11:27Z","snapshot_observed_at":"2026-08-09T14:17:23.242678Z","submitted_at":"2025-07-11T15:11:27Z","title":"LLMCup: Ranking-Enhanced Comment Updating with LLMs","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-06T18:19:58.516807Z"},"links":{"citing_paper":"/paper/2507.08671"},"observation_digest":"sha256:98e737e71d89de26339bee3491fd6d8a1ab4f1768270db099e359e7076d982f2","observation_id":"984cb804-83f6-4cf4-b453-d01007cdede1","resolution":{"observed_at":"2026-08-06T18:19:58.516807Z","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-06T18:19:58.997843Z","title":"CodeBERT: A pre-trained model for programming and natural languages,","venue":null,"work_id":"27fba14f-039c-4798-b6db-6b7d30aec936","year":2020},"citing_paper":{"arxiv_id":"2507.08671","last_updated":"2025-07-11T15:11:27Z","snapshot_observed_at":"2026-08-09T14:17:23.242678Z","submitted_at":"2025-07-11T15:11:27Z","title":"LLMCup: Ranking-Enhanced Comment Updating with LLMs","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-06T18:19:58.519933Z"},"links":{"citing_paper":"/paper/2507.08671"},"observation_digest":"sha256:5195b7f20aef4e63d4f49da4f5845c55cfa46b855809d0a0dfaffc11f9310738","observation_id":"94691353-bc24-4098-9958-55221c23354c","resolution":{"observed_at":"2026-08-06T18:19:59.010685Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:19:58.988443Z","title":"Available: https://docs.python.org/3/library/difflib.html","venue":null,"work_id":"06089e14-d7ff-4751-94de-6790c35ed793","year":2023},"citing_paper":{"arxiv_id":"2507.08671","last_updated":"2025-07-11T15:11:27Z","snapshot_observed_at":"2026-08-09T14:17:23.242678Z","submitted_at":"2025-07-11T15:11:27Z","title":"LLMCup: Ranking-Enhanced Comment Updating with LLMs","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-06T18:19:58.528808Z"},"links":{"citing_paper":"/paper/2507.08671"},"observation_digest":"sha256:7647ee469c0c07b7ab36848d9c7bf9c7481df34c6d5511af88e329039b0153c5","observation_id":"df80cef6-45d7-45bc-80e0-32ad0a4c2e51","resolution":{"observed_at":"2026-08-06T18:19:58.991341Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2311.01555","last_updated":"2023-11-02T19:16:21Z","snapshot_observed_at":"2026-08-01T19:49:30.116009Z","submitted_at":"2023-11-02T19:16:21Z","title":"Instruction Distillation Makes Large Language Models Efficient Zero-shot Rankers","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.01555","snapshot_observed_at":"2026-08-06T18:19:58.532315Z","title":"Instruction distillation makes large language models efficient zero-shot rankers,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.08671","last_updated":"2025-07-11T15:11:27Z","snapshot_observed_at":"2026-08-09T14:17:23.242678Z","submitted_at":"2025-07-11T15:11:27Z","title":"LLMCup: Ranking-Enhanced Comment Updating with LLMs","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-06T18:19:58.532315Z"},"links":{"cited_paper":"/paper/2311.01555","citing_paper":"/paper/2507.08671"},"observation_digest":"sha256:62505d7bd7348056272be02794d5bfa68e30d2f6193e57a305d62084026541b8","observation_id":"c549df4e-5e71-4785-835b-ed2358bf947c","resolution":{"observed_at":"2026-08-06T18:19:58.532315Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2304.09542","last_updated":"2024-12-28T06:20:54Z","snapshot_observed_at":"2026-08-06T00:21:17.259026Z","submitted_at":"2023-04-19T10:16:03Z","title":"Is ChatGPT Good at Search? Investigating Large Language Models as Re-Ranking Agents","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2304.09542","snapshot_observed_at":"2026-08-06T18:19:58.535253Z","title":"Is chatgpt good at search? investigating large language models as re-ranking agent,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.08671","last_updated":"2025-07-11T15:11:27Z","snapshot_observed_at":"2026-08-09T14:17:23.242678Z","submitted_at":"2025-07-11T15:11:27Z","title":"LLMCup: Ranking-Enhanced Comment Updating with LLMs","version":1},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-06T18:19:58.535253Z"},"links":{"cited_paper":"/paper/2304.09542","citing_paper":"/paper/2507.08671"},"observation_digest":"sha256:a04c9cc3962751666e4e87bfa4b8713925ee42b07466c3a92091f498b13cd1a8","observation_id":"122b7421-2f66-408f-8614-eb45f18f9f8d","resolution":{"observed_at":"2026-08-06T18:19:58.535253Z","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-06T18:19:58.964492Z","title":"Adapting deep ranknet for personalized search,","venue":null,"work_id":"88bbdbc5-e570-4605-b428-8d61bb9863ff","year":2014},"citing_paper":{"arxiv_id":"2507.08671","last_updated":"2025-07-11T15:11:27Z","snapshot_observed_at":"2026-08-09T14:17:23.242678Z","submitted_at":"2025-07-11T15:11:27Z","title":"LLMCup: Ranking-Enhanced Comment Updating with LLMs","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-06T18:19:58.538292Z"},"links":{"citing_paper":"/paper/2507.08671"},"observation_digest":"sha256:0dd058b39ac952cda7c36f6e1e192e5da465d78c6606b16a78438643b9ea1aa9","observation_id":"6e93d5ca-6d61-4cee-848f-44c3ce3f80a8","resolution":{"observed_at":"2026-08-06T18:19:58.977137Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:19:58.947207Z","title":"Ensemble network for ranking im- ages based on visual appeal,","venue":null,"work_id":"978c8086-2264-4ca4-99a4-e5e075f4f96d","year":2020},"citing_paper":{"arxiv_id":"2507.08671","last_updated":"2025-07-11T15:11:27Z","snapshot_observed_at":"2026-08-09T14:17:23.242678Z","submitted_at":"2025-07-11T15:11:27Z","title":"LLMCup: Ranking-Enhanced Comment Updating with LLMs","version":1},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-06T18:19:58.541524Z"},"links":{"citing_paper":"/paper/2507.08671"},"observation_digest":"sha256:d61f1eb45020570bfcbc52e8c92112b5348f2ca288eb577483a36fa6314f0c3e","observation_id":"9d380eb6-10ce-4569-85cc-cecdc4ecda39","resolution":{"observed_at":"2026-08-06T18:19:58.958004Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:19:58.933028Z","title":"A large-scale empirical study on code-comment inconsistencies,","venue":null,"work_id":"4c02a892-f40c-42f5-ab08-2bf2a98fdbaa","year":2019},"citing_paper":{"arxiv_id":"2507.08671","last_updated":"2025-07-11T15:11:27Z","snapshot_observed_at":"2026-08-09T14:17:23.242678Z","submitted_at":"2025-07-11T15:11:27Z","title":"LLMCup: Ranking-Enhanced Comment Updating with LLMs","version":1},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-06T18:19:58.544584Z"},"links":{"citing_paper":"/paper/2507.08671"},"observation_digest":"sha256:2b61d2f949b950475fc1275722a4874794001f2e278c62fb14ec48a24268172f","observation_id":"1bc6983e-483a-4bf9-8ff8-30c75553b50d","resolution":{"observed_at":"2026-08-06T18:19:58.938122Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"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-06T18:19:58.547623Z","title":"Qwen2.5-coder technical report,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.08671","last_updated":"2025-07-11T15:11:27Z","snapshot_observed_at":"2026-08-09T14:17:23.242678Z","submitted_at":"2025-07-11T15:11:27Z","title":"LLMCup: Ranking-Enhanced Comment Updating with LLMs","version":1},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-08-06T18:19:58.547623Z"},"links":{"cited_paper":"/paper/2409.12186","citing_paper":"/paper/2507.08671"},"observation_digest":"sha256:12478c7dbfd42b4974c5cce396399a6d5424637083139178a1cde061e717dfba","observation_id":"dad0866c-51a5-4e06-94dc-b92c3fa002ca","resolution":{"observed_at":"2026-08-06T18:19:58.547623Z","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-06T18:19:58.902923Z","title":"On the use of automated text summarization techniques for summarizing source code,","venue":null,"work_id":"7c3844c8-3580-40a6-a686-cfdb3cf5a556","year":2010},"citing_paper":{"arxiv_id":"2507.08671","last_updated":"2025-07-11T15:11:27Z","snapshot_observed_at":"2026-08-09T14:17:23.242678Z","submitted_at":"2025-07-11T15:11:27Z","title":"LLMCup: Ranking-Enhanced Comment Updating with LLMs","version":1},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-08-06T18:19:58.550356Z"},"links":{"citing_paper":"/paper/2507.08671"},"observation_digest":"sha256:c0d739d7f74144fdbcf88cf4d28c4fb24195b2129c0ca625b1a106bf8998ac3c","observation_id":"074bc9dc-2faa-4bb9-8fe6-10ac1c7fffe5","resolution":{"observed_at":"2026-08-06T18:19:58.911973Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:19:58.884676Z","title":"Deep code comment generation,","venue":null,"work_id":"6781a713-0f1b-4882-89c6-971754fe6bbd","year":2018},"citing_paper":{"arxiv_id":"2507.08671","last_updated":"2025-07-11T15:11:27Z","snapshot_observed_at":"2026-08-09T14:17:23.242678Z","submitted_at":"2025-07-11T15:11:27Z","title":"LLMCup: Ranking-Enhanced Comment Updating with LLMs","version":1},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-08-06T18:19:58.553755Z"},"links":{"citing_paper":"/paper/2507.08671"},"observation_digest":"sha256:0ade7120f72389634b3f839f3e9b5c4e83cdd43f6ac3c7b6fcc7f9f7d22be6ae","observation_id":"2df66ada-d2d8-45ef-88f5-05447a346bdf","resolution":{"observed_at":"2026-08-06T18:19:58.892452Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:19:58.860764Z","title":"Summarizing source code using a neural attention model,","venue":null,"work_id":"82459f4a-dc85-4ad4-8214-c7d0da043a21","year":2016},"citing_paper":{"arxiv_id":"2507.08671","last_updated":"2025-07-11T15:11:27Z","snapshot_observed_at":"2026-08-09T14:17:23.242678Z","submitted_at":"2025-07-11T15:11:27Z","title":"LLMCup: Ranking-Enhanced Comment Updating with LLMs","version":1},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-08-06T18:19:58.556665Z"},"links":{"citing_paper":"/paper/2507.08671"},"observation_digest":"sha256:857c69e4ae1cc649c02fd46582edb21b8b9d56fef2cee0fc38d878947dd3f055","observation_id":"5a903bf1-2074-454b-89ac-db3f133fc579","resolution":{"observed_at":"2026-08-06T18:19:58.872105Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:19:58.849093Z","title":"Bleu: a method for automatic evaluation of machine translation,","venue":null,"work_id":"4385a9fc-92d9-4f3d-9be1-a37cfedbf02f","year":2002},"citing_paper":{"arxiv_id":"2507.08671","last_updated":"2025-07-11T15:11:27Z","snapshot_observed_at":"2026-08-09T14:17:23.242678Z","submitted_at":"2025-07-11T15:11:27Z","title":"LLMCup: Ranking-Enhanced Comment Updating with LLMs","version":1},"reference_index":75,"source":"pdf_text","source_observed_at":"2026-08-06T18:19:58.559143Z"},"links":{"citing_paper":"/paper/2507.08671"},"observation_digest":"sha256:e230426d617375b1390ff9fe817d500122e9a9aeae73a26faa2665f05bb4100b","observation_id":"e2fde129-a664-430a-aaa1-b06cc79342ea","resolution":{"observed_at":"2026-08-06T18:19:58.852040Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:19:58.835142Z","title":"Meteor: An automatic metric for mt evalua- tion with improved correlation with human judgments,","venue":null,"work_id":"7f80333d-1b74-4f8f-a54e-9cea4278d2de","year":2005},"citing_paper":{"arxiv_id":"2507.08671","last_updated":"2025-07-11T15:11:27Z","snapshot_observed_at":"2026-08-09T14:17:23.242678Z","submitted_at":"2025-07-11T15:11:27Z","title":"LLMCup: Ranking-Enhanced Comment Updating with LLMs","version":1},"reference_index":76,"source":"pdf_text","source_observed_at":"2026-08-06T18:19:58.562081Z"},"links":{"citing_paper":"/paper/2507.08671"},"observation_digest":"sha256:fc747fb09c80ba548236f9828833d9b804c32a82c66146d232eaeda920bbdfb5","observation_id":"7e7b90e3-1682-44b7-9ad0-7d46b2a2d9c8","resolution":{"observed_at":"2026-08-06T18:19:58.841924Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:19:58.568508Z","title":"Rouge: A package for automatic evaluation of summaries,","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2507.08671","last_updated":"2025-07-11T15:11:27Z","snapshot_observed_at":"2026-08-09T14:17:23.242678Z","submitted_at":"2025-07-11T15:11:27Z","title":"LLMCup: Ranking-Enhanced Comment Updating with LLMs","version":1},"reference_index":77,"source":"pdf_text","source_observed_at":"2026-08-06T18:19:58.568508Z"},"links":{"citing_paper":"/paper/2507.08671"},"observation_digest":"sha256:ece79619cd7bcf05fd059f787eb1a77d78d7dba3b56daeb7a1130228c71ee079","observation_id":"4a42ebcd-8c3d-4881-9d02-fd3a2c7c0bdd","resolution":{"observed_at":"2026-08-06T18:19:58.568508Z","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-06T18:19:58.785081Z","title":"A technique for the measurement of attitudes","venue":null,"work_id":"8a279e72-5c1c-4c70-ab4b-9e56b31ec87d","year":1932},"citing_paper":{"arxiv_id":"2507.08671","last_updated":"2025-07-11T15:11:27Z","snapshot_observed_at":"2026-08-09T14:17:23.242678Z","submitted_at":"2025-07-11T15:11:27Z","title":"LLMCup: Ranking-Enhanced Comment Updating with LLMs","version":1},"reference_index":78,"source":"pdf_text","source_observed_at":"2026-08-06T18:19:58.571730Z"},"links":{"citing_paper":"/paper/2507.08671"},"observation_digest":"sha256:677b275726275dad924f9683429c4627e339a5351bbf00f4559b216fce73f7c5","observation_id":"e040aad7-9005-4cc8-b4dc-83e873f3e499","resolution":{"observed_at":"2026-08-06T18:19:58.805484Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:19:59.458589Z","title":"Available: https://github.com/meta-llama/llama3","venue":null,"work_id":"7ecdb6d2-52b6-4617-a8e6-f3cd50248de7","year":null},"citing_paper":{"arxiv_id":"2507.08671","last_updated":"2025-07-11T15:11:27Z","snapshot_observed_at":"2026-08-09T14:17:23.242678Z","submitted_at":"2025-07-11T15:11:27Z","title":"LLMCup: Ranking-Enhanced Comment Updating with LLMs","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-06T18:19:58.376501Z"},"links":{"citing_paper":"/paper/2507.08671"},"observation_digest":"sha256:df669ca251b85590b99dcaedfc79ccca80500ec7425ea7213cda1513fc756003","observation_id":"30519476-7db1-4781-a89a-569b7fbf3961","resolution":{"observed_at":"2026-08-06T18:19:59.461784Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2507.08671","last_updated":"2025-07-11T15:11:27Z","latest_version":1,"primary_category":"cs.SE","snapshot_observed_at":"2026-08-09T14:17:23.242678Z","submitted_at":"2025-07-11T15:11:27Z","title":"LLMCup: Ranking-Enhanced Comment Updating with LLMs"},"reference_resolution":{"displayed":79,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":17,"verified_exact":0,"verified_fuzzy":62},"total_outbound_references":79},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 79 of 79 outbound references and 0 inbound Pith citation observations for arXiv:2507.08671."}