{"as_of":"2026-08-16T17:57:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b79b2bc519969e331fdda92565d2512b3d8e084e79b5697a3e2995d4055f5792","coverage":[{"denominator":37,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":37,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T14:06:33.827977Z","state":"measured"},{"denominator":37,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":37,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+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/1908.03883/citation-record","integrity":"/paper/1908.03883/integrity","json":"/paper/1908.03883/citation-record.json","paper":"/paper/1908.03883"},"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-14T14:06:34.438754Z","title":"Soft-to-hard vector quantization for end-to-end learn- ing compressible representations","venue":null,"work_id":"94cb51d3-43ed-441d-8171-826ef2d3b468","year":2017},"citing_paper":{"arxiv_id":"1908.03883","last_updated":"2019-08-11T10:46:16Z","snapshot_observed_at":"2026-08-16T02:24:39.131210Z","submitted_at":"2019-08-11T10:46:16Z","title":"Unsupervised Neural Quantization for Compressed-Domain Similarity Search","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T14:06:33.658387Z"},"links":{"citing_paper":"/paper/1908.03883"},"observation_digest":"sha256:c7a58517bae8bbae7638536b6be150d3f9b4710a7212c0aa6bd05d5ddd2f0d59","observation_id":"bbd09b00-5a34-40bc-9014-2656b54b911e","resolution":{"observed_at":"2026-08-14T14:06:34.443596Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:06:34.423474Z","title":"Lempitsky","venue":null,"work_id":"2c65d032-64d9-46fa-94c1-a02420a9e19f","year":2014},"citing_paper":{"arxiv_id":"1908.03883","last_updated":"2019-08-11T10:46:16Z","snapshot_observed_at":"2026-08-16T02:24:39.131210Z","submitted_at":"2019-08-11T10:46:16Z","title":"Unsupervised Neural Quantization for Compressed-Domain Similarity Search","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T14:06:33.664107Z"},"links":{"citing_paper":"/paper/1908.03883"},"observation_digest":"sha256:28f04b4cbe9ec8f5a3883991bc369d7325f64d17073b6ebed3faf0589522aa7c","observation_id":"f4cdc1d1-e15d-4ec3-b35e-a9c20f34c61b","resolution":{"observed_at":"2026-08-14T14:06:34.428598Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:06:34.407893Z","title":"Lempitsky","venue":null,"work_id":"5321fed3-a58b-4fd5-8150-950d31f3925e","year":2016},"citing_paper":{"arxiv_id":"1908.03883","last_updated":"2019-08-11T10:46:16Z","snapshot_observed_at":"2026-08-16T02:24:39.131210Z","submitted_at":"2019-08-11T10:46:16Z","title":"Unsupervised Neural Quantization for Compressed-Domain Similarity Search","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T14:06:33.668916Z"},"links":{"citing_paper":"/paper/1908.03883"},"observation_digest":"sha256:ebf58a935b4f065f5b2667f6504d90f43175749a6956521a606d2a49579e818d","observation_id":"f6759f7b-f2fe-4297-830f-e793bd56f8e1","resolution":{"observed_at":"2026-08-14T14:06:34.412968Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:06:34.391905Z","title":"Deep clustering for unsupervised learning of visual features","venue":null,"work_id":"2b440765-894e-41ab-8752-81624b4f8618","year":2018},"citing_paper":{"arxiv_id":"1908.03883","last_updated":"2019-08-11T10:46:16Z","snapshot_observed_at":"2026-08-16T02:24:39.131210Z","submitted_at":"2019-08-11T10:46:16Z","title":"Unsupervised Neural Quantization for Compressed-Domain Similarity Search","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T14:06:33.674372Z"},"links":{"citing_paper":"/paper/1908.03883"},"observation_digest":"sha256:272c87588026c6f10478e4518280c89bed79794581cb60c652d93c40623c53db","observation_id":"295d4a54-ef70-400e-ba94-52a4050f433e","resolution":{"observed_at":"2026-08-14T14:06:34.397122Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:06:34.376281Z","title":"Approximate nearest neighbor search by residual vector quantization","venue":null,"work_id":"c6b688b6-a76a-4444-9177-0d43ea7b1aa7","year":2010},"citing_paper":{"arxiv_id":"1908.03883","last_updated":"2019-08-11T10:46:16Z","snapshot_observed_at":"2026-08-16T02:24:39.131210Z","submitted_at":"2019-08-11T10:46:16Z","title":"Unsupervised Neural Quantization for Compressed-Domain Similarity Search","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T14:06:33.679610Z"},"links":{"citing_paper":"/paper/1908.03883"},"observation_digest":"sha256:0cc78b20c93c254bd335566ba8975488c23c0242b47e59b376f9b412de7c53c3","observation_id":"351cca41-a4d2-463e-b72f-48edb7761e9e","resolution":{"observed_at":"2026-08-14T14:06:34.381878Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:06:34.360775Z","title":"Opti- mized product quantization for approximate nearest neigh- bor search","venue":null,"work_id":"e512e5a1-a6ee-4b45-8965-2905c23b15c3","year":2013},"citing_paper":{"arxiv_id":"1908.03883","last_updated":"2019-08-11T10:46:16Z","snapshot_observed_at":"2026-08-16T02:24:39.131210Z","submitted_at":"2019-08-11T10:46:16Z","title":"Unsupervised Neural Quantization for Compressed-Domain Similarity Search","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T14:06:33.684564Z"},"links":{"citing_paper":"/paper/1908.03883"},"observation_digest":"sha256:26ba13aed9973aadd49c67d5c21a3c31036e4642d8cf2b14c19aa8b97c0ea4a1","observation_id":"5bfa107c-b0df-45ac-9a65-2f8133883314","resolution":{"observed_at":"2026-08-14T14:06:34.365829Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:06:34.345788Z","title":"Iterative quantization: A procrustean approach to learning binary codes for large-scale im- age retrieval","venue":null,"work_id":"4327913f-73d4-42e5-aa3f-2b2cfd64da1a","year":2013},"citing_paper":{"arxiv_id":"1908.03883","last_updated":"2019-08-11T10:46:16Z","snapshot_observed_at":"2026-08-16T02:24:39.131210Z","submitted_at":"2019-08-11T10:46:16Z","title":"Unsupervised Neural Quantization for Compressed-Domain Similarity Search","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T14:06:33.690085Z"},"links":{"citing_paper":"/paper/1908.03883"},"observation_digest":"sha256:00b7fff06104261c6efb6d9a82d6392ab35dd4bd21e250f2f0e39f84fc84dfa0","observation_id":"3555b565-2a14-4a97-8d2c-94264cbd86c9","resolution":{"observed_at":"2026-08-14T14:06:34.350582Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1412.6115","last_updated":"2014-12-18T21:09:01Z","snapshot_observed_at":"2026-08-14T23:06:53.533484Z","submitted_at":"2014-12-18T21:09:01Z","title":"Compressing Deep Convolutional Networks using Vector Quantization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1412.6115","snapshot_observed_at":"2026-08-14T14:06:33.695031Z","title":"Bour- dev","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"1908.03883","last_updated":"2019-08-11T10:46:16Z","snapshot_observed_at":"2026-08-16T02:24:39.131210Z","submitted_at":"2019-08-11T10:46:16Z","title":"Unsupervised Neural Quantization for Compressed-Domain Similarity Search","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T14:06:33.695031Z"},"links":{"cited_paper":"/paper/1412.6115","citing_paper":"/paper/1908.03883"},"observation_digest":"sha256:b28b32c33036055227a0c0e42156bd6170c29e571aaa3d395950f209ed4520fa","observation_id":"29e743c6-9792-4c99-b84b-8f62c2aec549","resolution":{"observed_at":"2026-08-14T14:06:33.695031Z","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-14T14:06:34.331202Z","title":"Spherical hashing","venue":null,"work_id":"c4ee1964-cb1f-485d-817b-f95e4fae4252","year":2012},"citing_paper":{"arxiv_id":"1908.03883","last_updated":"2019-08-11T10:46:16Z","snapshot_observed_at":"2026-08-16T02:24:39.131210Z","submitted_at":"2019-08-11T10:46:16Z","title":"Unsupervised Neural Quantization for Compressed-Domain Similarity Search","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T14:06:33.700320Z"},"links":{"citing_paper":"/paper/1908.03883"},"observation_digest":"sha256:e96e628937ace0902599fc52416bf3233c9d3888feafb6d4a2ca47e4722ce2de","observation_id":"201ad19c-c951-49f6-b9da-8e24706a7735","resolution":{"observed_at":"2026-08-14T14:06:34.335857Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:06:34.315901Z","title":"Batch normalization: Accelerating deep network training by reducing internal co- variate shift","venue":null,"work_id":"824befb8-90b7-4cae-9191-8e315d33c936","year":2015},"citing_paper":{"arxiv_id":"1908.03883","last_updated":"2019-08-11T10:46:16Z","snapshot_observed_at":"2026-08-16T02:24:39.131210Z","submitted_at":"2019-08-11T10:46:16Z","title":"Unsupervised Neural Quantization for Compressed-Domain Similarity Search","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T14:06:33.705137Z"},"links":{"citing_paper":"/paper/1908.03883"},"observation_digest":"sha256:e9bd35161c1a63f59a8d9d12e2b9738a92a01f65a6c009f6741443b6a4100f48","observation_id":"5a44806f-d9b2-4ce9-9c2b-e0322a02f1df","resolution":{"observed_at":"2026-08-14T14:06:34.320961Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:06:34.299875Z","title":"Subic: A supervised, structured binary code for image search","venue":null,"work_id":"a7383152-3539-4c30-afaa-5f25e1cccec1","year":2017},"citing_paper":{"arxiv_id":"1908.03883","last_updated":"2019-08-11T10:46:16Z","snapshot_observed_at":"2026-08-16T02:24:39.131210Z","submitted_at":"2019-08-11T10:46:16Z","title":"Unsupervised Neural Quantization for Compressed-Domain Similarity Search","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T14:06:33.709647Z"},"links":{"citing_paper":"/paper/1908.03883"},"observation_digest":"sha256:be0a4b81c838be6727da7da646950ad49a89d28d93d0fce4b101f84d01aa388e","observation_id":"9e6215d7-4d10-4666-93db-70a74a2d1cbd","resolution":{"observed_at":"2026-08-14T14:06:34.304884Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:06:34.284960Z","title":"Categorical repa- rameterization with gumbel-softmax","venue":null,"work_id":"d8d88996-e8d7-472d-8b4d-6a376f1c999f","year":2016},"citing_paper":{"arxiv_id":"1908.03883","last_updated":"2019-08-11T10:46:16Z","snapshot_observed_at":"2026-08-16T02:24:39.131210Z","submitted_at":"2019-08-11T10:46:16Z","title":"Unsupervised Neural Quantization for Compressed-Domain Similarity Search","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T14:06:33.714372Z"},"links":{"citing_paper":"/paper/1908.03883"},"observation_digest":"sha256:735897710686af66f401fc0c457b9654413b6eaea64cf0891331d931402f7ff2","observation_id":"ef70a119-d338-4614-ad94-5da4617978c0","resolution":{"observed_at":"2026-08-14T14:06:34.289746Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1611.01144","last_updated":"2017-08-05T22:45:19Z","snapshot_observed_at":"2026-08-15T03:05:41.956181Z","submitted_at":"2016-11-03T19:48:08Z","title":"Categorical Reparameterization with Gumbel-Softmax","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1611.01144","snapshot_observed_at":"2026-08-14T14:06:33.718831Z","title":"Categorical reparameterization with gumbel-softmax","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"1908.03883","last_updated":"2019-08-11T10:46:16Z","snapshot_observed_at":"2026-08-16T02:24:39.131210Z","submitted_at":"2019-08-11T10:46:16Z","title":"Unsupervised Neural Quantization for Compressed-Domain Similarity Search","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T14:06:33.718831Z"},"links":{"cited_paper":"/paper/1611.01144","citing_paper":"/paper/1908.03883"},"observation_digest":"sha256:2acf5ce074dab7c4fe82791b74a086c76fe7d766cc559cc0f2f16c6e7ea457e9","observation_id":"fd7d6319-50f0-4612-8098-c009863d4300","resolution":{"observed_at":"2026-08-14T14:06:33.718831Z","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-14T14:06:34.268949Z","title":"Prod- uct quantization for nearest neighbor search","venue":null,"work_id":"e14f92ca-8af0-418d-89d1-aad7afd996eb","year":2011},"citing_paper":{"arxiv_id":"1908.03883","last_updated":"2019-08-11T10:46:16Z","snapshot_observed_at":"2026-08-16T02:24:39.131210Z","submitted_at":"2019-08-11T10:46:16Z","title":"Unsupervised Neural Quantization for Compressed-Domain Similarity Search","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T14:06:33.723576Z"},"links":{"citing_paper":"/paper/1908.03883"},"observation_digest":"sha256:25a1f41ceb27f8b240d7e4018d9f11ca7fcccccf21c89a55ee40104128f605b1","observation_id":"58cac3c5-3519-4df1-91a1-ceadac7b820a","resolution":{"observed_at":"2026-08-14T14:06:34.274588Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:06:34.253366Z","title":"Searching in one billion vectors: Re-rank with source coding","venue":null,"work_id":"fdac57e8-780d-4504-8b66-b6ebf35b2656","year":2011},"citing_paper":{"arxiv_id":"1908.03883","last_updated":"2019-08-11T10:46:16Z","snapshot_observed_at":"2026-08-16T02:24:39.131210Z","submitted_at":"2019-08-11T10:46:16Z","title":"Unsupervised Neural Quantization for Compressed-Domain Similarity Search","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T14:06:33.727984Z"},"links":{"citing_paper":"/paper/1908.03883"},"observation_digest":"sha256:d0dcb902cdfac4c101baae86a350f399e1cb8c1cf676d2b4913de5ea6a367e1b","observation_id":"d5a42bb5-65af-4928-a9b3-26fb4aa5a1e4","resolution":{"observed_at":"2026-08-14T14:06:34.258301Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1702.08734","last_updated":"2017-02-28T10:42:31Z","snapshot_observed_at":"2026-08-14T21:14:23.253253Z","submitted_at":"2017-02-28T10:42:31Z","title":"Billion-scale similarity search with GPUs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1702.08734","snapshot_observed_at":"2026-08-14T14:06:33.732489Z","title":"Billion- scale similarity search with gpus","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"1908.03883","last_updated":"2019-08-11T10:46:16Z","snapshot_observed_at":"2026-08-16T02:24:39.131210Z","submitted_at":"2019-08-11T10:46:16Z","title":"Unsupervised Neural Quantization for Compressed-Domain Similarity Search","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T14:06:33.732489Z"},"links":{"cited_paper":"/paper/1702.08734","citing_paper":"/paper/1908.03883"},"observation_digest":"sha256:ee3c9ce78790990d856480233bde76977b700ae8c75344b69f47150d28a0709b","observation_id":"529496c9-4662-4a76-945f-165a819c42c0","resolution":{"observed_at":"2026-08-14T14:06:33.732489Z","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-14T14:06:34.236626Z","title":"Fast de- coding in sequence models using discrete latent variables","venue":null,"work_id":"381a2a06-7097-45ab-9e98-d2c006f38ae7","year":2018},"citing_paper":{"arxiv_id":"1908.03883","last_updated":"2019-08-11T10:46:16Z","snapshot_observed_at":"2026-08-16T02:24:39.131210Z","submitted_at":"2019-08-11T10:46:16Z","title":"Unsupervised Neural Quantization for Compressed-Domain Similarity Search","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T14:06:33.737200Z"},"links":{"citing_paper":"/paper/1908.03883"},"observation_digest":"sha256:b850346399754515f8474b27ec6a3927e7bf19eb2ba5887fe8448a6018848f66","observation_id":"270e4d82-7b66-42e7-9da9-b0f7665f1a77","resolution":{"observed_at":"2026-08-14T14:06:34.242719Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1711.08589","last_updated":"2020-01-17T22:56:50Z","snapshot_observed_at":"2026-08-16T12:36:36.089615Z","submitted_at":"2017-11-23T06:40:28Z","title":"End-to-End Supervised Product Quantization for Image Search and Retrieval","version":2},"cited_work":{"arxiv_id":"1711.08589","doi":null,"metadata_source":"pith","pith_arxiv_id":"1711.08589","snapshot_observed_at":"2026-08-14T14:06:33.957752Z","title":"End-to-End Supervised Product Quantization for Image Search and Retrieval","venue":"cs.CV","work_id":"c2cd003c-eb3a-4f3c-8b5a-b91fbd807581","year":2017},"citing_paper":{"arxiv_id":"1908.03883","last_updated":"2019-08-11T10:46:16Z","snapshot_observed_at":"2026-08-16T02:24:39.131210Z","submitted_at":"2019-08-11T10:46:16Z","title":"Unsupervised Neural Quantization for Compressed-Domain Similarity Search","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T14:06:33.741683Z"},"links":{"cited_paper":"/paper/1711.08589","citing_paper":"/paper/1908.03883"},"observation_digest":"sha256:2256449e8a321b0244d891b86ecf9ed50beb25171c0a30d851749877e0e53f8c","observation_id":"6c1e0c8c-4f63-40c9-83bb-a05877614619","resolution":{"observed_at":"2026-08-14T14:06:33.965337Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:06:34.220922Z","title":"Hesch, Marc Pollefeys, and Roland Siegwart","venue":null,"work_id":"5cdd14d7-7b5b-4d77-bb24-e0bacd2caac5","year":2015},"citing_paper":{"arxiv_id":"1908.03883","last_updated":"2019-08-11T10:46:16Z","snapshot_observed_at":"2026-08-16T02:24:39.131210Z","submitted_at":"2019-08-11T10:46:16Z","title":"Unsupervised Neural Quantization for Compressed-Domain Similarity Search","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T14:06:33.746309Z"},"links":{"citing_paper":"/paper/1908.03883"},"observation_digest":"sha256:815990c544ffb59f5ac66ddc6b2c12f70ec52ff38614be794fbe0b48f0931701","observation_id":"6a8f1a91-07e6-4b08-839b-0e279a4ee508","resolution":{"observed_at":"2026-08-14T14:06:34.226015Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1810.06801","last_updated":"2019-05-02T04:57:39Z","snapshot_observed_at":"2026-08-14T18:14:06.866622Z","submitted_at":"2018-10-16T03:58:14Z","title":"Quasi-hyperbolic momentum and Adam for deep learning","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1810.06801","snapshot_observed_at":"2026-08-14T14:06:33.750533Z","title":"Quasi-hyperbolic momentum and adam for deep learning","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"1908.03883","last_updated":"2019-08-11T10:46:16Z","snapshot_observed_at":"2026-08-16T02:24:39.131210Z","submitted_at":"2019-08-11T10:46:16Z","title":"Unsupervised Neural Quantization for Compressed-Domain Similarity Search","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-14T14:06:33.750533Z"},"links":{"cited_paper":"/paper/1810.06801","citing_paper":"/paper/1908.03883"},"observation_digest":"sha256:da799c9d06975eb72a896435c6f4bb5ac5a7deb790047f76eb78d0c54fb1c352","observation_id":"d568a897-94ad-4452-87b1-d003610eba3d","resolution":{"observed_at":"2026-08-14T14:06:33.750533Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1611.00712","last_updated":"2017-03-05T16:59:44Z","snapshot_observed_at":"2026-08-15T03:06:21.621383Z","submitted_at":"2016-11-02T18:25:40Z","title":"The Concrete Distribution: A Continuous Relaxation of Discrete Random Variables","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1611.00712","snapshot_observed_at":"2026-08-14T14:06:33.754879Z","title":"Maddison, Andriy Mnih, and Yee Whye Teh","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"1908.03883","last_updated":"2019-08-11T10:46:16Z","snapshot_observed_at":"2026-08-16T02:24:39.131210Z","submitted_at":"2019-08-11T10:46:16Z","title":"Unsupervised Neural Quantization for Compressed-Domain Similarity Search","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-14T14:06:33.754879Z"},"links":{"cited_paper":"/paper/1611.00712","citing_paper":"/paper/1908.03883"},"observation_digest":"sha256:0e30d901ed41b93c5c767a8a246270a421d1d2849771e3531c9255652b69b54c","observation_id":"79f25d47-5b64-43c1-8e38-6cea397c30bc","resolution":{"observed_at":"2026-08-14T14:06:33.754879Z","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-14T14:06:34.206022Z","title":"Hoos, and James J","venue":null,"work_id":"bd673781-3226-4146-b6ee-2ba238783e1d","year":2016},"citing_paper":{"arxiv_id":"1908.03883","last_updated":"2019-08-11T10:46:16Z","snapshot_observed_at":"2026-08-16T02:24:39.131210Z","submitted_at":"2019-08-11T10:46:16Z","title":"Unsupervised Neural Quantization for Compressed-Domain Similarity Search","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-14T14:06:33.759489Z"},"links":{"citing_paper":"/paper/1908.03883"},"observation_digest":"sha256:63034605d0293ba8d49e78666f1e434a37d84fdcf7c2e89cb0acd4a94c9d6096","observation_id":"16bc3510-9802-4d5d-b602-959163d3566b","resolution":{"observed_at":"2026-08-14T14:06:34.210665Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:06:34.190920Z","title":"Hoos, and James J","venue":null,"work_id":"6f7bf770-28de-4e42-a957-19ec87441cfa","year":2018},"citing_paper":{"arxiv_id":"1908.03883","last_updated":"2019-08-11T10:46:16Z","snapshot_observed_at":"2026-08-16T02:24:39.131210Z","submitted_at":"2019-08-11T10:46:16Z","title":"Unsupervised Neural Quantization for Compressed-Domain Similarity Search","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-14T14:06:33.763708Z"},"links":{"citing_paper":"/paper/1908.03883"},"observation_digest":"sha256:46d69a822708ab18ea44b535824119672476deee92e31756ed8139e740dcb7cf","observation_id":"dfe59d60-5419-4b4c-9bea-6eb205a5cb68","resolution":{"observed_at":"2026-08-14T14:06:34.195886Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:06:34.174851Z","title":null,"venue":null,"work_id":"4cf99314-61f4-4a7a-9c0a-fc87c96bdcaa","year":null},"citing_paper":{"arxiv_id":"1908.03883","last_updated":"2019-08-11T10:46:16Z","snapshot_observed_at":"2026-08-16T02:24:39.131210Z","submitted_at":"2019-08-11T10:46:16Z","title":"Unsupervised Neural Quantization for Compressed-Domain Similarity Search","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-14T14:06:33.767867Z"},"links":{"citing_paper":"/paper/1908.03883"},"observation_digest":"sha256:7b4ab35c1a1087b428ed33e27eb5fae61a5990d5583f1a2afb65334a04f39089","observation_id":"1d107327-32b1-43ec-9e36-c8218d4a0802","resolution":{"observed_at":"2026-08-14T14:06:34.180290Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:06:34.158524Z","title":"Competitive quantization for approximate nearest neighbor search","venue":null,"work_id":"c4cdd775-3f1f-409f-8cf0-32ae130c9b42","year":null},"citing_paper":{"arxiv_id":"1908.03883","last_updated":"2019-08-11T10:46:16Z","snapshot_observed_at":"2026-08-16T02:24:39.131210Z","submitted_at":"2019-08-11T10:46:16Z","title":"Unsupervised Neural Quantization for Compressed-Domain Similarity Search","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-14T14:06:33.772212Z"},"links":{"citing_paper":"/paper/1908.03883"},"observation_digest":"sha256:1dfe2efa2c8cd1beedee218144355181c2fa084c5a29ffde430ee2f52ba10b6f","observation_id":"73736634-c0bb-4843-a584-3c5f0df66b9b","resolution":{"observed_at":"2026-08-14T14:06:34.163701Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:06:34.142127Z","title":"Spreading vectors for similarity search","venue":null,"work_id":"e00f6180-81fa-4739-8e4b-d58ed3c8faa5","year":null},"citing_paper":{"arxiv_id":"1908.03883","last_updated":"2019-08-11T10:46:16Z","snapshot_observed_at":"2026-08-16T02:24:39.131210Z","submitted_at":"2019-08-11T10:46:16Z","title":"Unsupervised Neural Quantization for Compressed-Domain Similarity Search","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-14T14:06:33.776903Z"},"links":{"citing_paper":"/paper/1908.03883"},"observation_digest":"sha256:7b135bdc868d73315f6c4f6bc33e1703313efcdbc65e4e879c88e475bd505e7c","observation_id":"78f1c65c-e51b-412a-a1d4-f826c6321b16","resolution":{"observed_at":"2026-08-14T14:06:34.147328Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:06:34.125974Z","title":null,"venue":null,"work_id":"1fcba8a7-e2ad-49a2-8228-8ee4f4ef7389","year":2017},"citing_paper":{"arxiv_id":"1908.03883","last_updated":"2019-08-11T10:46:16Z","snapshot_observed_at":"2026-08-16T02:24:39.131210Z","submitted_at":"2019-08-11T10:46:16Z","title":"Unsupervised Neural Quantization for Compressed-Domain Similarity Search","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-14T14:06:33.781374Z"},"links":{"citing_paper":"/paper/1908.03883"},"observation_digest":"sha256:3ffcd217eafd6c13abdc340c524e696a9341978d2c4bf12c4e58ea5de711f7e6","observation_id":"2d3956d1-4dad-4158-9203-d485b51aa6f0","resolution":{"observed_at":"2026-08-14T14:06:34.131091Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1701.06538","last_updated":"2017-01-23T18:10:00Z","snapshot_observed_at":"2026-08-13T11:35:07.866136Z","submitted_at":"2017-01-23T18:10:00Z","title":"Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layer","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1701.06538","snapshot_observed_at":"2026-08-14T14:06:33.786246Z","title":"Le, Geoffrey E","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"1908.03883","last_updated":"2019-08-11T10:46:16Z","snapshot_observed_at":"2026-08-16T02:24:39.131210Z","submitted_at":"2019-08-11T10:46:16Z","title":"Unsupervised Neural Quantization for Compressed-Domain Similarity Search","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-14T14:06:33.786246Z"},"links":{"cited_paper":"/paper/1701.06538","citing_paper":"/paper/1908.03883"},"observation_digest":"sha256:b03a90fea4645654a54f467e05e006ba461a95e02c8dddfec1079cb687819c12","observation_id":"31c0e4c8-61fe-4ecf-b00f-b563a2655a47","resolution":{"observed_at":"2026-08-14T14:06:33.786246Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1711.01068","last_updated":"2017-11-17T15:31:45Z","snapshot_observed_at":"2026-08-14T20:17:22.130094Z","submitted_at":"2017-11-03T09:05:44Z","title":"Compressing Word Embeddings via Deep Compositional Code Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1711.01068","snapshot_observed_at":"2026-08-14T14:06:33.791034Z","title":"Compressing word embeddings via deep compositional code learning","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"1908.03883","last_updated":"2019-08-11T10:46:16Z","snapshot_observed_at":"2026-08-16T02:24:39.131210Z","submitted_at":"2019-08-11T10:46:16Z","title":"Unsupervised Neural Quantization for Compressed-Domain Similarity Search","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-14T14:06:33.791034Z"},"links":{"cited_paper":"/paper/1711.01068","citing_paper":"/paper/1908.03883"},"observation_digest":"sha256:0b545317f40318d2ecf2c89be434cb60c05b9f8f6ba3f9e74dd1b69b48f80ea2","observation_id":"d490a9d5-fa5f-427f-9026-850f5d45def3","resolution":{"observed_at":"2026-08-14T14:06:33.791034Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1708.07120","last_updated":"2018-05-17T17:40:34Z","snapshot_observed_at":"2026-08-14T20:39:34.526507Z","submitted_at":"2017-08-23T17:51:57Z","title":"Super-Convergence: Very Fast Training of Neural Networks Using Large Learning Rates","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1708.07120","snapshot_observed_at":"2026-08-14T14:06:33.795895Z","title":"Super-convergence: Very fast training of neural networks using large learning rates","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"1908.03883","last_updated":"2019-08-11T10:46:16Z","snapshot_observed_at":"2026-08-16T02:24:39.131210Z","submitted_at":"2019-08-11T10:46:16Z","title":"Unsupervised Neural Quantization for Compressed-Domain Similarity Search","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-14T14:06:33.795895Z"},"links":{"cited_paper":"/paper/1708.07120","citing_paper":"/paper/1908.03883"},"observation_digest":"sha256:d674d092cf2c6124cfeb89be1917f8e2478146e8b8780689daeb2c79a92b5812","observation_id":"d55ec495-5714-4245-89ec-3bded58b75d0","resolution":{"observed_at":"2026-08-14T14:06:33.795895Z","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-14T14:06:34.108828Z","title":"Maddison, John Law- son, and Jascha Sohl-Dickstein","venue":null,"work_id":"5ae1de39-aa86-4dc5-874d-e787c2fc0e70","year":2017},"citing_paper":{"arxiv_id":"1908.03883","last_updated":"2019-08-11T10:46:16Z","snapshot_observed_at":"2026-08-16T02:24:39.131210Z","submitted_at":"2019-08-11T10:46:16Z","title":"Unsupervised Neural Quantization for Compressed-Domain Similarity Search","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-14T14:06:33.800688Z"},"links":{"citing_paper":"/paper/1908.03883"},"observation_digest":"sha256:f8771d6f8522ac8d5481c2bef1bd7a6ede6cfde486900ad0043107f769a280b1","observation_id":"dc9ce36a-111a-4c06-aaa1-4b740e816d44","resolution":{"observed_at":"2026-08-14T14:06:34.114554Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:06:34.091569Z","title":"Neural discrete representation learning","venue":null,"work_id":"37aa5afc-d94b-45cb-b273-715f82bcaf44","year":2017},"citing_paper":{"arxiv_id":"1908.03883","last_updated":"2019-08-11T10:46:16Z","snapshot_observed_at":"2026-08-16T02:24:39.131210Z","submitted_at":"2019-08-11T10:46:16Z","title":"Unsupervised Neural Quantization for Compressed-Domain Similarity Search","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-14T14:06:33.805226Z"},"links":{"citing_paper":"/paper/1908.03883"},"observation_digest":"sha256:d1ea203f34af28b10b1503b4177aeccbee9c3f2e699a24fa48faab3bf238e7f6","observation_id":"abb51a58-2e3f-4ce9-a403-c7c5e2102d8d","resolution":{"observed_at":"2026-08-14T14:06:34.096846Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:06:34.076269Z","title":"Spec- tral hashing","venue":null,"work_id":"d638916b-7189-4152-a2fb-4e513d93dfdf","year":2008},"citing_paper":{"arxiv_id":"1908.03883","last_updated":"2019-08-11T10:46:16Z","snapshot_observed_at":"2026-08-16T02:24:39.131210Z","submitted_at":"2019-08-11T10:46:16Z","title":"Unsupervised Neural Quantization for Compressed-Domain Similarity Search","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-14T14:06:33.809533Z"},"links":{"citing_paper":"/paper/1908.03883"},"observation_digest":"sha256:790276d3c502f794cf47158049a1a961fff34510d15665d95591db70645466c5","observation_id":"8e9bf33b-e3a9-4316-af39-4f48df169c97","resolution":{"observed_at":"2026-08-14T14:06:34.081072Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1807.04629","last_updated":"2019-03-04T11:50:21Z","snapshot_observed_at":"2026-08-15T09:50:51.448273Z","submitted_at":"2018-07-12T15:08:31Z","title":"Learning Product Codebooks using Vector Quantized Autoencoders for Image Retrieval","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1807.04629","snapshot_observed_at":"2026-08-14T14:06:33.813706Z","title":"Learning product code- books using vector quantized autoencoders for image re- trieval","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"1908.03883","last_updated":"2019-08-11T10:46:16Z","snapshot_observed_at":"2026-08-16T02:24:39.131210Z","submitted_at":"2019-08-11T10:46:16Z","title":"Unsupervised Neural Quantization for Compressed-Domain Similarity Search","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-14T14:06:33.813706Z"},"links":{"cited_paper":"/paper/1807.04629","citing_paper":"/paper/1908.03883"},"observation_digest":"sha256:d695e6d336c2376713bd0fd3c1062ee3b77ae7c925280fa17530ae8196401f44","observation_id":"1b0c4b53-9e8a-4d5d-aa57-c50a3a06a7cb","resolution":{"observed_at":"2026-08-14T14:06:33.813706Z","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-14T14:06:34.060427Z","title":"Product quantization network for fast image retrieval","venue":null,"work_id":"54181f97-913c-4336-916b-489c2170ae7e","year":2018},"citing_paper":{"arxiv_id":"1908.03883","last_updated":"2019-08-11T10:46:16Z","snapshot_observed_at":"2026-08-16T02:24:39.131210Z","submitted_at":"2019-08-11T10:46:16Z","title":"Unsupervised Neural Quantization for Compressed-Domain Similarity Search","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-14T14:06:33.818565Z"},"links":{"citing_paper":"/paper/1908.03883"},"observation_digest":"sha256:09a552e6d20f410f31fd39dedfec8958ca4a3979b329571c6160f7dbab9cde44","observation_id":"b5500b42-e33a-4918-a683-9c9ec0f6f635","resolution":{"observed_at":"2026-08-14T14:06:34.065357Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:06:34.044925Z","title":"PQ-CNN: accelerating prod- uct quantized convolutional neural network on FPGA","venue":null,"work_id":"82d5c451-a0a9-4209-a75b-af0fd94d71d4","year":2018},"citing_paper":{"arxiv_id":"1908.03883","last_updated":"2019-08-11T10:46:16Z","snapshot_observed_at":"2026-08-16T02:24:39.131210Z","submitted_at":"2019-08-11T10:46:16Z","title":"Unsupervised Neural Quantization for Compressed-Domain Similarity Search","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-14T14:06:33.823181Z"},"links":{"citing_paper":"/paper/1908.03883"},"observation_digest":"sha256:15e5b0ffbeecb330b9f940f9b4c10f176daf7f3d822d9f0e72e86832a4a6648d","observation_id":"21e05616-c091-4b63-990c-5d580c4d3397","resolution":{"observed_at":"2026-08-14T14:06:34.049800Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:06:34.028654Z","title":"Composite quan- tization for approximate nearest neighbor search","venue":null,"work_id":"31a71e2e-8447-4663-ba9b-de3a40c2213f","year":2014},"citing_paper":{"arxiv_id":"1908.03883","last_updated":"2019-08-11T10:46:16Z","snapshot_observed_at":"2026-08-16T02:24:39.131210Z","submitted_at":"2019-08-11T10:46:16Z","title":"Unsupervised Neural Quantization for Compressed-Domain Similarity Search","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-14T14:06:33.827977Z"},"links":{"citing_paper":"/paper/1908.03883"},"observation_digest":"sha256:905fae06107d077ce919f99674d5e320bd8be37e95c532a28e56a1ba1b3887d0","observation_id":"48abf67e-3479-4ee1-a92e-78163e721bf9","resolution":{"observed_at":"2026-08-14T14:06:34.033944Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"1908.03883","last_updated":"2019-08-11T10:46:16Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-16T02:24:39.131210Z","submitted_at":"2019-08-11T10:46:16Z","title":"Unsupervised Neural Quantization for Compressed-Domain Similarity Search"},"reference_resolution":{"displayed":37,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":11,"verified_exact":1,"verified_fuzzy":25},"total_outbound_references":37},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 37 of 37 outbound references and 0 inbound Pith citation observations for arXiv:1908.03883."}