{"as_of":"2026-08-14T06:50:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1d5b9813bda7b8fb10063af387884cc7ede729dbeba6f0943022488e02faa368","coverage":[{"denominator":53,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":53,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T14:46:16.644616Z","state":"measured"},{"denominator":54,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":54,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-01T14:11:56.235998Z","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":[{"citation":{"cited_paper":{"arxiv_id":"2412.11728","last_updated":"2024-12-16T12:51:35Z","snapshot_observed_at":"2026-08-12T17:54:58.954681Z","submitted_at":"2024-12-16T12:51:35Z","title":"SECRET: Towards Scalable and Efficient Code Retrieval via Segmented Deep Hashing","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.11728","snapshot_observed_at":"2026-08-01T14:11:56.235998Z","title":"Secret: Towards scalable and efficient code retrieval via segmented deep hashing,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.18859","last_updated":"2026-07-21T08:49:30Z","snapshot_observed_at":"2026-08-08T05:58:51.576912Z","submitted_at":"2026-07-21T08:49:30Z","title":"PhoenixRepair: Rethinking Repair Strategy Exploration in Software Agents","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-01T14:11:56.235998Z"},"links":{"cited_paper":"/paper/2412.11728","citing_paper":"/paper/2607.18859"},"observation_digest":"sha256:59a6977b8c192adb1c170492e08c76e9f0adc4475934054a68c494d1c8cb7abf","observation_id":"668fc869-3607-4dc1-ade7-0fdf0a21fc02","resolution":{"observed_at":"2026-08-01T14:11:56.235998Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2412.11728/citation-record","integrity":"/paper/2412.11728/integrity","json":"/paper/2412.11728/citation-record.json","paper":"/paper/2412.11728"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T14:46:16.398531Z","title":"Two studies of opportunistic programming: interleaving web foraging, learning, and writing code,","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2412.11728","last_updated":"2024-12-16T12:51:35Z","snapshot_observed_at":"2026-08-12T17:54:58.954681Z","submitted_at":"2024-12-16T12:51:35Z","title":"SECRET: Towards Scalable and Efficient Code Retrieval via Segmented Deep Hashing","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-11T14:46:16.398531Z"},"links":{"citing_paper":"/paper/2412.11728"},"observation_digest":"sha256:c08ca1e45318942305cf3e406f0e02906c1413fe58120de1ebbaf45b01134e92","observation_id":"5bf12339-b1c0-4bf2-8335-4f5b6d442394","resolution":{"observed_at":"2026-08-11T14:46:16.398531Z","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-11T14:46:16.403766Z","title":"Portfolio: finding relevant functions and their usage,","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2412.11728","last_updated":"2024-12-16T12:51:35Z","snapshot_observed_at":"2026-08-12T17:54:58.954681Z","submitted_at":"2024-12-16T12:51:35Z","title":"SECRET: Towards Scalable and Efficient Code Retrieval via Segmented Deep Hashing","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-11T14:46:16.403766Z"},"links":{"citing_paper":"/paper/2412.11728"},"observation_digest":"sha256:caff954ef920e12227675e81adee06dc20e97e30012b29555a54c65c525b68fc","observation_id":"ab0adcc1-d027-4e68-821e-f9ebece4e6f7","resolution":{"observed_at":"2026-08-11T14:46:16.403766Z","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-11T14:46:16.408325Z","title":"Codehow: Effective code search based on API understanding and extended boolean model (E),","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2412.11728","last_updated":"2024-12-16T12:51:35Z","snapshot_observed_at":"2026-08-12T17:54:58.954681Z","submitted_at":"2024-12-16T12:51:35Z","title":"SECRET: Towards Scalable and Efficient Code Retrieval via Segmented Deep Hashing","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-11T14:46:16.408325Z"},"links":{"citing_paper":"/paper/2412.11728"},"observation_digest":"sha256:56fa487b21d6bd710ba8c1636cb7884e4bb3999a55923e175f95827e42118a66","observation_id":"93b3c511-44df-4a1f-9290-2d5a91799294","resolution":{"observed_at":"2026-08-11T14:46:16.408325Z","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-11T14:46:16.412751Z","title":"Cocosoda: Effective contrastive learning for code search,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.11728","last_updated":"2024-12-16T12:51:35Z","snapshot_observed_at":"2026-08-12T17:54:58.954681Z","submitted_at":"2024-12-16T12:51:35Z","title":"SECRET: Towards Scalable and Efficient Code Retrieval via Segmented Deep Hashing","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-11T14:46:16.412751Z"},"links":{"citing_paper":"/paper/2412.11728"},"observation_digest":"sha256:8398208e3b33b67f92f149a4d0be5e433499de13e7b0c8bd16db9f7a523e35d7","observation_id":"7a025065-218c-459d-b2cd-10742ae7d37a","resolution":{"observed_at":"2026-08-11T14:46:16.412751Z","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-11T14:46:16.416853Z","title":"Retrieval on source code: a neural code search,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2412.11728","last_updated":"2024-12-16T12:51:35Z","snapshot_observed_at":"2026-08-12T17:54:58.954681Z","submitted_at":"2024-12-16T12:51:35Z","title":"SECRET: Towards Scalable and Efficient Code Retrieval via Segmented Deep Hashing","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-11T14:46:16.416853Z"},"links":{"citing_paper":"/paper/2412.11728"},"observation_digest":"sha256:f662958ab828c706ee155d2665f45f53f80f1ba8fe5d9c3fd9fcbf4f3d3b9e9c","observation_id":"0a594123-91ac-4d1a-8772-e211a3d0ecd2","resolution":{"observed_at":"2026-08-11T14:46:16.416853Z","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-11T14:46:16.421866Z","title":"When deep learning met code search,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2412.11728","last_updated":"2024-12-16T12:51:35Z","snapshot_observed_at":"2026-08-12T17:54:58.954681Z","submitted_at":"2024-12-16T12:51:35Z","title":"SECRET: Towards Scalable and Efficient Code Retrieval via Segmented Deep Hashing","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-11T14:46:16.421866Z"},"links":{"citing_paper":"/paper/2412.11728"},"observation_digest":"sha256:55fcbcedc369458a9f939db267e04a4ff92ae42397a6a5adb3eedffbc20e987c","observation_id":"895a4966-9243-4b84-9163-33d15bd73ceb","resolution":{"observed_at":"2026-08-11T14:46:16.421866Z","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-11T14:46:16.427174Z","title":"Coacor: Code annotation for code retrieval with reinforcement learning,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2412.11728","last_updated":"2024-12-16T12:51:35Z","snapshot_observed_at":"2026-08-12T17:54:58.954681Z","submitted_at":"2024-12-16T12:51:35Z","title":"SECRET: Towards Scalable and Efficient Code Retrieval via Segmented Deep Hashing","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-11T14:46:16.427174Z"},"links":{"citing_paper":"/paper/2412.11728"},"observation_digest":"sha256:9f1a5efa6eea3eb9b59821a1b1fb29356d2d134886e87215d4d56d154167436a","observation_id":"5e686859-76f3-4b2c-90fe-227ff378b80b","resolution":{"observed_at":"2026-08-11T14:46:16.427174Z","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.1145/3546066","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T14:46:16.838606Z","title":"degraphcs: Embedding variable-based flow graph for neural code search,","venue":null,"work_id":"e68af386-a421-4d67-961e-ab6873a06950","year":2023},"citing_paper":{"arxiv_id":"2412.11728","last_updated":"2024-12-16T12:51:35Z","snapshot_observed_at":"2026-08-12T17:54:58.954681Z","submitted_at":"2024-12-16T12:51:35Z","title":"SECRET: Towards Scalable and Efficient Code Retrieval via Segmented Deep Hashing","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-11T14:46:16.431324Z"},"links":{"citing_paper":"/paper/2412.11728"},"observation_digest":"sha256:e1f846d06f819d3a31a5d8a14801f2558aa21c3bcc8ac16beca2ae9b02a6a0fe","observation_id":"6b1e3d63-2c08-4114-8775-378732fae1a4","resolution":{"observed_at":"2026-08-11T14:46:16.842801Z","resolver_source":"doi","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T14:46:16.435616Z","title":"Deep code search,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2412.11728","last_updated":"2024-12-16T12:51:35Z","snapshot_observed_at":"2026-08-12T17:54:58.954681Z","submitted_at":"2024-12-16T12:51:35Z","title":"SECRET: Towards Scalable and Efficient Code Retrieval via Segmented Deep Hashing","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-11T14:46:16.435616Z"},"links":{"citing_paper":"/paper/2412.11728"},"observation_digest":"sha256:d9f641cba525fafb71afa2d0472cd57810c9b111bcd619d8468d19a476434ba5","observation_id":"534846c7-9fce-49e1-9a36-bb6ad151875d","resolution":{"observed_at":"2026-08-11T14:46:16.435616Z","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-11T14:46:16.440552Z","title":"Codesearchnet challenge: Evaluating the state of semantic code search,","venue":null,"work_id":null,"year":1909},"citing_paper":{"arxiv_id":"2412.11728","last_updated":"2024-12-16T12:51:35Z","snapshot_observed_at":"2026-08-12T17:54:58.954681Z","submitted_at":"2024-12-16T12:51:35Z","title":"SECRET: Towards Scalable and Efficient Code Retrieval via Segmented Deep Hashing","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-11T14:46:16.440552Z"},"links":{"cited_paper":"/paper/1909.09436","citing_paper":"/paper/2412.11728"},"observation_digest":"sha256:31c2da33b73f6631f758cc07af4c0a8db4f132a4dcde1916a3995596ebea25fc","observation_id":"55aca695-a089-4283-a9ad-cd515670426f","resolution":{"observed_at":"2026-08-11T14:46:16.440552Z","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.1016/j.neunet.2021.04.019","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T14:46:16.825482Z","title":"Cradle: Deep code retrieval based on semantic dependency learning,","venue":null,"work_id":"9d309546-2723-4107-b3c1-4a36d4e750c9","year":2021},"citing_paper":{"arxiv_id":"2412.11728","last_updated":"2024-12-16T12:51:35Z","snapshot_observed_at":"2026-08-12T17:54:58.954681Z","submitted_at":"2024-12-16T12:51:35Z","title":"SECRET: Towards Scalable and Efficient Code Retrieval via Segmented Deep Hashing","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-11T14:46:16.446790Z"},"links":{"citing_paper":"/paper/2412.11728"},"observation_digest":"sha256:d5b0158ccd0fab7e335bce420c1aa90cc2aa4cc1334cba7b3fa17b812eda0a54","observation_id":"7023fd8e-8808-4e9b-bab0-f5504b1c3a89","resolution":{"observed_at":"2026-08-11T14:46:16.829794Z","resolver_source":"doi","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T14:46:18.844631Z","title":"Retrieval augmented code generation and summarization,","venue":null,"work_id":"d903ee92-994f-4d65-b7bd-583e860ac476","year":2021},"citing_paper":{"arxiv_id":"2412.11728","last_updated":"2024-12-16T12:51:35Z","snapshot_observed_at":"2026-08-12T17:54:58.954681Z","submitted_at":"2024-12-16T12:51:35Z","title":"SECRET: Towards Scalable and Efficient Code Retrieval via Segmented Deep Hashing","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-11T14:46:16.452054Z"},"links":{"citing_paper":"/paper/2412.11728"},"observation_digest":"sha256:72e3bfbed022c17605b865cb5ebe28789eaad6a4f3c837b34dc9f86bce01c673","observation_id":"b5bf73de-99cb-4dc5-bc9f-84fbf434b5bd","resolution":{"observed_at":"2026-08-11T14:46:18.848860Z","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":"10.18653/v1/2022.acl-long.181","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T14:46:16.810731Z","title":"Accelerating code search with deep hashing and code classification,","venue":null,"work_id":"e1fc90ca-8b60-44d4-b74f-a0838e2dfb0f","year":2022},"citing_paper":{"arxiv_id":"2412.11728","last_updated":"2024-12-16T12:51:35Z","snapshot_observed_at":"2026-08-12T17:54:58.954681Z","submitted_at":"2024-12-16T12:51:35Z","title":"SECRET: Towards Scalable and Efficient Code Retrieval via Segmented Deep Hashing","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-11T14:46:16.456480Z"},"links":{"citing_paper":"/paper/2412.11728"},"observation_digest":"sha256:133e302f1e4465562e88d18ba5904275f1f654803986a9a0627da769367791fc","observation_id":"f0805306-d850-42a1-a5c8-6fd793dc123c","resolution":{"observed_at":"2026-08-11T14:46:16.815869Z","resolver_source":"doi","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T14:46:16.460463Z","title":"A survey on deep hashing methods,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.11728","last_updated":"2024-12-16T12:51:35Z","snapshot_observed_at":"2026-08-12T17:54:58.954681Z","submitted_at":"2024-12-16T12:51:35Z","title":"SECRET: Towards Scalable and Efficient Code Retrieval via Segmented Deep Hashing","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-11T14:46:16.460463Z"},"links":{"citing_paper":"/paper/2412.11728"},"observation_digest":"sha256:1e8e3e064532a2323544cf7a446b3d15d69d8ce8591e692272889998d4c80845","observation_id":"58c2c9c2-499e-4316-b207-fd5003e82d6d","resolution":{"observed_at":"2026-08-11T14:46:16.460463Z","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.1007/s10115-022-01734-0","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T14:46:16.789674Z","title":"Learning to hash: a comprehensive survey of deep learning-based hashing methods,","venue":null,"work_id":"d580672e-8bdb-4cde-a440-e36955f4e47f","year":2022},"citing_paper":{"arxiv_id":"2412.11728","last_updated":"2024-12-16T12:51:35Z","snapshot_observed_at":"2026-08-12T17:54:58.954681Z","submitted_at":"2024-12-16T12:51:35Z","title":"SECRET: Towards Scalable and Efficient Code Retrieval via Segmented Deep Hashing","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-11T14:46:16.464229Z"},"links":{"citing_paper":"/paper/2412.11728"},"observation_digest":"sha256:83d5262879577365153f688dd4ff192a0ec8bb1b77b10cd5344c1f78d4728d3f","observation_id":"2efa0b19-a235-49c6-a45c-d3748ae925a0","resolution":{"observed_at":"2026-08-11T14:46:16.793935Z","resolver_source":"doi","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T14:46:18.832142Z","title":"Deep hashing for multi-label image retrieval: a survey,","venue":null,"work_id":"64922e6f-ca51-451e-a59b-6df38087a855","year":2020},"citing_paper":{"arxiv_id":"2412.11728","last_updated":"2024-12-16T12:51:35Z","snapshot_observed_at":"2026-08-12T17:54:58.954681Z","submitted_at":"2024-12-16T12:51:35Z","title":"SECRET: Towards Scalable and Efficient Code Retrieval via Segmented Deep Hashing","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-11T14:46:16.470067Z"},"links":{"citing_paper":"/paper/2412.11728"},"observation_digest":"sha256:b866121dffc309f22552a36b84ee6b48c9053b980ad19d388763a853cbdda103","observation_id":"10bf753e-57a6-488e-b36d-7db2e310ec60","resolution":{"observed_at":"2026-08-11T14:46:18.836973Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T14:46:18.818846Z","title":"Learning to hash for indexing big data - A survey,","venue":null,"work_id":"34989603-fb29-46f5-97b0-d12373077b90","year":null},"citing_paper":{"arxiv_id":"2412.11728","last_updated":"2024-12-16T12:51:35Z","snapshot_observed_at":"2026-08-12T17:54:58.954681Z","submitted_at":"2024-12-16T12:51:35Z","title":"SECRET: Towards Scalable and Efficient Code Retrieval via Segmented Deep Hashing","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-11T14:46:16.474645Z"},"links":{"citing_paper":"/paper/2412.11728"},"observation_digest":"sha256:fa336b048c2f5fc2af633f4c8a3665d02a0ccad4931b2fdd8861f11f3f1a9535","observation_id":"5991fda1-3f12-46e8-9a14-a6c83794bbe4","resolution":{"observed_at":"2026-08-11T14:46:18.823624Z","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-11T14:46:16.483999Z","title":"Codebert: A pre-trained model for programming and natural languages,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2412.11728","last_updated":"2024-12-16T12:51:35Z","snapshot_observed_at":"2026-08-12T17:54:58.954681Z","submitted_at":"2024-12-16T12:51:35Z","title":"SECRET: Towards Scalable and Efficient Code Retrieval via Segmented Deep Hashing","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-11T14:46:16.483999Z"},"links":{"citing_paper":"/paper/2412.11728"},"observation_digest":"sha256:a18ebdf233637c14f712d4fa7577748f6ecb15ceb3a5a067990dc4b7c3ee3985","observation_id":"9e1b74e0-10e1-429e-a93b-5fe7c18cef86","resolution":{"observed_at":"2026-08-11T14:46:16.483999Z","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-11T14:46:18.805272Z","title":"Graphcodebert: Pre-training code representations with data flow,","venue":null,"work_id":"a6a3b717-e5af-47ab-9402-f9812537914d","year":2021},"citing_paper":{"arxiv_id":"2412.11728","last_updated":"2024-12-16T12:51:35Z","snapshot_observed_at":"2026-08-12T17:54:58.954681Z","submitted_at":"2024-12-16T12:51:35Z","title":"SECRET: Towards Scalable and Efficient Code Retrieval via Segmented Deep Hashing","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-11T14:46:16.488887Z"},"links":{"citing_paper":"/paper/2412.11728"},"observation_digest":"sha256:987b2b0b76da1deef88b5f2f8ecd13a9494e2feb8ec7844478500a08f8f7696e","observation_id":"96514db1-8f37-413a-bf45-89ac1ea44d8b","resolution":{"observed_at":"2026-08-11T14:46:18.809906Z","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-11T14:46:16.497032Z","title":"Deep joint-semantics reconstructing hashing for large-scale unsupervised cross-modal retrieval,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2412.11728","last_updated":"2024-12-16T12:51:35Z","snapshot_observed_at":"2026-08-12T17:54:58.954681Z","submitted_at":"2024-12-16T12:51:35Z","title":"SECRET: Towards Scalable and Efficient Code Retrieval via Segmented Deep Hashing","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-11T14:46:16.497032Z"},"links":{"citing_paper":"/paper/2412.11728"},"observation_digest":"sha256:0814456bfbd7e3fdbdec78d0b1da4e5f09fad2edb11ebeda4c2afbd29515e2c1","observation_id":"e9345063-0256-4d89-91a6-52cd6771f5a5","resolution":{"observed_at":"2026-08-11T14:46:16.497032Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T14:46:16.501535Z","title":"Deep semantic-alignment hashing for unsupervised cross-modal retrieval,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2412.11728","last_updated":"2024-12-16T12:51:35Z","snapshot_observed_at":"2026-08-12T17:54:58.954681Z","submitted_at":"2024-12-16T12:51:35Z","title":"SECRET: Towards Scalable and Efficient Code Retrieval via Segmented Deep Hashing","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-11T14:46:16.501535Z"},"links":{"citing_paper":"/paper/2412.11728"},"observation_digest":"sha256:9ea35b9b82fc0353e5590cbeccaf38a5ffcd821c6af2e8bf24cab5fa3709fa34","observation_id":"99164957-bfa1-4059-8e34-5b085538e2c1","resolution":{"observed_at":"2026-08-11T14:46:16.501535Z","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-11T14:46:16.505495Z","title":"Joint-modal distribution-based similarity hashing for large-scale unsupervised deep cross-modal retrieval,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2412.11728","last_updated":"2024-12-16T12:51:35Z","snapshot_observed_at":"2026-08-12T17:54:58.954681Z","submitted_at":"2024-12-16T12:51:35Z","title":"SECRET: Towards Scalable and Efficient Code Retrieval via Segmented Deep Hashing","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-11T14:46:16.505495Z"},"links":{"citing_paper":"/paper/2412.11728"},"observation_digest":"sha256:548953a63d7ac93e53a0a10f621d1befa99ed377051ce9db33c96d2bcb3c39d5","observation_id":"163c1cdd-442c-495a-bbad-82d1c036ddd9","resolution":{"observed_at":"2026-08-11T14:46:16.505495Z","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-11T14:46:16.509525Z","title":"Locality-sensitive hashing scheme based on p-stable distributions,","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2412.11728","last_updated":"2024-12-16T12:51:35Z","snapshot_observed_at":"2026-08-12T17:54:58.954681Z","submitted_at":"2024-12-16T12:51:35Z","title":"SECRET: Towards Scalable and Efficient Code Retrieval via Segmented Deep Hashing","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-11T14:46:16.509525Z"},"links":{"citing_paper":"/paper/2412.11728"},"observation_digest":"sha256:5d6522ce44dd67db765bb3a6dfec3fb6241f8fe7c351c233fe4250302d0f4883","observation_id":"db607b43-60ad-4661-8bdb-13865a868bc1","resolution":{"observed_at":"2026-08-11T14:46:16.509525Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T14:46:16.513805Z","title":"Some simple effective approximations to the 2-poisson model for probabilistic weighted retrieval,","venue":null,"work_id":null,"year":1994},"citing_paper":{"arxiv_id":"2412.11728","last_updated":"2024-12-16T12:51:35Z","snapshot_observed_at":"2026-08-12T17:54:58.954681Z","submitted_at":"2024-12-16T12:51:35Z","title":"SECRET: Towards Scalable and Efficient Code Retrieval via Segmented Deep Hashing","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-11T14:46:16.513805Z"},"links":{"citing_paper":"/paper/2412.11728"},"observation_digest":"sha256:15fe1ad87e8f14ecf5e15f3ceca5786b3d6c653674181fc6c2e3b6d42fade20e","observation_id":"5ea841f1-6fc0-48c8-8b76-7069ed3783da","resolution":{"observed_at":"2026-08-11T14:46:16.513805Z","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-11T14:46:18.790678Z","title":"A statistical interpretation of term specificity and its application in retrieval,","venue":null,"work_id":"fdcc803f-8c56-4c23-970a-9844db9590c5","year":null},"citing_paper":{"arxiv_id":"2412.11728","last_updated":"2024-12-16T12:51:35Z","snapshot_observed_at":"2026-08-12T17:54:58.954681Z","submitted_at":"2024-12-16T12:51:35Z","title":"SECRET: Towards Scalable and Efficient Code Retrieval via Segmented Deep Hashing","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-11T14:46:16.519770Z"},"links":{"citing_paper":"/paper/2412.11728"},"observation_digest":"sha256:a0be1d4d7460c64c560627ebd630eb28dae13a5520cf17328e54a9d44466bd3c","observation_id":"aa740d21-008a-45b7-bbf3-1a5b4d31ba46","resolution":{"observed_at":"2026-08-11T14:46:18.796205Z","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":"10.18653/v1/2020.acl-main.758","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T14:46:16.743808Z","title":"A multi- perspective architecture for semantic code search,","venue":null,"work_id":"463032e8-685f-4830-b350-25e27495b9d7","year":2020},"citing_paper":{"arxiv_id":"2412.11728","last_updated":"2024-12-16T12:51:35Z","snapshot_observed_at":"2026-08-12T17:54:58.954681Z","submitted_at":"2024-12-16T12:51:35Z","title":"SECRET: Towards Scalable and Efficient Code Retrieval via Segmented Deep Hashing","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-11T14:46:16.530363Z"},"links":{"citing_paper":"/paper/2412.11728"},"observation_digest":"sha256:2df494831f98c0145527fa0c4b1e2f1c186a51070f898c4631d5ff0759ef7fcf","observation_id":"9b4694d2-c4e8-4d21-9db3-0e878f641842","resolution":{"observed_at":"2026-08-11T14:46:16.748145Z","resolver_source":"doi","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T14:46:16.539147Z","title":"Improving code search with co-attentive representation learning,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2412.11728","last_updated":"2024-12-16T12:51:35Z","snapshot_observed_at":"2026-08-12T17:54:58.954681Z","submitted_at":"2024-12-16T12:51:35Z","title":"SECRET: Towards Scalable and Efficient Code Retrieval via Segmented Deep Hashing","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-11T14:46:16.539147Z"},"links":{"citing_paper":"/paper/2412.11728"},"observation_digest":"sha256:25a90faf19910d03ec24e3d7b400f1caceb68912f376cfd8709431ac678f6cce","observation_id":"be235c72-a997-437f-9a44-70cc34c05e3c","resolution":{"observed_at":"2026-08-11T14:46:16.539147Z","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-11T14:46:16.545177Z","title":"Self-attention networks for code search,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.11728","last_updated":"2024-12-16T12:51:35Z","snapshot_observed_at":"2026-08-12T17:54:58.954681Z","submitted_at":"2024-12-16T12:51:35Z","title":"SECRET: Towards Scalable and Efficient Code Retrieval via Segmented Deep Hashing","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-11T14:46:16.545177Z"},"links":{"citing_paper":"/paper/2412.11728"},"observation_digest":"sha256:e8567e97f1aa6875f2c6f64e267abb2d265ce414d6251e115115034427d3d47d","observation_id":"ab73b0f0-f3db-4d73-969d-0f3661afc3fc","resolution":{"observed_at":"2026-08-11T14:46:16.545177Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2008.12193","last_updated":"2020-08-27T15:39:09Z","snapshot_observed_at":"2026-08-12T17:55:10.036079Z","submitted_at":"2020-08-27T15:39:09Z","title":"Neural Code Search Revisited: Enhancing Code Snippet Retrieval through Natural Language Intent","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2008.12193","snapshot_observed_at":"2026-08-11T14:46:16.549452Z","title":"Neural code search revisited: Enhancing code snippet retrieval through natural language intent,","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2412.11728","last_updated":"2024-12-16T12:51:35Z","snapshot_observed_at":"2026-08-12T17:54:58.954681Z","submitted_at":"2024-12-16T12:51:35Z","title":"SECRET: Towards Scalable and Efficient Code Retrieval via Segmented Deep Hashing","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-11T14:46:16.549452Z"},"links":{"cited_paper":"/paper/2008.12193","citing_paper":"/paper/2412.11728"},"observation_digest":"sha256:41a054d0e335fa63dd35b3aea88cb427978f495e9915e271ba925ecdc341cd86","observation_id":"62169e3d-0c61-4655-be1a-451a26656b8f","resolution":{"observed_at":"2026-08-11T14:46:16.549452Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1412.6980","last_updated":"2017-01-30T01:27:54Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2014-12-22T13:54:29Z","title":"Adam: A Method for Stochastic Optimization","version":9},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1412.6980","snapshot_observed_at":"2026-08-11T14:46:16.554131Z","title":"Adam: A method for stochastic optimization,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2412.11728","last_updated":"2024-12-16T12:51:35Z","snapshot_observed_at":"2026-08-12T17:54:58.954681Z","submitted_at":"2024-12-16T12:51:35Z","title":"SECRET: Towards Scalable and Efficient Code Retrieval via Segmented Deep Hashing","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-11T14:46:16.554131Z"},"links":{"cited_paper":"/paper/1412.6980","citing_paper":"/paper/2412.11728"},"observation_digest":"sha256:1e121867e4714602f0b4ad838e20ff88acd7b829f46bc5e8565d31c372cb3ad6","observation_id":"7e73dd8b-720f-4e5e-80a4-1fe57e47d560","resolution":{"observed_at":"2026-08-11T14:46:16.554131Z","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-11T14:46:18.777786Z","title":"Enriching word vectors with subword information,","venue":null,"work_id":"77726939-21f2-4284-bdb6-8c8e7c64e1d2","year":2017},"citing_paper":{"arxiv_id":"2412.11728","last_updated":"2024-12-16T12:51:35Z","snapshot_observed_at":"2026-08-12T17:54:58.954681Z","submitted_at":"2024-12-16T12:51:35Z","title":"SECRET: Towards Scalable and Efficient Code Retrieval via Segmented Deep Hashing","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-11T14:46:16.558754Z"},"links":{"citing_paper":"/paper/2412.11728"},"observation_digest":"sha256:eb4c9c8cee903d8d70ad9eede47dd94fc7e28ab4ad1e91c83a75a1aae1aa35d8","observation_id":"ee846f1e-b410-42b4-a6e3-ef2490bec52b","resolution":{"observed_at":"2026-08-11T14:46:18.782042Z","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-11T14:46:16.562844Z","title":"Codet5: Identifier-aware unified pre-trained encoder-decoder models for code understanding and generation,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.11728","last_updated":"2024-12-16T12:51:35Z","snapshot_observed_at":"2026-08-12T17:54:58.954681Z","submitted_at":"2024-12-16T12:51:35Z","title":"SECRET: Towards Scalable and Efficient Code Retrieval via Segmented Deep Hashing","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-11T14:46:16.562844Z"},"links":{"citing_paper":"/paper/2412.11728"},"observation_digest":"sha256:467f563e5e2a6fae58d939cd55c4a77ca729611e084ead23035551b9c7ac4057","observation_id":"e887bb80-d7ea-40f4-a610-ef426a841bd4","resolution":{"observed_at":"2026-08-11T14:46:16.562844Z","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-11T14:46:16.567534Z","title":"Spt- code: Sequence-to-sequence pre-training for learning source code representations,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.11728","last_updated":"2024-12-16T12:51:35Z","snapshot_observed_at":"2026-08-12T17:54:58.954681Z","submitted_at":"2024-12-16T12:51:35Z","title":"SECRET: Towards Scalable and Efficient Code Retrieval via Segmented Deep Hashing","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-11T14:46:16.567534Z"},"links":{"citing_paper":"/paper/2412.11728"},"observation_digest":"sha256:815105f04252598a7b2ec9338e8a200b77969e17be1afbb18af54f51c84a2b35","observation_id":"bcab37d1-a8fd-43ca-98a6-daef8b62140c","resolution":{"observed_at":"2026-08-11T14:46:16.567534Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2108.04556","last_updated":"2021-09-09T12:45:58Z","snapshot_observed_at":"2026-08-13T18:30:48.914826Z","submitted_at":"2021-08-10T10:08:21Z","title":"SynCoBERT: Syntax-Guided Multi-Modal Contrastive Pre-Training for Code Representation","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2108.04556","snapshot_observed_at":"2026-08-11T14:46:16.571881Z","title":"Syncobert: Syntax-guided multi-modal contrastive pre-training for code representation,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.11728","last_updated":"2024-12-16T12:51:35Z","snapshot_observed_at":"2026-08-12T17:54:58.954681Z","submitted_at":"2024-12-16T12:51:35Z","title":"SECRET: Towards Scalable and Efficient Code Retrieval via Segmented Deep Hashing","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-11T14:46:16.571881Z"},"links":{"cited_paper":"/paper/2108.04556","citing_paper":"/paper/2412.11728"},"observation_digest":"sha256:eeff06746aea3c944dbb151fe98b0b8aa78c3d890345e7361b2cfa3813585357","observation_id":"a433df2c-484d-45cf-abdd-07baf9be2c90","resolution":{"observed_at":"2026-08-11T14:46:16.571881Z","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-11T14:46:16.576442Z","title":"Unixcoder: Unified cross-modal pre-training for code representation,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.11728","last_updated":"2024-12-16T12:51:35Z","snapshot_observed_at":"2026-08-12T17:54:58.954681Z","submitted_at":"2024-12-16T12:51:35Z","title":"SECRET: Towards Scalable and Efficient Code Retrieval via Segmented Deep Hashing","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-11T14:46:16.576442Z"},"links":{"citing_paper":"/paper/2412.11728"},"observation_digest":"sha256:25fe04420cb39c51c125b217850378cf5c2eefc8c8e4573be6dd75012cdd096f","observation_id":"37cd14e5-303c-415f-a8f8-da48b254fcea","resolution":{"observed_at":"2026-08-11T14:46:16.576442Z","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-11T14:46:16.581209Z","title":"Self-supervised contrastive learning for code retrieval and summarization via semantic-preserving transformations,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.11728","last_updated":"2024-12-16T12:51:35Z","snapshot_observed_at":"2026-08-12T17:54:58.954681Z","submitted_at":"2024-12-16T12:51:35Z","title":"SECRET: Towards Scalable and Efficient Code Retrieval via Segmented Deep Hashing","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-11T14:46:16.581209Z"},"links":{"citing_paper":"/paper/2412.11728"},"observation_digest":"sha256:e977950d6608a384c94f092117ce3724a2b9e1dc21e1b368ab273b46f21184f9","observation_id":"682f8511-1eb4-4866-9af0-4f01becc4bca","resolution":{"observed_at":"2026-08-11T14:46:16.581209Z","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":"2023.00185","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T14:46:17.588993Z","title":"Cocosoda: Effective contrastive learning for code search,","venue":null,"work_id":"b223d19f-e92c-4a60-af0c-55670a5606a5","year":2023},"citing_paper":{"arxiv_id":"2412.11728","last_updated":"2024-12-16T12:51:35Z","snapshot_observed_at":"2026-08-12T17:54:58.954681Z","submitted_at":"2024-12-16T12:51:35Z","title":"SECRET: Towards Scalable and Efficient Code Retrieval via Segmented Deep Hashing","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-11T14:46:16.585560Z"},"links":{"citing_paper":"/paper/2412.11728"},"observation_digest":"sha256:0de74bcc31f16e707cb649c65011bf1df903156f3baa80a3d8abe6bf6fdd6570","observation_id":"78a775b2-a216-4fc4-a0f2-24837699acb8","resolution":{"observed_at":"2026-08-11T14:46:17.596053Z","resolver_source":"raw_fallback","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T14:46:18.759716Z","title":"Graphsearchnet: Enhancing gnns via capturing global dependencies for semantic code search,","venue":null,"work_id":"ff4f59cf-a415-4f38-bfc0-c807caa24de6","year":null},"citing_paper":{"arxiv_id":"2412.11728","last_updated":"2024-12-16T12:51:35Z","snapshot_observed_at":"2026-08-12T17:54:58.954681Z","submitted_at":"2024-12-16T12:51:35Z","title":"SECRET: Towards Scalable and Efficient Code Retrieval via Segmented Deep Hashing","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-11T14:46:16.589161Z"},"links":{"citing_paper":"/paper/2412.11728"},"observation_digest":"sha256:01a97acad658795bc0c0250eadfa4cd414bf2dd13538a94d56c1236eaedd51d4","observation_id":"4d3aada4-6b05-4432-b508-a88b05607329","resolution":{"observed_at":"2026-08-11T14:46:18.766411Z","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":"0745.10608","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T14:46:17.422417Z","title":"LSH forest: self-tuning indexes for similarity search,","venue":null,"work_id":"fe7f1526-576b-495c-b93c-4d9cbf7aa75e","year":2005},"citing_paper":{"arxiv_id":"2412.11728","last_updated":"2024-12-16T12:51:35Z","snapshot_observed_at":"2026-08-12T17:54:58.954681Z","submitted_at":"2024-12-16T12:51:35Z","title":"SECRET: Towards Scalable and Efficient Code Retrieval via Segmented Deep Hashing","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-11T14:46:16.597341Z"},"links":{"citing_paper":"/paper/2412.11728"},"observation_digest":"sha256:de83cd2f70eb2b093939e23b5c0335b3d8d0796e9ab9b3d87aeddecae41bfc02","observation_id":"3a07d833-636e-4e62-bed1-0d559b8c9c11","resolution":{"observed_at":"2026-08-11T14:46:17.430427Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"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-11T14:46:16.601426Z","title":"Locality-sensitive hashing scheme based on dynamic collision counting,","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2412.11728","last_updated":"2024-12-16T12:51:35Z","snapshot_observed_at":"2026-08-12T17:54:58.954681Z","submitted_at":"2024-12-16T12:51:35Z","title":"SECRET: Towards Scalable and Efficient Code Retrieval via Segmented Deep Hashing","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-11T14:46:16.601426Z"},"links":{"citing_paper":"/paper/2412.11728"},"observation_digest":"sha256:f82653772592882d066b8b7fe23eab446e3641294f12baada8a72d6035c4483f","observation_id":"aa3841ce-68f2-4ef3-8031-fc2703d8cc77","resolution":{"observed_at":"2026-08-11T14:46:16.601426Z","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-11T14:46:18.747263Z","title":"Query-aware locality-sensitive hashing for approximate nearest neighbor search,","venue":null,"work_id":"ebe76c7c-bf60-4f4e-aaca-b176d1380972","year":2015},"citing_paper":{"arxiv_id":"2412.11728","last_updated":"2024-12-16T12:51:35Z","snapshot_observed_at":"2026-08-12T17:54:58.954681Z","submitted_at":"2024-12-16T12:51:35Z","title":"SECRET: Towards Scalable and Efficient Code Retrieval via Segmented Deep Hashing","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-11T14:46:16.605235Z"},"links":{"citing_paper":"/paper/2412.11728"},"observation_digest":"sha256:ea7499c9c2c9010e954d79f7cf8a26dbc4e467cae158def5f55c4deee9d684a5","observation_id":"48b91e10-0309-4d0e-a739-e4f77e26e2fc","resolution":{"observed_at":"2026-08-11T14:46:18.751709Z","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":"10.1016/j.ijar.2008.11.006","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T14:46:16.714793Z","title":"Semantic hashing,","venue":null,"work_id":"23e340e3-f0a1-4869-950c-299467d7fb29","year":2009},"citing_paper":{"arxiv_id":"2412.11728","last_updated":"2024-12-16T12:51:35Z","snapshot_observed_at":"2026-08-12T17:54:58.954681Z","submitted_at":"2024-12-16T12:51:35Z","title":"SECRET: Towards Scalable and Efficient Code Retrieval via Segmented Deep Hashing","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-11T14:46:16.609499Z"},"links":{"citing_paper":"/paper/2412.11728"},"observation_digest":"sha256:460f98250e53840aa192777b4abe64dc40278530cdf500040951112de1e69b0c","observation_id":"9b0345bc-07e1-4241-b435-3e959790b8ce","resolution":{"observed_at":"2026-08-11T14:46:16.718949Z","resolver_source":"doi","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T14:46:16.614405Z","title":"Data fusion through cross-modality metric learning using similarity-sensitive hashing,","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2412.11728","last_updated":"2024-12-16T12:51:35Z","snapshot_observed_at":"2026-08-12T17:54:58.954681Z","submitted_at":"2024-12-16T12:51:35Z","title":"SECRET: Towards Scalable and Efficient Code Retrieval via Segmented Deep Hashing","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-11T14:46:16.614405Z"},"links":{"citing_paper":"/paper/2412.11728"},"observation_digest":"sha256:b3b27d5530104deafea3d906c8ce8275662e0e1a8a7ab7ead0ac0adf768bb8af","observation_id":"ed7ee657-cb88-44e2-aab3-70c5651dd013","resolution":{"observed_at":"2026-08-11T14:46:16.614405Z","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-11T14:46:18.734113Z","title":"Large-scale supervised multimodal hashing with semantic correlation maximization,","venue":null,"work_id":"c1f510f7-5659-4ad2-a953-bd9db701c637","year":2014},"citing_paper":{"arxiv_id":"2412.11728","last_updated":"2024-12-16T12:51:35Z","snapshot_observed_at":"2026-08-12T17:54:58.954681Z","submitted_at":"2024-12-16T12:51:35Z","title":"SECRET: Towards Scalable and Efficient Code Retrieval via Segmented Deep Hashing","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-11T14:46:16.618479Z"},"links":{"citing_paper":"/paper/2412.11728"},"observation_digest":"sha256:52e77290f890bb15cff65c042efcebf98603415337abddd3296849d89a7ea918","observation_id":"aee01f09-83b1-41ae-8a63-c7fd0c21f9f4","resolution":{"observed_at":"2026-08-11T14:46:18.738734Z","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-11T14:46:16.622811Z","title":"Semantics-preserving hashing for cross-view retrieval,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2412.11728","last_updated":"2024-12-16T12:51:35Z","snapshot_observed_at":"2026-08-12T17:54:58.954681Z","submitted_at":"2024-12-16T12:51:35Z","title":"SECRET: Towards Scalable and Efficient Code Retrieval via Segmented Deep Hashing","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-11T14:46:16.622811Z"},"links":{"citing_paper":"/paper/2412.11728"},"observation_digest":"sha256:b7ae0518b062b1503e1a4e255fc5078dfc9865cb04aa3844cb2e106dc316c751","observation_id":"4c3ab5ff-14df-4880-a029-a14a072d4f44","resolution":{"observed_at":"2026-08-11T14:46:16.622811Z","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-11T14:46:16.626769Z","title":"Multi-scale correlation for sequential cross-modal hashing learning,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2412.11728","last_updated":"2024-12-16T12:51:35Z","snapshot_observed_at":"2026-08-12T17:54:58.954681Z","submitted_at":"2024-12-16T12:51:35Z","title":"SECRET: Towards Scalable and Efficient Code Retrieval via Segmented Deep Hashing","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-11T14:46:16.626769Z"},"links":{"citing_paper":"/paper/2412.11728"},"observation_digest":"sha256:478e2a0f1fd9c783b955f668042dbf1a836ddabd743c9e3380985097ddbcb4ee","observation_id":"4ff44390-47c3-493e-b15d-1d5ee5123d0e","resolution":{"observed_at":"2026-08-11T14:46:16.626769Z","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.1109/cvpr.2014.267","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T14:46:16.701372Z","title":"Collective matrix factorization hashing for multimodal data,","venue":null,"work_id":"966872fa-c491-4086-81b0-786cf155d20d","year":2014},"citing_paper":{"arxiv_id":"2412.11728","last_updated":"2024-12-16T12:51:35Z","snapshot_observed_at":"2026-08-12T17:54:58.954681Z","submitted_at":"2024-12-16T12:51:35Z","title":"SECRET: Towards Scalable and Efficient Code Retrieval via Segmented Deep Hashing","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-11T14:46:16.631196Z"},"links":{"citing_paper":"/paper/2412.11728"},"observation_digest":"sha256:fdd278a05c4d2806bfbc4a24e703345d5b3ab441662be36226c8d732079da4ae","observation_id":"29e3ed2b-567e-4c2d-a78e-9443d436b5d9","resolution":{"observed_at":"2026-08-11T14:46:16.705644Z","resolver_source":"doi","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":null,"cited_work":{"arxiv_id":null,"doi":"10.24963/ijcai.2018/396","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T14:46:16.684508Z","title":"Unsupervised deep hashing via binary latent factor models for large-scale cross-modal retrieval,","venue":null,"work_id":"ef719ec6-4642-4b4a-9067-80a65f6caa73","year":2018},"citing_paper":{"arxiv_id":"2412.11728","last_updated":"2024-12-16T12:51:35Z","snapshot_observed_at":"2026-08-12T17:54:58.954681Z","submitted_at":"2024-12-16T12:51:35Z","title":"SECRET: Towards Scalable and Efficient Code Retrieval via Segmented Deep Hashing","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-11T14:46:16.635326Z"},"links":{"citing_paper":"/paper/2412.11728"},"observation_digest":"sha256:9898412be504c18b88647e14e18099fae0906f2e5216a0cebaf445e908c04425","observation_id":"528bc114-156f-4eb0-bf5b-e90adff9d4df","resolution":{"observed_at":"2026-08-11T14:46:16.691856Z","resolver_source":"doi","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":"2103.09173","last_updated":"2021-03-19T12:39:32Z","snapshot_observed_at":"2026-08-12T17:55:10.689077Z","submitted_at":"2021-03-16T16:20:54Z","title":"Ternary Hashing","version":2},"cited_work":{"arxiv_id":"2103.09173","doi":null,"metadata_source":"pith","pith_arxiv_id":"2103.09173","snapshot_observed_at":"2026-08-11T14:46:17.012383Z","title":"Ternary Hashing","venue":"cs.AI","work_id":"e3556289-bf08-461b-a286-5b27f0fcb1c8","year":2021},"citing_paper":{"arxiv_id":"2412.11728","last_updated":"2024-12-16T12:51:35Z","snapshot_observed_at":"2026-08-12T17:54:58.954681Z","submitted_at":"2024-12-16T12:51:35Z","title":"SECRET: Towards Scalable and Efficient Code Retrieval via Segmented Deep Hashing","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-11T14:46:16.639909Z"},"links":{"cited_paper":"/paper/2103.09173","citing_paper":"/paper/2412.11728"},"observation_digest":"sha256:7dbe79e6c6f9bb7d36ca2e6174e3e59dc958bf271e4c10379850954716f96531","observation_id":"0375bee9-b4ba-4caf-8f22-1d88fa619186","resolution":{"observed_at":"2026-08-11T14:46:17.019141Z","resolver_source":"local_arxiv","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":null,"cited_work":{"arxiv_id":"2018.28828","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T14:46:16.991000Z","title":"Deep variational and structural hashing,","venue":null,"work_id":"0b6b375f-924a-4013-9d98-9cfa59894712","year":2020},"citing_paper":{"arxiv_id":"2412.11728","last_updated":"2024-12-16T12:51:35Z","snapshot_observed_at":"2026-08-12T17:54:58.954681Z","submitted_at":"2024-12-16T12:51:35Z","title":"SECRET: Towards Scalable and Efficient Code Retrieval via Segmented Deep Hashing","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-11T14:46:16.644616Z"},"links":{"citing_paper":"/paper/2412.11728"},"observation_digest":"sha256:b96c57852a1c99de0f0da537aafb4a9827c64c732ed2968c8551239689f503b3","observation_id":"ce67973f-2f2e-4705-aa4f-73eb4413fad0","resolution":{"observed_at":"2026-08-11T14:46:16.998790Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"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-11T14:46:16.525420Z","title":"Available: https://doi.org/10.1108/00220410410560573","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.11728","last_updated":"2024-12-16T12:51:35Z","snapshot_observed_at":"2026-08-12T17:54:58.954681Z","submitted_at":"2024-12-16T12:51:35Z","title":"SECRET: Towards Scalable and Efficient Code Retrieval via Segmented Deep Hashing","version":1},"reference_index":2004,"source":"pdf_text","source_observed_at":"2026-08-11T14:46:16.525420Z"},"links":{"citing_paper":"/paper/2412.11728"},"observation_digest":"sha256:41c90ee62c095660ef4ba9eb4e763c165c9db27a945aab30d7d3dd68a638bd03","observation_id":"9862dc72-b948-49b6-8bf1-4f78f4f0cdcf","resolution":{"observed_at":"2026-08-11T14:46:16.525420Z","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":"2015.24879","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T14:46:18.230942Z","title":"Available: https://doi.org/10.1109/JPROC.2015.2487976","venue":null,"work_id":"a1c5012a-35ec-4242-9796-e20220cb06bc","year":2015},"citing_paper":{"arxiv_id":"2412.11728","last_updated":"2024-12-16T12:51:35Z","snapshot_observed_at":"2026-08-12T17:54:58.954681Z","submitted_at":"2024-12-16T12:51:35Z","title":"SECRET: Towards Scalable and Efficient Code Retrieval via Segmented Deep Hashing","version":1},"reference_index":2016,"source":"pdf_text","source_observed_at":"2026-08-11T14:46:16.479022Z"},"links":{"citing_paper":"/paper/2412.11728"},"observation_digest":"sha256:2585df9a196addc5fd9224953c42a15289d6021bb899eaf5717856ef879f3134","observation_id":"f20d4ca8-fd08-4774-b515-2eb6b7543312","resolution":{"observed_at":"2026-08-11T14:46:18.237613Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"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":"2022.32339","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T14:46:17.519412Z","title":"Available: https://doi.org/10.1109/TSE.2022.3233901","venue":null,"work_id":"a01d8f18-a51c-43c1-bed8-eb9aee6cff3d","year":2022},"citing_paper":{"arxiv_id":"2412.11728","last_updated":"2024-12-16T12:51:35Z","snapshot_observed_at":"2026-08-12T17:54:58.954681Z","submitted_at":"2024-12-16T12:51:35Z","title":"SECRET: Towards Scalable and Efficient Code Retrieval via Segmented Deep Hashing","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-11T14:46:16.593461Z"},"links":{"citing_paper":"/paper/2412.11728"},"observation_digest":"sha256:cf62b02825e8343a9ba2fb3b97d3bb84a05b06573fd3166ece0c7fc7d45e042c","observation_id":"214d6f2b-a3da-42dd-8da2-8c54a68a8796","resolution":{"observed_at":"2026-08-11T14:46:17.527063Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"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"}}],"paper":{"arxiv_id":"2412.11728","last_updated":"2024-12-16T12:51:35Z","latest_version":1,"primary_category":"cs.SE","snapshot_observed_at":"2026-08-12T17:54:58.954681Z","submitted_at":"2024-12-16T12:51:35Z","title":"SECRET: Towards Scalable and Efficient Code Retrieval via Segmented Deep Hashing"},"reference_resolution":{"displayed":53,"state_counts":{"malformed_identifier":2,"metadata_mismatch":4,"parse_uncertain":0,"unresolved":28,"verified_exact":10,"verified_fuzzy":9},"total_outbound_references":53},"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 14 August 2026, this Paper Citation Record lists 53 of 53 outbound references and 1 inbound Pith citation observation for arXiv:2412.11728."}