{"as_of":"2026-08-10T09:54:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ead21f7f9b279d7dabcca88285f18e616b0a2170063841b5d0a99ea76e564b87","coverage":[{"denominator":66,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":66,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T22:05:10.701454Z","state":"measured"},{"denominator":70,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":70,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+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-07-12T11:49:34.865484Z","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-04T14:39:57.838547Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2506.22776","last_updated":"2025-06-28T06:32:25Z","snapshot_observed_at":"2026-08-09T13:44:37.089885Z","submitted_at":"2025-06-28T06:32:25Z","title":"Smaller = Weaker? Benchmarking Robustness of Quantized LLMs in Code Generation","version":1},"cited_work":{"arxiv_id":"2506.22776","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.22776","snapshot_observed_at":"2026-07-04T14:39:57.838547Z","title":"Smaller = weaker? bench- marking robustness of quantized llms in code generation.CoRR, abs/2506.22776, 2025","venue":null,"work_id":"db110b30-2c52-4faa-a1f0-7f4326cd41a9","year":2025},"citing_paper":{"arxiv_id":"2603.29813","last_updated":"2026-06-24T12:09:03Z","snapshot_observed_at":"2026-08-07T20:31:27.965876Z","submitted_at":"2026-03-31T14:40:19Z","title":"Compiling Code LLMs into Lightweight Executables","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-13T23:26:03.943399Z"},"links":{"cited_paper":"/paper/2506.22776","citing_paper":"/paper/2603.29813"},"observation_digest":"sha256:f509a6165c34b07743fbd956fbc1152493e2cbdda8f50a7be2705ed1724e24ac","observation_id":"ce6ef429-1370-40ab-9e62-0d888fb80044","resolution":{"observed_at":"2026-05-13T23:28:26.169974Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.22776","last_updated":"2025-06-28T06:32:25Z","snapshot_observed_at":"2026-08-09T13:44:37.089885Z","submitted_at":"2025-06-28T06:32:25Z","title":"Smaller = Weaker? Benchmarking Robustness of Quantized LLMs in Code Generation","version":1},"cited_work":{"arxiv_id":"2506.22776","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.22776","snapshot_observed_at":"2026-07-04T14:39:57.838547Z","title":"Smaller = weaker? bench- marking robustness of quantized llms in code generation.CoRR, abs/2506.22776, 2025","venue":null,"work_id":"db110b30-2c52-4faa-a1f0-7f4326cd41a9","year":2025},"citing_paper":{"arxiv_id":"2606.19535","last_updated":"2026-06-17T19:28:30Z","snapshot_observed_at":"2026-08-08T21:30:12.811889Z","submitted_at":"2026-06-17T19:28:30Z","title":"FloatDoor: Platform-Triggered Backdoors in LLMs","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-06-26T20:10:50.750555Z"},"links":{"cited_paper":"/paper/2506.22776","citing_paper":"/paper/2606.19535"},"observation_digest":"sha256:851026aa9b223fe1d278f5d077b8ea69fd70c9acff32c0f5beb06eaf1027bf40","observation_id":"8895ba49-6b5f-49c5-b916-a8551de1f54e","resolution":{"observed_at":"2026-07-04T01:49:22.462882Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.22776","last_updated":"2025-06-28T06:32:25Z","snapshot_observed_at":"2026-08-09T13:44:37.089885Z","submitted_at":"2025-06-28T06:32:25Z","title":"Smaller = Weaker? Benchmarking Robustness of Quantized LLMs in Code Generation","version":1},"cited_work":{"arxiv_id":"2506.22776","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.22776","snapshot_observed_at":"2026-07-04T14:39:57.838547Z","title":"Smaller = weaker? bench- marking robustness of quantized llms in code generation.CoRR, abs/2506.22776, 2025","venue":null,"work_id":"db110b30-2c52-4faa-a1f0-7f4326cd41a9","year":2025},"citing_paper":{"arxiv_id":"2606.27205","last_updated":"2026-07-03T12:47:47Z","snapshot_observed_at":"2026-08-09T13:41:50.552485Z","submitted_at":"2026-06-25T16:02:05Z","title":"Smaller Models, Unexpected Costs: Trade-offs in LLM Quantization for Automated Program Repair","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-06-26T03:10:37.068739Z"},"links":{"cited_paper":"/paper/2506.22776","citing_paper":"/paper/2606.27205"},"observation_digest":"sha256:ce530db7d39e8ef3337e4955365c20943ef4c47fb94b1cd269928fed82569fe9","observation_id":"fc5e7fbb-2ffa-4807-ae5d-354b9c3b20dc","resolution":{"observed_at":"2026-07-04T14:39:57.840214Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.22776","last_updated":"2025-06-28T06:32:25Z","snapshot_observed_at":"2026-08-09T13:44:37.089885Z","submitted_at":"2025-06-28T06:32:25Z","title":"Smaller = Weaker? Benchmarking Robustness of Quantized LLMs in Code Generation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.22776","snapshot_observed_at":"2026-07-12T11:49:34.865484Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.27205","last_updated":"2026-07-03T12:47:47Z","snapshot_observed_at":"2026-08-09T13:41:50.552485Z","submitted_at":"2026-06-25T16:02:05Z","title":"Smaller Models, Unexpected Costs: Trade-offs in LLM Quantization for Automated Program Repair","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-07-12T11:49:34.865484Z"},"links":{"cited_paper":"/paper/2506.22776","citing_paper":"/paper/2606.27205"},"observation_digest":"sha256:fcda619db6b0384d108dffb65db3e8c1f59207392a39a7873e7c3f03deafa1a6","observation_id":"9b93b6ac-6e5a-4fb3-8568-caf7eef7146c","resolution":{"observed_at":"2026-07-12T11:49:34.865484Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2506.22776/citation-record","integrity":"/paper/2506.22776/integrity","json":"/paper/2506.22776/citation-record.json","paper":"/paper/2506.22776"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"1806.08342","last_updated":"2018-06-21T17:32:46Z","snapshot_observed_at":"2026-07-06T06:46:08.396066Z","submitted_at":"2018-06-21T17:32:46Z","title":"Quantizing deep convolutional networks for efficient inference: A whitepaper","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1806.08342","snapshot_observed_at":"2026-08-06T22:05:05.398345Z","title":"Quantizing deep convolutional net- works for efficient inference: A whitepaper,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2506.22776","last_updated":"2025-06-28T06:32:25Z","snapshot_observed_at":"2026-08-09T13:44:37.089885Z","submitted_at":"2025-06-28T06:32:25Z","title":"Smaller = Weaker? Benchmarking Robustness of Quantized LLMs in Code Generation","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T22:05:05.398345Z"},"links":{"cited_paper":"/paper/1806.08342","citing_paper":"/paper/2506.22776"},"observation_digest":"sha256:7b8eb24a2fe2e7d34ffbbf7a035739df5cc4fd7c93f0b33dfb72994296889038","observation_id":"d3d36378-1c57-4eb3-9191-e5d9b498ff92","resolution":{"observed_at":"2026-08-06T22:05:05.398345Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:05:05.451757Z","title":"Pruning and quantization for deep neural network accel- eration: A survey,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.22776","last_updated":"2025-06-28T06:32:25Z","snapshot_observed_at":"2026-08-09T13:44:37.089885Z","submitted_at":"2025-06-28T06:32:25Z","title":"Smaller = Weaker? Benchmarking Robustness of Quantized LLMs in Code Generation","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T22:05:05.451757Z"},"links":{"citing_paper":"/paper/2506.22776"},"observation_digest":"sha256:c18dd96dea294c0290cbfc16156b5232350017b5db34054794bbe3de644e0a3f","observation_id":"b54f029e-0d28-4cbc-ae19-28cbfe76c4aa","resolution":{"observed_at":"2026-08-06T22:05:05.451757Z","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-06T22:05:20.674360Z","title":"A survey of quantization methods for efficient neural network inference,","venue":null,"work_id":"2c1bcc7f-bb7f-4b74-89c5-bcd608bf29a3","year":2022},"citing_paper":{"arxiv_id":"2506.22776","last_updated":"2025-06-28T06:32:25Z","snapshot_observed_at":"2026-08-09T13:44:37.089885Z","submitted_at":"2025-06-28T06:32:25Z","title":"Smaller = Weaker? Benchmarking Robustness of Quantized LLMs in Code Generation","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T22:05:05.511131Z"},"links":{"citing_paper":"/paper/2506.22776"},"observation_digest":"sha256:c5517ce85b536a25698ecc3f1af982b436cb0d61637b13e16e4c5bd748397d27","observation_id":"bee7734c-a282-4027-9a09-8b72787b530e","resolution":{"observed_at":"2026-08-06T22:05:20.759582Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T22:05:20.479859Z","title":"A systematic literature review on the use of deep learning in software engineering research,","venue":null,"work_id":"2c6ab062-df80-4fd5-be5f-e0b863345f70","year":2022},"citing_paper":{"arxiv_id":"2506.22776","last_updated":"2025-06-28T06:32:25Z","snapshot_observed_at":"2026-08-09T13:44:37.089885Z","submitted_at":"2025-06-28T06:32:25Z","title":"Smaller = Weaker? Benchmarking Robustness of Quantized LLMs in Code Generation","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T22:05:05.601890Z"},"links":{"citing_paper":"/paper/2506.22776"},"observation_digest":"sha256:0fa88f01b78c7b6c053341f8aa5f630072707e24e83831986cb3303985516b45","observation_id":"fe4da36b-c8ff-49f4-9336-3dd98e94b4c8","resolution":{"observed_at":"2026-08-06T22:05:20.575157Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T22:05:20.304807Z","title":"Large language models for software engineering: A systematic literature review,","venue":null,"work_id":"20dd6f4a-200b-4f63-b8e9-9b5254f65d41","year":2024},"citing_paper":{"arxiv_id":"2506.22776","last_updated":"2025-06-28T06:32:25Z","snapshot_observed_at":"2026-08-09T13:44:37.089885Z","submitted_at":"2025-06-28T06:32:25Z","title":"Smaller = Weaker? Benchmarking Robustness of Quantized LLMs in Code Generation","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T22:05:05.697225Z"},"links":{"citing_paper":"/paper/2506.22776"},"observation_digest":"sha256:f237a7950b08fa5a0c9e2c27ff4e67c717c2b63534b19ce718fdff5426462cef","observation_id":"3f9374aa-58da-4646-a480-b7470b973557","resolution":{"observed_at":"2026-08-06T22:05:20.407549Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T22:05:20.110853Z","title":"Deepseek coder 1.3b base bnb 4bit,","venue":null,"work_id":"68c3a459-3e80-41aa-838c-2c58f6d43723","year":2023},"citing_paper":{"arxiv_id":"2506.22776","last_updated":"2025-06-28T06:32:25Z","snapshot_observed_at":"2026-08-09T13:44:37.089885Z","submitted_at":"2025-06-28T06:32:25Z","title":"Smaller = Weaker? Benchmarking Robustness of Quantized LLMs in Code Generation","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T22:05:05.765656Z"},"links":{"citing_paper":"/paper/2506.22776"},"observation_digest":"sha256:0426075433a18aaebc7c01cd06bb58f1e763f94b787b79210c2e19403893b8c5","observation_id":"df71bf72-027c-47e0-9b4b-068119a7ed4d","resolution":{"observed_at":"2026-08-06T22:05:20.181256Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T22:05:19.976672Z","title":"Meta-llama-3.1-8b bnb 4bit,","venue":null,"work_id":"320a3774-3949-446c-9427-efc813805af8","year":2023},"citing_paper":{"arxiv_id":"2506.22776","last_updated":"2025-06-28T06:32:25Z","snapshot_observed_at":"2026-08-09T13:44:37.089885Z","submitted_at":"2025-06-28T06:32:25Z","title":"Smaller = Weaker? Benchmarking Robustness of Quantized LLMs in Code Generation","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T22:05:05.845372Z"},"links":{"citing_paper":"/paper/2506.22776"},"observation_digest":"sha256:ee2da40c8ee4871e1bb2ce54c6babf40c05cd4503f63e46506e5658e1ae5c394","observation_id":"a2e037cf-fea6-42c2-9be9-a22a85bcd0c7","resolution":{"observed_at":"2026-08-06T22:05:20.039586Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1503.02531","last_updated":"2015-03-09T15:44:49Z","snapshot_observed_at":"2026-07-06T04:11:24.157003Z","submitted_at":"2015-03-09T15:44:49Z","title":"Distilling the Knowledge in a Neural Network","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1503.02531","snapshot_observed_at":"2026-08-06T22:05:05.905484Z","title":"Distilling the knowledge in a neural network,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2506.22776","last_updated":"2025-06-28T06:32:25Z","snapshot_observed_at":"2026-08-09T13:44:37.089885Z","submitted_at":"2025-06-28T06:32:25Z","title":"Smaller = Weaker? Benchmarking Robustness of Quantized LLMs in Code Generation","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T22:05:05.905484Z"},"links":{"cited_paper":"/paper/1503.02531","citing_paper":"/paper/2506.22776"},"observation_digest":"sha256:cf5f75690ff3167350babff6075269df9541b669406ceee02f6cb88b4c89360a","observation_id":"0f030ff3-c2d6-430a-9318-0cd5cd0b0df4","resolution":{"observed_at":"2026-08-06T22:05:05.905484Z","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-06T22:05:19.788491Z","title":"Knod: Domain knowledge distilled tree de- coder for automated program repair,","venue":null,"work_id":"9b5ba32a-4d0b-4e3c-86cc-91541462cca6","year":2023},"citing_paper":{"arxiv_id":"2506.22776","last_updated":"2025-06-28T06:32:25Z","snapshot_observed_at":"2026-08-09T13:44:37.089885Z","submitted_at":"2025-06-28T06:32:25Z","title":"Smaller = Weaker? Benchmarking Robustness of Quantized LLMs in Code Generation","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T22:05:05.964317Z"},"links":{"citing_paper":"/paper/2506.22776"},"observation_digest":"sha256:bd83aa29c6c5dc6a5556fc00fc85cd0426318776a183aa7848f60f80330d5658","observation_id":"4d578f59-e9a8-4b7b-bbf0-692e2128e461","resolution":{"observed_at":"2026-08-06T22:05:19.913253Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T22:05:19.657670Z","title":"Post-training quantization for vision trans- former,","venue":null,"work_id":"43aa494e-ada6-4c89-adfe-032aea2ae2cd","year":2021},"citing_paper":{"arxiv_id":"2506.22776","last_updated":"2025-06-28T06:32:25Z","snapshot_observed_at":"2026-08-09T13:44:37.089885Z","submitted_at":"2025-06-28T06:32:25Z","title":"Smaller = Weaker? Benchmarking Robustness of Quantized LLMs in Code Generation","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T22:05:06.033638Z"},"links":{"citing_paper":"/paper/2506.22776"},"observation_digest":"sha256:ecd58037c565d6a7518227574a0e9080e903ad0a7d11bed182ce67284a182366","observation_id":"35ed500f-bb31-4a7c-ac62-18bc0d4d0568","resolution":{"observed_at":"2026-08-06T22:05:19.715490Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T22:05:19.552893Z","title":"Qlora: Efficient finetuning of quantized llms,","venue":null,"work_id":"6c39af2d-1c1a-4d48-af65-df953e4f272c","year":2023},"citing_paper":{"arxiv_id":"2506.22776","last_updated":"2025-06-28T06:32:25Z","snapshot_observed_at":"2026-08-09T13:44:37.089885Z","submitted_at":"2025-06-28T06:32:25Z","title":"Smaller = Weaker? Benchmarking Robustness of Quantized LLMs in Code Generation","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T22:05:06.091537Z"},"links":{"citing_paper":"/paper/2506.22776"},"observation_digest":"sha256:b04fdb5ca5e9ea2c4dc13c29ceced08aa810f71f1caa5d403cb7cccbfdce13e1","observation_id":"03ccd0d1-f416-43ba-888e-4ddef872d7ce","resolution":{"observed_at":"2026-08-06T22:05:19.617098Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T22:05:19.375126Z","title":"Exploiting LLM quantization,","venue":null,"work_id":"e4196dda-63a4-47a9-bfce-f4d751ef53bd","year":2024},"citing_paper":{"arxiv_id":"2506.22776","last_updated":"2025-06-28T06:32:25Z","snapshot_observed_at":"2026-08-09T13:44:37.089885Z","submitted_at":"2025-06-28T06:32:25Z","title":"Smaller = Weaker? Benchmarking Robustness of Quantized LLMs in Code Generation","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T22:05:06.185457Z"},"links":{"citing_paper":"/paper/2506.22776"},"observation_digest":"sha256:aaedbc43c97cbbd13867b10dc40c923d11089fa4ef4346f551346757d7970a0e","observation_id":"4134d58e-7c55-44d1-9c4f-7dd8aa5f021a","resolution":{"observed_at":"2026-08-06T22:05:19.455097Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.03617","last_updated":"2025-02-05T21:06:30Z","snapshot_observed_at":"2026-08-09T13:43:47.719527Z","submitted_at":"2025-02-05T21:06:30Z","title":"Resource-Efficient & Effective Code Summarization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.03617","snapshot_observed_at":"2026-08-06T22:05:06.250561Z","title":"Resource-efficient & effective code summarization,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.22776","last_updated":"2025-06-28T06:32:25Z","snapshot_observed_at":"2026-08-09T13:44:37.089885Z","submitted_at":"2025-06-28T06:32:25Z","title":"Smaller = Weaker? Benchmarking Robustness of Quantized LLMs in Code Generation","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T22:05:06.250561Z"},"links":{"cited_paper":"/paper/2502.03617","citing_paper":"/paper/2506.22776"},"observation_digest":"sha256:9cb5e05a39364f06bb15318fe817a295495f88d658293fe4b130ec013673b8d3","observation_id":"4a08c4b5-91a2-4d84-bcf0-39309239e04c","resolution":{"observed_at":"2026-08-06T22:05:06.250561Z","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-06T22:05:19.148980Z","title":"Exploring parameter-efficient fine-tuning techniques for code generation with large language models,","venue":null,"work_id":"5dae967e-3a60-492f-91b3-748317cdd737","year":2023},"citing_paper":{"arxiv_id":"2506.22776","last_updated":"2025-06-28T06:32:25Z","snapshot_observed_at":"2026-08-09T13:44:37.089885Z","submitted_at":"2025-06-28T06:32:25Z","title":"Smaller = Weaker? Benchmarking Robustness of Quantized LLMs in Code Generation","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T22:05:06.344347Z"},"links":{"citing_paper":"/paper/2506.22776"},"observation_digest":"sha256:680ac4a5f888ffedaca0bb2581d4ccfce7d9e93ac0149fd89d8d7f1d7505b168","observation_id":"a6d8b735-9eb3-45f1-af07-9a145352ee38","resolution":{"observed_at":"2026-08-06T22:05:19.225439Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T22:05:18.965474Z","title":"Towards greener yet powerful code generation via quan- tization: An empirical study,","venue":null,"work_id":"baa60038-8f7f-4d18-91c5-134bbe249049","year":2023},"citing_paper":{"arxiv_id":"2506.22776","last_updated":"2025-06-28T06:32:25Z","snapshot_observed_at":"2026-08-09T13:44:37.089885Z","submitted_at":"2025-06-28T06:32:25Z","title":"Smaller = Weaker? Benchmarking Robustness of Quantized LLMs in Code Generation","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T22:05:06.410743Z"},"links":{"citing_paper":"/paper/2506.22776"},"observation_digest":"sha256:cf05bab8cb03534db17e2c43f15b2f2fa9a059b45aaf130af2b7d8fc449fe221","observation_id":"211a50c2-fedf-4ecd-91f3-0e1f15efecb6","resolution":{"observed_at":"2026-08-06T22:05:19.066944Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2408.02502","last_updated":"2024-11-01T21:36:31Z","snapshot_observed_at":"2026-08-09T23:14:59.018015Z","submitted_at":"2024-08-05T14:26:41Z","title":"Context Conquers Parameters: Outperforming Proprietary LLM in Commit Message Generation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.02502","snapshot_observed_at":"2026-08-06T22:05:06.477077Z","title":"Con- text conquers parameters: Outperforming proprietary llm in commit message generation,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.22776","last_updated":"2025-06-28T06:32:25Z","snapshot_observed_at":"2026-08-09T13:44:37.089885Z","submitted_at":"2025-06-28T06:32:25Z","title":"Smaller = Weaker? Benchmarking Robustness of Quantized LLMs in Code Generation","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T22:05:06.477077Z"},"links":{"cited_paper":"/paper/2408.02502","citing_paper":"/paper/2506.22776"},"observation_digest":"sha256:9121f005fd49c1cfd8e9d2249636485da8ddc75ddd3f39d11d51bb5dbb0552be","observation_id":"2cadc917-51c2-47af-815e-c79444f5b71e","resolution":{"observed_at":"2026-08-06T22:05:06.477077Z","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-06T22:05:18.652689Z","title":"Awq: Activation-aware weight quantization for on-device llm compression and acceleration,","venue":null,"work_id":"4bb0b212-5453-4d16-8388-6c6e39cb6fa3","year":2024},"citing_paper":{"arxiv_id":"2506.22776","last_updated":"2025-06-28T06:32:25Z","snapshot_observed_at":"2026-08-09T13:44:37.089885Z","submitted_at":"2025-06-28T06:32:25Z","title":"Smaller = Weaker? Benchmarking Robustness of Quantized LLMs in Code Generation","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T22:05:06.550789Z"},"links":{"citing_paper":"/paper/2506.22776"},"observation_digest":"sha256:471f35f5ebf422a2a30e08c9e11e1f970a44f9ee11eaaf5e512cfefb2f07b774","observation_id":"2e365213-a3eb-49d1-9d39-d25c1263391b","resolution":{"observed_at":"2026-08-06T22:05:18.802850Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T22:05:18.413859Z","title":"Atom: Low-bit quantization for efficient and accurate llm serving,","venue":null,"work_id":"000740b6-1478-4095-9268-481d2d13d373","year":2024},"citing_paper":{"arxiv_id":"2506.22776","last_updated":"2025-06-28T06:32:25Z","snapshot_observed_at":"2026-08-09T13:44:37.089885Z","submitted_at":"2025-06-28T06:32:25Z","title":"Smaller = Weaker? Benchmarking Robustness of Quantized LLMs in Code Generation","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T22:05:06.647337Z"},"links":{"citing_paper":"/paper/2506.22776"},"observation_digest":"sha256:0cea89b1653e7170a80e7cbe3523b06a3e5d2cf915207be40f7335e16df61d74","observation_id":"eba36b05-a644-4cba-81d1-095b2fa26349","resolution":{"observed_at":"2026-08-06T22:05:18.535231Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T22:05:18.122563Z","title":"A large-scale survey on the usability of ai programming assistants: Successes and challenges,","venue":null,"work_id":"acfb4a4c-4bf3-4dc9-878f-cfca2f1dd642","year":2024},"citing_paper":{"arxiv_id":"2506.22776","last_updated":"2025-06-28T06:32:25Z","snapshot_observed_at":"2026-08-09T13:44:37.089885Z","submitted_at":"2025-06-28T06:32:25Z","title":"Smaller = Weaker? Benchmarking Robustness of Quantized LLMs in Code Generation","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T22:05:06.744554Z"},"links":{"citing_paper":"/paper/2506.22776"},"observation_digest":"sha256:755611ed15935377c7a05662bdc10305019d767222573cf03463c1cb618bac92","observation_id":"7debd548-8b9d-4013-9c3d-208595df3cab","resolution":{"observed_at":"2026-08-06T22:05:18.256578Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T22:05:17.950866Z","title":"An industry case study on adoption of ai-based programming assistants,","venue":null,"work_id":"0e1b7942-1cfc-435a-adc6-acbac3c92b02","year":2024},"citing_paper":{"arxiv_id":"2506.22776","last_updated":"2025-06-28T06:32:25Z","snapshot_observed_at":"2026-08-09T13:44:37.089885Z","submitted_at":"2025-06-28T06:32:25Z","title":"Smaller = Weaker? Benchmarking Robustness of Quantized LLMs in Code Generation","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-06T22:05:06.846073Z"},"links":{"citing_paper":"/paper/2506.22776"},"observation_digest":"sha256:013bbca7f805079016092c3cb69f4398e25903ff505fc0507fa7923ccdca803f","observation_id":"ff270431-b7aa-44f3-a792-9664a82e4757","resolution":{"observed_at":"2026-08-06T22:05:18.033410Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"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-06T22:05:06.916550Z","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":"2506.22776","last_updated":"2025-06-28T06:32:25Z","snapshot_observed_at":"2026-08-09T13:44:37.089885Z","submitted_at":"2025-06-28T06:32:25Z","title":"Smaller = Weaker? Benchmarking Robustness of Quantized LLMs in Code Generation","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-06T22:05:06.916550Z"},"links":{"cited_paper":"/paper/2406.11931","citing_paper":"/paper/2506.22776"},"observation_digest":"sha256:1755853649ce36983aaf0ccebc9c5ced640eb1227b2b8f26b6d7cda978bd744e","observation_id":"bf83b884-8db0-4900-b02b-284b945bb501","resolution":{"observed_at":"2026-08-06T22:05:06.916550Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.21783","last_updated":"2024-11-23T23:27:33Z","snapshot_observed_at":"2026-07-06T18:55:11.576666Z","submitted_at":"2024-07-31T17:54:27Z","title":"The Llama 3 Herd of Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.21783","snapshot_observed_at":"2026-08-06T22:05:07.016418Z","title":"The llama 3 herd of models,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.22776","last_updated":"2025-06-28T06:32:25Z","snapshot_observed_at":"2026-08-09T13:44:37.089885Z","submitted_at":"2025-06-28T06:32:25Z","title":"Smaller = Weaker? Benchmarking Robustness of Quantized LLMs in Code Generation","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-06T22:05:07.016418Z"},"links":{"cited_paper":"/paper/2407.21783","citing_paper":"/paper/2506.22776"},"observation_digest":"sha256:409710bc001cf1605a304f55a6b9cc7d4b801adcf54dc28ec3c2fdffa1c91840","observation_id":"4a2be23f-10ca-40e6-8ee6-2b9cc678ec52","resolution":{"observed_at":"2026-08-06T22:05:07.016418Z","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-06T22:05:07.113381Z","title":"Evaluating large language models trained on code,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.22776","last_updated":"2025-06-28T06:32:25Z","snapshot_observed_at":"2026-08-09T13:44:37.089885Z","submitted_at":"2025-06-28T06:32:25Z","title":"Smaller = Weaker? Benchmarking Robustness of Quantized LLMs in Code Generation","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-06T22:05:07.113381Z"},"links":{"cited_paper":"/paper/2107.03374","citing_paper":"/paper/2506.22776"},"observation_digest":"sha256:4d4f9fae331f545f77269336415bdec8d83a5c5c93d855bd90b0a80000618d89","observation_id":"dea1b7cd-f940-444e-9516-0988357106c0","resolution":{"observed_at":"2026-08-06T22:05:07.113381Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2108.07732","last_updated":"2021-08-16T03:57:30Z","snapshot_observed_at":"2026-08-02T19:23:53.535075Z","submitted_at":"2021-08-16T03:57:30Z","title":"Program Synthesis with Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2108.07732","snapshot_observed_at":"2026-08-06T22:05:07.188356Z","title":"Program synthesis with large language models,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.22776","last_updated":"2025-06-28T06:32:25Z","snapshot_observed_at":"2026-08-09T13:44:37.089885Z","submitted_at":"2025-06-28T06:32:25Z","title":"Smaller = Weaker? Benchmarking Robustness of Quantized LLMs in Code Generation","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-06T22:05:07.188356Z"},"links":{"cited_paper":"/paper/2108.07732","citing_paper":"/paper/2506.22776"},"observation_digest":"sha256:3a74710d499ec107dc515e436ebef70746c90b955eb588e00ab2f8ea7d815a19","observation_id":"6a073572-1c06-4bd4-89d4-ed70dd5be1eb","resolution":{"observed_at":"2026-08-06T22:05:07.188356Z","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-06T22:05:17.761138Z","title":"On the robust- ness of code generation techniques: An empirical study on github copilot,","venue":null,"work_id":"cdc261bb-b7c8-43ad-b9aa-19ec15e4387f","year":2023},"citing_paper":{"arxiv_id":"2506.22776","last_updated":"2025-06-28T06:32:25Z","snapshot_observed_at":"2026-08-09T13:44:37.089885Z","submitted_at":"2025-06-28T06:32:25Z","title":"Smaller = Weaker? Benchmarking Robustness of Quantized LLMs in Code Generation","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-06T22:05:07.287697Z"},"links":{"citing_paper":"/paper/2506.22776"},"observation_digest":"sha256:02f417540a1967ef40b1d9c3f0424ccff7cda1ed5a9e7a812132033b94e5a169","observation_id":"74cf2f95-ba97-49a0-890d-e3e36dc4147b","resolution":{"observed_at":"2026-08-06T22:05:17.849837Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T22:05:17.548659Z","title":"Codeattack: Code-based ad- versarial attacks for pre-trained programming language models,","venue":null,"work_id":"096bbe0f-364a-4800-9dd5-9023f4594453","year":2023},"citing_paper":{"arxiv_id":"2506.22776","last_updated":"2025-06-28T06:32:25Z","snapshot_observed_at":"2026-08-09T13:44:37.089885Z","submitted_at":"2025-06-28T06:32:25Z","title":"Smaller = Weaker? Benchmarking Robustness of Quantized LLMs in Code Generation","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-06T22:05:07.364113Z"},"links":{"citing_paper":"/paper/2506.22776"},"observation_digest":"sha256:d0180718ffb0998b48b67c53d4d981b58ca3c772ae00dcb6aa7d75c45455e92b","observation_id":"c87b024d-58cf-48db-b820-7ce6ea5723d4","resolution":{"observed_at":"2026-08-06T22:05:17.622829Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T22:05:17.429322Z","title":"A survey on robustness attacks for deep code models,","venue":null,"work_id":"51bdac3b-0bd9-4e3f-aaec-47263cf7e958","year":2024},"citing_paper":{"arxiv_id":"2506.22776","last_updated":"2025-06-28T06:32:25Z","snapshot_observed_at":"2026-08-09T13:44:37.089885Z","submitted_at":"2025-06-28T06:32:25Z","title":"Smaller = Weaker? Benchmarking Robustness of Quantized LLMs in Code Generation","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-06T22:05:07.481146Z"},"links":{"citing_paper":"/paper/2506.22776"},"observation_digest":"sha256:9b26bcb7aa17d0dd8c25f533ba6a1d53b04757cfe70a08b049464620b2801a1a","observation_id":"ff44ecae-fe9c-4373-9ed4-b353ee26f1d4","resolution":{"observed_at":"2026-08-06T22:05:17.470994Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T22:05:15.413271Z","title":"Attacks and defenses for large language models on coding tasks,","venue":null,"work_id":"95d07f5b-d73d-4661-a7c4-050386c13f1e","year":2024},"citing_paper":{"arxiv_id":"2506.22776","last_updated":"2025-06-28T06:32:25Z","snapshot_observed_at":"2026-08-09T13:44:37.089885Z","submitted_at":"2025-06-28T06:32:25Z","title":"Smaller = Weaker? Benchmarking Robustness of Quantized LLMs in Code Generation","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-06T22:05:07.557564Z"},"links":{"citing_paper":"/paper/2506.22776"},"observation_digest":"sha256:1d24525af654bb2ebed70b118748c2b2b0e41ae9174ac1799b0ec8cdac08c6ef","observation_id":"aa531512-a257-4c65-9c14-30a25d4c013d","resolution":{"observed_at":"2026-08-06T22:05:17.339347Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T22:05:07.654467Z","title":"Attacks and defenses for large language models on coding tasks,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.22776","last_updated":"2025-06-28T06:32:25Z","snapshot_observed_at":"2026-08-09T13:44:37.089885Z","submitted_at":"2025-06-28T06:32:25Z","title":"Smaller = Weaker? Benchmarking Robustness of Quantized LLMs in Code Generation","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-06T22:05:07.654467Z"},"links":{"citing_paper":"/paper/2506.22776"},"observation_digest":"sha256:fc286549863628fbbd8f374f761f48c4ef5760180126a31d5336911d0196a323","observation_id":"42919a53-1a57-474e-99e4-74d96d2a0974","resolution":{"observed_at":"2026-08-06T22:05:07.654467Z","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-06T22:05:15.137494Z","title":"Codegen: An open large language model for code with multi-turn program synthesis,","venue":null,"work_id":"00b382e3-aa78-4744-a6ac-3fb62f4aff53","year":2023},"citing_paper":{"arxiv_id":"2506.22776","last_updated":"2025-06-28T06:32:25Z","snapshot_observed_at":"2026-08-09T13:44:37.089885Z","submitted_at":"2025-06-28T06:32:25Z","title":"Smaller = Weaker? Benchmarking Robustness of Quantized LLMs in Code Generation","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-06T22:05:07.718441Z"},"links":{"citing_paper":"/paper/2506.22776"},"observation_digest":"sha256:37ed7aff7f26d688e0d42e8320edf7b3b85c5568338a4113fee6985a14f50952","observation_id":"a697d07e-a5e0-444d-bd92-afff43aa6f8b","resolution":{"observed_at":"2026-08-06T22:05:15.254563Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.19173","last_updated":"2024-02-29T13:53:35Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-02-29T13:53:35Z","title":"StarCoder 2 and The Stack v2: The Next Generation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.19173","snapshot_observed_at":"2026-08-06T22:05:07.743061Z","title":"Starcoder 2 and the stack v2: The next generation,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.22776","last_updated":"2025-06-28T06:32:25Z","snapshot_observed_at":"2026-08-09T13:44:37.089885Z","submitted_at":"2025-06-28T06:32:25Z","title":"Smaller = Weaker? Benchmarking Robustness of Quantized LLMs in Code Generation","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-06T22:05:07.743061Z"},"links":{"cited_paper":"/paper/2402.19173","citing_paper":"/paper/2506.22776"},"observation_digest":"sha256:d0958c11eae74429ecb53a9645d38b0ac4c8705fa712075e94eb3b9cb36c9195","observation_id":"1047f086-7e6d-44e9-bca1-72b2ef3cefde","resolution":{"observed_at":"2026-08-06T22:05:07.743061Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2306.14583","last_updated":"2023-06-26T10:48:50Z","snapshot_observed_at":"2026-07-06T15:46:40.281717Z","submitted_at":"2023-06-26T10:48:50Z","title":"Exploring the Robustness of Large Language Models for Solving Programming Problems","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.14583","snapshot_observed_at":"2026-08-06T22:05:07.828258Z","title":"Exploring the robustness of large language models for solving programming prob- lems,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.22776","last_updated":"2025-06-28T06:32:25Z","snapshot_observed_at":"2026-08-09T13:44:37.089885Z","submitted_at":"2025-06-28T06:32:25Z","title":"Smaller = Weaker? Benchmarking Robustness of Quantized LLMs in Code Generation","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-06T22:05:07.828258Z"},"links":{"cited_paper":"/paper/2306.14583","citing_paper":"/paper/2506.22776"},"observation_digest":"sha256:548a2ac8abafa4ca5000e4b550159fe843205419967043c8e39d47a8f441dc72","observation_id":"b5a6a3eb-cd55-41b5-86c1-88c6f87f715c","resolution":{"observed_at":"2026-08-06T22:05:07.828258Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2301.12868","last_updated":"2023-03-09T11:01:02Z","snapshot_observed_at":"2026-07-06T14:46:02.951905Z","submitted_at":"2023-01-30T13:21:00Z","title":"On Robustness of Prompt-based Semantic Parsing with Large Pre-trained Language Model: An Empirical Study on Codex","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2301.12868","snapshot_observed_at":"2026-08-06T22:05:07.899408Z","title":"On robustness of prompt- based semantic parsing with large pre-trained language model: An empirical study on codex,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.22776","last_updated":"2025-06-28T06:32:25Z","snapshot_observed_at":"2026-08-09T13:44:37.089885Z","submitted_at":"2025-06-28T06:32:25Z","title":"Smaller = Weaker? Benchmarking Robustness of Quantized LLMs in Code Generation","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-06T22:05:07.899408Z"},"links":{"cited_paper":"/paper/2301.12868","citing_paper":"/paper/2506.22776"},"observation_digest":"sha256:c933a1ede1192bbf5a0ac552923065bf9a8224776ba126ff2743e32686801352","observation_id":"073ece53-54bd-455f-8ff4-0ebf295059e4","resolution":{"observed_at":"2026-08-06T22:05:07.899408Z","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-06T22:05:14.935458Z","title":"Evaluating and enhancing the robustness of code pre- trained models through structure-aware adversarial sam- ples generation,","venue":null,"work_id":"f5741e88-e5f3-4eb1-8018-47c62bdb59a9","year":2023},"citing_paper":{"arxiv_id":"2506.22776","last_updated":"2025-06-28T06:32:25Z","snapshot_observed_at":"2026-08-09T13:44:37.089885Z","submitted_at":"2025-06-28T06:32:25Z","title":"Smaller = Weaker? Benchmarking Robustness of Quantized LLMs in Code Generation","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-06T22:05:07.979833Z"},"links":{"citing_paper":"/paper/2506.22776"},"observation_digest":"sha256:79518a7f912ceb0183be91d4a2d1c3eb403346fbe25b4b762bb74cffc59fb5cb","observation_id":"83363841-edfb-4bd5-9e1e-8491a2375e01","resolution":{"observed_at":"2026-08-06T22:05:15.053341Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.07506","last_updated":"2024-03-12T10:43:26Z","snapshot_observed_at":"2026-08-09T00:49:03.226961Z","submitted_at":"2024-03-12T10:43:26Z","title":"Robustness, Security, Privacy, Explainability, Efficiency, and Usability of Large Language Models for Code","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.07506","snapshot_observed_at":"2026-08-06T22:05:08.052305Z","title":"Robustness, security, privacy, explainability, efficiency, and usability of large language models for code,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.22776","last_updated":"2025-06-28T06:32:25Z","snapshot_observed_at":"2026-08-09T13:44:37.089885Z","submitted_at":"2025-06-28T06:32:25Z","title":"Smaller = Weaker? Benchmarking Robustness of Quantized LLMs in Code Generation","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-06T22:05:08.052305Z"},"links":{"cited_paper":"/paper/2403.07506","citing_paper":"/paper/2506.22776"},"observation_digest":"sha256:907d7b37d9b468da25abd2d0bda3faadae761f75136e9ac449ce4b9a645a225c","observation_id":"83628a02-1d30-48a0-ab2a-78ee26317a02","resolution":{"observed_at":"2026-08-06T22:05:08.052305Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.02841","last_updated":"2024-10-03T12:59:29Z","snapshot_observed_at":"2026-08-10T09:36:27.623584Z","submitted_at":"2024-10-03T12:59:29Z","title":"Demonstration Attack against In-Context Learning for Code Intelligence","version":1},"cited_work":{"arxiv_id":"2410.02841","doi":null,"metadata_source":"pith","pith_arxiv_id":"2410.02841","snapshot_observed_at":"2026-08-06T22:05:10.988847Z","title":"Demonstration Attack against In-Context Learning for Code Intelligence","venue":"cs.CR","work_id":"9f567431-4ca3-444d-92c4-f6a5793c5b68","year":2024},"citing_paper":{"arxiv_id":"2506.22776","last_updated":"2025-06-28T06:32:25Z","snapshot_observed_at":"2026-08-09T13:44:37.089885Z","submitted_at":"2025-06-28T06:32:25Z","title":"Smaller = Weaker? Benchmarking Robustness of Quantized LLMs in Code Generation","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-06T22:05:08.152405Z"},"links":{"cited_paper":"/paper/2410.02841","citing_paper":"/paper/2506.22776"},"observation_digest":"sha256:a63a1b6b33ae32ffa71830e6ecab6f78fe3cbfa0aca98bafc1ae43bd57a13483","observation_id":"187c350f-4999-44a0-95aa-2b2e47d9498f","resolution":{"observed_at":"2026-08-06T22:05:11.034227Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T22:05:14.680453Z","title":"Alanca: Active learning guided adversarial attacks for code comprehension on diverse pre-trained and large language models,","venue":null,"work_id":"d9a4f523-795d-4678-9a36-2f6ccee7243a","year":2024},"citing_paper":{"arxiv_id":"2506.22776","last_updated":"2025-06-28T06:32:25Z","snapshot_observed_at":"2026-08-09T13:44:37.089885Z","submitted_at":"2025-06-28T06:32:25Z","title":"Smaller = Weaker? Benchmarking Robustness of Quantized LLMs in Code Generation","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-06T22:05:08.210012Z"},"links":{"citing_paper":"/paper/2506.22776"},"observation_digest":"sha256:abbd5596e16b8bc9dfc485bb53f422d1f2b87726dab12180cae408a5b96b2ba6","observation_id":"f368513e-62be-429c-b8f5-4418d683493e","resolution":{"observed_at":"2026-08-06T22:05:14.819711Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T22:05:14.395607Z","title":"Attribution-guided adversarial code prompt generation for code completion models,","venue":null,"work_id":"10a89c02-091a-40b7-9f74-44eae6d5cb42","year":2024},"citing_paper":{"arxiv_id":"2506.22776","last_updated":"2025-06-28T06:32:25Z","snapshot_observed_at":"2026-08-09T13:44:37.089885Z","submitted_at":"2025-06-28T06:32:25Z","title":"Smaller = Weaker? Benchmarking Robustness of Quantized LLMs in Code Generation","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-06T22:05:08.298353Z"},"links":{"citing_paper":"/paper/2506.22776"},"observation_digest":"sha256:65bbffecbac9b6cb3296dcb9901c372ae8f2c8910b9c032e2dfa6b37c6939c4b","observation_id":"ce779412-308d-47fe-9cb6-352fb5d609b5","resolution":{"observed_at":"2026-08-06T22:05:14.533498Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T22:05:14.235332Z","title":"Enhancing robustness of ai offensive code generators via data augmentation,","venue":null,"work_id":"0bfb8a7c-e4e5-4477-b3b4-371ecfb311a5","year":2025},"citing_paper":{"arxiv_id":"2506.22776","last_updated":"2025-06-28T06:32:25Z","snapshot_observed_at":"2026-08-09T13:44:37.089885Z","submitted_at":"2025-06-28T06:32:25Z","title":"Smaller = Weaker? Benchmarking Robustness of Quantized LLMs in Code Generation","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-06T22:05:08.357171Z"},"links":{"citing_paper":"/paper/2506.22776"},"observation_digest":"sha256:8d0c6b2736201dbf4c0e2d06de77909e640b25e800e18e107720283edfbd43ce","observation_id":"08492e49-da37-4ee8-a293-73cfb9f6219e","resolution":{"observed_at":"2026-08-06T22:05:14.336170Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T22:05:14.169241Z","title":"LoRD: Low-rank decomposition of monolingual code LLMs for one-shot compression,","venue":null,"work_id":"99fc3e4a-1237-4c43-9517-a57f8cc55cc7","year":2024},"citing_paper":{"arxiv_id":"2506.22776","last_updated":"2025-06-28T06:32:25Z","snapshot_observed_at":"2026-08-09T13:44:37.089885Z","submitted_at":"2025-06-28T06:32:25Z","title":"Smaller = Weaker? Benchmarking Robustness of Quantized LLMs in Code Generation","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-06T22:05:08.439138Z"},"links":{"citing_paper":"/paper/2506.22776"},"observation_digest":"sha256:fc0f1a7fecd3da74290cbdee12e6c4752eb7256dfc2216ade8e566a4ba3fa432","observation_id":"5c99cb10-3345-466f-b96c-f99e27648c20","resolution":{"observed_at":"2026-08-06T22:05:14.224444Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T22:05:14.089992Z","title":"Full stack optimization of transformer inference,","venue":null,"work_id":"088561e5-8495-4ba7-8a09-865aac67e7a3","year":2023},"citing_paper":{"arxiv_id":"2506.22776","last_updated":"2025-06-28T06:32:25Z","snapshot_observed_at":"2026-08-09T13:44:37.089885Z","submitted_at":"2025-06-28T06:32:25Z","title":"Smaller = Weaker? Benchmarking Robustness of Quantized LLMs in Code Generation","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-06T22:05:08.505706Z"},"links":{"citing_paper":"/paper/2506.22776"},"observation_digest":"sha256:94ba3624440d9b4edd4081c0ba73b7e483ee1d496ab4efb61373fd28e3c4dd2d","observation_id":"cb61ab0d-7b86-4540-8dcb-5f5c48def5e8","resolution":{"observed_at":"2026-08-06T22:05:14.124473Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2106.08295","last_updated":"2021-06-15T17:12:42Z","snapshot_observed_at":"2026-08-02T11:19:40.664702Z","submitted_at":"2021-06-15T17:12:42Z","title":"A White Paper on Neural Network Quantization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2106.08295","snapshot_observed_at":"2026-08-06T22:05:08.615014Z","title":"A white paper on neural network quantization,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.22776","last_updated":"2025-06-28T06:32:25Z","snapshot_observed_at":"2026-08-09T13:44:37.089885Z","submitted_at":"2025-06-28T06:32:25Z","title":"Smaller = Weaker? Benchmarking Robustness of Quantized LLMs in Code Generation","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-06T22:05:08.615014Z"},"links":{"cited_paper":"/paper/2106.08295","citing_paper":"/paper/2506.22776"},"observation_digest":"sha256:dce3c8323103fe7901b3625b64d8a2dd58ddcf510f17dc7b1be563127b8e607b","observation_id":"c1779c51-f289-4c7f-9fa5-c8b5abd58bd8","resolution":{"observed_at":"2026-08-06T22:05:08.615014Z","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-06T22:05:13.988490Z","title":"Q-bert: Hessian based ultra low precision quantization of bert,","venue":null,"work_id":"719d5a91-3a39-4fa2-a8bd-cba4e018fb01","year":2020},"citing_paper":{"arxiv_id":"2506.22776","last_updated":"2025-06-28T06:32:25Z","snapshot_observed_at":"2026-08-09T13:44:37.089885Z","submitted_at":"2025-06-28T06:32:25Z","title":"Smaller = Weaker? Benchmarking Robustness of Quantized LLMs in Code Generation","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-06T22:05:08.695627Z"},"links":{"citing_paper":"/paper/2506.22776"},"observation_digest":"sha256:9715bbc2d3c16708a8a97c4cb23be78de6293864685620278207787b481dd6b5","observation_id":"5c98c8f0-5af0-4e69-840b-50f43a11f9d6","resolution":{"observed_at":"2026-08-06T22:05:14.029821Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T22:05:13.887064Z","title":"OPTQ: Accurate quantization for generative pre-trained transformers,","venue":null,"work_id":"0d8f50c7-2d0e-4fdd-a01d-7d3cd8adccce","year":2023},"citing_paper":{"arxiv_id":"2506.22776","last_updated":"2025-06-28T06:32:25Z","snapshot_observed_at":"2026-08-09T13:44:37.089885Z","submitted_at":"2025-06-28T06:32:25Z","title":"Smaller = Weaker? Benchmarking Robustness of Quantized LLMs in Code Generation","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-06T22:05:08.750350Z"},"links":{"citing_paper":"/paper/2506.22776"},"observation_digest":"sha256:e212267b8289deada861991067d9515a32bf007e2aed90a22f7dacdcccb156ff","observation_id":"bfca5ac9-9f15-4a84-acad-f96f0211984a","resolution":{"observed_at":"2026-08-06T22:05:13.927170Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T22:05:13.782795Z","title":"Gpt3. int8 (): 8-bit matrix multiplication for transform- ers at scale,","venue":null,"work_id":"d4c24f5d-57a1-4b49-bee0-cccdae4c6f11","year":2022},"citing_paper":{"arxiv_id":"2506.22776","last_updated":"2025-06-28T06:32:25Z","snapshot_observed_at":"2026-08-09T13:44:37.089885Z","submitted_at":"2025-06-28T06:32:25Z","title":"Smaller = Weaker? Benchmarking Robustness of Quantized LLMs in Code Generation","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-06T22:05:08.815407Z"},"links":{"citing_paper":"/paper/2506.22776"},"observation_digest":"sha256:0395c0330d7f89d55dde67704313d31fdec3b7d92d07e84e75d6b78d0049b758","observation_id":"d7c658c6-2512-4684-9fde-08aca472c5f9","resolution":{"observed_at":"2026-08-06T22:05:13.846870Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T22:05:13.716928Z","title":"8-bit optimizers via block-wise quantization,","venue":null,"work_id":"bc5af5c3-b82a-43e0-8e2c-50eb4956ae7f","year":null},"citing_paper":{"arxiv_id":"2506.22776","last_updated":"2025-06-28T06:32:25Z","snapshot_observed_at":"2026-08-09T13:44:37.089885Z","submitted_at":"2025-06-28T06:32:25Z","title":"Smaller = Weaker? Benchmarking Robustness of Quantized LLMs in Code Generation","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-06T22:05:08.906184Z"},"links":{"citing_paper":"/paper/2506.22776"},"observation_digest":"sha256:1f2d8ec76a8e9cc41320055da7d166f70ea1f7f95f182864e480935c3c586b11","observation_id":"713c2942-bf95-4ba7-8349-17a8387b76e3","resolution":{"observed_at":"2026-08-06T22:05:13.737012Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T22:05:13.501130Z","title":null,"venue":null,"work_id":"a755bacd-9d1b-4488-b4f9-7916040b99a3","year":2023},"citing_paper":{"arxiv_id":"2506.22776","last_updated":"2025-06-28T06:32:25Z","snapshot_observed_at":"2026-08-09T13:44:37.089885Z","submitted_at":"2025-06-28T06:32:25Z","title":"Smaller = Weaker? Benchmarking Robustness of Quantized LLMs in Code Generation","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-06T22:05:09.061943Z"},"links":{"citing_paper":"/paper/2506.22776"},"observation_digest":"sha256:bc5595d77b462698b65e5fd6747c852587c6cf4cddb2887f020b1099b4afd705","observation_id":"de591c61-69a3-4589-9a85-9a32048546bf","resolution":{"observed_at":"2026-08-06T22:05:13.546648Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T22:05:13.419908Z","title":"Wordnet: a lexical database for english,","venue":null,"work_id":"489cab25-84d5-4d5c-94e3-2befbb1370d9","year":1995},"citing_paper":{"arxiv_id":"2506.22776","last_updated":"2025-06-28T06:32:25Z","snapshot_observed_at":"2026-08-09T13:44:37.089885Z","submitted_at":"2025-06-28T06:32:25Z","title":"Smaller = Weaker? Benchmarking Robustness of Quantized LLMs in Code Generation","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-06T22:05:09.125357Z"},"links":{"citing_paper":"/paper/2506.22776"},"observation_digest":"sha256:ba25663e0b4967aa5dec6befd3dc6cf9260176d3c3b9f07162c90cc0ed2e30b6","observation_id":"685a89fa-80b1-4d53-8f2e-3457f3384e60","resolution":{"observed_at":"2026-08-06T22:05:13.440874Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T22:05:13.289652Z","title":"Analyzing the noise robustness of deep neural networks,","venue":null,"work_id":"18c1d426-6a70-4c04-bcc2-922ae18e74ca","year":2018},"citing_paper":{"arxiv_id":"2506.22776","last_updated":"2025-06-28T06:32:25Z","snapshot_observed_at":"2026-08-09T13:44:37.089885Z","submitted_at":"2025-06-28T06:32:25Z","title":"Smaller = Weaker? Benchmarking Robustness of Quantized LLMs in Code Generation","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-06T22:05:09.213889Z"},"links":{"citing_paper":"/paper/2506.22776"},"observation_digest":"sha256:4850176fd768f148dc9d46d73c7b36059f38f98ba3e464639266f7d2e814b2ab","observation_id":"becc8813-e546-48fd-8468-52a357cc5582","resolution":{"observed_at":"2026-08-06T22:05:13.353452Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T22:05:13.171471Z","title":"What makes quantization for large language model hard? an empirical study from the lens of perturbation,","venue":null,"work_id":"7380c486-ec4c-447f-85c0-b6c0a4c2361b","year":2024},"citing_paper":{"arxiv_id":"2506.22776","last_updated":"2025-06-28T06:32:25Z","snapshot_observed_at":"2026-08-09T13:44:37.089885Z","submitted_at":"2025-06-28T06:32:25Z","title":"Smaller = Weaker? Benchmarking Robustness of Quantized LLMs in Code Generation","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-06T22:05:09.261407Z"},"links":{"citing_paper":"/paper/2506.22776"},"observation_digest":"sha256:7cedb265f8d77abb1915898cb2ec122dbf3418976c02cbc264a6a2aba215becf","observation_id":"785e3f1b-29ee-48be-b76d-a8dc7822aadc","resolution":{"observed_at":"2026-08-06T22:05:13.229392Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T22:05:13.093239Z","title":"Noisy neighbors: Efficient membership inference attacks against LLMs,","venue":null,"work_id":"21146c42-0409-4a70-8eb4-e9a84cd4b2b9","year":2024},"citing_paper":{"arxiv_id":"2506.22776","last_updated":"2025-06-28T06:32:25Z","snapshot_observed_at":"2026-08-09T13:44:37.089885Z","submitted_at":"2025-06-28T06:32:25Z","title":"Smaller = Weaker? Benchmarking Robustness of Quantized LLMs in Code Generation","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-06T22:05:09.346848Z"},"links":{"citing_paper":"/paper/2506.22776"},"observation_digest":"sha256:bf2b92a6573368ebf3f1cd38da25956c3ea39d01e869c656f0fb02a3d5956aed","observation_id":"4cbab650-9358-46d4-a5f0-779011170ddd","resolution":{"observed_at":"2026-08-06T22:05:13.135099Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T22:05:12.952873Z","title":"Benchmarking neural network robustness to common corruptions and perturbations,","venue":null,"work_id":"66989598-e010-43b7-8b5e-e5124af7ca3a","year":2019},"citing_paper":{"arxiv_id":"2506.22776","last_updated":"2025-06-28T06:32:25Z","snapshot_observed_at":"2026-08-09T13:44:37.089885Z","submitted_at":"2025-06-28T06:32:25Z","title":"Smaller = Weaker? Benchmarking Robustness of Quantized LLMs in Code Generation","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-06T22:05:09.440650Z"},"links":{"citing_paper":"/paper/2506.22776"},"observation_digest":"sha256:33d0cfa2a3ee4f1a69b639c232ce5764f65282abb56369863ad80785e188868d","observation_id":"6a88c464-3673-45cd-bc6f-b89b820a9f1f","resolution":{"observed_at":"2026-08-06T22:05:13.008332Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T22:05:12.840313Z","title":"On adaptive attacks to adversarial example defenses,","venue":null,"work_id":"fc67698c-2280-46bc-8850-8e177f5a7f09","year":2020},"citing_paper":{"arxiv_id":"2506.22776","last_updated":"2025-06-28T06:32:25Z","snapshot_observed_at":"2026-08-09T13:44:37.089885Z","submitted_at":"2025-06-28T06:32:25Z","title":"Smaller = Weaker? Benchmarking Robustness of Quantized LLMs in Code Generation","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-06T22:05:09.546528Z"},"links":{"citing_paper":"/paper/2506.22776"},"observation_digest":"sha256:3d896e414f9427c9d44f3e29b0f9ef580b3c8d2df47019156a5368c23dbe57fe","observation_id":"d48e40da-eb41-4111-853c-04a7ed93b159","resolution":{"observed_at":"2026-08-06T22:05:12.887930Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T22:05:12.726834Z","title":"Evaluat- ing model robustness and stability to dataset shift,","venue":null,"work_id":"430c2995-6bff-4712-8ea0-f0195df65c24","year":2021},"citing_paper":{"arxiv_id":"2506.22776","last_updated":"2025-06-28T06:32:25Z","snapshot_observed_at":"2026-08-09T13:44:37.089885Z","submitted_at":"2025-06-28T06:32:25Z","title":"Smaller = Weaker? Benchmarking Robustness of Quantized LLMs in Code Generation","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-06T22:05:09.643218Z"},"links":{"citing_paper":"/paper/2506.22776"},"observation_digest":"sha256:14968f81ae0feca3d6b5c06a6e4e605e46353c0200b126911cc6a548de88e223","observation_id":"6078105d-16db-4a4a-b329-20d47cfec1f5","resolution":{"observed_at":"2026-08-06T22:05:12.779818Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T22:05:12.624214Z","title":"Attacks which do not kill training make adversarial learning stronger,","venue":null,"work_id":"fc386ff3-e4df-45c9-b6d5-13fbbbbbfed1","year":2020},"citing_paper":{"arxiv_id":"2506.22776","last_updated":"2025-06-28T06:32:25Z","snapshot_observed_at":"2026-08-09T13:44:37.089885Z","submitted_at":"2025-06-28T06:32:25Z","title":"Smaller = Weaker? Benchmarking Robustness of Quantized LLMs in Code Generation","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-06T22:05:09.787174Z"},"links":{"citing_paper":"/paper/2506.22776"},"observation_digest":"sha256:5be31c1b47ae900b21d7ba3651c4d1b9bf72b6732d96d487e204453d965facd7","observation_id":"01b31939-1fde-44d8-a0cf-31b9a24e9236","resolution":{"observed_at":"2026-08-06T22:05:12.654013Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T22:05:12.423019Z","title":"A baseline for detecting misclassified and out-of-distribution examples in neural networks,","venue":null,"work_id":"a984451f-28c4-420b-8c63-d3f6cce5259a","year":2017},"citing_paper":{"arxiv_id":"2506.22776","last_updated":"2025-06-28T06:32:25Z","snapshot_observed_at":"2026-08-09T13:44:37.089885Z","submitted_at":"2025-06-28T06:32:25Z","title":"Smaller = Weaker? Benchmarking Robustness of Quantized LLMs in Code Generation","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-06T22:05:09.858636Z"},"links":{"citing_paper":"/paper/2506.22776"},"observation_digest":"sha256:abeb4fb48f86e0d0dfbddfb880f61f25a58b254ff0b8e206a02d0b51080ec23e","observation_id":"b6fe8411-1812-4582-a18c-d95d30030067","resolution":{"observed_at":"2026-08-06T22:05:12.528291Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2409.19027","last_updated":"2025-04-02T17:01:15Z","snapshot_observed_at":"2026-07-06T19:23:37.758078Z","submitted_at":"2024-09-26T13:29:20Z","title":"Code Generation and Algorithmic Problem Solving Using Llama 3.1 405B","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.19027","snapshot_observed_at":"2026-08-06T22:05:09.947670Z","title":"Code generation and algorithmic problem solving using llama 3.1 405b,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.22776","last_updated":"2025-06-28T06:32:25Z","snapshot_observed_at":"2026-08-09T13:44:37.089885Z","submitted_at":"2025-06-28T06:32:25Z","title":"Smaller = Weaker? Benchmarking Robustness of Quantized LLMs in Code Generation","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-06T22:05:09.947670Z"},"links":{"cited_paper":"/paper/2409.19027","citing_paper":"/paper/2506.22776"},"observation_digest":"sha256:ac2db8cf510677d691c72634dbd9ea00649457ea6718f01920e75387a66aa10a","observation_id":"91f00a28-b910-471b-99ff-e264b486e8b7","resolution":{"observed_at":"2026-08-06T22:05:09.947670Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2308.12950","last_updated":"2024-01-31T19:47:26Z","snapshot_observed_at":"2026-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-06T22:05:10.033548Z","title":"Code llama: Open foundation models for code,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.22776","last_updated":"2025-06-28T06:32:25Z","snapshot_observed_at":"2026-08-09T13:44:37.089885Z","submitted_at":"2025-06-28T06:32:25Z","title":"Smaller = Weaker? Benchmarking Robustness of Quantized LLMs in Code Generation","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-06T22:05:10.033548Z"},"links":{"cited_paper":"/paper/2308.12950","citing_paper":"/paper/2506.22776"},"observation_digest":"sha256:48fbdeda738d201ffc250cece93ed76daf611e3028b6a3925108ad8e5b82e293","observation_id":"8ee27a18-833a-4616-bdd2-312238ebb346","resolution":{"observed_at":"2026-08-06T22:05:10.033548Z","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-06T22:05:12.216890Z","title":"Codereval: A benchmark of pragmatic code generation with gener- ative pre-trained models,","venue":null,"work_id":"154e5708-8777-402a-8249-833d1b1ad73c","year":2024},"citing_paper":{"arxiv_id":"2506.22776","last_updated":"2025-06-28T06:32:25Z","snapshot_observed_at":"2026-08-09T13:44:37.089885Z","submitted_at":"2025-06-28T06:32:25Z","title":"Smaller = Weaker? Benchmarking Robustness of Quantized LLMs in Code Generation","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-06T22:05:10.141987Z"},"links":{"citing_paper":"/paper/2506.22776"},"observation_digest":"sha256:34829490de60ebd62af5e03969f2fabdc96b28ec7b2db7d05366cb5d62542249","observation_id":"e09d86d0-8bff-47bf-a87b-33ec93b30930","resolution":{"observed_at":"2026-08-06T22:05:12.330504Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T22:05:12.026649Z","title":"Complexcodeeval: A benchmark for eval- uating large code models on more complex code,","venue":null,"work_id":"f4d8c309-e583-413e-a253-a7eb4c1cc358","year":2024},"citing_paper":{"arxiv_id":"2506.22776","last_updated":"2025-06-28T06:32:25Z","snapshot_observed_at":"2026-08-09T13:44:37.089885Z","submitted_at":"2025-06-28T06:32:25Z","title":"Smaller = Weaker? Benchmarking Robustness of Quantized LLMs in Code Generation","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-06T22:05:10.247671Z"},"links":{"citing_paper":"/paper/2506.22776"},"observation_digest":"sha256:3d5397741e1d51f649333766fce3647ea2355c287f1259917fb6a7e0f28cd598","observation_id":"5e26e358-60f2-4f44-adf3-5e3e6aac79a4","resolution":{"observed_at":"2026-08-06T22:05:12.130121Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T22:05:11.855721Z","title":"Coderujb: An executable and unified java benchmark for practical programming scenarios,","venue":null,"work_id":"7fbb9417-6492-4856-980c-5c4326dbba4d","year":2024},"citing_paper":{"arxiv_id":"2506.22776","last_updated":"2025-06-28T06:32:25Z","snapshot_observed_at":"2026-08-09T13:44:37.089885Z","submitted_at":"2025-06-28T06:32:25Z","title":"Smaller = Weaker? Benchmarking Robustness of Quantized LLMs in Code Generation","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-06T22:05:10.345752Z"},"links":{"citing_paper":"/paper/2506.22776"},"observation_digest":"sha256:dcecc99027e92522f1e005c667c8ce7e7d771c712dcbf3f495a7d7765b5d5327","observation_id":"acf7ad77-ee7e-4e0c-bae0-a36f88cc7d62","resolution":{"observed_at":"2026-08-06T22:05:11.931347Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.06918","last_updated":"2025-03-18T04:58:23Z","snapshot_observed_at":"2026-07-06T18:28:38.016649Z","submitted_at":"2024-06-11T03:19:18Z","title":"HumanEvo: An Evolution-aware Benchmark for More Realistic Evaluation of Repository-level Code Generation","version":2},"cited_work":{"arxiv_id":"2406.06918","doi":null,"metadata_source":"pith","pith_arxiv_id":"2406.06918","snapshot_observed_at":"2026-08-06T22:05:10.822591Z","title":"HumanEvo: An Evolution-aware Benchmark for More Realistic Evaluation of Repository-level Code Generation","venue":"cs.SE","work_id":"a6884214-28ec-4fc8-8a1e-3d58ba94f8b7","year":2024},"citing_paper":{"arxiv_id":"2506.22776","last_updated":"2025-06-28T06:32:25Z","snapshot_observed_at":"2026-08-09T13:44:37.089885Z","submitted_at":"2025-06-28T06:32:25Z","title":"Smaller = Weaker? Benchmarking Robustness of Quantized LLMs in Code Generation","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-06T22:05:10.431735Z"},"links":{"cited_paper":"/paper/2406.06918","citing_paper":"/paper/2506.22776"},"observation_digest":"sha256:00be029506e391bb7d19e488325549557f93f0165e0a7b35d1852cf8a8d8ac4f","observation_id":"1c8d4fd0-0b17-4e1a-81da-a90ea6095dd3","resolution":{"observed_at":"2026-08-06T22:05:10.866913Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T22:05:11.688160Z","title":"Is your code generated by chatgpt really correct? rigorous evaluation of large language models for code generation,","venue":null,"work_id":"78f7d9c7-447f-4946-b8d6-1652d9ff85f6","year":2024},"citing_paper":{"arxiv_id":"2506.22776","last_updated":"2025-06-28T06:32:25Z","snapshot_observed_at":"2026-08-09T13:44:37.089885Z","submitted_at":"2025-06-28T06:32:25Z","title":"Smaller = Weaker? Benchmarking Robustness of Quantized LLMs in Code Generation","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-06T22:05:10.518348Z"},"links":{"citing_paper":"/paper/2506.22776"},"observation_digest":"sha256:bdda753ad776463f05b24a424f64e14aadd89ab34f6fc8830999d92ea56f8ea5","observation_id":"63e4a4b1-f624-4f7d-b606-908a6e5ef5ad","resolution":{"observed_at":"2026-08-06T22:05:11.771016Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T22:05:11.544634Z","title":"Robustness may be at odds with accuracy,","venue":null,"work_id":"9a55718c-9a40-4201-8370-324b5f6c1089","year":null},"citing_paper":{"arxiv_id":"2506.22776","last_updated":"2025-06-28T06:32:25Z","snapshot_observed_at":"2026-08-09T13:44:37.089885Z","submitted_at":"2025-06-28T06:32:25Z","title":"Smaller = Weaker? Benchmarking Robustness of Quantized LLMs in Code Generation","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-06T22:05:10.589940Z"},"links":{"citing_paper":"/paper/2506.22776"},"observation_digest":"sha256:3c4e9f44a0bf5d8e3e0048af4698f75c2aacb351b69891cbe752f5351ded0a22","observation_id":"4429957c-c8df-47d2-b262-aaab32b3afe8","resolution":{"observed_at":"2026-08-06T22:05:11.606763Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T22:05:11.399164Z","title":"Available: https://openreview.net/forum? id=SyxAb30cY7","venue":null,"work_id":"02dbe3bb-734d-4bed-9f38-44f67f8414db","year":null},"citing_paper":{"arxiv_id":"2506.22776","last_updated":"2025-06-28T06:32:25Z","snapshot_observed_at":"2026-08-09T13:44:37.089885Z","submitted_at":"2025-06-28T06:32:25Z","title":"Smaller = Weaker? Benchmarking Robustness of Quantized LLMs in Code Generation","version":1},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-06T22:05:10.701454Z"},"links":{"citing_paper":"/paper/2506.22776"},"observation_digest":"sha256:4203ad6bedded465f1c7ed3aa6df63cd03a3c905185b615202bffcc95d302ad6","observation_id":"ba730ba1-4004-4622-9774-40dc03383199","resolution":{"observed_at":"2026-08-06T22:05:11.459218Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T22:05:13.590909Z","title":"Available: https://openreview.net/forum? id=shpkpVXzo3h","venue":null,"work_id":"42c2148b-f066-47cf-8779-b822304437db","year":null},"citing_paper":{"arxiv_id":"2506.22776","last_updated":"2025-06-28T06:32:25Z","snapshot_observed_at":"2026-08-09T13:44:37.089885Z","submitted_at":"2025-06-28T06:32:25Z","title":"Smaller = Weaker? Benchmarking Robustness of Quantized LLMs in Code Generation","version":1},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-06T22:05:08.983448Z"},"links":{"citing_paper":"/paper/2506.22776"},"observation_digest":"sha256:afe1dd60887b53104c5094336fbd683aa47ce5aead466585ac044250147e9a33","observation_id":"92e178da-1ee0-4400-94ff-7fe03c060edc","resolution":{"observed_at":"2026-08-06T22:05:13.640991Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.22776","last_updated":"2025-06-28T06:32:25Z","latest_version":1,"primary_category":"cs.SE","snapshot_observed_at":"2026-08-09T13:44:37.089885Z","submitted_at":"2025-06-28T06:32:25Z","title":"Smaller = Weaker? Benchmarking Robustness of Quantized LLMs in Code Generation"},"reference_resolution":{"displayed":66,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":18,"verified_exact":2,"verified_fuzzy":46},"total_outbound_references":66},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 66 of 66 outbound references and 4 inbound Pith citation observations for arXiv:2506.22776."}