{"as_of":"2026-08-23T13:26:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5ad77a9636e755bc5d557a1f9a81b6bafbf23600ce06af99980f483083cb623e","coverage":[{"denominator":27,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":27,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T23:40:47.020679Z","state":"measured"},{"denominator":27,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":27,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-23T06:30:58.430688+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/2505.04040/citation-record","integrity":"/paper/2505.04040/integrity","json":"/paper/2505.04040/citation-record.json","paper":"/paper/2505.04040"},"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-15T23:40:47.358433Z","title":"Java quality assurance by det ecting code smells,","venue":null,"work_id":"46f305db-6667-4ad6-8a70-341f22f89d00","year":null},"citing_paper":{"arxiv_id":"2505.04040","last_updated":"2025-05-07T00:44:32Z","snapshot_observed_at":"2026-08-22T05:48:03.857469Z","submitted_at":"2025-05-07T00:44:32Z","title":"Identification and Optimization of Redundant Code Using Large Language Models","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-15T23:40:46.929823Z"},"links":{"citing_paper":"/paper/2505.04040"},"observation_digest":"sha256:20ff6927204d844cdf78763de1cac07df97e39e4f6bd99105de3fb7632ba4e52","observation_id":"60f49a3f-d5bb-4e50-b136-d1f3a311a0eb","resolution":{"observed_at":"2026-08-15T23:40:47.362007Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T23:40:47.337401Z","title":"Structural quality me trics as indicators of the long method bad smell: An empirical study,","venue":null,"work_id":"ab820e2f-8c3f-41df-ae69-ac4fc6aee83f","year":2018},"citing_paper":{"arxiv_id":"2505.04040","last_updated":"2025-05-07T00:44:32Z","snapshot_observed_at":"2026-08-22T05:48:03.857469Z","submitted_at":"2025-05-07T00:44:32Z","title":"Identification and Optimization of Redundant Code Using Large Language Models","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-15T23:40:46.937345Z"},"links":{"citing_paper":"/paper/2505.04040"},"observation_digest":"sha256:4e30b13712c4d2590714ecb40e1ea3377e8cca19b78d2c0121dcda271ec39fa9","observation_id":"b070fb1f-88ce-49e6-bb3c-62740b08b5ac","resolution":{"observed_at":"2026-08-15T23:40:47.341278Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T23:40:47.326464Z","title":"An optimization method of javascript redundant code elimination based on hybrid analysis technique,","venue":null,"work_id":"9ce65811-6502-41a5-aafd-07a2295b4da7","year":2020},"citing_paper":{"arxiv_id":"2505.04040","last_updated":"2025-05-07T00:44:32Z","snapshot_observed_at":"2026-08-22T05:48:03.857469Z","submitted_at":"2025-05-07T00:44:32Z","title":"Identification and Optimization of Redundant Code Using Large Language Models","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-15T23:40:46.940857Z"},"links":{"citing_paper":"/paper/2505.04040"},"observation_digest":"sha256:9f8ad5ae9a5ca9ac840cc29c85a6e7966248e46d21a158bbab1638b1e317e305","observation_id":"cf83d75f-53d7-4c6a-ba76-3f36539d011e","resolution":{"observed_at":"2026-08-15T23:40:47.330907Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T23:40:47.313617Z","title":"The hidde n cost of backward compatibility: when deprecation turns into techn ical debt-an experience report,","venue":null,"work_id":"aa18113e-20d1-4b54-be8c-228e57a60b5f","year":2020},"citing_paper":{"arxiv_id":"2505.04040","last_updated":"2025-05-07T00:44:32Z","snapshot_observed_at":"2026-08-22T05:48:03.857469Z","submitted_at":"2025-05-07T00:44:32Z","title":"Identification and Optimization of Redundant Code Using Large Language Models","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-15T23:40:46.944404Z"},"links":{"citing_paper":"/paper/2505.04040"},"observation_digest":"sha256:50a74b6f72abad46dde53ebd32d11d953e2bcc4368facb8465c2b96dea005749","observation_id":"04621e61-baa9-4c30-97ef-ab9d276b877c","resolution":{"observed_at":"2026-08-15T23:40:47.317685Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T23:40:47.301799Z","title":"Towards a mapping of software technical debt onto testware,","venue":null,"work_id":"fdcb77b0-a3e2-484e-a655-a4eabdf19989","year":2017},"citing_paper":{"arxiv_id":"2505.04040","last_updated":"2025-05-07T00:44:32Z","snapshot_observed_at":"2026-08-22T05:48:03.857469Z","submitted_at":"2025-05-07T00:44:32Z","title":"Identification and Optimization of Redundant Code Using Large Language Models","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-15T23:40:46.948230Z"},"links":{"citing_paper":"/paper/2505.04040"},"observation_digest":"sha256:059a0d8eb1952f2729a1f59ff45e96d408008c14f9155ccabab0364c07cacff1","observation_id":"74b1cabf-d1b0-43b9-855e-96992c5ecbfc","resolution":{"observed_at":"2026-08-15T23:40:47.305941Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T23:40:47.285023Z","title":"Dead code removal at meta: Automatically deleting million s of lines of code and petabytes of deprecated data,","venue":null,"work_id":"15745bab-ada9-4a21-93f3-d7e2869352ca","year":2023},"citing_paper":{"arxiv_id":"2505.04040","last_updated":"2025-05-07T00:44:32Z","snapshot_observed_at":"2026-08-22T05:48:03.857469Z","submitted_at":"2025-05-07T00:44:32Z","title":"Identification and Optimization of Redundant Code Using Large Language Models","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-15T23:40:46.951745Z"},"links":{"citing_paper":"/paper/2505.04040"},"observation_digest":"sha256:11471d13c9f521f513227ed88cfaa2051cc00f5a73ff6e29256428a320737c2a","observation_id":"52c1f77a-d9e0-41db-8275-ee8154697c45","resolution":{"observed_at":"2026-08-15T23:40:47.289501Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T23:40:47.274333Z","title":"A multi- study investigation into dead code,","venue":null,"work_id":"5db48f32-6cd6-4ba9-b870-9fdfdd0f2023","year":2018},"citing_paper":{"arxiv_id":"2505.04040","last_updated":"2025-05-07T00:44:32Z","snapshot_observed_at":"2026-08-22T05:48:03.857469Z","submitted_at":"2025-05-07T00:44:32Z","title":"Identification and Optimization of Redundant Code Using Large Language Models","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-15T23:40:46.955022Z"},"links":{"citing_paper":"/paper/2505.04040"},"observation_digest":"sha256:d855132e911a87fe8155ded7fd673052fb1b2e3b279a57faf677e75b336e62c8","observation_id":"e47994ad-db74-420a-96b1-0a592a8a1dc6","resolution":{"observed_at":"2026-08-15T23:40:47.277944Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T23:40:47.263872Z","title":"Javascript dead code identifica tion, elim- ination, and empirical assessment,","venue":null,"work_id":"f94c8ab2-6e9a-4f3d-862d-fd3696d2760b","year":2023},"citing_paper":{"arxiv_id":"2505.04040","last_updated":"2025-05-07T00:44:32Z","snapshot_observed_at":"2026-08-22T05:48:03.857469Z","submitted_at":"2025-05-07T00:44:32Z","title":"Identification and Optimization of Redundant Code Using Large Language Models","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-15T23:40:46.958162Z"},"links":{"citing_paper":"/paper/2505.04040"},"observation_digest":"sha256:4afd319ae3cfc49e1ea3dbb645aa4ed06b1cdac3901d05c294ea392c8b80fe5f","observation_id":"224a025b-4822-480a-9319-9dcf94a465f4","resolution":{"observed_at":"2026-08-15T23:40:47.267450Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T23:40:47.253117Z","title":"Rc-fi nder: Redundancy detection for large scale source code,","venue":null,"work_id":"b9b79e44-269c-4ec7-8c05-7d5e802e7317","year":2012},"citing_paper":{"arxiv_id":"2505.04040","last_updated":"2025-05-07T00:44:32Z","snapshot_observed_at":"2026-08-22T05:48:03.857469Z","submitted_at":"2025-05-07T00:44:32Z","title":"Identification and Optimization of Redundant Code Using Large Language Models","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-15T23:40:46.961118Z"},"links":{"citing_paper":"/paper/2505.04040"},"observation_digest":"sha256:709a7ac5f1cc2ffdec3fc0ea84ea7d8d2d5346cc99561bb1baa4a7ec2e8e6553","observation_id":"9c879b29-8f5d-4ced-8b44-8b69d5ac2866","resolution":{"observed_at":"2026-08-15T23:40:47.256793Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T23:40:47.242025Z","title":"An exploratory study of functional redundancy in code repo sitories,","venue":null,"work_id":"5d8a0d7a-2936-4c8b-9248-64851c9c54d7","year":2017},"citing_paper":{"arxiv_id":"2505.04040","last_updated":"2025-05-07T00:44:32Z","snapshot_observed_at":"2026-08-22T05:48:03.857469Z","submitted_at":"2025-05-07T00:44:32Z","title":"Identification and Optimization of Redundant Code Using Large Language Models","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-15T23:40:46.964145Z"},"links":{"citing_paper":"/paper/2505.04040"},"observation_digest":"sha256:614316921e2987bf6437e498438085144f68973b0a8b32f1d3dd97ed64707050","observation_id":"b1a680ad-a062-465b-90a1-ad948a7e0190","resolution":{"observed_at":"2026-08-15T23:40:47.245922Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T23:40:47.229732Z","title":"Inve stigating student reasoning in method-level code refactoring: A think-aloud study,","venue":null,"work_id":"eee67aa7-75ad-4e85-87a1-734836c06355","year":2024},"citing_paper":{"arxiv_id":"2505.04040","last_updated":"2025-05-07T00:44:32Z","snapshot_observed_at":"2026-08-22T05:48:03.857469Z","submitted_at":"2025-05-07T00:44:32Z","title":"Identification and Optimization of Redundant Code Using Large Language Models","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-15T23:40:46.967277Z"},"links":{"citing_paper":"/paper/2505.04040"},"observation_digest":"sha256:ba79121db972a79113989becd3adb2aad046d62b88fe66ef349461ad9c079d1e","observation_id":"5e3d4a52-23ca-4ed6-a6d1-777a543de46c","resolution":{"observed_at":"2026-08-15T23:40:47.233601Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T23:40:47.218929Z","title":"Dead code,","venue":null,"work_id":"2cc3deab-29a4-4879-979f-583b87812558","year":2018},"citing_paper":{"arxiv_id":"2505.04040","last_updated":"2025-05-07T00:44:32Z","snapshot_observed_at":"2026-08-22T05:48:03.857469Z","submitted_at":"2025-05-07T00:44:32Z","title":"Identification and Optimization of Redundant Code Using Large Language Models","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-15T23:40:46.970391Z"},"links":{"citing_paper":"/paper/2505.04040"},"observation_digest":"sha256:9d7271c6d56f1d31077795ecbb469189ba4cf2f79bbb5b946044f0c4842cdbc1","observation_id":"45776ea1-d853-44f0-9dc5-09c9bdb4a073","resolution":{"observed_at":"2026-08-15T23:40:47.222327Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T23:40:47.207896Z","title":"Cost-effective, energy-efficient, and scalable storage computing for large-scale ai applications,","venue":null,"work_id":"45b2227f-9916-473e-9a57-73f037af8b0e","year":2020},"citing_paper":{"arxiv_id":"2505.04040","last_updated":"2025-05-07T00:44:32Z","snapshot_observed_at":"2026-08-22T05:48:03.857469Z","submitted_at":"2025-05-07T00:44:32Z","title":"Identification and Optimization of Redundant Code Using Large Language Models","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-15T23:40:46.973851Z"},"links":{"citing_paper":"/paper/2505.04040"},"observation_digest":"sha256:c00a9696a67219186574520e6de6b99ab92f53f0c6b7390d0a6539b86990d7be","observation_id":"91d9ce4e-6a44-4690-93e9-2299b4498eb4","resolution":{"observed_at":"2026-08-15T23:40:47.211815Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T23:40:47.195491Z","title":"Attacks and defenses for large language mode ls on coding tasks,","venue":null,"work_id":"95eae7c4-bca1-4131-a4c5-09a35ee377e9","year":2024},"citing_paper":{"arxiv_id":"2505.04040","last_updated":"2025-05-07T00:44:32Z","snapshot_observed_at":"2026-08-22T05:48:03.857469Z","submitted_at":"2025-05-07T00:44:32Z","title":"Identification and Optimization of Redundant Code Using Large Language Models","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-15T23:40:46.976995Z"},"links":{"citing_paper":"/paper/2505.04040"},"observation_digest":"sha256:9fcfca120bc24f47c6499e38b6fead0a9de41fd71f918fb275576554366b61d9","observation_id":"6bdbbcfa-8a89-4bc4-827a-5562dad6b184","resolution":{"observed_at":"2026-08-15T23:40:47.199462Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.13291","last_updated":"2024-02-23T17:26:06Z","snapshot_observed_at":"2026-08-22T05:47:18.928542Z","submitted_at":"2024-02-19T18:35:40Z","title":"DeepCode AI Fix: Fixing Security Vulnerabilities with Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.13291","snapshot_observed_at":"2026-08-15T23:40:46.980146Z","title":"Deepcode ai fix: Fixing security vulnerabilitie s with large language models,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.04040","last_updated":"2025-05-07T00:44:32Z","snapshot_observed_at":"2026-08-22T05:48:03.857469Z","submitted_at":"2025-05-07T00:44:32Z","title":"Identification and Optimization of Redundant Code Using Large Language Models","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-15T23:40:46.980146Z"},"links":{"cited_paper":"/paper/2402.13291","citing_paper":"/paper/2505.04040"},"observation_digest":"sha256:53ed3b26b491b609c25c0c8c97a278f66dd2a385d714ad63894bd4b5593533d9","observation_id":"5cde4a76-bd04-4445-9b90-133c21d986fa","resolution":{"observed_at":"2026-08-15T23:40:46.980146Z","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-15T23:40:47.183990Z","title":"Llm-based control code ge neration using image recognition,","venue":null,"work_id":"18de0461-bab9-442b-9abf-d547b51f1b99","year":2024},"citing_paper":{"arxiv_id":"2505.04040","last_updated":"2025-05-07T00:44:32Z","snapshot_observed_at":"2026-08-22T05:48:03.857469Z","submitted_at":"2025-05-07T00:44:32Z","title":"Identification and Optimization of Redundant Code Using Large Language Models","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-15T23:40:46.983796Z"},"links":{"citing_paper":"/paper/2505.04040"},"observation_digest":"sha256:b00a8db16173bb0c653e31cc0d012a0d00ae29fe162170260034710060efdc1e","observation_id":"6c31b04e-b45b-41ec-a891-08b02ccf212a","resolution":{"observed_at":"2026-08-15T23:40:47.187607Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T23:40:47.173236Z","title":"Exploring factors and metrics to select open source software components for integ ration: An empirical study,","venue":null,"work_id":"5e1065b9-da6a-4611-831f-e80620afd53e","year":2022},"citing_paper":{"arxiv_id":"2505.04040","last_updated":"2025-05-07T00:44:32Z","snapshot_observed_at":"2026-08-22T05:48:03.857469Z","submitted_at":"2025-05-07T00:44:32Z","title":"Identification and Optimization of Redundant Code Using Large Language Models","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-15T23:40:46.987756Z"},"links":{"citing_paper":"/paper/2505.04040"},"observation_digest":"sha256:5fde84619855d908180adeb95c2a4a9239394e05964e5164faf0a2f4078089a2","observation_id":"ca182ed1-24df-491d-949f-5857ca70b7d4","resolution":{"observed_at":"2026-08-15T23:40:47.177248Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2303.08774","last_updated":"2024-03-04T06:01:33Z","snapshot_observed_at":"2026-08-17T09:58:46.058102Z","submitted_at":"2023-03-15T17:15:04Z","title":"GPT-4 Technical Report","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.08774","snapshot_observed_at":"2026-08-15T23:40:46.991155Z","title":"Gpt-4 technical report,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.04040","last_updated":"2025-05-07T00:44:32Z","snapshot_observed_at":"2026-08-22T05:48:03.857469Z","submitted_at":"2025-05-07T00:44:32Z","title":"Identification and Optimization of Redundant Code Using Large Language Models","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-15T23:40:46.991155Z"},"links":{"cited_paper":"/paper/2303.08774","citing_paper":"/paper/2505.04040"},"observation_digest":"sha256:98d3088f153021960a4d918c2d42ac0009ef6a3bb2f84bf24540318c1057fc76","observation_id":"db291b26-1265-42e9-b452-cb4addbea5eb","resolution":{"observed_at":"2026-08-15T23:40:46.991155Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2312.11805","last_updated":"2025-05-09T21:04:06Z","snapshot_observed_at":"2026-08-20T18:27:04.837880Z","submitted_at":"2023-12-19T02:39:27Z","title":"Gemini: A Family of Highly Capable Multimodal Models","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.11805","snapshot_observed_at":"2026-08-15T23:40:46.994505Z","title":"Gemini: a family of highly capable multimodal models,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.04040","last_updated":"2025-05-07T00:44:32Z","snapshot_observed_at":"2026-08-22T05:48:03.857469Z","submitted_at":"2025-05-07T00:44:32Z","title":"Identification and Optimization of Redundant Code Using Large Language Models","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-15T23:40:46.994505Z"},"links":{"cited_paper":"/paper/2312.11805","citing_paper":"/paper/2505.04040"},"observation_digest":"sha256:dbd69eca3b73bae75382cda5497afec71388b8df73d880cacef33d9314718f6c","observation_id":"5700458e-b435-446e-a926-3c8b005438ca","resolution":{"observed_at":"2026-08-15T23:40:46.994505Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2302.13971","last_updated":"2023-02-27T17:11:15Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-02-27T17:11:15Z","title":"LLaMA: Open and Efficient Foundation Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.13971","snapshot_observed_at":"2026-08-15T23:40:46.998120Z","title":"Llama: Open and efficient foundation language models,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.04040","last_updated":"2025-05-07T00:44:32Z","snapshot_observed_at":"2026-08-22T05:48:03.857469Z","submitted_at":"2025-05-07T00:44:32Z","title":"Identification and Optimization of Redundant Code Using Large Language Models","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-15T23:40:46.998120Z"},"links":{"cited_paper":"/paper/2302.13971","citing_paper":"/paper/2505.04040"},"observation_digest":"sha256:bd73aa64b6fd4eabe4f25aa7c03ef2bb185416148aeda7785516c9eea76265db","observation_id":"d9e95c53-acd8-4e1c-a2f2-adb3770c5b14","resolution":{"observed_at":"2026-08-15T23:40:46.998120Z","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-15T23:40:47.161558Z","title":"Using a line of code metric to understand s oftware rework,","venue":null,"work_id":"af05cbc8-12d4-4e9f-b331-cca4a063c60f","year":2009},"citing_paper":{"arxiv_id":"2505.04040","last_updated":"2025-05-07T00:44:32Z","snapshot_observed_at":"2026-08-22T05:48:03.857469Z","submitted_at":"2025-05-07T00:44:32Z","title":"Identification and Optimization of Redundant Code Using Large Language Models","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-15T23:40:47.002063Z"},"links":{"citing_paper":"/paper/2505.04040"},"observation_digest":"sha256:fa36cfa76688107301f8e3a0895bf80cab1ec4dcf7a5a13966112320757251e4","observation_id":"c16b6a38-3500-4f1e-a9d3-2d66d22190cd","resolution":{"observed_at":"2026-08-15T23:40:47.165262Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T23:40:47.150452Z","title":"Cyclomatic complexity,","venue":null,"work_id":"ce2c93b3-a394-4602-bd7c-376c73bdb582","year":2016},"citing_paper":{"arxiv_id":"2505.04040","last_updated":"2025-05-07T00:44:32Z","snapshot_observed_at":"2026-08-22T05:48:03.857469Z","submitted_at":"2025-05-07T00:44:32Z","title":"Identification and Optimization of Redundant Code Using Large Language Models","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-15T23:40:47.005998Z"},"links":{"citing_paper":"/paper/2505.04040"},"observation_digest":"sha256:5436bb2a692047b1aedd19f7d235133debc3d91a993b52c498e551f737407c1a","observation_id":"f4be2149-4af3-4eec-84b1-b3b66a2fa01b","resolution":{"observed_at":"2026-08-15T23:40:47.153804Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T23:40:47.138155Z","title":"Eva luating complexity, code churn, and developer activity metrics as i ndicators of software vulnerabilities,","venue":null,"work_id":"c5477e31-018e-4ade-a0ef-e2c77e4a39c3","year":2010},"citing_paper":{"arxiv_id":"2505.04040","last_updated":"2025-05-07T00:44:32Z","snapshot_observed_at":"2026-08-22T05:48:03.857469Z","submitted_at":"2025-05-07T00:44:32Z","title":"Identification and Optimization of Redundant Code Using Large Language Models","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-15T23:40:47.010505Z"},"links":{"citing_paper":"/paper/2505.04040"},"observation_digest":"sha256:0037ba6cf9d553fb91b58fa26083bb0b663e749d660a0a9b2b800e686742753f","observation_id":"5e86a0db-4e70-4946-bdb3-e362c41f3796","resolution":{"observed_at":"2026-08-15T23:40:47.142842Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T23:40:47.124880Z","title":"Developmen t and application of an automated source code maintainability in dex,","venue":null,"work_id":"c338f806-ec6b-47b4-b4c0-25cb92ebebfb","year":1997},"citing_paper":{"arxiv_id":"2505.04040","last_updated":"2025-05-07T00:44:32Z","snapshot_observed_at":"2026-08-22T05:48:03.857469Z","submitted_at":"2025-05-07T00:44:32Z","title":"Identification and Optimization of Redundant Code Using Large Language Models","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-15T23:40:47.013802Z"},"links":{"citing_paper":"/paper/2505.04040"},"observation_digest":"sha256:c20f960b69e18b962f8b3559aa00244c8f460d9815a6a359b64ca9b1b1e02ba9","observation_id":"1d3eba65-e16f-42eb-b2b7-a72db374ae8a","resolution":{"observed_at":"2026-08-15T23:40:47.129462Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T23:40:47.110915Z","title":"The impa ct of coverage on bug density in a large industrial software proje ct,","venue":null,"work_id":"d9e560b7-75ec-4c81-bb85-37fac18d964c","year":2017},"citing_paper":{"arxiv_id":"2505.04040","last_updated":"2025-05-07T00:44:32Z","snapshot_observed_at":"2026-08-22T05:48:03.857469Z","submitted_at":"2025-05-07T00:44:32Z","title":"Identification and Optimization of Redundant Code Using Large Language Models","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-15T23:40:47.017133Z"},"links":{"citing_paper":"/paper/2505.04040"},"observation_digest":"sha256:0e53c19c976e443bf356b4f06b7cbbd75409e49a4834960c9abe204843b90d47","observation_id":"0766192c-9118-4640-8a0b-df21d357cdbf","resolution":{"observed_at":"2026-08-15T23:40:47.115474Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T23:40:47.093955Z","title":"Nasa-task load index (nasa-tlx); 20 years l ater,","venue":null,"work_id":"94b7d66f-8109-4c8e-835f-0aaccecc511e","year":null},"citing_paper":{"arxiv_id":"2505.04040","last_updated":"2025-05-07T00:44:32Z","snapshot_observed_at":"2026-08-22T05:48:03.857469Z","submitted_at":"2025-05-07T00:44:32Z","title":"Identification and Optimization of Redundant Code Using Large Language Models","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-15T23:40:47.020679Z"},"links":{"citing_paper":"/paper/2505.04040"},"observation_digest":"sha256:33a76e296211be653d34f4044bacc4fa31ec19975be07680ea1ac104aead0c29","observation_id":"a62a786f-2073-4ab9-ac48-7ce710deef42","resolution":{"observed_at":"2026-08-15T23:40:47.100419Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T23:40:47.347786Z","title":"IEEE, 2002, pp","venue":null,"work_id":"40f5c647-a480-4503-a5ef-3c0280e12368","year":2002},"citing_paper":{"arxiv_id":"2505.04040","last_updated":"2025-05-07T00:44:32Z","snapshot_observed_at":"2026-08-22T05:48:03.857469Z","submitted_at":"2025-05-07T00:44:32Z","title":"Identification and Optimization of Redundant Code Using Large Language Models","version":1},"reference_index":2002,"source":"pdf_text","source_observed_at":"2026-08-15T23:40:46.933921Z"},"links":{"citing_paper":"/paper/2505.04040"},"observation_digest":"sha256:2786555553c1b191d49e45dbb5cb517d7ec0d3bf2becbc5b08a9b5c9c82be244","observation_id":"e2b20639-85a3-40b4-94cf-a95d1b1e1384","resolution":{"observed_at":"2026-08-15T23:40:47.351250Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2505.04040","last_updated":"2025-05-07T00:44:32Z","latest_version":1,"primary_category":"cs.SE","snapshot_observed_at":"2026-08-22T05:48:03.857469Z","submitted_at":"2025-05-07T00:44:32Z","title":"Identification and Optimization of Redundant Code Using Large Language Models"},"reference_resolution":{"displayed":27,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":4,"verified_exact":0,"verified_fuzzy":23},"total_outbound_references":27},"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-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"thesis":"As of 23 August 2026, this Paper Citation Record lists 27 of 27 outbound references and 0 inbound Pith citation observations for arXiv:2505.04040."}