{"as_of":"2026-08-13T01:15:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:64c6bb40552ce2aeb09b42e2dc1d53270d9ed8ec5f5f10a3c1a893b927ef0139","coverage":[{"denominator":65,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":65,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T12:53:58.558058Z","state":"measured"},{"denominator":67,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":67,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-19T00:01:42.228190Z","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-05-19T00:01:55.825781Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2412.13737","last_updated":"2024-12-18T11:14:30Z","snapshot_observed_at":"2026-08-12T12:15:03.928867Z","submitted_at":"2024-12-18T11:14:30Z","title":"On the Compression of Language Models for Code: An Empirical Study on CodeBERT","version":1},"cited_work":{"arxiv_id":"2412.13737","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2412.13737","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2412.13737 (2024)","venue":null,"work_id":"b60a4dac-d9d8-4918-a9f0-e19cf4438519","year":2024},"citing_paper":{"arxiv_id":"2508.03949","last_updated":"2026-04-14T17:16:30Z","snapshot_observed_at":"2026-08-04T01:34:07.529496Z","submitted_at":"2025-08-05T22:32:32Z","title":"Model Compression vs. Adversarial Robustness: An Empirical Study on Language Models for Code","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-19T00:01:42.228190Z"},"links":{"cited_paper":"/paper/2412.13737","citing_paper":"/paper/2508.03949"},"observation_digest":"sha256:36bd732ee6855c05e4b12c32c64e5a9c423e5c7ab6626fa53727d87a93c59334","observation_id":"a7ece7bc-e490-4631-9b12-352e7d5ce7eb","resolution":{"observed_at":"2026-05-19T00:01:55.828951Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.13737","last_updated":"2024-12-18T11:14:30Z","snapshot_observed_at":"2026-08-12T12:15:03.928867Z","submitted_at":"2024-12-18T11:14:30Z","title":"On the Compression of Language Models for Code: An Empirical Study on CodeBERT","version":1},"cited_work":{"arxiv_id":"2412.13737","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2412.13737","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2412.13737 (2024)","venue":null,"work_id":"b60a4dac-d9d8-4918-a9f0-e19cf4438519","year":2024},"citing_paper":{"arxiv_id":"2511.05476","last_updated":"2026-05-11T16:45:40Z","snapshot_observed_at":"2026-08-12T12:32:44.776406Z","submitted_at":"2025-11-07T18:38:54Z","title":"A Metamorphic Testing Perspective on Knowledge Distillation for Language Models of Code: Does the Student Deeply Mimic the Teacher?","version":5},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-17T23:45:54.490984Z"},"links":{"cited_paper":"/paper/2412.13737","citing_paper":"/paper/2511.05476"},"observation_digest":"sha256:d4dda2ac48be233659af6eb57b08a5e39ac7a94bc90e00d8a09c7c6d418961e6","observation_id":"cbdc79fa-84a9-4ded-b543-71a66854f151","resolution":{"observed_at":"2026-05-17T23:50:31.905550Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2412.13737/citation-record","integrity":"/paper/2412.13737/integrity","json":"/paper/2412.13737/citation-record.json","paper":"/paper/2412.13737"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2403.18624","last_updated":"2024-07-10T05:26:17Z","snapshot_observed_at":"2026-08-13T00:43:47.034389Z","submitted_at":"2024-03-27T14:34:29Z","title":"Vulnerability Detection with Code Language Models: How Far Are We?","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.18624","snapshot_observed_at":"2026-08-11T12:53:58.282808Z","title":"Vulnerability detection with code language models: How far are we?","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.13737","last_updated":"2024-12-18T11:14:30Z","snapshot_observed_at":"2026-08-12T12:15:03.928867Z","submitted_at":"2024-12-18T11:14:30Z","title":"On the Compression of Language Models for Code: An Empirical Study on CodeBERT","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-11T12:53:58.282808Z"},"links":{"cited_paper":"/paper/2403.18624","citing_paper":"/paper/2412.13737"},"observation_digest":"sha256:7dbec47ad977569f34efe7eb1d55f99ec5262a16580c0a91ffda03725de6e5ad","observation_id":"c2455cf9-309e-406d-a516-80ca50386ce0","resolution":{"observed_at":"2026-08-11T12:53:58.282808Z","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-11T12:53:58.287902Z","title":"When neural code completion models size up the situation: Attaining cheaper and faster completion through dynamic model inference,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.13737","last_updated":"2024-12-18T11:14:30Z","snapshot_observed_at":"2026-08-12T12:15:03.928867Z","submitted_at":"2024-12-18T11:14:30Z","title":"On the Compression of Language Models for Code: An Empirical Study on CodeBERT","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-11T12:53:58.287902Z"},"links":{"citing_paper":"/paper/2412.13737"},"observation_digest":"sha256:e4e0727a28c402027b85367b8a0a0aa72f6484356792f5f5019ec09ee406c8ad","observation_id":"c7ecfc24-c462-44d8-bb38-5dbb8a14a472","resolution":{"observed_at":"2026-08-11T12:53:58.287902Z","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-11T12:53:58.292093Z","title":"Code search is all you need? improving code suggestions with code search,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.13737","last_updated":"2024-12-18T11:14:30Z","snapshot_observed_at":"2026-08-12T12:15:03.928867Z","submitted_at":"2024-12-18T11:14:30Z","title":"On the Compression of Language Models for Code: An Empirical Study on CodeBERT","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-11T12:53:58.292093Z"},"links":{"citing_paper":"/paper/2412.13737"},"observation_digest":"sha256:1d32c6639a1e49f15d09a0a8712178ba8e1a53962687975886261f727f56de3d","observation_id":"8b3803c4-64bf-44af-a350-17be321e0458","resolution":{"observed_at":"2026-08-11T12:53:58.292093Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2308.10620","last_updated":"2024-04-10T08:41:22Z","snapshot_observed_at":"2026-08-12T08:47:12.692700Z","submitted_at":"2023-08-21T10:37:49Z","title":"Large Language Models for Software Engineering: A Systematic Literature Review","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.10620","snapshot_observed_at":"2026-08-11T12:53:58.296181Z","title":"Large language models for software engineering: A systematic literature review,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.13737","last_updated":"2024-12-18T11:14:30Z","snapshot_observed_at":"2026-08-12T12:15:03.928867Z","submitted_at":"2024-12-18T11:14:30Z","title":"On the Compression of Language Models for Code: An Empirical Study on CodeBERT","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-11T12:53:58.296181Z"},"links":{"cited_paper":"/paper/2308.10620","citing_paper":"/paper/2412.13737"},"observation_digest":"sha256:fbd72b05898cf404e6bf6d2a924a5849b29ca632a0f057ef9f68a1d30d3228dd","observation_id":"d46ee9ab-d462-46c6-808c-a5ab22df9f69","resolution":{"observed_at":"2026-08-11T12:53:58.296181Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1907.10597","last_updated":"2019-08-13T20:09:57Z","snapshot_observed_at":"2026-07-06T08:09:56.848263Z","submitted_at":"2019-07-22T19:36:18Z","title":"Green AI","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1907.10597","snapshot_observed_at":"2026-08-11T12:53:58.301503Z","title":"Green ai,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2412.13737","last_updated":"2024-12-18T11:14:30Z","snapshot_observed_at":"2026-08-12T12:15:03.928867Z","submitted_at":"2024-12-18T11:14:30Z","title":"On the Compression of Language Models for Code: An Empirical Study on CodeBERT","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-11T12:53:58.301503Z"},"links":{"cited_paper":"/paper/1907.10597","citing_paper":"/paper/2412.13737"},"observation_digest":"sha256:73674b008d9e4193e2410d3da8a9c8a6f430b10ed903cd25499631f70e8e4402","observation_id":"7f3a86ce-2b66-4a08-ba29-94541eaafcef","resolution":{"observed_at":"2026-08-11T12:53:58.301503Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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-11T12:53:58.305803Z","title":"Distilling the knowledge in a neural network,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2412.13737","last_updated":"2024-12-18T11:14:30Z","snapshot_observed_at":"2026-08-12T12:15:03.928867Z","submitted_at":"2024-12-18T11:14:30Z","title":"On the Compression of Language Models for Code: An Empirical Study on CodeBERT","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-11T12:53:58.305803Z"},"links":{"cited_paper":"/paper/1503.02531","citing_paper":"/paper/2412.13737"},"observation_digest":"sha256:40fefd62b43be6f05939388baca1e73c3c9c64e687d4dc04a1f87dd14985ae22","observation_id":"8a14d1cd-7bd2-44e9-913c-7740ebb3381b","resolution":{"observed_at":"2026-08-11T12:53:58.305803Z","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-11T12:54:00.572631Z","title":"Q8bert: Quantized 8bit bert,","venue":null,"work_id":"12a78d8e-9e18-4a20-a106-98b3a81cdd35","year":2019},"citing_paper":{"arxiv_id":"2412.13737","last_updated":"2024-12-18T11:14:30Z","snapshot_observed_at":"2026-08-12T12:15:03.928867Z","submitted_at":"2024-12-18T11:14:30Z","title":"On the Compression of Language Models for Code: An Empirical Study on CodeBERT","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-11T12:53:58.310290Z"},"links":{"citing_paper":"/paper/2412.13737"},"observation_digest":"sha256:24f5d6447999f5b3ca055c1eb62de4129b1d7eedb6bbc603a7ac1f8b31d9553d","observation_id":"e09e6b3c-6b3a-4e47-aab4-fbd9074503ee","resolution":{"observed_at":"2026-08-11T12:54:00.576690Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T12:53:58.317363Z","title":"Movement pruning: adaptive sparsity by fine-tuning,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2412.13737","last_updated":"2024-12-18T11:14:30Z","snapshot_observed_at":"2026-08-12T12:15:03.928867Z","submitted_at":"2024-12-18T11:14:30Z","title":"On the Compression of Language Models for Code: An Empirical Study on CodeBERT","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-11T12:53:58.317363Z"},"links":{"citing_paper":"/paper/2412.13737"},"observation_digest":"sha256:75bdf68d6bf2aa98ede480899b5e839c6a6f838d87cf43e88f170421cf331cc1","observation_id":"753816b8-59ba-4f4d-b58e-8b94dd7d3a68","resolution":{"observed_at":"2026-08-11T12:53:58.317363Z","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-11T12:53:58.322110Z","title":"Compressing pre-trained models of code into 3 mb,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.13737","last_updated":"2024-12-18T11:14:30Z","snapshot_observed_at":"2026-08-12T12:15:03.928867Z","submitted_at":"2024-12-18T11:14:30Z","title":"On the Compression of Language Models for Code: An Empirical Study on CodeBERT","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-11T12:53:58.322110Z"},"links":{"citing_paper":"/paper/2412.13737"},"observation_digest":"sha256:12fd625d1c2e3038ad4140d77a493d3e87c98f2218e96cf149e91308838bafdd","observation_id":"cb7d36ad-a73f-4cb9-9e6e-f20a9d3a6b86","resolution":{"observed_at":"2026-08-11T12:53:58.322110Z","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-11T12:53:58.326383Z","title":"Greening large language models of code,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.13737","last_updated":"2024-12-18T11:14:30Z","snapshot_observed_at":"2026-08-12T12:15:03.928867Z","submitted_at":"2024-12-18T11:14:30Z","title":"On the Compression of Language Models for Code: An Empirical Study on CodeBERT","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-11T12:53:58.326383Z"},"links":{"citing_paper":"/paper/2412.13737"},"observation_digest":"sha256:e5cf75809db5d096ad437a97d868eb0e2d82f2fd3a2d9b10791df6800b537fd9","observation_id":"a035d1c4-1ab7-4b73-9588-5f2f12fd79f4","resolution":{"observed_at":"2026-08-11T12:53:58.326383Z","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-11T12:53:58.331421Z","title":"Towards greener yet powerful code generation via quantization: An empirical study,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.13737","last_updated":"2024-12-18T11:14:30Z","snapshot_observed_at":"2026-08-12T12:15:03.928867Z","submitted_at":"2024-12-18T11:14:30Z","title":"On the Compression of Language Models for Code: An Empirical Study on CodeBERT","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-11T12:53:58.331421Z"},"links":{"citing_paper":"/paper/2412.13737"},"observation_digest":"sha256:feb0ced6bcde458069efa0d79aaf50b0861725e89dc8ffb1c68fcb4e95919e7a","observation_id":"038fc14a-f56c-4821-b7dd-6a689cbc23b8","resolution":{"observed_at":"2026-08-11T12:53:58.331421Z","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-11T12:54:00.550228Z","title":"CodeBERT: A pre-trained model for programming and natural languages,","venue":null,"work_id":"02ab8486-ee23-40b1-b00e-f50529bf3254","year":2020},"citing_paper":{"arxiv_id":"2412.13737","last_updated":"2024-12-18T11:14:30Z","snapshot_observed_at":"2026-08-12T12:15:03.928867Z","submitted_at":"2024-12-18T11:14:30Z","title":"On the Compression of Language Models for Code: An Empirical Study on CodeBERT","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-11T12:53:58.335937Z"},"links":{"citing_paper":"/paper/2412.13737"},"observation_digest":"sha256:1dce99aa99f1e53ac72f2c886fd538c3b75385e1f41aecc31b2b2e34d5c2c668","observation_id":"341f6f43-286b-49ba-876d-5d8121b9fec9","resolution":{"observed_at":"2026-08-11T12:54:00.554585Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T12:54:00.537267Z","title":"On the compression of language models for code: An empirical study on codebert,","venue":null,"work_id":"5d4c3efa-5636-4579-8a88-0189e295d837","year":null},"citing_paper":{"arxiv_id":"2412.13737","last_updated":"2024-12-18T11:14:30Z","snapshot_observed_at":"2026-08-12T12:15:03.928867Z","submitted_at":"2024-12-18T11:14:30Z","title":"On the Compression of Language Models for Code: An Empirical Study on CodeBERT","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-11T12:53:58.341233Z"},"links":{"citing_paper":"/paper/2412.13737"},"observation_digest":"sha256:ff69f61f5ac03f08587758c5a4077a4acac4153b89b6757d70a6750a01f8d80d","observation_id":"abb3af8b-a26d-426e-911f-966e8e53d416","resolution":{"observed_at":"2026-08-11T12:54:00.541657Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T12:54:00.522895Z","title":"Attention is all you need,","venue":null,"work_id":"a242be59-6c7b-4a3c-b503-701ff7b236f8","year":2017},"citing_paper":{"arxiv_id":"2412.13737","last_updated":"2024-12-18T11:14:30Z","snapshot_observed_at":"2026-08-12T12:15:03.928867Z","submitted_at":"2024-12-18T11:14:30Z","title":"On the Compression of Language Models for Code: An Empirical Study on CodeBERT","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-11T12:53:58.350306Z"},"links":{"citing_paper":"/paper/2412.13737"},"observation_digest":"sha256:387a8893d238351827c3c5a96dab76fc6f94cf9bac681822e24939d3f2941a71","observation_id":"593526d5-2e95-4dad-919c-99eb9c506b1d","resolution":{"observed_at":"2026-08-11T12:54:00.527251Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T12:54:00.510026Z","title":"Language models are unsupervised multitask learners,","venue":null,"work_id":"9684d884-3244-40bb-93f2-16a5bf26e59c","year":2019},"citing_paper":{"arxiv_id":"2412.13737","last_updated":"2024-12-18T11:14:30Z","snapshot_observed_at":"2026-08-12T12:15:03.928867Z","submitted_at":"2024-12-18T11:14:30Z","title":"On the Compression of Language Models for Code: An Empirical Study on CodeBERT","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-11T12:53:58.354456Z"},"links":{"citing_paper":"/paper/2412.13737"},"observation_digest":"sha256:eed867155f935edaf4ed92c194ac18b73bdd6b1b9088b78773d474345e4b32a9","observation_id":"6f5138c0-cf67-4ce6-b285-5e869e114520","resolution":{"observed_at":"2026-08-11T12:54:00.514436Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1910.10683","last_updated":"2023-09-19T15:14:48Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2019-10-23T17:37:36Z","title":"Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformer","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1910.10683","snapshot_observed_at":"2026-08-11T12:53:58.359144Z","title":"Exploring the limits of transfer learning with a unified text-to-text transformer,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.13737","last_updated":"2024-12-18T11:14:30Z","snapshot_observed_at":"2026-08-12T12:15:03.928867Z","submitted_at":"2024-12-18T11:14:30Z","title":"On the Compression of Language Models for Code: An Empirical Study on CodeBERT","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-11T12:53:58.359144Z"},"links":{"cited_paper":"/paper/1910.10683","citing_paper":"/paper/2412.13737"},"observation_digest":"sha256:75787b751603470b91156b8a5eeb645a71d06ebcb751ce66fd82674529be7478","observation_id":"55696f82-e0db-43dd-b5d0-3e0af0cf9295","resolution":{"observed_at":"2026-08-11T12:53:58.359144Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1810.04805","last_updated":"2019-05-24T20:37:26Z","snapshot_observed_at":"2026-07-30T09:12:38.100527Z","submitted_at":"2018-10-11T00:50:01Z","title":"BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1810.04805","snapshot_observed_at":"2026-08-11T12:53:58.364796Z","title":"Openai codex,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2412.13737","last_updated":"2024-12-18T11:14:30Z","snapshot_observed_at":"2026-08-12T12:15:03.928867Z","submitted_at":"2024-12-18T11:14:30Z","title":"On the Compression of Language Models for Code: An Empirical Study on CodeBERT","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-11T12:53:58.364796Z"},"links":{"cited_paper":"/paper/1810.04805","citing_paper":"/paper/2412.13737"},"observation_digest":"sha256:11f174a92c2d36e40e870909312fd6120dbbf2558f5e399c31ee1ae6a0c46ef7","observation_id":"70f4f395-95a0-41c0-87ff-dbdfd64a8a06","resolution":{"observed_at":"2026-08-11T12:53:58.364796Z","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-11T12:54:00.497325Z","title":"CodeT5+: Open code large language models for code understanding and generation,","venue":null,"work_id":"ce6babb9-1e6f-4f47-89e6-078004e09c61","year":2023},"citing_paper":{"arxiv_id":"2412.13737","last_updated":"2024-12-18T11:14:30Z","snapshot_observed_at":"2026-08-12T12:15:03.928867Z","submitted_at":"2024-12-18T11:14:30Z","title":"On the Compression of Language Models for Code: An Empirical Study on CodeBERT","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-11T12:53:58.371232Z"},"links":{"citing_paper":"/paper/2412.13737"},"observation_digest":"sha256:93c12c5be23b8f7d090de5d60ce4363f1e1754f1d669ff44708500c402a4f266","observation_id":"76762ff5-41fe-4384-8a60-0b65a35ef404","resolution":{"observed_at":"2026-08-11T12:54:00.501544Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T12:53:58.376130Z","title":"Evaluating large language models trained on code,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.13737","last_updated":"2024-12-18T11:14:30Z","snapshot_observed_at":"2026-08-12T12:15:03.928867Z","submitted_at":"2024-12-18T11:14:30Z","title":"On the Compression of Language Models for Code: An Empirical Study on CodeBERT","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-11T12:53:58.376130Z"},"links":{"citing_paper":"/paper/2412.13737"},"observation_digest":"sha256:67a9aebe8d622401254183e77899ff94acff51afabb83088ef399ecf7ce23f50","observation_id":"f68a963d-da9f-4799-b257-ced534676849","resolution":{"observed_at":"2026-08-11T12:53:58.376130Z","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-11T12:54:00.472009Z","title":"Assemble foundation models for automatic code summarization,","venue":null,"work_id":"d8a2e35a-3b8b-49f2-ae5c-ae2b101c69cc","year":2022},"citing_paper":{"arxiv_id":"2412.13737","last_updated":"2024-12-18T11:14:30Z","snapshot_observed_at":"2026-08-12T12:15:03.928867Z","submitted_at":"2024-12-18T11:14:30Z","title":"On the Compression of Language Models for Code: An Empirical Study on CodeBERT","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-11T12:53:58.380180Z"},"links":{"citing_paper":"/paper/2412.13737"},"observation_digest":"sha256:996a8eccdbc62aef428f66d0341b11a21fbc0092b6922317bbe62595be9fe072","observation_id":"9eefc90f-e0df-492e-b5fa-0c513438e02e","resolution":{"observed_at":"2026-08-11T12:54:00.476284Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T12:54:00.458628Z","title":"Assessing generalizability of codebert,","venue":null,"work_id":"261ce9cc-1d17-4a87-bb77-1b22cd01d0ed","year":2021},"citing_paper":{"arxiv_id":"2412.13737","last_updated":"2024-12-18T11:14:30Z","snapshot_observed_at":"2026-08-12T12:15:03.928867Z","submitted_at":"2024-12-18T11:14:30Z","title":"On the Compression of Language Models for Code: An Empirical Study on CodeBERT","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-11T12:53:58.388151Z"},"links":{"citing_paper":"/paper/2412.13737"},"observation_digest":"sha256:46e66e210c85174f0c0c81262417ac81ae62033a8e22ae1d17b6aa0c47bfbb98","observation_id":"ab40e0e3-b260-4127-a4d2-7ea31f3ff8e6","resolution":{"observed_at":"2026-08-11T12:54:00.462945Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T12:54:00.445212Z","title":"Optimal brain damage,","venue":null,"work_id":"8df2e9e4-12ad-4ebb-b691-9d0c109ca058","year":1989},"citing_paper":{"arxiv_id":"2412.13737","last_updated":"2024-12-18T11:14:30Z","snapshot_observed_at":"2026-08-12T12:15:03.928867Z","submitted_at":"2024-12-18T11:14:30Z","title":"On the Compression of Language Models for Code: An Empirical Study on CodeBERT","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-11T12:53:58.396907Z"},"links":{"citing_paper":"/paper/2412.13737"},"observation_digest":"sha256:10a48a592c1feb43bc480dc68594b0489758730f5a2e4d3dc45ecfa7ef6f0afb","observation_id":"1f6dbad3-5ba2-4e0f-8bff-31f2036694c7","resolution":{"observed_at":"2026-08-11T12:54:00.449614Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T12:54:00.431790Z","title":"Pruning filters for efficient convnets,","venue":null,"work_id":"d73e0a10-f31c-42a5-a53a-d701d702361d","year":null},"citing_paper":{"arxiv_id":"2412.13737","last_updated":"2024-12-18T11:14:30Z","snapshot_observed_at":"2026-08-12T12:15:03.928867Z","submitted_at":"2024-12-18T11:14:30Z","title":"On the Compression of Language Models for Code: An Empirical Study on CodeBERT","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-11T12:53:58.401007Z"},"links":{"citing_paper":"/paper/2412.13737"},"observation_digest":"sha256:7c675c6476e394e5147bfe65c8eb07b3faabb4948765c45804337e0f135c7bda","observation_id":"887a4111-d1d9-4ecd-a647-3d49c8ed700d","resolution":{"observed_at":"2026-08-11T12:54:00.436159Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1608.04493","last_updated":"2016-11-10T00:17:25Z","snapshot_observed_at":"2026-08-03T18:28:06.557970Z","submitted_at":"2016-08-16T06:23:05Z","title":"Dynamic Network Surgery for Efficient DNNs","version":2},"cited_work":{"arxiv_id":"1608.04493","doi":null,"metadata_source":"pith","pith_arxiv_id":"1608.04493","snapshot_observed_at":"2026-08-11T12:53:59.474268Z","title":"Dynamic Network Surgery for Efficient DNNs","venue":"cs.NE","work_id":"2591dfe3-226c-4535-8e6f-7157bc412e01","year":2016},"citing_paper":{"arxiv_id":"2412.13737","last_updated":"2024-12-18T11:14:30Z","snapshot_observed_at":"2026-08-12T12:15:03.928867Z","submitted_at":"2024-12-18T11:14:30Z","title":"On the Compression of Language Models for Code: An Empirical Study on CodeBERT","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-11T12:53:58.409096Z"},"links":{"cited_paper":"/paper/1608.04493","citing_paper":"/paper/2412.13737"},"observation_digest":"sha256:33e07ca4ceffeccf8b5b54eb2fc78b3b623951c9062e16f720e5724bba21a928","observation_id":"320d121c-e9d7-4c0a-bfc3-4471265442f9","resolution":{"observed_at":"2026-08-11T12:53:59.479314Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1611.06440","last_updated":"2017-06-08T19:53:26Z","snapshot_observed_at":"2026-08-07T07:29:29.524604Z","submitted_at":"2016-11-19T22:48:30Z","title":"Pruning Convolutional Neural Networks for Resource Efficient Inference","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1611.06440","snapshot_observed_at":"2026-08-11T12:53:58.412887Z","title":"Pruning convolutional neural networks for resource efficient inference,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2412.13737","last_updated":"2024-12-18T11:14:30Z","snapshot_observed_at":"2026-08-12T12:15:03.928867Z","submitted_at":"2024-12-18T11:14:30Z","title":"On the Compression of Language Models for Code: An Empirical Study on CodeBERT","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-11T12:53:58.412887Z"},"links":{"cited_paper":"/paper/1611.06440","citing_paper":"/paper/2412.13737"},"observation_digest":"sha256:b8709a736c5403e0c3c980bb8045fa3712cbccb418e040a6c5bcd1eccd48ba8e","observation_id":"2872e01e-0f41-4754-87e3-d4b7ca29e739","resolution":{"observed_at":"2026-08-11T12:53:58.412887Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1902.09574","last_updated":"2019-02-25T19:18:40Z","snapshot_observed_at":"2026-08-06T16:38:23.884750Z","submitted_at":"2019-02-25T19:18:40Z","title":"The State of Sparsity in Deep Neural Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1902.09574","snapshot_observed_at":"2026-08-11T12:53:58.417627Z","title":"The state of sparsity in deep neural networks,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2412.13737","last_updated":"2024-12-18T11:14:30Z","snapshot_observed_at":"2026-08-12T12:15:03.928867Z","submitted_at":"2024-12-18T11:14:30Z","title":"On the Compression of Language Models for Code: An Empirical Study on CodeBERT","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-11T12:53:58.417627Z"},"links":{"cited_paper":"/paper/1902.09574","citing_paper":"/paper/2412.13737"},"observation_digest":"sha256:c79f813120a1a2a8a52afdad256ec3a8a5b44156536910952ce5056953a52ab8","observation_id":"970b5812-e902-4e64-9eaf-f0081296158f","resolution":{"observed_at":"2026-08-11T12:53:58.417627Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2009.08366","last_updated":"2021-09-13T05:48:51Z","snapshot_observed_at":"2026-07-06T09:56:32.308108Z","submitted_at":"2020-09-17T15:25:56Z","title":"GraphCodeBERT: Pre-training Code Representations with Data Flow","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2009.08366","snapshot_observed_at":"2026-08-11T12:53:58.422047Z","title":"Graphcodebert: Pre-training code representations with data flow,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.13737","last_updated":"2024-12-18T11:14:30Z","snapshot_observed_at":"2026-08-12T12:15:03.928867Z","submitted_at":"2024-12-18T11:14:30Z","title":"On the Compression of Language Models for Code: An Empirical Study on CodeBERT","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-11T12:53:58.422047Z"},"links":{"cited_paper":"/paper/2009.08366","citing_paper":"/paper/2412.13737"},"observation_digest":"sha256:ed638f4e83962e7c8bdb4561c23c53607fe4c2a0e43e18c12a9da61f29c188a0","observation_id":"6e2e1221-2449-4c0b-8795-adfa003f53df","resolution":{"observed_at":"2026-08-11T12:53:58.422047Z","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-11T12:54:00.403836Z","title":"Software defect prediction via transformer,","venue":null,"work_id":"4e2768de-4bea-4aef-8132-965cb27fb3be","year":2020},"citing_paper":{"arxiv_id":"2412.13737","last_updated":"2024-12-18T11:14:30Z","snapshot_observed_at":"2026-08-12T12:15:03.928867Z","submitted_at":"2024-12-18T11:14:30Z","title":"On the Compression of Language Models for Code: An Empirical Study on CodeBERT","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-11T12:53:58.426205Z"},"links":{"citing_paper":"/paper/2412.13737"},"observation_digest":"sha256:df99941585af829d9271da76fcc2433f6198c0dd19d20d8982604b9c0d146f05","observation_id":"2dbfc7eb-1916-46a7-ab02-f0e7a6f14f3d","resolution":{"observed_at":"2026-08-11T12:54:00.408536Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2003.03238","last_updated":"2020-03-09T11:42:16Z","snapshot_observed_at":"2026-08-05T18:33:53.359818Z","submitted_at":"2020-03-06T14:33:36Z","title":"TranS^3: A Transformer-based Framework for Unifying Code Summarization and Code Search","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2003.03238","snapshot_observed_at":"2026-08-11T12:53:58.430237Z","title":"Transˆ 3: A transformer-based framework for unifying code summarization and code search,","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2412.13737","last_updated":"2024-12-18T11:14:30Z","snapshot_observed_at":"2026-08-12T12:15:03.928867Z","submitted_at":"2024-12-18T11:14:30Z","title":"On the Compression of Language Models for Code: An Empirical Study on CodeBERT","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-11T12:53:58.430237Z"},"links":{"cited_paper":"/paper/2003.03238","citing_paper":"/paper/2412.13737"},"observation_digest":"sha256:50ef361171cdc7fce94a8e5272b11f0b12b26f7478916a22ddc0d314852c1772","observation_id":"987572d4-b363-458f-b5f3-cd2f89db8999","resolution":{"observed_at":"2026-08-11T12:53:58.430237Z","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-11T12:53:58.435691Z","title":"A coefficient of agreement as a measure of thematic classification accuracy","venue":null,"work_id":null,"year":1986},"citing_paper":{"arxiv_id":"2412.13737","last_updated":"2024-12-18T11:14:30Z","snapshot_observed_at":"2026-08-12T12:15:03.928867Z","submitted_at":"2024-12-18T11:14:30Z","title":"On the Compression of Language Models for Code: An Empirical Study on CodeBERT","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-11T12:53:58.435691Z"},"links":{"citing_paper":"/paper/2412.13737"},"observation_digest":"sha256:759439c121c06b24af6812ca638929cc9827f9032e282ee025810af53aa11e9c","observation_id":"47819a14-d83a-45d2-9173-5d07eca2e617","resolution":{"observed_at":"2026-08-11T12:53:58.435691Z","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-11T12:53:58.439095Z","title":"Metrics for evaluating 3D medical image segmentation: analysis, selection, and tool,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2412.13737","last_updated":"2024-12-18T11:14:30Z","snapshot_observed_at":"2026-08-12T12:15:03.928867Z","submitted_at":"2024-12-18T11:14:30Z","title":"On the Compression of Language Models for Code: An Empirical Study on CodeBERT","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-11T12:53:58.439095Z"},"links":{"citing_paper":"/paper/2412.13737"},"observation_digest":"sha256:da49bb3ffdf6b7aa7be09e56e3c2807f40fb6e5538829d6360e9a7e42e1d2cd8","observation_id":"f5b86270-3b75-4363-a5d2-b54c7dd4f8c0","resolution":{"observed_at":"2026-08-11T12:53:58.439095Z","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-11T12:53:58.443052Z","title":"The advantages of the matthews correlation coefficient (mcc) over f1 score and accuracy in binary classification evaluation,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2412.13737","last_updated":"2024-12-18T11:14:30Z","snapshot_observed_at":"2026-08-12T12:15:03.928867Z","submitted_at":"2024-12-18T11:14:30Z","title":"On the Compression of Language Models for Code: An Empirical Study on CodeBERT","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-11T12:53:58.443052Z"},"links":{"citing_paper":"/paper/2412.13737"},"observation_digest":"sha256:caf5da33cbc1ae5f91a5b9134caa836f4120d99823832a32ac635f07984e4b2d","observation_id":"0cbac5f8-f358-4a2c-8594-8766ccf8903a","resolution":{"observed_at":"2026-08-11T12:53:58.443052Z","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-11T12:54:00.382152Z","title":"Bleu: a Method for Automatic Evaluation of Machine Translation,","venue":null,"work_id":"f3b04c96-1d0e-4338-b50d-9c3ea8fa4f7b","year":2002},"citing_paper":{"arxiv_id":"2412.13737","last_updated":"2024-12-18T11:14:30Z","snapshot_observed_at":"2026-08-12T12:15:03.928867Z","submitted_at":"2024-12-18T11:14:30Z","title":"On the Compression of Language Models for Code: An Empirical Study on CodeBERT","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-11T12:53:58.446396Z"},"links":{"citing_paper":"/paper/2412.13737"},"observation_digest":"sha256:a000f1c6cde966cb78c3575176d74fb23b6223ea478e187bd367474243dc2214","observation_id":"6942e6df-5b84-4284-a4f5-624d21529336","resolution":{"observed_at":"2026-08-11T12:54:00.386654Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1904.09675","last_updated":"2020-02-24T18:59:28Z","snapshot_observed_at":"2026-07-29T15:42:51.774083Z","submitted_at":"2019-04-21T23:08:53Z","title":"BERTScore: Evaluating Text Generation with BERT","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1904.09675","snapshot_observed_at":"2026-08-11T12:53:58.449982Z","title":"Bertscore: Evaluating text generation with bert,","venue":null,"work_id":null,"year":1904},"citing_paper":{"arxiv_id":"2412.13737","last_updated":"2024-12-18T11:14:30Z","snapshot_observed_at":"2026-08-12T12:15:03.928867Z","submitted_at":"2024-12-18T11:14:30Z","title":"On the Compression of Language Models for Code: An Empirical Study on CodeBERT","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-11T12:53:58.449982Z"},"links":{"cited_paper":"/paper/1904.09675","citing_paper":"/paper/2412.13737"},"observation_digest":"sha256:80f7a494713c0653196ec6d9299d19583cb5ab33da790898ec73913bc9122bf9","observation_id":"460f0f8e-e056-4e7e-ad51-2edcc9c8ce92","resolution":{"observed_at":"2026-08-11T12:53:58.449982Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2312.15475","last_updated":"2023-12-24T13:12:39Z","snapshot_observed_at":"2026-08-12T18:04:29.022865Z","submitted_at":"2023-12-24T13:12:39Z","title":"Evaluating Code Summarization Techniques: A New Metric and an Empirical Characterization","version":1},"cited_work":{"arxiv_id":"2312.15475","doi":null,"metadata_source":"pith","pith_arxiv_id":"2312.15475","snapshot_observed_at":"2026-08-11T12:53:59.312180Z","title":"Evaluating Code Summarization Techniques: A New Metric and an Empirical Characterization","venue":"cs.SE","work_id":"99a388c8-59a9-4583-af67-f840404fe9db","year":2023},"citing_paper":{"arxiv_id":"2412.13737","last_updated":"2024-12-18T11:14:30Z","snapshot_observed_at":"2026-08-12T12:15:03.928867Z","submitted_at":"2024-12-18T11:14:30Z","title":"On the Compression of Language Models for Code: An Empirical Study on CodeBERT","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-11T12:53:58.454159Z"},"links":{"cited_paper":"/paper/2312.15475","citing_paper":"/paper/2412.13737"},"observation_digest":"sha256:b5db53a0dae68840b8c86b5fc300079c1b1d5edfe2c398da23abc6d76f783647","observation_id":"4c6b6c18-d900-43c6-9bd4-37a058ea8ca0","resolution":{"observed_at":"2026-08-11T12:53:59.317616Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T12:53:58.457876Z","title":"Expected reciprocal rank for graded relevance,","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2412.13737","last_updated":"2024-12-18T11:14:30Z","snapshot_observed_at":"2026-08-12T12:15:03.928867Z","submitted_at":"2024-12-18T11:14:30Z","title":"On the Compression of Language Models for Code: An Empirical Study on CodeBERT","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-11T12:53:58.457876Z"},"links":{"citing_paper":"/paper/2412.13737"},"observation_digest":"sha256:f163c6a9635009a5ad012c7cc14d1eb7af8dd0e857f427570acc89383beb0374","observation_id":"acf27b70-d1fb-4ddb-99d1-f6325e2b4bfc","resolution":{"observed_at":"2026-08-11T12:53:58.457876Z","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-11T12:54:00.368408Z","title":"Devign: Effective vulnerability identi- fication by learning comprehensive program semantics via graph neural networks,","venue":null,"work_id":"05f578aa-dd78-4736-b9e0-2d6c6f02d112","year":2019},"citing_paper":{"arxiv_id":"2412.13737","last_updated":"2024-12-18T11:14:30Z","snapshot_observed_at":"2026-08-12T12:15:03.928867Z","submitted_at":"2024-12-18T11:14:30Z","title":"On the Compression of Language Models for Code: An Empirical Study on CodeBERT","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-11T12:53:58.461669Z"},"links":{"citing_paper":"/paper/2412.13737"},"observation_digest":"sha256:a71dfd5f640b7b5f7b7b9bc45fe925a8279961f4be2a9f028656443502d820f6","observation_id":"50798bc2-0a4e-474c-9135-051831b002ec","resolution":{"observed_at":"2026-08-11T12:54:00.373331Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T12:53:58.313853Z","title":"Available: https://doi.ieeecomputersociety.org/10.1109/ EMC2-NIPS53020.2019.00016","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2412.13737","last_updated":"2024-12-18T11:14:30Z","snapshot_observed_at":"2026-08-12T12:15:03.928867Z","submitted_at":"2024-12-18T11:14:30Z","title":"On the Compression of Language Models for Code: An Empirical Study on CodeBERT","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-11T12:53:58.313853Z"},"links":{"citing_paper":"/paper/2412.13737"},"observation_digest":"sha256:b3d152a7135c1d4a4937183b0d5b3ca611d53044f246dbfb3f44e17b090f779b","observation_id":"840fb041-545e-426e-b093-2e6991ab0adb","resolution":{"observed_at":"2026-08-11T12:53:58.313853Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2102.04664","last_updated":"2021-03-16T08:28:37Z","snapshot_observed_at":"2026-07-06T10:39:42.676631Z","submitted_at":"2021-02-09T06:16:25Z","title":"CodeXGLUE: A Machine Learning Benchmark Dataset for Code Understanding and Generation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2102.04664","snapshot_observed_at":"2026-08-11T12:53:58.469942Z","title":"Codexglue: A machine learning benchmark dataset for code understanding and generation,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.13737","last_updated":"2024-12-18T11:14:30Z","snapshot_observed_at":"2026-08-12T12:15:03.928867Z","submitted_at":"2024-12-18T11:14:30Z","title":"On the Compression of Language Models for Code: An Empirical Study on CodeBERT","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-11T12:53:58.469942Z"},"links":{"cited_paper":"/paper/2102.04664","citing_paper":"/paper/2412.13737"},"observation_digest":"sha256:99b8d90b9bdd1ef96c39cafa2bc26e87984dc2b34b7c765abe5ac48505c0cfd4","observation_id":"98e0e6cd-74d6-42e1-93eb-1d236db102a6","resolution":{"observed_at":"2026-08-11T12:53:58.469942Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1910.01108","last_updated":"2020-03-01T02:57:50Z","snapshot_observed_at":"2026-08-07T19:07:36.327251Z","submitted_at":"2019-10-02T17:56:28Z","title":"DistilBERT, a distilled version of BERT: smaller, faster, cheaper and lighter","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1910.01108","snapshot_observed_at":"2026-08-11T12:53:58.474414Z","title":"Distilbert, a distilled version of bert: smaller, faster, cheaper and lighter,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2412.13737","last_updated":"2024-12-18T11:14:30Z","snapshot_observed_at":"2026-08-12T12:15:03.928867Z","submitted_at":"2024-12-18T11:14:30Z","title":"On the Compression of Language Models for Code: An Empirical Study on CodeBERT","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-11T12:53:58.474414Z"},"links":{"cited_paper":"/paper/1910.01108","citing_paper":"/paper/2412.13737"},"observation_digest":"sha256:95cd502c7f3edf0b1cd2c1af253909a79ca5218edd9191f47b40cc0d71c9503d","observation_id":"71cff739-1fc3-4fd7-8bba-0c219ab2c14b","resolution":{"observed_at":"2026-08-11T12:53:58.474414Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2002.08307","last_updated":"2020-05-14T21:58:57Z","snapshot_observed_at":"2026-08-07T23:34:22.325786Z","submitted_at":"2020-02-19T17:40:57Z","title":"Compressing BERT: Studying the Effects of Weight Pruning on Transfer Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2002.08307","snapshot_observed_at":"2026-08-11T12:53:58.478166Z","title":"Compressing BERT: Studying the Effects of Weight Pruning on Transfer Learning,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2412.13737","last_updated":"2024-12-18T11:14:30Z","snapshot_observed_at":"2026-08-12T12:15:03.928867Z","submitted_at":"2024-12-18T11:14:30Z","title":"On the Compression of Language Models for Code: An Empirical Study on CodeBERT","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-11T12:53:58.478166Z"},"links":{"cited_paper":"/paper/2002.08307","citing_paper":"/paper/2412.13737"},"observation_digest":"sha256:ef48fff918b52d63367c7eb907dfe39a50f458671e7568672fdbf3446fd8d15d","observation_id":"b732e45f-9f23-4ff7-91fa-ef7d4cc98a6a","resolution":{"observed_at":"2026-08-11T12:53:58.478166Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1909.09436","last_updated":"2020-06-08T09:09:28Z","snapshot_observed_at":"2026-08-06T10:54:14.530969Z","submitted_at":"2019-09-20T11:52:45Z","title":"CodeSearchNet Challenge: Evaluating the State of Semantic Code Search","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1909.09436","snapshot_observed_at":"2026-08-11T12:53:58.465930Z","title":"Codesearchnet challenge: Evaluat- ing the state of semantic code search,","venue":null,"work_id":null,"year":1909},"citing_paper":{"arxiv_id":"2412.13737","last_updated":"2024-12-18T11:14:30Z","snapshot_observed_at":"2026-08-12T12:15:03.928867Z","submitted_at":"2024-12-18T11:14:30Z","title":"On the Compression of Language Models for Code: An Empirical Study on CodeBERT","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-11T12:53:58.465930Z"},"links":{"cited_paper":"/paper/1909.09436","citing_paper":"/paper/2412.13737"},"observation_digest":"sha256:fc8c801f0eea63d00fd22ce94c71f98bdb58ef3b311a4eb351f6dda14cc21c2a","observation_id":"5ed61953-af62-4782-a68e-76b59a19e4b4","resolution":{"observed_at":"2026-08-11T12:53:58.465930Z","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-11T12:53:58.485860Z","title":"Ai-driven java performance testing: Balancing result quality with testing time,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.13737","last_updated":"2024-12-18T11:14:30Z","snapshot_observed_at":"2026-08-12T12:15:03.928867Z","submitted_at":"2024-12-18T11:14:30Z","title":"On the Compression of Language Models for Code: An Empirical Study on CodeBERT","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-11T12:53:58.485860Z"},"links":{"citing_paper":"/paper/2412.13737"},"observation_digest":"sha256:1dc0f0592bb8952f393edfde6dedab2a58d1bcc33c31f4fd964e0bd07318bace","observation_id":"d709a4f2-5116-413e-a1bc-aa49a363f1b8","resolution":{"observed_at":"2026-08-11T12:53:58.485860Z","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-11T12:54:00.340208Z","title":"Automated generation and evaluation of jmh microbenchmark suites from unit tests,","venue":null,"work_id":"d440486b-306c-448d-ac2b-4ba6e70f7d19","year":2023},"citing_paper":{"arxiv_id":"2412.13737","last_updated":"2024-12-18T11:14:30Z","snapshot_observed_at":"2026-08-12T12:15:03.928867Z","submitted_at":"2024-12-18T11:14:30Z","title":"On the Compression of Language Models for Code: An Empirical Study on CodeBERT","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-11T12:53:58.489768Z"},"links":{"citing_paper":"/paper/2412.13737"},"observation_digest":"sha256:b89814c37ce1d1f8f1d2a5453f7716bb248b21cef9950bf2f5d5e6c6b3912251","observation_id":"178b5941-7ffa-4ef5-a98e-21b94e20c0d9","resolution":{"observed_at":"2026-08-11T12:54:00.344635Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T12:53:58.493934Z","title":"Faster or slower? performance mystery of python idioms unveiled with empirical evidence,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.13737","last_updated":"2024-12-18T11:14:30Z","snapshot_observed_at":"2026-08-12T12:15:03.928867Z","submitted_at":"2024-12-18T11:14:30Z","title":"On the Compression of Language Models for Code: An Empirical Study on CodeBERT","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-11T12:53:58.493934Z"},"links":{"citing_paper":"/paper/2412.13737"},"observation_digest":"sha256:f672949eda07b4a36c832f06bb1aaf526a4e94fee7ff832ee28e86056f45ab83","observation_id":"04dfe012-2554-48a7-8817-cfde5836fc35","resolution":{"observed_at":"2026-08-11T12:53:58.493934Z","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-11T12:54:00.353883Z","title":"Pruning filters with l1-norm and capped l1-norm for cnn compression,","venue":null,"work_id":"29acf60c-d573-4b98-b15b-97ab2027e292","year":2021},"citing_paper":{"arxiv_id":"2412.13737","last_updated":"2024-12-18T11:14:30Z","snapshot_observed_at":"2026-08-12T12:15:03.928867Z","submitted_at":"2024-12-18T11:14:30Z","title":"On the Compression of Language Models for Code: An Empirical Study on CodeBERT","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-11T12:53:58.482201Z"},"links":{"citing_paper":"/paper/2412.13737"},"observation_digest":"sha256:75966103dfca722f1c84547b6e792bf8487d158ce9b48542933c53b994977267","observation_id":"f444c542-72c1-4aa8-9248-4a18882c495f","resolution":{"observed_at":"2026-08-11T12:54:00.358691Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"4157.24641","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T12:53:58.922024Z","title":"Rigorous benchmarking in reasonable time,","venue":null,"work_id":"4bfb7a59-8dff-4acb-82b9-861baa2ccc4e","year":2013},"citing_paper":{"arxiv_id":"2412.13737","last_updated":"2024-12-18T11:14:30Z","snapshot_observed_at":"2026-08-12T12:15:03.928867Z","submitted_at":"2024-12-18T11:14:30Z","title":"On the Compression of Language Models for Code: An Empirical Study on CodeBERT","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-11T12:53:58.502124Z"},"links":{"citing_paper":"/paper/2412.13737"},"observation_digest":"sha256:32b5591afcfc600eda3807868479a52df852f5e8faa1a7da9226e342ea684218","observation_id":"8045f7fa-4aac-4fd0-be03-db74b9b26155","resolution":{"observed_at":"2026-08-11T12:53:58.930478Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T12:54:00.326032Z","title":"Quantifying performance changes with effect size confidence intervals,","venue":null,"work_id":"15c771a1-dd1d-4ff2-8796-efdeb1547e94","year":2012},"citing_paper":{"arxiv_id":"2412.13737","last_updated":"2024-12-18T11:14:30Z","snapshot_observed_at":"2026-08-12T12:15:03.928867Z","submitted_at":"2024-12-18T11:14:30Z","title":"On the Compression of Language Models for Code: An Empirical Study on CodeBERT","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-11T12:53:58.506119Z"},"links":{"citing_paper":"/paper/2412.13737"},"observation_digest":"sha256:3ec6315443994ccc7ad9781398810354869a6288e8dc82f4e66df0fdcdb51b47","observation_id":"a45d2aba-f7c8-43c1-a6e0-f1900b8d8f10","resolution":{"observed_at":"2026-08-11T12:54:00.331515Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T12:54:00.310310Z","title":"Wilcoxon signed-rank test,","venue":null,"work_id":"c1a0a721-ef52-4efb-afad-c9678c4602fa","year":2005},"citing_paper":{"arxiv_id":"2412.13737","last_updated":"2024-12-18T11:14:30Z","snapshot_observed_at":"2026-08-12T12:15:03.928867Z","submitted_at":"2024-12-18T11:14:30Z","title":"On the Compression of Language Models for Code: An Empirical Study on CodeBERT","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-11T12:53:58.510237Z"},"links":{"citing_paper":"/paper/2412.13737"},"observation_digest":"sha256:5b542f1953dbbb4a46cccc0aa1528b5665531e084898ba7db12e86d3be1c8b09","observation_id":"60b4a73c-d3f0-461e-b34b-accb348f9ba8","resolution":{"observed_at":"2026-08-11T12:54:00.316114Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T12:53:58.497645Z","title":"Dynamically reconfiguring software microbenchmarks: Reducing execution time without sacrificing result quality,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2412.13737","last_updated":"2024-12-18T11:14:30Z","snapshot_observed_at":"2026-08-12T12:15:03.928867Z","submitted_at":"2024-12-18T11:14:30Z","title":"On the Compression of Language Models for Code: An Empirical Study on CodeBERT","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-11T12:53:58.497645Z"},"links":{"citing_paper":"/paper/2412.13737"},"observation_digest":"sha256:fb88a5baa37721f5431317c06b1aff61ecbc047efb3a34074ef010bf8481e108","observation_id":"a5eb672f-52c6-420f-bbc8-791c4f11155d","resolution":{"observed_at":"2026-08-11T12:53:58.497645Z","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-11T12:54:00.295330Z","title":"Searching for a needle in a haystack: Predicting security vulnerabilities for windows vista,","venue":null,"work_id":"cf3e8bf7-4e3a-47b0-934b-e266abbe937f","year":2010},"citing_paper":{"arxiv_id":"2412.13737","last_updated":"2024-12-18T11:14:30Z","snapshot_observed_at":"2026-08-12T12:15:03.928867Z","submitted_at":"2024-12-18T11:14:30Z","title":"On the Compression of Language Models for Code: An Empirical Study on CodeBERT","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-11T12:53:58.518346Z"},"links":{"citing_paper":"/paper/2412.13737"},"observation_digest":"sha256:d5762690f5121b62101d9c6ed93b916f980e006a4dba4638e09bf51472fa1e13","observation_id":"8e6d9bd0-4edb-4cee-a99d-c62ca8612635","resolution":{"observed_at":"2026-08-11T12:54:00.299941Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T12:53:58.521727Z","title":"The importance of accounting for real-world labelling when predicting software vulnerabilities,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2412.13737","last_updated":"2024-12-18T11:14:30Z","snapshot_observed_at":"2026-08-12T12:15:03.928867Z","submitted_at":"2024-12-18T11:14:30Z","title":"On the Compression of Language Models for Code: An Empirical Study on CodeBERT","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-11T12:53:58.521727Z"},"links":{"citing_paper":"/paper/2412.13737"},"observation_digest":"sha256:99d48e6fd1921d831d3f943f18c46bdaa1e1979a5d966f69cc5f8c25ae301df5","observation_id":"8f5a4ee9-ca34-4d42-8bff-8f93f6312bcb","resolution":{"observed_at":"2026-08-11T12:53:58.521727Z","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-11T12:53:58.525865Z","title":"On the use of evaluation measures for defect prediction studies,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.13737","last_updated":"2024-12-18T11:14:30Z","snapshot_observed_at":"2026-08-12T12:15:03.928867Z","submitted_at":"2024-12-18T11:14:30Z","title":"On the Compression of Language Models for Code: An Empirical Study on CodeBERT","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-11T12:53:58.525865Z"},"links":{"citing_paper":"/paper/2412.13737"},"observation_digest":"sha256:df9b9aa0b041aa626d352882fb4c25faa921e80baf944fbd20abd35a706a43b4","observation_id":"7ddddd7e-f99d-4e84-a7f5-296e17982e38","resolution":{"observed_at":"2026-08-11T12:53:58.525865Z","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-11T12:53:58.514666Z","title":"How software refactoring impacts execution time,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.13737","last_updated":"2024-12-18T11:14:30Z","snapshot_observed_at":"2026-08-12T12:15:03.928867Z","submitted_at":"2024-12-18T11:14:30Z","title":"On the Compression of Language Models for Code: An Empirical Study on CodeBERT","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-11T12:53:58.514666Z"},"links":{"citing_paper":"/paper/2412.13737"},"observation_digest":"sha256:92732a2626d8aa50126b2d2e14a1a7fb67bb9840348323ac91a7511cf3e8eeec","observation_id":"c6a31264-5503-41eb-81cd-886f7d1ad400","resolution":{"observed_at":"2026-08-11T12:53:58.514666Z","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-11T12:54:00.279850Z","title":"Survey of code search based on deep learning,","venue":null,"work_id":"5d74ac36-4fc9-416e-8359-37ac3abbd1a7","year":null},"citing_paper":{"arxiv_id":"2412.13737","last_updated":"2024-12-18T11:14:30Z","snapshot_observed_at":"2026-08-12T12:15:03.928867Z","submitted_at":"2024-12-18T11:14:30Z","title":"On the Compression of Language Models for Code: An Empirical Study on CodeBERT","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-11T12:53:58.533242Z"},"links":{"citing_paper":"/paper/2412.13737"},"observation_digest":"sha256:6241c91ac6c41eb7eab31255499ab3e968c7cab49b420c4f3fa961db3170d6fd","observation_id":"96b64c53-aea6-44b1-8075-2ae0d1c8ab34","resolution":{"observed_at":"2026-08-11T12:54:00.284810Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T12:54:00.262276Z","title":"A survey of quantization methods for efficient neural network inference,","venue":null,"work_id":"5a010f65-50de-470c-9e91-2cd6c2bb5098","year":2022},"citing_paper":{"arxiv_id":"2412.13737","last_updated":"2024-12-18T11:14:30Z","snapshot_observed_at":"2026-08-12T12:15:03.928867Z","submitted_at":"2024-12-18T11:14:30Z","title":"On the Compression of Language Models for Code: An Empirical Study on CodeBERT","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-11T12:53:58.542230Z"},"links":{"citing_paper":"/paper/2412.13737"},"observation_digest":"sha256:656e8a1f1f75ae39859084757d97c9bd6d6534b6f871ed65ac6ee96f2ccc8f92","observation_id":"dee9b18e-36e2-4e3a-b67b-d6079ccb631b","resolution":{"observed_at":"2026-08-11T12:54:00.268405Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2004.10568","last_updated":"2020-06-30T09:51:23Z","snapshot_observed_at":"2026-08-12T19:59:54.746291Z","submitted_at":"2020-04-22T13:44:28Z","title":"Up or Down? Adaptive Rounding for Post-Training Quantization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2004.10568","snapshot_observed_at":"2026-08-11T12:53:58.546181Z","title":"Up or down? adaptive rounding for post-training quantization,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2412.13737","last_updated":"2024-12-18T11:14:30Z","snapshot_observed_at":"2026-08-12T12:15:03.928867Z","submitted_at":"2024-12-18T11:14:30Z","title":"On the Compression of Language Models for Code: An Empirical Study on CodeBERT","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-11T12:53:58.546181Z"},"links":{"cited_paper":"/paper/2004.10568","citing_paper":"/paper/2412.13737"},"observation_digest":"sha256:d06dbaf4fdf0a4044c98317e7682efa36146dd18e323c79cab718e54b31ab08e","observation_id":"99ab9e81-96ba-4f37-a426-b725beea7989","resolution":{"observed_at":"2026-08-11T12:53:58.546181Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.07959","last_updated":"2025-08-23T15:44:13Z","snapshot_observed_at":"2026-08-12T23:26:09.775593Z","submitted_at":"2024-07-09T05:48:42Z","title":"Source Code Summarization in the Era of Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.07959","snapshot_observed_at":"2026-08-11T12:53:58.529494Z","title":"Source Code Summarization in the Era of Large Language Models,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.13737","last_updated":"2024-12-18T11:14:30Z","snapshot_observed_at":"2026-08-12T12:15:03.928867Z","submitted_at":"2024-12-18T11:14:30Z","title":"On the Compression of Language Models for Code: An Empirical Study on CodeBERT","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-11T12:53:58.529494Z"},"links":{"cited_paper":"/paper/2407.07959","citing_paper":"/paper/2412.13737"},"observation_digest":"sha256:f3a0c144bba63f49f6a2feab05a1f57fedd37a9d684415c739beb9f079b46eb3","observation_id":"494491a0-0460-432a-8a06-d092300ab15b","resolution":{"observed_at":"2026-08-11T12:53:58.529494Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1810.05270","last_updated":"2019-03-05T05:58:11Z","snapshot_observed_at":"2026-08-10T10:06:07.580743Z","submitted_at":"2018-10-11T22:15:28Z","title":"Rethinking the Value of Network Pruning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1810.05270","snapshot_observed_at":"2026-08-11T12:53:58.554079Z","title":"Rethinking the value of network pruning,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2412.13737","last_updated":"2024-12-18T11:14:30Z","snapshot_observed_at":"2026-08-12T12:15:03.928867Z","submitted_at":"2024-12-18T11:14:30Z","title":"On the Compression of Language Models for Code: An Empirical Study on CodeBERT","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-11T12:53:58.554079Z"},"links":{"cited_paper":"/paper/1810.05270","citing_paper":"/paper/2412.13737"},"observation_digest":"sha256:8ccf7990ce0cdffb878ebcad1f271a841950c6a289a048250eee91e5bf7b09ef","observation_id":"5a17b4e8-72b1-4ad1-a9fa-9f63ae432864","resolution":{"observed_at":"2026-08-11T12:53:58.554079Z","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-11T12:54:00.207205Z","title":"Taming performance variability,","venue":null,"work_id":"790897e2-2e20-4758-bcfd-c38deac8e507","year":2018},"citing_paper":{"arxiv_id":"2412.13737","last_updated":"2024-12-18T11:14:30Z","snapshot_observed_at":"2026-08-12T12:15:03.928867Z","submitted_at":"2024-12-18T11:14:30Z","title":"On the Compression of Language Models for Code: An Empirical Study on CodeBERT","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-11T12:53:58.558058Z"},"links":{"citing_paper":"/paper/2412.13737"},"observation_digest":"sha256:0b7a5de3021a5c17d4b13191f402061ca40a869d26e9e2bca2552780e9d70818","observation_id":"82d3f77d-ef1a-4747-a739-7842743f4e6e","resolution":{"observed_at":"2026-08-11T12:54:00.217054Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T12:54:00.241202Z","title":"Compressing large-scale transformer- based models: A case study on bert,","venue":null,"work_id":"56326625-90f6-4026-ab67-cc172fe65460","year":2021},"citing_paper":{"arxiv_id":"2412.13737","last_updated":"2024-12-18T11:14:30Z","snapshot_observed_at":"2026-08-12T12:15:03.928867Z","submitted_at":"2024-12-18T11:14:30Z","title":"On the Compression of Language Models for Code: An Empirical Study on CodeBERT","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-11T12:53:58.550204Z"},"links":{"citing_paper":"/paper/2412.13737"},"observation_digest":"sha256:0a61326adc22615064893f16d5ee953fc71787e7eafdc43aaa9362a024297caf","observation_id":"4fefdb0b-de15-4911-8971-ecab9c71542d","resolution":{"observed_at":"2026-08-11T12:54:00.249148Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T12:53:58.383952Z","title":"Available: https://doi.ieeecomputersociety.org/10.1109/ SANER53432.2022.00112","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.13737","last_updated":"2024-12-18T11:14:30Z","snapshot_observed_at":"2026-08-12T12:15:03.928867Z","submitted_at":"2024-12-18T11:14:30Z","title":"On the Compression of Language Models for Code: An Empirical Study on CodeBERT","version":1},"reference_index":946,"source":"pdf_text","source_observed_at":"2026-08-11T12:53:58.383952Z"},"links":{"citing_paper":"/paper/2412.13737"},"observation_digest":"sha256:623c873959b84413f0a484ff7d21bed0396a47c328e614af6ae23e0995e23953","observation_id":"bc5f44ec-1bf6-4774-ba12-22fc65148708","resolution":{"observed_at":"2026-08-11T12:53:58.383952Z","resolver_source":null,"status":"malformed_identifier"},"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-11T12:54:00.416937Z","title":"Available: https://openreview.net/forum?id=rJqFGTslg","venue":null,"work_id":"d3e2a8a1-462a-4419-8d52-2fcfa157ecc8","year":null},"citing_paper":{"arxiv_id":"2412.13737","last_updated":"2024-12-18T11:14:30Z","snapshot_observed_at":"2026-08-12T12:15:03.928867Z","submitted_at":"2024-12-18T11:14:30Z","title":"On the Compression of Language Models for Code: An Empirical Study on CodeBERT","version":1},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-11T12:53:58.405149Z"},"links":{"citing_paper":"/paper/2412.13737"},"observation_digest":"sha256:0f288d4af2b1bcc167714588b266915be84e59c7d9816a53c631bc6d7037158d","observation_id":"092e90ab-f312-46f6-8fd0-b5315c2eaf9d","resolution":{"observed_at":"2026-08-11T12:54:00.421880Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3628161","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T12:53:58.589925Z","title":"Available: https://doi.org/10.1145/3628161","venue":null,"work_id":"b5a4f16d-0043-494c-acba-ece07e5cdb69","year":null},"citing_paper":{"arxiv_id":"2412.13737","last_updated":"2024-12-18T11:14:30Z","snapshot_observed_at":"2026-08-12T12:15:03.928867Z","submitted_at":"2024-12-18T11:14:30Z","title":"On the Compression of Language Models for Code: An Empirical Study on CodeBERT","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-11T12:53:58.537589Z"},"links":{"citing_paper":"/paper/2412.13737"},"observation_digest":"sha256:48a1de7703e9f98cba74461ba710bbfbf25795f9b0a91e3ba41eb749a4cc1644","observation_id":"2bee4dab-5733-4b77-a55b-0d9da0d92c1e","resolution":{"observed_at":"2026-08-11T12:53:58.595506Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.5281/zenodo.14357478","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T12:53:58.623275Z","title":"Available: https://doi.org/10.5281/zenodo.14357478","venue":null,"work_id":"a9a3e271-2834-4916-ac97-438792359374","year":null},"citing_paper":{"arxiv_id":"2412.13737","last_updated":"2024-12-18T11:14:30Z","snapshot_observed_at":"2026-08-12T12:15:03.928867Z","submitted_at":"2024-12-18T11:14:30Z","title":"On the Compression of Language Models for Code: An Empirical Study on CodeBERT","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-11T12:53:58.346516Z"},"links":{"citing_paper":"/paper/2412.13737"},"observation_digest":"sha256:0511f7a628521ce873d8c50b4ff1474887c5bd5de953aeb56a1edc07b99166eb","observation_id":"c992455b-c2c7-4e4e-a34d-4d2e1c141097","resolution":{"observed_at":"2026-08-11T12:53:58.627862Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2412.13737","last_updated":"2024-12-18T11:14:30Z","latest_version":1,"primary_category":"cs.SE","snapshot_observed_at":"2026-08-12T12:15:03.928867Z","submitted_at":"2024-12-18T11:14:30Z","title":"On the Compression of Language Models for Code: An Empirical Study on CodeBERT"},"reference_resolution":{"displayed":65,"state_counts":{"malformed_identifier":2,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":35,"verified_exact":4,"verified_fuzzy":23},"total_outbound_references":65},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 65 of 65 outbound references and 2 inbound Pith citation observations for arXiv:2412.13737."}