{"as_of":"2026-08-15T05:24:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a070cc2f275b4168db3e2ca6936abd13624c3c2dc02d82fd28b3b44394a3edd1","coverage":[{"denominator":24,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":24,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T04:49:20.716737Z","state":"measured"},{"denominator":29,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":29,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+00:00","state":"measured"},{"denominator":5,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":5,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T17:24:31.574171Z","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-19T11:53:03.444495Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2412.01007","last_updated":"2025-03-04T00:36:44Z","snapshot_observed_at":"2026-08-14T12:40:39.050297Z","submitted_at":"2024-12-01T23:54:12Z","title":"CoRNStack: High-Quality Contrastive Data for Better Code Retrieval and Reranking","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.01007","snapshot_observed_at":"2026-08-12T17:24:31.574171Z","title":"Cornstack: High-quality contrastive data for better code ranking.arXiv preprint arXiv:2412.01007,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2411.12644","last_updated":"2025-08-08T04:35:26Z","snapshot_observed_at":"2026-08-14T07:15:24.440419Z","submitted_at":"2024-11-19T16:54:45Z","title":"CodeXEmbed: A Generalist Embedding Model Family for Multiligual and Multi-task Code Retrieval","version":3},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-12T17:24:31.574171Z"},"links":{"cited_paper":"/paper/2412.01007","citing_paper":"/paper/2411.12644"},"observation_digest":"sha256:1d7f7cb05ff4556fa794805283d9d9250e255efcd6800873ede8c2b540c7e4d2","observation_id":"b05bdbc8-9e9d-4504-8198-896f6164265d","resolution":{"observed_at":"2026-08-12T17:24:31.574171Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.01007","last_updated":"2025-03-04T00:36:44Z","snapshot_observed_at":"2026-08-14T12:40:39.050297Z","submitted_at":"2024-12-01T23:54:12Z","title":"CoRNStack: High-Quality Contrastive Data for Better Code Retrieval and Reranking","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.01007","snapshot_observed_at":"2026-08-07T22:51:13.008690Z","title":"Suresh, T., Reddy, R","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.09061","last_updated":"2025-09-05T01:04:00Z","snapshot_observed_at":"2026-08-14T04:22:22.363002Z","submitted_at":"2025-02-13T08:23:42Z","title":"CRANE: Reasoning with constrained LLM generation","version":4},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T22:51:13.008690Z"},"links":{"cited_paper":"/paper/2412.01007","citing_paper":"/paper/2502.09061"},"observation_digest":"sha256:758321235c7c397bedea72a84ae1166378d1dc4f9285a79df4e07347ccb4188b","observation_id":"58c93124-c2d4-4177-bda5-3bcaa428773b","resolution":{"observed_at":"2026-08-07T22:51:13.008690Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.01007","last_updated":"2025-03-04T00:36:44Z","snapshot_observed_at":"2026-08-14T12:40:39.050297Z","submitted_at":"2024-12-01T23:54:12Z","title":"CoRNStack: High-Quality Contrastive Data for Better Code Retrieval and Reranking","version":3},"cited_work":{"arxiv_id":"2412.01007","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2412.01007","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Cornstack: High-quality contrastive data for better code ranking","venue":null,"work_id":"9b3de792-4071-46f3-95e7-cd5340a6c4b7","year":2024},"citing_paper":{"arxiv_id":"2506.03535","last_updated":"2026-04-20T04:02:41Z","snapshot_observed_at":"2026-08-11T10:26:42.867757Z","submitted_at":"2025-06-04T03:31:00Z","title":"Across Programming Language Silos: A Study on Cross-Lingual Retrieval-augmented Code Generation","version":2},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-05-19T11:52:44.990234Z"},"links":{"cited_paper":"/paper/2412.01007","citing_paper":"/paper/2506.03535"},"observation_digest":"sha256:ee7814baf8540a8606bb235d5c5509f43f1a0b31f3007db12d540a22538e3492","observation_id":"5c638953-d85a-4862-8669-423cd8dec2e0","resolution":{"observed_at":"2026-05-19T11:53:03.446660Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.01007","last_updated":"2025-03-04T00:36:44Z","snapshot_observed_at":"2026-08-14T12:40:39.050297Z","submitted_at":"2024-12-01T23:54:12Z","title":"CoRNStack: High-Quality Contrastive Data for Better Code Retrieval and Reranking","version":3},"cited_work":{"arxiv_id":"2412.01007","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2412.01007","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Cornstack: High-quality contrastive data for better code ranking","venue":null,"work_id":"9b3de792-4071-46f3-95e7-cd5340a6c4b7","year":2024},"citing_paper":{"arxiv_id":"2605.05251","last_updated":"2026-05-05T17:53:51Z","snapshot_observed_at":"2026-08-10T23:07:09.452488Z","submitted_at":"2026-05-05T17:53:51Z","title":"Identifier-Free Code Embedding Models for Scalable Search","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-08T18:06:14.202115Z"},"links":{"cited_paper":"/paper/2412.01007","citing_paper":"/paper/2605.05251"},"observation_digest":"sha256:5d85cae27cc83a50ba5f9c805c8e20b79d5273e30a7afafdcaaa42576bf4b73c","observation_id":"5cbe928f-336b-4ab3-bd23-e1c6717cafc6","resolution":{"observed_at":"2026-05-09T06:50:39.590882Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.01007","last_updated":"2025-03-04T00:36:44Z","snapshot_observed_at":"2026-08-14T12:40:39.050297Z","submitted_at":"2024-12-01T23:54:12Z","title":"CoRNStack: High-Quality Contrastive Data for Better Code Retrieval and Reranking","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.01007","snapshot_observed_at":"2026-08-01T18:36:16.838613Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.17286","last_updated":"2026-07-19T15:08:08Z","snapshot_observed_at":"2026-08-14T23:38:55.504753Z","submitted_at":"2026-07-19T15:08:08Z","title":"IssueExec: A Test-Driven Approach for Localizing Software Engineering Issues","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-01T18:36:16.838613Z"},"links":{"cited_paper":"/paper/2412.01007","citing_paper":"/paper/2607.17286"},"observation_digest":"sha256:9bea10a1faba0e0b744a4ee0b78262296733c55e7295d79fb0785f9ff51b3660","observation_id":"91339594-ee4f-45de-b217-42d489482a1b","resolution":{"observed_at":"2026-08-01T18:36:16.838613Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2412.01007/citation-record","integrity":"/paper/2412.01007/integrity","json":"/paper/2412.01007/citation-record.json","paper":"/paper/2412.01007"},"outbound":[{"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-12T04:49:20.632761Z","title":"Kaiming He, Haoqi Fan, Yuxin Wu, Saining Xie, and Ross Girshick","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2412.01007","last_updated":"2025-03-04T00:36:44Z","snapshot_observed_at":"2026-08-14T12:40:39.050297Z","submitted_at":"2024-12-01T23:54:12Z","title":"CoRNStack: High-Quality Contrastive Data for Better Code Retrieval and Reranking","version":3},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-12T04:49:20.632761Z"},"links":{"cited_paper":"/paper/2009.08366","citing_paper":"/paper/2412.01007"},"observation_digest":"sha256:759976c6a5801731758f286c278178b20522eb70422070b3ae8e9416dd51fa98","observation_id":"fca532d8-17ee-4804-99a3-b813a0096ecf","resolution":{"observed_at":"2026-08-12T04:49:20.632761Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.12186","last_updated":"2024-11-12T13:24:25Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-09-18T17:57:57Z","title":"Qwen2.5-Coder Technical Report","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.12186","snapshot_observed_at":"2026-08-12T04:49:20.638161Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.01007","last_updated":"2025-03-04T00:36:44Z","snapshot_observed_at":"2026-08-14T12:40:39.050297Z","submitted_at":"2024-12-01T23:54:12Z","title":"CoRNStack: High-Quality Contrastive Data for Better Code Retrieval and Reranking","version":3},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-12T04:49:20.638161Z"},"links":{"cited_paper":"/paper/2409.12186","citing_paper":"/paper/2412.01007"},"observation_digest":"sha256:a19e3ae0482988c4e88918017b52c20e4ba10d3781ef2980d3811ef5a9d8ed75","observation_id":"70ac4eaa-dde5-4546-8714-8ddab65858a0","resolution":{"observed_at":"2026-08-12T04:49:20.638161Z","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-12T04:49:20.642236Z","title":"Codesearchnet challenge: Evaluating the state of semantic code search","venue":null,"work_id":null,"year":1909},"citing_paper":{"arxiv_id":"2412.01007","last_updated":"2025-03-04T00:36:44Z","snapshot_observed_at":"2026-08-14T12:40:39.050297Z","submitted_at":"2024-12-01T23:54:12Z","title":"CoRNStack: High-Quality Contrastive Data for Better Code Retrieval and Reranking","version":3},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-12T04:49:20.642236Z"},"links":{"cited_paper":"/paper/1909.09436","citing_paper":"/paper/2412.01007"},"observation_digest":"sha256:022b72153e6beef7bc6ffe60dc27d9d45ae749e7aef6699dfa5487230218143d","observation_id":"63754435-80c6-4dfb-a5e8-2ddcde4108ed","resolution":{"observed_at":"2026-08-12T04:49:20.642236Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2202.06602","last_updated":"2022-04-16T10:53:12Z","snapshot_observed_at":"2026-08-14T22:35:40.312638Z","submitted_at":"2022-02-14T10:44:41Z","title":"Neural Re-ranking in Multi-stage Recommender Systems: A Review","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2202.06602","snapshot_observed_at":"2026-08-12T04:49:20.651102Z","title":"Coderetriever: A large scale contrastive pre-training method for code search","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.01007","last_updated":"2025-03-04T00:36:44Z","snapshot_observed_at":"2026-08-14T12:40:39.050297Z","submitted_at":"2024-12-01T23:54:12Z","title":"CoRNStack: High-Quality Contrastive Data for Better Code Retrieval and Reranking","version":3},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-12T04:49:20.651102Z"},"links":{"cited_paper":"/paper/2202.06602","citing_paper":"/paper/2412.01007"},"observation_digest":"sha256:745bb7ff63991cca10f578802b8313ed6d840ffa4c604e9d3862f026d44e7133","observation_id":"bb602f44-d198-413e-8bb8-ac929ce7f485","resolution":{"observed_at":"2026-08-12T04:49:20.651102Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.05374","last_updated":"2024-05-08T19:05:18Z","snapshot_observed_at":"2026-08-14T02:19:07.502030Z","submitted_at":"2024-05-08T19:05:18Z","title":"Arctic-Embed: Scalable, Efficient, and Accurate Text Embedding Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.05374","snapshot_observed_at":"2026-08-12T04:49:20.659238Z","title":"Arctic-embed: Scalable, efficient, and accurate text embedding models","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.01007","last_updated":"2025-03-04T00:36:44Z","snapshot_observed_at":"2026-08-14T12:40:39.050297Z","submitted_at":"2024-12-01T23:54:12Z","title":"CoRNStack: High-Quality Contrastive Data for Better Code Retrieval and Reranking","version":3},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-12T04:49:20.659238Z"},"links":{"cited_paper":"/paper/2405.05374","citing_paper":"/paper/2412.01007"},"observation_digest":"sha256:7f132950ce305e48299f71cd97cc5754bf05f2ee119d1df36cfc4667efc014ff","observation_id":"2eed6768-982d-40b5-843f-a80bc093daf1","resolution":{"observed_at":"2026-08-12T04:49:20.659238Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.15831","last_updated":"2025-02-07T15:17:18Z","snapshot_observed_at":"2026-08-12T23:17:05.684103Z","submitted_at":"2024-07-22T17:50:31Z","title":"NV-Retriever: Improving text embedding models with effective hard-negative mining","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.15831","snapshot_observed_at":"2026-08-12T04:49:20.663007Z","title":"Nv-retriever: Improving text embedding models with effective hard-negative mining","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.01007","last_updated":"2025-03-04T00:36:44Z","snapshot_observed_at":"2026-08-14T12:40:39.050297Z","submitted_at":"2024-12-01T23:54:12Z","title":"CoRNStack: High-Quality Contrastive Data for Better Code Retrieval and Reranking","version":3},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-12T04:49:20.663007Z"},"links":{"cited_paper":"/paper/2407.15831","citing_paper":"/paper/2412.01007"},"observation_digest":"sha256:21f4e33d71dabd3f825fbbb1736295bd7b5f469d9305c38031e9bc731c2cc121","observation_id":"389093d5-9ce0-4eff-be99-87006eb64d34","resolution":{"observed_at":"2026-08-12T04:49:20.663007Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.15657","last_updated":"2024-06-21T21:27:50Z","snapshot_observed_at":"2026-08-14T16:30:53.914759Z","submitted_at":"2024-06-21T21:27:50Z","title":"FIRST: Faster Improved Listwise Reranking with Single Token Decoding","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.15657","snapshot_observed_at":"2026-08-12T04:49:20.677461Z","title":"First: Faster improved listwise reranking with single token decoding","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.01007","last_updated":"2025-03-04T00:36:44Z","snapshot_observed_at":"2026-08-14T12:40:39.050297Z","submitted_at":"2024-12-01T23:54:12Z","title":"CoRNStack: High-Quality Contrastive Data for Better Code Retrieval and Reranking","version":3},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-12T04:49:20.677461Z"},"links":{"cited_paper":"/paper/2406.15657","citing_paper":"/paper/2412.01007"},"observation_digest":"sha256:609baf45f07b32c834e55856159d9da738afccdaa032bc2fa2fc3d143a12dd35","observation_id":"0e306239-1a68-4779-b917-935eea7b893b","resolution":{"observed_at":"2026-08-12T04:49:20.677461Z","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-12T04:49:20.948803Z","title":"Sentence-BERT: Sentence embeddings using Siamese BERT- networks","venue":null,"work_id":"69a71aa2-4260-499a-a1b6-216ab3c45ded","year":2019},"citing_paper":{"arxiv_id":"2412.01007","last_updated":"2025-03-04T00:36:44Z","snapshot_observed_at":"2026-08-14T12:40:39.050297Z","submitted_at":"2024-12-01T23:54:12Z","title":"CoRNStack: High-Quality Contrastive Data for Better Code Retrieval and Reranking","version":3},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-12T04:49:20.681740Z"},"links":{"citing_paper":"/paper/2412.01007"},"observation_digest":"sha256:394389525c0b7c8346b293be318f344f6e9cd18b75f3bc2c1da9975a762d82d4","observation_id":"9b504435-1c21-42c4-8e2e-822a6d1bbc8f","resolution":{"observed_at":"2026-08-12T04:49:20.953071Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T04:49:20.686111Z","title":"doi: 10.18653/v1/D19-1410","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.01007","last_updated":"2025-03-04T00:36:44Z","snapshot_observed_at":"2026-08-14T12:40:39.050297Z","submitted_at":"2024-12-01T23:54:12Z","title":"CoRNStack: High-Quality Contrastive Data for Better Code Retrieval and Reranking","version":3},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-12T04:49:20.686111Z"},"links":{"citing_paper":"/paper/2412.01007"},"observation_digest":"sha256:5c49c3ddca7150cb46c065172d5ed6395b6d717cfe94ac793fe3306c678b86a3","observation_id":"d88edc89-b17d-4af5-a552-be08c53b04e0","resolution":{"observed_at":"2026-08-12T04:49:20.686111Z","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-12T04:49:20.935607Z","title":"Is the watermarking of llm-generated code robust?,","venue":null,"work_id":"092039b7-3804-4f7b-af86-9e93a21f3cf6","year":2025},"citing_paper":{"arxiv_id":"2412.01007","last_updated":"2025-03-04T00:36:44Z","snapshot_observed_at":"2026-08-14T12:40:39.050297Z","submitted_at":"2024-12-01T23:54:12Z","title":"CoRNStack: High-Quality Contrastive Data for Better Code Retrieval and Reranking","version":3},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-12T04:49:20.690403Z"},"links":{"citing_paper":"/paper/2412.01007"},"observation_digest":"sha256:c3d15d4884a6231156fd35441830ec566fd0aeed84581258361087269a3eb62e","observation_id":"aad59603-6282-4973-bf35-d735579fbe33","resolution":{"observed_at":"2026-08-12T04:49:20.941162Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.17983","last_updated":"2025-08-19T19:25:28Z","snapshot_observed_at":"2026-08-14T15:41:26.981100Z","submitted_at":"2024-03-24T21:41:29Z","title":"Is The Watermarking Of LLM-Generated Code Robust?","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.17983","snapshot_observed_at":"2026-08-12T04:49:20.694725Z","title":"James Thorne, Andreas Vlachos, Christos Christodoulopoulos, and Arpit Mittal","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.01007","last_updated":"2025-03-04T00:36:44Z","snapshot_observed_at":"2026-08-14T12:40:39.050297Z","submitted_at":"2024-12-01T23:54:12Z","title":"CoRNStack: High-Quality Contrastive Data for Better Code Retrieval and Reranking","version":3},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-12T04:49:20.694725Z"},"links":{"cited_paper":"/paper/2403.17983","citing_paper":"/paper/2412.01007"},"observation_digest":"sha256:bec587a0239c4e5407fb7ac517d7769636880f1c61a1dbfaf8b7221b2bb7d265","observation_id":"44e4fb9f-288a-46f9-9a7f-eb450bc0ab99","resolution":{"observed_at":"2026-08-12T04:49:20.694725Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.07295","last_updated":"2025-03-02T01:39:57Z","snapshot_observed_at":"2026-08-14T06:48:07.058379Z","submitted_at":"2024-10-09T16:21:38Z","title":"IterGen: Iterative Semantic-aware Structured LLM Generation with Backtracking","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.07295","snapshot_observed_at":"2026-08-12T04:49:20.699581Z","title":"Itergen: Iterative structured llm generation, 2024a","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.01007","last_updated":"2025-03-04T00:36:44Z","snapshot_observed_at":"2026-08-14T12:40:39.050297Z","submitted_at":"2024-12-01T23:54:12Z","title":"CoRNStack: High-Quality Contrastive Data for Better Code Retrieval and Reranking","version":3},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-12T04:49:20.699581Z"},"links":{"cited_paper":"/paper/2410.07295","citing_paper":"/paper/2412.01007"},"observation_digest":"sha256:3c5d47a4d4b369bd58536c0253ce257f5ea1cb89056970f11c2d82d6220a06f4","observation_id":"e91f5b28-7106-4bab-91db-e50751215388","resolution":{"observed_at":"2026-08-12T04:49:20.699581Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.00368","last_updated":"2024-05-31T07:22:01Z","snapshot_observed_at":"2026-08-13T04:50:57.181092Z","submitted_at":"2023-12-31T02:13:18Z","title":"Improving Text Embeddings with Large Language Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.00368","snapshot_observed_at":"2026-08-12T04:49:20.704122Z","title":"Improv- ing text embeddings with large language models","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.01007","last_updated":"2025-03-04T00:36:44Z","snapshot_observed_at":"2026-08-14T12:40:39.050297Z","submitted_at":"2024-12-01T23:54:12Z","title":"CoRNStack: High-Quality Contrastive Data for Better Code Retrieval and Reranking","version":3},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-12T04:49:20.704122Z"},"links":{"cited_paper":"/paper/2401.00368","citing_paper":"/paper/2412.01007"},"observation_digest":"sha256:9bf363c297c68efa0ead10503d991021184900595308079cdbaabd4822478efb","observation_id":"8db35987-9e37-4705-84c8-c7300dc55490","resolution":{"observed_at":"2026-08-12T04:49:20.704122Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.10671","last_updated":"2024-09-10T13:25:53Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-07-15T12:35:42Z","title":"Qwen2 Technical Report","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.10671","snapshot_observed_at":"2026-08-12T04:49:20.708097Z","title":"Qwen2 technical report","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.01007","last_updated":"2025-03-04T00:36:44Z","snapshot_observed_at":"2026-08-14T12:40:39.050297Z","submitted_at":"2024-12-01T23:54:12Z","title":"CoRNStack: High-Quality Contrastive Data for Better Code Retrieval and Reranking","version":3},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-12T04:49:20.708097Z"},"links":{"cited_paper":"/paper/2407.10671","citing_paper":"/paper/2412.01007"},"observation_digest":"sha256:4e166acc4e556520156bd412d081f332547a1ddc047c210c29730a087a404b00","observation_id":"043e1c6a-5099-490b-b987-30d3fba733ce","resolution":{"observed_at":"2026-08-12T04:49:20.708097Z","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-12T04:49:20.712512Z","title":"Hotpotqa: A dataset for diverse, explainable multi-hop question answering","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2412.01007","last_updated":"2025-03-04T00:36:44Z","snapshot_observed_at":"2026-08-14T12:40:39.050297Z","submitted_at":"2024-12-01T23:54:12Z","title":"CoRNStack: High-Quality Contrastive Data for Better Code Retrieval and Reranking","version":3},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-12T04:49:20.712512Z"},"links":{"citing_paper":"/paper/2412.01007"},"observation_digest":"sha256:0912930fd42b52167ada33f56a1c4b379c36b0542533a0cf74502d324f3eccc8","observation_id":"1af9a998-17a3-4158-8c98-6ef0b5708cd9","resolution":{"observed_at":"2026-08-12T04:49:20.712512Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.14122","last_updated":"2024-04-02T01:47:40Z","snapshot_observed_at":"2026-08-14T10:26:04.100289Z","submitted_at":"2023-10-21T21:39:48Z","title":"Beyond Yes and No: Improving Zero-Shot LLM Rankers via Scoring Fine-Grained Relevance Labels","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.14122","snapshot_observed_at":"2026-08-12T04:49:20.716737Z","title":"Beyond yes and no: Improving zero-shot llm rankers via scoring fine-grained relevance labels","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.01007","last_updated":"2025-03-04T00:36:44Z","snapshot_observed_at":"2026-08-14T12:40:39.050297Z","submitted_at":"2024-12-01T23:54:12Z","title":"CoRNStack: High-Quality Contrastive Data for Better Code Retrieval and Reranking","version":3},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-12T04:49:20.716737Z"},"links":{"cited_paper":"/paper/2310.14122","citing_paper":"/paper/2412.01007"},"observation_digest":"sha256:4c7a34af9bf729cdf7e585dc5a9e35fc1e311ce0b4ec494323a70bd14d8f9271","observation_id":"fc107f77-85f3-4c5e-be52-ee8670b268dd","resolution":{"observed_at":"2026-08-12T04:49:20.716737Z","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-12T04:49:20.960681Z","title":"Codegen: An open large language model for code with multi-turn program synthesis","venue":null,"work_id":"4aedca56-a50b-4852-887f-6e90c32b1ac5","year":2020},"citing_paper":{"arxiv_id":"2412.01007","last_updated":"2025-03-04T00:36:44Z","snapshot_observed_at":"2026-08-14T12:40:39.050297Z","submitted_at":"2024-12-01T23:54:12Z","title":"CoRNStack: High-Quality Contrastive Data for Better Code Retrieval and Reranking","version":3},"reference_index":2016,"source":"pdf_text","source_observed_at":"2026-08-12T04:49:20.666399Z"},"links":{"citing_paper":"/paper/2412.01007"},"observation_digest":"sha256:1742a9f6ae708afa14cc4fa817aba7e588e12180cce89d56b5a0cdb9be93bdf7","observation_id":"77191967-4838-4c52-a04c-446aea085d35","resolution":{"observed_at":"2026-08-12T04:49:20.965494Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2312.02724","last_updated":"2023-12-05T12:39:00Z","snapshot_observed_at":"2026-08-11T22:23:22.715360Z","submitted_at":"2023-12-05T12:39:00Z","title":"RankZephyr: Effective and Robust Zero-Shot Listwise Reranking is a Breeze!","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.02724","snapshot_observed_at":"2026-08-12T04:49:20.670025Z","title":"Rankzephyr: Effective and robust zero- shot listwise reranking is a breeze! arXiv preprint arXiv:2312.02724,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.01007","last_updated":"2025-03-04T00:36:44Z","snapshot_observed_at":"2026-08-14T12:40:39.050297Z","submitted_at":"2024-12-01T23:54:12Z","title":"CoRNStack: High-Quality Contrastive Data for Better Code Retrieval and Reranking","version":3},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-12T04:49:20.670025Z"},"links":{"cited_paper":"/paper/2312.02724","citing_paper":"/paper/2412.01007"},"observation_digest":"sha256:495e093b433e6a01da961d12ef8abbc2ac22488e227f4c759880149f16a00c25","observation_id":"0327307a-dcc4-4eb7-b271-24a12940d2a2","resolution":{"observed_at":"2026-08-12T04:49:20.670025Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.02883","last_updated":"2025-06-06T03:39:22Z","snapshot_observed_at":"2026-08-14T18:42:47.023606Z","submitted_at":"2024-07-03T07:58:20Z","title":"CoIR: A Comprehensive Benchmark for Code Information Retrieval Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.02883","snapshot_observed_at":"2026-08-12T04:49:20.646693Z","title":"Coir: A comprehensive benchmark for code information retrieval models","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.01007","last_updated":"2025-03-04T00:36:44Z","snapshot_observed_at":"2026-08-14T12:40:39.050297Z","submitted_at":"2024-12-01T23:54:12Z","title":"CoRNStack: High-Quality Contrastive Data for Better Code Retrieval and Reranking","version":3},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-12T04:49:20.646693Z"},"links":{"cited_paper":"/paper/2407.02883","citing_paper":"/paper/2412.01007"},"observation_digest":"sha256:6eb8061bea94831fe4c4e6083746e2abd5f922a3b139e05df437503d6f8684ca","observation_id":"a14b0a13-6a84-4694-8fec-847b49f3098b","resolution":{"observed_at":"2026-08-12T04:49:20.646693Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.12433","last_updated":"2025-02-03T02:14:26Z","snapshot_observed_at":"2026-08-12T23:40:16.765665Z","submitted_at":"2024-06-18T09:29:18Z","title":"LLM4Rerank: LLM-based Auto-Reranking Framework for Recommendations","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.12433","snapshot_observed_at":"2026-08-12T04:49:20.624395Z","title":"Llm-enhanced reranking in recommender systems","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.01007","last_updated":"2025-03-04T00:36:44Z","snapshot_observed_at":"2026-08-14T12:40:39.050297Z","submitted_at":"2024-12-01T23:54:12Z","title":"CoRNStack: High-Quality Contrastive Data for Better Code Retrieval and Reranking","version":3},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-12T04:49:20.624395Z"},"links":{"cited_paper":"/paper/2406.12433","citing_paper":"/paper/2412.01007"},"observation_digest":"sha256:f4a521289dd1a1fa37b4f5cd2e2af74bbfb96a1b40fe0228a6e14f8cd5ba0072","observation_id":"a424d03b-296c-4c20-9eac-8628584793f5","resolution":{"observed_at":"2026-08-12T04:49:20.624395Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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-12T04:49:20.655432Z","title":"Starcoder 2 and the stack v2: The next generation","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.01007","last_updated":"2025-03-04T00:36:44Z","snapshot_observed_at":"2026-08-14T12:40:39.050297Z","submitted_at":"2024-12-01T23:54:12Z","title":"CoRNStack: High-Quality Contrastive Data for Better Code Retrieval and Reranking","version":3},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-12T04:49:20.655432Z"},"links":{"cited_paper":"/paper/2402.19173","citing_paper":"/paper/2412.01007"},"observation_digest":"sha256:8a669cb83057945db27738b77dfef0ae653d456771fd937e24ad85d7c4f0be5a","observation_id":"3abf76f2-0f01-479e-80c8-f4eaf81fdc27","resolution":{"observed_at":"2026-08-12T04:49:20.655432Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2306.17563","last_updated":"2024-03-28T13:59:09Z","snapshot_observed_at":"2026-08-14T20:21:53.563107Z","submitted_at":"2023-06-30T11:32:25Z","title":"Large Language Models are Effective Text Rankers with Pairwise Ranking Prompting","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.17563","snapshot_observed_at":"2026-08-12T04:49:20.673733Z","title":"Large language models are effective text rankers with pairwise ranking prompting","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.01007","last_updated":"2025-03-04T00:36:44Z","snapshot_observed_at":"2026-08-14T12:40:39.050297Z","submitted_at":"2024-12-01T23:54:12Z","title":"CoRNStack: High-Quality Contrastive Data for Better Code Retrieval and Reranking","version":3},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-12T04:49:20.673733Z"},"links":{"cited_paper":"/paper/2306.17563","citing_paper":"/paper/2412.01007"},"observation_digest":"sha256:985a20010c521508135683615b8b65f49a3fe1d2ca392331311cb30fe25ee27b","observation_id":"6a305c39-9d48-4761-88c0-565d587e4bd1","resolution":{"observed_at":"2026-08-12T04:49:20.673733Z","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-12T04:49:20.973586Z","title":"Jina embeddings: A novel set of high-performance sentence embedding models","venue":null,"work_id":"d53234ab-1e11-49f7-82e1-c48c8901f2ca","year":2023},"citing_paper":{"arxiv_id":"2412.01007","last_updated":"2025-03-04T00:36:44Z","snapshot_observed_at":"2026-08-14T12:40:39.050297Z","submitted_at":"2024-12-01T23:54:12Z","title":"CoRNStack: High-Quality Contrastive Data for Better Code Retrieval and Reranking","version":3},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-12T04:49:20.628485Z"},"links":{"citing_paper":"/paper/2412.01007"},"observation_digest":"sha256:37b8a78d219315505c4d6d108093086e2335cd176a612ec3abfc6cb5e2d301bb","observation_id":"a39574cb-241a-4d38-b302-cd7b3792e855","resolution":{"observed_at":"2026-08-12T04:49:20.977760Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.09061","last_updated":"2025-09-05T01:04:00Z","snapshot_observed_at":"2026-08-14T04:22:22.363002Z","submitted_at":"2025-02-13T08:23:42Z","title":"CRANE: Reasoning with constrained LLM generation","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.09061","snapshot_observed_at":"2026-08-12T04:49:20.619870Z","title":"Mark Chen, Jerry Tworek, Heewoo Jun, Qiming Yuan, Henrique Ponde De Oliveira Pinto, Jared Kaplan, Harri Edwards, Yuri Burda, Nicholas Joseph, Greg Brockman, et al","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.01007","last_updated":"2025-03-04T00:36:44Z","snapshot_observed_at":"2026-08-14T12:40:39.050297Z","submitted_at":"2024-12-01T23:54:12Z","title":"CoRNStack: High-Quality Contrastive Data for Better Code Retrieval and Reranking","version":3},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-12T04:49:20.619870Z"},"links":{"cited_paper":"/paper/2502.09061","citing_paper":"/paper/2412.01007"},"observation_digest":"sha256:b218d0d9a1238cda4d3963145f611803e4eec633e527b2a9aaa0faae6d7420b7","observation_id":"c9910d0e-0093-4357-b46a-957b16a3c29d","resolution":{"observed_at":"2026-08-12T04:49:20.619870Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2412.01007","last_updated":"2025-03-04T00:36:44Z","latest_version":3,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-14T12:40:39.050297Z","submitted_at":"2024-12-01T23:54:12Z","title":"CoRNStack: High-Quality Contrastive Data for Better Code Retrieval and Reranking"},"reference_resolution":{"displayed":24,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":19,"verified_exact":0,"verified_fuzzy":4},"total_outbound_references":24},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 24 of 24 outbound references and 5 inbound Pith citation observations for arXiv:2412.01007."}