{"as_of":"2026-08-11T16:40:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5f8be1ed4df1c3a81f87d855320d9dc54c66ef9b873a756a399d2dc46397c1cd","coverage":[{"denominator":45,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":45,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T12:39:57.696817Z","state":"measured"},{"denominator":45,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":45,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2502.07494/citation-record","integrity":"/paper/2502.07494/integrity","json":"/paper/2502.07494/citation-record.json","paper":"/paper/2502.07494"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T12:39:58.275478Z","title":"J., Mao, Y., and Ren, X","venue":null,"work_id":"6339f019-1dfb-41c8-814e-7043b3f32d2d","year":2023},"citing_paper":{"arxiv_id":"2502.07494","last_updated":"2025-02-11T11:53:23Z","snapshot_observed_at":"2026-08-10T11:53:30.849284Z","submitted_at":"2025-02-11T11:53:23Z","title":"URECA: The Chain of Two Minimum Set Cover Problems exists behind Adaptation to Shifts in Semantic Code Search","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-08T12:39:57.532544Z"},"links":{"citing_paper":"/paper/2502.07494"},"observation_digest":"sha256:54d9b8e597d6f2c0876192957e657acdeca9ca341f6a7c8e59b39792400fd110","observation_id":"fb9926be-e1c8-4265-bbfd-d9a01536a9f7","resolution":{"observed_at":"2026-08-08T12:39:58.278978Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-08T12:39:58.264794Z","title":"L ipschitz continuity in model-based reinforcement learning","venue":null,"work_id":"3bb6152f-a8c1-4fe9-86ff-8a9ae0459dea","year":2018},"citing_paper":{"arxiv_id":"2502.07494","last_updated":"2025-02-11T11:53:23Z","snapshot_observed_at":"2026-08-10T11:53:30.849284Z","submitted_at":"2025-02-11T11:53:23Z","title":"URECA: The Chain of Two Minimum Set Cover Problems exists behind Adaptation to Shifts in Semantic Code Search","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-08T12:39:57.536908Z"},"links":{"citing_paper":"/paper/2502.07494"},"observation_digest":"sha256:ec0d5fd849168ae95d9bbcbb162f26e3a192a9cf7b757766bda7dfc91ca5d465","observation_id":"3b5e4fb5-ba4a-4408-b514-a123a38b2b99","resolution":{"observed_at":"2026-08-08T12:39:58.268169Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-08T12:39:57.541050Z","title":"D., Dhariwal, P., Neelakantan, A., Shyam, P., Sastry, G., Askell, A., et al","venue":null,"work_id":null,"year":1901},"citing_paper":{"arxiv_id":"2502.07494","last_updated":"2025-02-11T11:53:23Z","snapshot_observed_at":"2026-08-10T11:53:30.849284Z","submitted_at":"2025-02-11T11:53:23Z","title":"URECA: The Chain of Two Minimum Set Cover Problems exists behind Adaptation to Shifts in Semantic Code Search","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-08T12:39:57.541050Z"},"links":{"citing_paper":"/paper/2502.07494"},"observation_digest":"sha256:9ef6f042f6b9f6e66ce86000103434af71b06dbd46cce64059d2ce7c216c66fa","observation_id":"74b9cdbe-45ce-4f46-a5a2-603fa1a4ffe0","resolution":{"observed_at":"2026-08-08T12:39:57.541050Z","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-08T12:39:58.245913Z","title":"When deep learning met code search","venue":null,"work_id":"e52b70be-5b3b-4f27-a1c4-8dcd823ba4c9","year":2019},"citing_paper":{"arxiv_id":"2502.07494","last_updated":"2025-02-11T11:53:23Z","snapshot_observed_at":"2026-08-10T11:53:30.849284Z","submitted_at":"2025-02-11T11:53:23Z","title":"URECA: The Chain of Two Minimum Set Cover Problems exists behind Adaptation to Shifts in Semantic Code Search","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-08T12:39:57.545500Z"},"links":{"citing_paper":"/paper/2502.07494"},"observation_digest":"sha256:42cae08e911b2a24cb16de52836825a3892cb43aea93e7918f76b4de7d73f894","observation_id":"82215a0a-66e5-4dab-9740-b7b417f5fb06","resolution":{"observed_at":"2026-08-08T12:39:58.249268Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-08T12:39:58.233996Z","title":"Minimum entropy combinatorial optimization problems","venue":null,"work_id":"34a43b1c-3956-4e09-83d7-ded2311a61da","year":2012},"citing_paper":{"arxiv_id":"2502.07494","last_updated":"2025-02-11T11:53:23Z","snapshot_observed_at":"2026-08-10T11:53:30.849284Z","submitted_at":"2025-02-11T11:53:23Z","title":"URECA: The Chain of Two Minimum Set Cover Problems exists behind Adaptation to Shifts in Semantic Code Search","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-08T12:39:57.549070Z"},"links":{"citing_paper":"/paper/2502.07494"},"observation_digest":"sha256:079b9c96995b2dcbfbb43433b9f7eeb542e24eba47b71bd5cdea6275209f100b","observation_id":"f55198ee-eb11-4bdc-a85d-83e4a0437771","resolution":{"observed_at":"2026-08-08T12:39:58.237287Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-08T12:39:58.223869Z","title":"In-context sharpness as alerts: An inner representation perspective for hallucination mitigation","venue":null,"work_id":"5e47121e-20da-427f-9eeb-cfa885e639c0","year":2024},"citing_paper":{"arxiv_id":"2502.07494","last_updated":"2025-02-11T11:53:23Z","snapshot_observed_at":"2026-08-10T11:53:30.849284Z","submitted_at":"2025-02-11T11:53:23Z","title":"URECA: The Chain of Two Minimum Set Cover Problems exists behind Adaptation to Shifts in Semantic Code Search","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-08T12:39:57.553279Z"},"links":{"citing_paper":"/paper/2502.07494"},"observation_digest":"sha256:d6c9edf76525b77c6023eea3e004357a9eeeae57143de764b92bb169711c3f9e","observation_id":"a47e83fe-bbc2-421a-ba48-1c7a8c157721","resolution":{"observed_at":"2026-08-08T12:39:58.227429Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-08T12:39:57.556937Z","title":"Infogan: Interpretable representation learning by information maximizing generative adversarial nets","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2502.07494","last_updated":"2025-02-11T11:53:23Z","snapshot_observed_at":"2026-08-10T11:53:30.849284Z","submitted_at":"2025-02-11T11:53:23Z","title":"URECA: The Chain of Two Minimum Set Cover Problems exists behind Adaptation to Shifts in Semantic Code Search","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-08T12:39:57.556937Z"},"links":{"citing_paper":"/paper/2502.07494"},"observation_digest":"sha256:b045a124843e237a31c3a9ac06c7076b471854d52817b595add3301a65c80d38","observation_id":"a5b78aba-acaf-4474-bf7b-02cfc98607a8","resolution":{"observed_at":"2026-08-08T12:39:57.556937Z","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-08T12:39:58.208076Z","title":null,"venue":null,"work_id":"43fd2d8e-4101-45f4-a924-461ae9d50d48","year":2017},"citing_paper":{"arxiv_id":"2502.07494","last_updated":"2025-02-11T11:53:23Z","snapshot_observed_at":"2026-08-10T11:53:30.849284Z","submitted_at":"2025-02-11T11:53:23Z","title":"URECA: The Chain of Two Minimum Set Cover Problems exists behind Adaptation to Shifts in Semantic Code Search","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-08T12:39:57.560284Z"},"links":{"citing_paper":"/paper/2502.07494"},"observation_digest":"sha256:6ef51a159cb45cd3d0a63f3ecc4588605ff6d4b8fe8bb40516407d79e82d8021","observation_id":"46e15ca9-66ee-41e6-b6d3-9e365603883b","resolution":{"observed_at":"2026-08-08T12:39:58.211949Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-08T12:39:58.198030Z","title":"Codebert: A pre-trained model for programming and natural languages","venue":null,"work_id":"178be10a-6a56-4f9c-92c9-a124ada38250","year":2020},"citing_paper":{"arxiv_id":"2502.07494","last_updated":"2025-02-11T11:53:23Z","snapshot_observed_at":"2026-08-10T11:53:30.849284Z","submitted_at":"2025-02-11T11:53:23Z","title":"URECA: The Chain of Two Minimum Set Cover Problems exists behind Adaptation to Shifts in Semantic Code Search","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-08T12:39:57.563748Z"},"links":{"citing_paper":"/paper/2502.07494"},"observation_digest":"sha256:811bc822683b2a5298906f1ea38d7b906a090a454bcb0a003143244245b11fed","observation_id":"7d24136c-c3e4-494c-b494-a6676761c117","resolution":{"observed_at":"2026-08-08T12:39:58.202010Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-08T12:39:58.188291Z","title":"and Bengio, Y","venue":null,"work_id":"1e3aba0c-a8fa-4f0b-8d60-7f7593a3494a","year":2004},"citing_paper":{"arxiv_id":"2502.07494","last_updated":"2025-02-11T11:53:23Z","snapshot_observed_at":"2026-08-10T11:53:30.849284Z","submitted_at":"2025-02-11T11:53:23Z","title":"URECA: The Chain of Two Minimum Set Cover Problems exists behind Adaptation to Shifts in Semantic Code Search","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-08T12:39:57.566952Z"},"links":{"citing_paper":"/paper/2502.07494"},"observation_digest":"sha256:1900dc3911a74a4cc627dc907a5df478fb982f1781753fd96f3c68777b03652c","observation_id":"aaabbbe6-a3e0-456e-8174-7fda08f9182e","resolution":{"observed_at":"2026-08-08T12:39:58.191793Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/0-306-47019-5_2","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T00:03:40.895421Z","title":null,"venue":"Kluwer Academic Publishers eBooks","work_id":"6060b24d-46b2-4933-8702-35c34c1c7a27","year":2000},"citing_paper":{"arxiv_id":"2502.07494","last_updated":"2025-02-11T11:53:23Z","snapshot_observed_at":"2026-08-10T11:53:30.849284Z","submitted_at":"2025-02-11T11:53:23Z","title":"URECA: The Chain of Two Minimum Set Cover Problems exists behind Adaptation to Shifts in Semantic Code Search","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-08T12:39:57.569970Z"},"links":{"citing_paper":"/paper/2502.07494"},"observation_digest":"sha256:ff65ea9468ca015c774c1333459d09a2f6d2b9da5fde5dabd71ca94ff6fa04c6","observation_id":"82b4f2d6-336c-41f4-b1a1-ef17826222d6","resolution":{"observed_at":"2026-08-08T12:39:57.753478Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-08T12:39:58.178653Z","title":"Deep code search","venue":null,"work_id":"ae4d073e-17f8-4835-92d3-3b6b8a6b0ab4","year":2018},"citing_paper":{"arxiv_id":"2502.07494","last_updated":"2025-02-11T11:53:23Z","snapshot_observed_at":"2026-08-10T11:53:30.849284Z","submitted_at":"2025-02-11T11:53:23Z","title":"URECA: The Chain of Two Minimum Set Cover Problems exists behind Adaptation to Shifts in Semantic Code Search","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-08T12:39:57.574832Z"},"links":{"citing_paper":"/paper/2502.07494"},"observation_digest":"sha256:7024e5ad1f112fa522bd9afca9905b3fa710073448cff59790322d7ce4f5ecbc","observation_id":"1ee77959-3719-4a88-bf69-3868c9e02980","resolution":{"observed_at":"2026-08-08T12:39:58.181849Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-08T12:39:58.169200Z","title":"K., Clement, C","venue":null,"work_id":"1d7f7fc0-80fc-4c09-ab8d-a4d14ece6e48","year":2021},"citing_paper":{"arxiv_id":"2502.07494","last_updated":"2025-02-11T11:53:23Z","snapshot_observed_at":"2026-08-10T11:53:30.849284Z","submitted_at":"2025-02-11T11:53:23Z","title":"URECA: The Chain of Two Minimum Set Cover Problems exists behind Adaptation to Shifts in Semantic Code Search","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-08T12:39:57.577907Z"},"links":{"citing_paper":"/paper/2502.07494"},"observation_digest":"sha256:d9cd0c2da7d1fd49b96a0ea747c04c84890968f04dd6f17622dc058e1901b0ab","observation_id":"31724c68-b24c-4415-997f-ac76f0fb8d78","resolution":{"observed_at":"2026-08-08T12:39:58.172376Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-08T12:39:58.159776Z","title":"UniXcoder : Unified cross-modal pre-training for code representation","venue":null,"work_id":"9508740a-5f19-4732-ade7-9dd07575c877","year":2022},"citing_paper":{"arxiv_id":"2502.07494","last_updated":"2025-02-11T11:53:23Z","snapshot_observed_at":"2026-08-10T11:53:30.849284Z","submitted_at":"2025-02-11T11:53:23Z","title":"URECA: The Chain of Two Minimum Set Cover Problems exists behind Adaptation to Shifts in Semantic Code Search","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-08T12:39:57.581666Z"},"links":{"citing_paper":"/paper/2502.07494"},"observation_digest":"sha256:ae17c26ad68ed99ad5f512c54e4a1dfaf9461dab734496b45d8ccd008d2aff21","observation_id":"377f3f54-ca55-4411-83bd-0cf26328d21c","resolution":{"observed_at":"2026-08-08T12:39:58.163101Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-08T12:39:58.148861Z","title":"and Gilbert, S","venue":null,"work_id":"4c25f2cd-96a5-454a-b84b-efbd0c7bd1fc","year":2016},"citing_paper":{"arxiv_id":"2502.07494","last_updated":"2025-02-11T11:53:23Z","snapshot_observed_at":"2026-08-10T11:53:30.849284Z","submitted_at":"2025-02-11T11:53:23Z","title":"URECA: The Chain of Two Minimum Set Cover Problems exists behind Adaptation to Shifts in Semantic Code Search","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-08T12:39:57.585514Z"},"links":{"citing_paper":"/paper/2502.07494"},"observation_digest":"sha256:62fb218e75786cf1f9bdd04ab9c33e6070ccd28a5bba8dfd5bb5a87aa8f3c016","observation_id":"1a2330b1-131c-456a-816a-6b2a3f512149","resolution":{"observed_at":"2026-08-08T12:39:58.153010Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-08T12:39:58.137600Z","title":"and Karp, R","venue":null,"work_id":"5a2d3109-265c-4f1b-b69f-aa22f9f8bc20","year":2005},"citing_paper":{"arxiv_id":"2502.07494","last_updated":"2025-02-11T11:53:23Z","snapshot_observed_at":"2026-08-10T11:53:30.849284Z","submitted_at":"2025-02-11T11:53:23Z","title":"URECA: The Chain of Two Minimum Set Cover Problems exists behind Adaptation to Shifts in Semantic Code Search","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-08T12:39:57.588785Z"},"links":{"citing_paper":"/paper/2502.07494"},"observation_digest":"sha256:4f760be104e39910705609d455530aa639fc2026c8a34ef79c944b7c5f031c16","observation_id":"0d0d87d9-b503-4f4b-9231-74b4116d6896","resolution":{"observed_at":"2026-08-08T12:39:58.141420Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-08T12:39:58.125466Z","title":"CoSQA : 20, 000+ web queries for code search and question answering","venue":null,"work_id":"25c0cd4c-f526-4364-9a3e-09215327f755","year":2021},"citing_paper":{"arxiv_id":"2502.07494","last_updated":"2025-02-11T11:53:23Z","snapshot_observed_at":"2026-08-10T11:53:30.849284Z","submitted_at":"2025-02-11T11:53:23Z","title":"URECA: The Chain of Two Minimum Set Cover Problems exists behind Adaptation to Shifts in Semantic Code Search","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-08T12:39:57.592542Z"},"links":{"citing_paper":"/paper/2502.07494"},"observation_digest":"sha256:92070c15254506df1d7487cbbdcc8aa75ed5d283d03ec6005ab5433df16b8fd5","observation_id":"72ac312f-303d-4095-9516-178f3f28c3c1","resolution":{"observed_at":"2026-08-08T12:39:58.130625Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-08T12:39:57.595813Z","title":"A survey on hallucination in large language models: Principles, taxonomy, challenges, and open questions","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2502.07494","last_updated":"2025-02-11T11:53:23Z","snapshot_observed_at":"2026-08-10T11:53:30.849284Z","submitted_at":"2025-02-11T11:53:23Z","title":"URECA: The Chain of Two Minimum Set Cover Problems exists behind Adaptation to Shifts in Semantic Code Search","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-08T12:39:57.595813Z"},"links":{"citing_paper":"/paper/2502.07494"},"observation_digest":"sha256:1cc6c0cdc941cbc7302c3e9cee852d40c47138257343d1aab490f5ad4edb6f92","observation_id":"63e0eefa-10db-45a3-b749-d1379b6b92d9","resolution":{"observed_at":"2026-08-08T12:39:57.595813Z","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-08T12:39:57.598956Z","title":"CodeSearchNet Challenge : Evaluating the state of semantic code search","venue":null,"work_id":null,"year":1909},"citing_paper":{"arxiv_id":"2502.07494","last_updated":"2025-02-11T11:53:23Z","snapshot_observed_at":"2026-08-10T11:53:30.849284Z","submitted_at":"2025-02-11T11:53:23Z","title":"URECA: The Chain of Two Minimum Set Cover Problems exists behind Adaptation to Shifts in Semantic Code Search","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-08T12:39:57.598956Z"},"links":{"cited_paper":"/paper/1909.09436","citing_paper":"/paper/2502.07494"},"observation_digest":"sha256:d9c0aa75d32dc1ce3e11f9ba6e20da984ee5843264406ab597e031d843770e08","observation_id":"bcaf0942-ce36-47db-8fac-509df62862e6","resolution":{"observed_at":"2026-08-08T12:39:57.598956Z","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-08T12:39:58.114405Z","title":"Ib-gan: Disentangled representation learning with information bottleneck generative adversarial networks","venue":null,"work_id":"6616920d-00bb-4bd3-a727-fc7530955cba","year":2021},"citing_paper":{"arxiv_id":"2502.07494","last_updated":"2025-02-11T11:53:23Z","snapshot_observed_at":"2026-08-10T11:53:30.849284Z","submitted_at":"2025-02-11T11:53:23Z","title":"URECA: The Chain of Two Minimum Set Cover Problems exists behind Adaptation to Shifts in Semantic Code Search","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-08T12:39:57.604491Z"},"links":{"citing_paper":"/paper/2502.07494"},"observation_digest":"sha256:39330a9cc7d1576b5c3a819be6664b6633e1d77efb2592e2a55cf37d5fc15ccf","observation_id":"b588f368-788b-4347-bf31-96f319881034","resolution":{"observed_at":"2026-08-08T12:39:58.118021Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-08T12:39:58.103760Z","title":"and Yoon, H","venue":null,"work_id":"5e58f598-2b81-4bcf-a6aa-acfd9c60613e","year":2012},"citing_paper":{"arxiv_id":"2502.07494","last_updated":"2025-02-11T11:53:23Z","snapshot_observed_at":"2026-08-10T11:53:30.849284Z","submitted_at":"2025-02-11T11:53:23Z","title":"URECA: The Chain of Two Minimum Set Cover Problems exists behind Adaptation to Shifts in Semantic Code Search","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-08T12:39:57.608233Z"},"links":{"citing_paper":"/paper/2502.07494"},"observation_digest":"sha256:4af90461e27451c9df3a04a75cf4242fbcc0413f7c78bfde19a57fe157c71dcb","observation_id":"28d10552-dc99-4b96-bca8-6d2a4996cf56","resolution":{"observed_at":"2026-08-08T12:39:58.106921Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-08T12:39:58.093817Z","title":"Entropy is not enough for test-time adaptation: From the perspective of disentangled factors","venue":null,"work_id":"239fcef0-5255-40ba-94c0-cb721b8c71cb","year":2024},"citing_paper":{"arxiv_id":"2502.07494","last_updated":"2025-02-11T11:53:23Z","snapshot_observed_at":"2026-08-10T11:53:30.849284Z","submitted_at":"2025-02-11T11:53:23Z","title":"URECA: The Chain of Two Minimum Set Cover Problems exists behind Adaptation to Shifts in Semantic Code Search","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-08T12:39:57.612405Z"},"links":{"citing_paper":"/paper/2502.07494"},"observation_digest":"sha256:527889777bbebe45a90c58c8855823d572fe194e43ae91de9df7ad9940857268","observation_id":"1c2a65c7-fa80-41fa-a999-5ae8e3cf0ad2","resolution":{"observed_at":"2026-08-08T12:39:58.097418Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-08T12:39:57.616021Z","title":"u ttler, H., Lewis, M., Yih, W.-t., Rockt \\","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2502.07494","last_updated":"2025-02-11T11:53:23Z","snapshot_observed_at":"2026-08-10T11:53:30.849284Z","submitted_at":"2025-02-11T11:53:23Z","title":"URECA: The Chain of Two Minimum Set Cover Problems exists behind Adaptation to Shifts in Semantic Code Search","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-08T12:39:57.616021Z"},"links":{"citing_paper":"/paper/2502.07494"},"observation_digest":"sha256:7c4527687f2f555b6127ed3f0a7d5db8a78b94a97026efb3d3d3b8cd8c75baad","observation_id":"7f9fb613-515e-4091-a1d5-bef11a973dbb","resolution":{"observed_at":"2026-08-08T12:39:57.616021Z","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":"10.18653/v1/2023.emnlp-main.786","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Rethinking negative pairs in code search","venue":null,"work_id":"8f134c4b-48f5-417d-a95f-56db03893636","year":2023},"citing_paper":{"arxiv_id":"2502.07494","last_updated":"2025-02-11T11:53:23Z","snapshot_observed_at":"2026-08-10T11:53:30.849284Z","submitted_at":"2025-02-11T11:53:23Z","title":"URECA: The Chain of Two Minimum Set Cover Problems exists behind Adaptation to Shifts in Semantic Code Search","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-08T12:39:57.619233Z"},"links":{"citing_paper":"/paper/2502.07494"},"observation_digest":"sha256:3a1c65d3fe57830ca2c7cf556dac47789a8d7794541feec22f5a6bea3af25746","observation_id":"dd5c53c8-8c81-4a58-8b4d-38af6e081b20","resolution":{"observed_at":"2026-08-08T12:39:57.736073Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-08T12:39:57.622461Z","title":"Rewriting the code: A simple method for large language model augmented code search","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.07494","last_updated":"2025-02-11T11:53:23Z","snapshot_observed_at":"2026-08-10T11:53:30.849284Z","submitted_at":"2025-02-11T11:53:23Z","title":"URECA: The Chain of Two Minimum Set Cover Problems exists behind Adaptation to Shifts in Semantic Code Search","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-08T12:39:57.622461Z"},"links":{"citing_paper":"/paper/2502.07494"},"observation_digest":"sha256:68f2b76ae63787342cf4ac0945bf76f9037cfb00b1d179f7e7b452b0d68f2b8f","observation_id":"0639a2d7-66e7-4078-9786-f04367c5e6a6","resolution":{"observed_at":"2026-08-08T12:39:57.622461Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1906.06034","last_updated":"2020-08-07T17:28:18Z","snapshot_observed_at":"2026-07-06T08:00:16.619191Z","submitted_at":"2019-06-14T05:56:20Z","title":"InfoGAN-CR and ModelCentrality: Self-supervised Model Training and Selection for Disentangling GANs","version":3},"cited_work":{"arxiv_id":"1906.06034","doi":null,"metadata_source":"pith","pith_arxiv_id":"1906.06034","snapshot_observed_at":"2026-08-08T12:39:57.936222Z","title":"InfoGAN-CR and ModelCentrality: Self-supervised Model Training and Selection for Disentangling GANs","venue":"cs.LG","work_id":"0b4e1041-0a0c-40f2-8e5e-f10a06775543","year":2019},"citing_paper":{"arxiv_id":"2502.07494","last_updated":"2025-02-11T11:53:23Z","snapshot_observed_at":"2026-08-10T11:53:30.849284Z","submitted_at":"2025-02-11T11:53:23Z","title":"URECA: The Chain of Two Minimum Set Cover Problems exists behind Adaptation to Shifts in Semantic Code Search","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-08T12:39:57.626217Z"},"links":{"cited_paper":"/paper/1906.06034","citing_paper":"/paper/2502.07494"},"observation_digest":"sha256:b731d22b7dc9d54e4f796aa5068c4de0177368468fd98e2cf7992ee3aa0aa1ae","observation_id":"5a54845f-374e-464a-a7dd-395c59f1248f","resolution":{"observed_at":"2026-08-08T12:39:57.940355Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-08T12:39:58.078844Z","title":"Activity image-to-video retrieval by disentangling appearance and motion","venue":null,"work_id":"bdb6c7f5-35ac-4180-ac67-264ace12a90d","year":2021},"citing_paper":{"arxiv_id":"2502.07494","last_updated":"2025-02-11T11:53:23Z","snapshot_observed_at":"2026-08-10T11:53:30.849284Z","submitted_at":"2025-02-11T11:53:23Z","title":"URECA: The Chain of Two Minimum Set Cover Problems exists behind Adaptation to Shifts in Semantic Code Search","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-08T12:39:57.630650Z"},"links":{"citing_paper":"/paper/2502.07494"},"observation_digest":"sha256:792b7ea1668da4b10d0c94620008fcde8389984dbc50eceb1c3ad0ad7ceeea0e","observation_id":"ec29e0e9-a408-42d8-9420-0e6965b44a41","resolution":{"observed_at":"2026-08-08T12:39:58.082109Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1205.1117","last_updated":"2012-05-05T09:55:22Z","snapshot_observed_at":"2026-07-06T02:47:35.279271Z","submitted_at":"2012-05-05T09:55:22Z","title":"An Overview on Clustering Methods","version":1},"cited_work":{"arxiv_id":"1205.1117","doi":null,"metadata_source":"pith","pith_arxiv_id":"1205.1117","snapshot_observed_at":"2026-08-08T12:39:57.922910Z","title":"An Overview on Clustering Methods","venue":"cs.DS","work_id":"4c2fa4ed-092f-46ec-9959-b32f42711a22","year":2012},"citing_paper":{"arxiv_id":"2502.07494","last_updated":"2025-02-11T11:53:23Z","snapshot_observed_at":"2026-08-10T11:53:30.849284Z","submitted_at":"2025-02-11T11:53:23Z","title":"URECA: The Chain of Two Minimum Set Cover Problems exists behind Adaptation to Shifts in Semantic Code Search","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-08T12:39:57.634597Z"},"links":{"cited_paper":"/paper/1205.1117","citing_paper":"/paper/2502.07494"},"observation_digest":"sha256:d009d447ce95a5136b53b82326a1a6aaf53c4dc206bdaf53c0510648dfcb6731","observation_id":"7931157a-a7d5-49e9-b0b5-efc68d9f0801","resolution":{"observed_at":"2026-08-08T12:39:57.926391Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-08T12:39:58.069228Z","title":"Cross-entropy loss functions: Theoretical analysis and applications","venue":null,"work_id":"5defb56e-0f9a-442e-aa6d-260cf7d1897e","year":2023},"citing_paper":{"arxiv_id":"2502.07494","last_updated":"2025-02-11T11:53:23Z","snapshot_observed_at":"2026-08-10T11:53:30.849284Z","submitted_at":"2025-02-11T11:53:23Z","title":"URECA: The Chain of Two Minimum Set Cover Problems exists behind Adaptation to Shifts in Semantic Code Search","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-08T12:39:57.638147Z"},"links":{"citing_paper":"/paper/2502.07494"},"observation_digest":"sha256:6bca359c2bb7608a53a5be36888d3581a5b0082c16b27f0d3c558c0dab21a94c","observation_id":"2885ac0c-510a-4601-b1c0-104eb8c9cb7a","resolution":{"observed_at":"2026-08-08T12:39:58.072719Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-08T12:39:57.642448Z","title":"RAGT ruth: A hallucination corpus for developing trustworthy retrieval-augmented language models","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.07494","last_updated":"2025-02-11T11:53:23Z","snapshot_observed_at":"2026-08-10T11:53:30.849284Z","submitted_at":"2025-02-11T11:53:23Z","title":"URECA: The Chain of Two Minimum Set Cover Problems exists behind Adaptation to Shifts in Semantic Code Search","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-08T12:39:57.642448Z"},"links":{"citing_paper":"/paper/2502.07494"},"observation_digest":"sha256:b281fef9016cfe2e3acd81cdcb9fca72942a59da0994870f84da25219ece5909","observation_id":"568ef798-5f90-4b06-9f37-4a088ab0845f","resolution":{"observed_at":"2026-08-08T12:39:57.642448Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1807.03748","last_updated":"2019-01-22T18:47:12Z","snapshot_observed_at":"2026-07-06T06:49:24.960992Z","submitted_at":"2018-07-10T16:52:11Z","title":"Representation Learning with Contrastive Predictive Coding","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1807.03748","snapshot_observed_at":"2026-08-08T12:39:57.646484Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2502.07494","last_updated":"2025-02-11T11:53:23Z","snapshot_observed_at":"2026-08-10T11:53:30.849284Z","submitted_at":"2025-02-11T11:53:23Z","title":"URECA: The Chain of Two Minimum Set Cover Problems exists behind Adaptation to Shifts in Semantic Code Search","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-08T12:39:57.646484Z"},"links":{"cited_paper":"/paper/1807.03748","citing_paper":"/paper/2502.07494"},"observation_digest":"sha256:7329a715d54bac5a2108d9d57e50570f0014fc0d3e21eda92df69d3dec27a826","observation_id":"86c2699c-7de7-4e9c-8b99-44586ac0133b","resolution":{"observed_at":"2026-08-08T12:39:57.646484Z","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-08T12:39:58.058780Z","title":"The entropy enigma: Success and failure of entropy minimization","venue":null,"work_id":"76a7296d-913a-46d4-a7f8-60839fe37076","year":2024},"citing_paper":{"arxiv_id":"2502.07494","last_updated":"2025-02-11T11:53:23Z","snapshot_observed_at":"2026-08-10T11:53:30.849284Z","submitted_at":"2025-02-11T11:53:23Z","title":"URECA: The Chain of Two Minimum Set Cover Problems exists behind Adaptation to Shifts in Semantic Code Search","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-08T12:39:57.650420Z"},"links":{"citing_paper":"/paper/2502.07494"},"observation_digest":"sha256:839d1e98c73cb540567f3b88951ce806c905e2147fc16c2d8ad4e2980f4d0486","observation_id":"1dcf8cfa-442a-4682-83c4-93e9ac4fc220","resolution":{"observed_at":"2026-08-08T12:39:58.062638Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-08T12:39:58.048952Z","title":null,"venue":null,"work_id":"3880a652-d5b9-4b54-b405-f3dac917665c","year":1948},"citing_paper":{"arxiv_id":"2502.07494","last_updated":"2025-02-11T11:53:23Z","snapshot_observed_at":"2026-08-10T11:53:30.849284Z","submitted_at":"2025-02-11T11:53:23Z","title":"URECA: The Chain of Two Minimum Set Cover Problems exists behind Adaptation to Shifts in Semantic Code Search","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-08T12:39:57.654298Z"},"links":{"citing_paper":"/paper/2502.07494"},"observation_digest":"sha256:14bfec28ec9e25fd11c683ba216e02454745e5fd46d2c5ecc488ae8cd2a0a6e6","observation_id":"21e9d234-d284-4678-8a64-f19b23c5c255","resolution":{"observed_at":"2026-08-08T12:39:58.052306Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-08T12:39:57.657414Z","title":"Cocosoda: Effective contrastive learning for code search","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.07494","last_updated":"2025-02-11T11:53:23Z","snapshot_observed_at":"2026-08-10T11:53:30.849284Z","submitted_at":"2025-02-11T11:53:23Z","title":"URECA: The Chain of Two Minimum Set Cover Problems exists behind Adaptation to Shifts in Semantic Code Search","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-08T12:39:57.657414Z"},"links":{"citing_paper":"/paper/2502.07494"},"observation_digest":"sha256:37c0275650598689239e7369d81c56d06cd84c1b17e463e9c5e5ffea5edb7b22","observation_id":"9eb0732f-0f9b-4f3d-94d9-f2d04dbfce5d","resolution":{"observed_at":"2026-08-08T12:39:57.657414Z","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-08T12:39:58.037820Z","title":"Disentangled representation learning gan for pose-invariant face recognition","venue":null,"work_id":"9c8dca01-645e-4576-95a1-18286166f900","year":2017},"citing_paper":{"arxiv_id":"2502.07494","last_updated":"2025-02-11T11:53:23Z","snapshot_observed_at":"2026-08-10T11:53:30.849284Z","submitted_at":"2025-02-11T11:53:23Z","title":"URECA: The Chain of Two Minimum Set Cover Problems exists behind Adaptation to Shifts in Semantic Code Search","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-08T12:39:57.661577Z"},"links":{"citing_paper":"/paper/2502.07494"},"observation_digest":"sha256:13dec40e4f62456f3fbd2b0e65bd0bc55e691e4f750662ddea8c122b9e01b8bc","observation_id":"37d862ef-5fb8-4ebc-927e-eb6eb85afcdd","resolution":{"observed_at":"2026-08-08T12:39:58.041969Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-08T12:39:58.028416Z","title":"Tent: Fully test-time adaptation by entropy minimization","venue":null,"work_id":"5d602c88-66bd-440f-991c-7beb232e4da2","year":2021},"citing_paper":{"arxiv_id":"2502.07494","last_updated":"2025-02-11T11:53:23Z","snapshot_observed_at":"2026-08-10T11:53:30.849284Z","submitted_at":"2025-02-11T11:53:23Z","title":"URECA: The Chain of Two Minimum Set Cover Problems exists behind Adaptation to Shifts in Semantic Code Search","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-08T12:39:57.665825Z"},"links":{"citing_paper":"/paper/2502.07494"},"observation_digest":"sha256:91ffedcce9e7f8fdec0a9cd6ddeaeb734efce8862eda1093262131b7348163e6","observation_id":"370ab9c6-0cda-4a39-a571-39aba1693bc5","resolution":{"observed_at":"2026-08-08T12:39:58.031793Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2211.11695","last_updated":"2024-06-26T19:29:39Z","snapshot_observed_at":"2026-08-09T15:15:30.992618Z","submitted_at":"2022-11-21T18:14:38Z","title":"Disentangled Representation Learning","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2211.11695","snapshot_observed_at":"2026-08-08T12:39:57.669041Z","title":"Disentangled representation learning","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.07494","last_updated":"2025-02-11T11:53:23Z","snapshot_observed_at":"2026-08-10T11:53:30.849284Z","submitted_at":"2025-02-11T11:53:23Z","title":"URECA: The Chain of Two Minimum Set Cover Problems exists behind Adaptation to Shifts in Semantic Code Search","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-08T12:39:57.669041Z"},"links":{"cited_paper":"/paper/2211.11695","citing_paper":"/paper/2502.07494"},"observation_digest":"sha256:bd31b6ba4568607557ce2f7b92c3dea8bdcdf358c524613f2c1dfad16b3c3d9d","observation_id":"a3bacbd3-6408-4436-95d1-57ce16db69b9","resolution":{"observed_at":"2026-08-08T12:39:57.669041Z","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-08T12:39:58.018061Z","title":"R., and Hoi, S","venue":null,"work_id":"221074b2-3a6e-48f2-bd8c-ff0563d0f278","year":2021},"citing_paper":{"arxiv_id":"2502.07494","last_updated":"2025-02-11T11:53:23Z","snapshot_observed_at":"2026-08-10T11:53:30.849284Z","submitted_at":"2025-02-11T11:53:23Z","title":"URECA: The Chain of Two Minimum Set Cover Problems exists behind Adaptation to Shifts in Semantic Code Search","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-08T12:39:57.672576Z"},"links":{"citing_paper":"/paper/2502.07494"},"observation_digest":"sha256:159d1f723fe07c505b82668e42d189a0c055ff32b463397a97e1a42a3cf7e25f","observation_id":"9622473f-f4e1-4e87-89ca-4f4baba9e76e","resolution":{"observed_at":"2026-08-08T12:39:58.021717Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-08T12:39:58.005355Z","title":null,"venue":null,"work_id":"c3973ed7-496f-443d-a698-280d6d88c52c","year":2023},"citing_paper":{"arxiv_id":"2502.07494","last_updated":"2025-02-11T11:53:23Z","snapshot_observed_at":"2026-08-10T11:53:30.849284Z","submitted_at":"2025-02-11T11:53:23Z","title":"URECA: The Chain of Two Minimum Set Cover Problems exists behind Adaptation to Shifts in Semantic Code Search","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-08T12:39:57.676087Z"},"links":{"citing_paper":"/paper/2502.07494"},"observation_digest":"sha256:e84b8a7da476eed4721443f625e83e2c9a476ca5dbf2d26b73f9f4d0de46f62e","observation_id":"4e7cae91-0159-4774-9e19-d18ff51c7c6c","resolution":{"observed_at":"2026-08-08T12:39:58.008833Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-08T12:39:57.994734Z","title":null,"venue":null,"work_id":"82e88c93-d9f5-4691-bcec-9a26aefdafba","year":2022},"citing_paper":{"arxiv_id":"2502.07494","last_updated":"2025-02-11T11:53:23Z","snapshot_observed_at":"2026-08-10T11:53:30.849284Z","submitted_at":"2025-02-11T11:53:23Z","title":"URECA: The Chain of Two Minimum Set Cover Problems exists behind Adaptation to Shifts in Semantic Code Search","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-08T12:39:57.679118Z"},"links":{"citing_paper":"/paper/2502.07494"},"observation_digest":"sha256:0f7e488b809bcbe564e8b4dc030736f4ea6210e32ebbc1d705aea5a16e3cb370","observation_id":"876d2e56-7451-4554-86a7-81be78b2d581","resolution":{"observed_at":"2026-08-08T12:39:57.997957Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1711.05415","last_updated":"2018-03-28T02:42:06Z","snapshot_observed_at":"2026-07-06T06:09:32.998168Z","submitted_at":"2017-11-15T05:49:39Z","title":"DNA-GAN: Learning Disentangled Representations from Multi-Attribute Images","version":2},"cited_work":{"arxiv_id":"1711.05415","doi":null,"metadata_source":"pith","pith_arxiv_id":"1711.05415","snapshot_observed_at":"2026-08-08T12:39:57.764976Z","title":"DNA-GAN: Learning Disentangled Representations from Multi-Attribute Images","venue":"cs.CV","work_id":"caf4c2c8-eb69-42d2-8313-a6b9fc09d38c","year":2017},"citing_paper":{"arxiv_id":"2502.07494","last_updated":"2025-02-11T11:53:23Z","snapshot_observed_at":"2026-08-10T11:53:30.849284Z","submitted_at":"2025-02-11T11:53:23Z","title":"URECA: The Chain of Two Minimum Set Cover Problems exists behind Adaptation to Shifts in Semantic Code Search","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-08T12:39:57.682684Z"},"links":{"cited_paper":"/paper/1711.05415","citing_paper":"/paper/2502.07494"},"observation_digest":"sha256:78a8d61a44c5fcaad9a08dadbc61e2fe369e31da035f8cc6163a2f94a8657217","observation_id":"30c9c544-f897-4ce6-b637-db1dfa5d0ad8","resolution":{"observed_at":"2026-08-08T12:39:57.768716Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-08T12:39:57.983752Z","title":"Learning to mine aligned code and natural language pairs from stack overflow","venue":null,"work_id":"4d9c3987-d2b7-46fe-a459-01dfe0e69840","year":2018},"citing_paper":{"arxiv_id":"2502.07494","last_updated":"2025-02-11T11:53:23Z","snapshot_observed_at":"2026-08-10T11:53:30.849284Z","submitted_at":"2025-02-11T11:53:23Z","title":"URECA: The Chain of Two Minimum Set Cover Problems exists behind Adaptation to Shifts in Semantic Code Search","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-08T12:39:57.686613Z"},"links":{"citing_paper":"/paper/2502.07494"},"observation_digest":"sha256:50019bdff9ad99097043e9a824b7a5d6b7e2e683fa2f624c9cc51c681d3c5948","observation_id":"fca44c0d-e322-46c2-bdf5-418674afd768","resolution":{"observed_at":"2026-08-08T12:39:57.987649Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-08T12:39:57.972346Z","title":"Disentangled code representation learning for multiple programming languages","venue":null,"work_id":"01f9af42-e080-400d-a8fb-ce1c5ddc0452","year":2021},"citing_paper":{"arxiv_id":"2502.07494","last_updated":"2025-02-11T11:53:23Z","snapshot_observed_at":"2026-08-10T11:53:30.849284Z","submitted_at":"2025-02-11T11:53:23Z","title":"URECA: The Chain of Two Minimum Set Cover Problems exists behind Adaptation to Shifts in Semantic Code Search","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-08T12:39:57.690212Z"},"links":{"citing_paper":"/paper/2502.07494"},"observation_digest":"sha256:5a2d844c49f27325cbba8b0cb22e344b186fe6015356acb301125a262cbb2c76","observation_id":"050dcc56-d50a-4dfc-ba00-b9fc60cd0dbb","resolution":{"observed_at":"2026-08-08T12:39:57.975914Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-08T12:39:57.961742Z","title":"F., Jiang, Z., and Neubig, G","venue":null,"work_id":"0432cc1b-6398-4353-8fbb-dc7d0a2fbd55","year":2023},"citing_paper":{"arxiv_id":"2502.07494","last_updated":"2025-02-11T11:53:23Z","snapshot_observed_at":"2026-08-10T11:53:30.849284Z","submitted_at":"2025-02-11T11:53:23Z","title":"URECA: The Chain of Two Minimum Set Cover Problems exists behind Adaptation to Shifts in Semantic Code Search","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-08T12:39:57.693652Z"},"links":{"citing_paper":"/paper/2502.07494"},"observation_digest":"sha256:23eb6e333fe51cdd73275d6614049538c6176991f83f64970c45cf9fc054d846","observation_id":"1d80021a-e149-4b1b-8073-b08235b2631b","resolution":{"observed_at":"2026-08-08T12:39:57.965495Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-08T12:39:57.696817Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.07494","last_updated":"2025-02-11T11:53:23Z","snapshot_observed_at":"2026-08-10T11:53:30.849284Z","submitted_at":"2025-02-11T11:53:23Z","title":"URECA: The Chain of Two Minimum Set Cover Problems exists behind Adaptation to Shifts in Semantic Code Search","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-08T12:39:57.696817Z"},"links":{"citing_paper":"/paper/2502.07494"},"observation_digest":"sha256:b9cc414cca223e4406f8b398d912001375670aa4dc7c4d7db587bd7ca3c3f678","observation_id":"6b600721-3105-482d-9215-11f3e31b055a","resolution":{"observed_at":"2026-08-08T12:39:57.696817Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2502.07494","last_updated":"2025-02-11T11:53:23Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-10T11:53:30.849284Z","submitted_at":"2025-02-11T11:53:23Z","title":"URECA: The Chain of Two Minimum Set Cover Problems exists behind Adaptation to Shifts in Semantic Code Search"},"reference_resolution":{"displayed":45,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":15,"verified_exact":4,"verified_fuzzy":25},"total_outbound_references":45},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 45 of 45 outbound references and 0 inbound Pith citation observations for arXiv:2502.07494."}