{"as_of":"2026-08-19T23:57:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f933e5f477cbe79435b9fddc08b1c7d81c7803ac866a0320616d7f6f9c6daf48","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T10:53:18.503322Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-04T04:59:36.944724Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2503.15838","last_updated":"2025-07-18T23:27:01Z","snapshot_observed_at":"2026-08-16T12:48:24.609419Z","submitted_at":"2025-03-20T04:38:56Z","title":"Enhancing LLM Code Generation with Ensembles: A Similarity-Based Selection Approach","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.15838","snapshot_observed_at":"2026-08-06T10:53:18.503322Z","title":"Mahmud, B","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.23370","last_updated":"2025-07-31T09:37:22Z","snapshot_observed_at":"2026-08-17T14:31:14.268621Z","submitted_at":"2025-07-31T09:37:22Z","title":"Trae Agent: An LLM-based Agent for Software Engineering with Test-time Scaling","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-06T10:53:18.503322Z"},"links":{"cited_paper":"/paper/2503.15838","citing_paper":"/paper/2507.23370"},"observation_digest":"sha256:693af317d00bee269ddb98ab80a98f7a31dbd8f1b0532db95c3bb75aa0861fb3","observation_id":"4a6db7b4-b800-4baa-96f0-e1d10d28fa58","resolution":{"observed_at":"2026-08-06T10:53:18.503322Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.15838","last_updated":"2025-07-18T23:27:01Z","snapshot_observed_at":"2026-08-16T12:48:24.609419Z","submitted_at":"2025-03-20T04:38:56Z","title":"Enhancing LLM Code Generation with Ensembles: A Similarity-Based Selection Approach","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.15838","snapshot_observed_at":"2026-08-03T08:22:13.672859Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2601.17471","last_updated":"2026-07-16T01:24:54Z","snapshot_observed_at":"2026-08-05T15:04:18.156198Z","submitted_at":"2026-01-24T14:19:10Z","title":"PatchIsland: Orchestration of LLM Agents for Continuous Vulnerability Repair","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-03T08:22:13.672859Z"},"links":{"cited_paper":"/paper/2503.15838","citing_paper":"/paper/2601.17471"},"observation_digest":"sha256:df68aed856a0c37dbbc836790011d43600c303104740e4d3f72fa29611744b0e","observation_id":"06a30251-9f00-4102-b712-832ff0c17638","resolution":{"observed_at":"2026-08-03T08:22:13.672859Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.15838","last_updated":"2025-07-18T23:27:01Z","snapshot_observed_at":"2026-08-16T12:48:24.609419Z","submitted_at":"2025-03-20T04:38:56Z","title":"Enhancing LLM Code Generation with Ensembles: A Similarity-Based Selection Approach","version":2},"cited_work":{"arxiv_id":"2503.15838","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2503.15838","snapshot_observed_at":"2026-07-04T04:59:36.944724Z","title":"P ˘as˘areanu, and Guowei Yang","venue":null,"work_id":"fe322bab-bc45-49d8-996a-0726a9eec3a5","year":2025},"citing_paper":{"arxiv_id":"2606.20158","last_updated":"2026-06-18T12:23:02Z","snapshot_observed_at":"2026-08-17T19:20:01.789729Z","submitted_at":"2026-06-18T12:23:02Z","title":"N-Version Programming with Coding Agents","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-06-26T16:27:12.192595Z"},"links":{"cited_paper":"/paper/2503.15838","citing_paper":"/paper/2606.20158"},"observation_digest":"sha256:a91f0288666fad2572578a4c2222a322976fa575eb8e9506819bac5f3460319e","observation_id":"deb5f61d-81d5-47a8-a201-d135719a6085","resolution":{"observed_at":"2026-07-04T04:59:36.946438Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2503.15838","last_updated":"2025-07-18T23:27:01Z","snapshot_observed_at":"2026-08-16T12:48:24.609419Z","submitted_at":"2025-03-20T04:38:56Z","title":"Enhancing LLM Code Generation with Ensembles: A Similarity-Based Selection Approach","version":2},"cited_work":{"arxiv_id":"2503.15838","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2503.15838","snapshot_observed_at":"2026-07-04T04:59:36.944724Z","title":"P ˘as˘areanu, and Guowei Yang","venue":null,"work_id":"fe322bab-bc45-49d8-996a-0726a9eec3a5","year":2025},"citing_paper":{"arxiv_id":"2606.20835","last_updated":"2026-06-18T18:21:38Z","snapshot_observed_at":"2026-08-16T16:01:31.573835Z","submitted_at":"2026-06-18T18:21:38Z","title":"PromptMark: A Prompt-Guided Iterative-Feedback Framework for Source Code Watermarking","version":1},"reference_index":63,"source":"arxiv_source","source_observed_at":"2026-06-26T16:44:20.076739Z"},"links":{"cited_paper":"/paper/2503.15838","citing_paper":"/paper/2606.20835"},"observation_digest":"sha256:ce04905a295724009613387c4f25decaed11557c64efbb7baa4241eb2db7304e","observation_id":"7c105769-199c-4b61-bca6-b5be16b41c79","resolution":{"observed_at":"2026-07-04T04:49:35.425963Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2503.15838/citation-record","integrity":"/paper/2503.15838/integrity","json":"/paper/2503.15838/citation-record.json","paper":"/paper/2503.15838"},"outbound":[],"paper":{"arxiv_id":"2503.15838","last_updated":"2025-07-18T23:27:01Z","latest_version":2,"primary_category":"cs.SE","snapshot_observed_at":"2026-08-16T12:48:24.609419Z","submitted_at":"2025-03-20T04:38:56Z","title":"Enhancing LLM Code Generation with Ensembles: A Similarity-Based Selection Approach"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:2503.15838."}