{"as_of":"2026-08-22T13:27:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2650791733405ca1edfdde1376277da575378e58a5b8dbf97b8adf2ae9d7a913","coverage":[{"denominator":68,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":68,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T23:48:11.322081Z","state":"measured"},{"denominator":68,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":68,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-22T06:32:14.747728+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/2412.02244/citation-record","integrity":"/paper/2412.02244/integrity","json":"/paper/2412.02244/citation-record.json","paper":"/paper/2412.02244"},"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-11T23:48:12.317088Z","title":"https://networkrepository","venue":null,"work_id":"c5d952a1-e85f-47ab-b1d2-d3369e6d75bd","year":null},"citing_paper":{"arxiv_id":"2412.02244","last_updated":"2024-12-03T08:16:59Z","snapshot_observed_at":"2026-08-15T17:45:29.152307Z","submitted_at":"2024-12-03T08:16:59Z","title":"On Simplifying Large-Scale Spatial Vectors: Fast, Memory-Efficient, and Cost-Predictable k-means","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-11T23:48:11.058259Z"},"links":{"citing_paper":"/paper/2412.02244"},"observation_digest":"sha256:4067ffa9258203101550894f3af063531448209f32f99a69665e815da00722c8","observation_id":"baa55816-de8a-4438-a3f8-4b57f8f6cdb4","resolution":{"observed_at":"2026-08-11T23:48:12.321265Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-11T23:48:12.304562Z","title":"https://shapenet.org/","venue":null,"work_id":"b31f4324-e9c6-4e4d-be26-5156c537dd35","year":null},"citing_paper":{"arxiv_id":"2412.02244","last_updated":"2024-12-03T08:16:59Z","snapshot_observed_at":"2026-08-15T17:45:29.152307Z","submitted_at":"2024-12-03T08:16:59Z","title":"On Simplifying Large-Scale Spatial Vectors: Fast, Memory-Efficient, and Cost-Predictable k-means","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-11T23:48:11.063168Z"},"links":{"citing_paper":"/paper/2412.02244"},"observation_digest":"sha256:721a3d779fde5b254b44be9c6ec87daf809a691dc0c19990e84099df29d4b669","observation_id":"f597fd59-cf6f-420f-abbc-e99979227e7e","resolution":{"observed_at":"2026-08-11T23:48:12.308487Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"trajectories/1230216","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T23:48:11.510238Z","title":"https://figshare.com/ articles/dataset/Porto taxi trajectories/12302165","venue":null,"work_id":"2917d274-dca8-4932-915d-597c06c9c51a","year":2015},"citing_paper":{"arxiv_id":"2412.02244","last_updated":"2024-12-03T08:16:59Z","snapshot_observed_at":"2026-08-15T17:45:29.152307Z","submitted_at":"2024-12-03T08:16:59Z","title":"On Simplifying Large-Scale Spatial Vectors: Fast, Memory-Efficient, and Cost-Predictable k-means","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-11T23:48:11.067325Z"},"links":{"citing_paper":"/paper/2412.02244"},"observation_digest":"sha256:e117d327a84e0373208140411edd37b1350a360eb133ff46f12e5b9f31748320","observation_id":"ae904354-39e3-457a-8a13-7b67b5beeab2","resolution":{"observed_at":"2026-08-11T23:48:11.518137Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-11T23:48:12.292350Z","title":"https://www.hackster.io/flyingfox/flyingfox-821a16, 2021","venue":null,"work_id":"5ed4556a-51e0-4c7a-a783-977022000245","year":2021},"citing_paper":{"arxiv_id":"2412.02244","last_updated":"2024-12-03T08:16:59Z","snapshot_observed_at":"2026-08-15T17:45:29.152307Z","submitted_at":"2024-12-03T08:16:59Z","title":"On Simplifying Large-Scale Spatial Vectors: Fast, Memory-Efficient, and Cost-Predictable k-means","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-11T23:48:11.071773Z"},"links":{"citing_paper":"/paper/2412.02244"},"observation_digest":"sha256:046a7e871dafb53c47bbbb74880e7e2ca3bac0ead47970531e75aad6c3983353","observation_id":"cf3cac8a-0e5d-435f-9df5-5fc6c55ae54e","resolution":{"observed_at":"2026-08-11T23:48:12.296637Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-11T23:48:12.278538Z","title":"https://www.oppo.com/en/smartphones/ series-reno/reno11/","venue":null,"work_id":"4b62dbcc-4a4d-4b50-afd7-4106231db342","year":2024},"citing_paper":{"arxiv_id":"2412.02244","last_updated":"2024-12-03T08:16:59Z","snapshot_observed_at":"2026-08-15T17:45:29.152307Z","submitted_at":"2024-12-03T08:16:59Z","title":"On Simplifying Large-Scale Spatial Vectors: Fast, Memory-Efficient, and Cost-Predictable k-means","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-11T23:48:11.076081Z"},"links":{"citing_paper":"/paper/2412.02244"},"observation_digest":"sha256:47c7bfcd47891abaf5a77c5e98470916d789781d5920331b14989762e8565dcd","observation_id":"9af2a7e4-9f7e-42ab-ad4e-c0f94cb5cd04","resolution":{"observed_at":"2026-08-11T23:48:12.283311Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-11T23:48:12.265328Z","title":"https://github.com/notNNORTH/ Dask-means-cpp, 2024","venue":null,"work_id":"dcf549db-b306-4bc4-a293-86a5dac85540","year":2024},"citing_paper":{"arxiv_id":"2412.02244","last_updated":"2024-12-03T08:16:59Z","snapshot_observed_at":"2026-08-15T17:45:29.152307Z","submitted_at":"2024-12-03T08:16:59Z","title":"On Simplifying Large-Scale Spatial Vectors: Fast, Memory-Efficient, and Cost-Predictable k-means","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-11T23:48:11.080554Z"},"links":{"citing_paper":"/paper/2412.02244"},"observation_digest":"sha256:34be47aa7c91a43be6f663f156660bc3c3de29d6d99ba17a2e780d49ae485ac1","observation_id":"3eca51ea-c61b-40ac-9b87-dd02d9ac53b9","resolution":{"observed_at":"2026-08-11T23:48:12.269550Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-11T23:48:12.253473Z","title":"https://malmaud.github.io/tfdocs/shape inference/, 2024","venue":null,"work_id":"a8cd1faf-2d8e-4a18-8eb2-328a3ed39d14","year":2024},"citing_paper":{"arxiv_id":"2412.02244","last_updated":"2024-12-03T08:16:59Z","snapshot_observed_at":"2026-08-15T17:45:29.152307Z","submitted_at":"2024-12-03T08:16:59Z","title":"On Simplifying Large-Scale Spatial Vectors: Fast, Memory-Efficient, and Cost-Predictable k-means","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-11T23:48:11.084972Z"},"links":{"citing_paper":"/paper/2412.02244"},"observation_digest":"sha256:01b9e2e5fe9e90c1ffdee4108e296a5e3ad19a165050b61cbcbf3001c44575b8","observation_id":"1ff337e6-0053-4541-8d16-f25bb145a872","resolution":{"observed_at":"2026-08-11T23:48:12.257778Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-11T23:48:12.238605Z","title":null,"venue":null,"work_id":"b00a1d4e-3ff6-4038-8749-4b4c469263c4","year":2020},"citing_paper":{"arxiv_id":"2412.02244","last_updated":"2024-12-03T08:16:59Z","snapshot_observed_at":"2026-08-15T17:45:29.152307Z","submitted_at":"2024-12-03T08:16:59Z","title":"On Simplifying Large-Scale Spatial Vectors: Fast, Memory-Efficient, and Cost-Predictable k-means","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-11T23:48:11.089044Z"},"links":{"citing_paper":"/paper/2412.02244"},"observation_digest":"sha256:22ca1d995368ef6db096869069e4fe662995a01ee43d53e6453358d97ab6b8b1","observation_id":"f663aa8e-2b99-4fa8-b4ed-065a071bf533","resolution":{"observed_at":"2026-08-11T23:48:12.242951Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-11T23:48:12.225582Z","title":null,"venue":null,"work_id":"9340375c-fdc5-41b5-b61d-76942842ba1a","year":2019},"citing_paper":{"arxiv_id":"2412.02244","last_updated":"2024-12-03T08:16:59Z","snapshot_observed_at":"2026-08-15T17:45:29.152307Z","submitted_at":"2024-12-03T08:16:59Z","title":"On Simplifying Large-Scale Spatial Vectors: Fast, Memory-Efficient, and Cost-Predictable k-means","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-11T23:48:11.093561Z"},"links":{"citing_paper":"/paper/2412.02244"},"observation_digest":"sha256:8afa5f22ddb8e5ca2a8fe240310d9f9c3d99d1badd3170d5fd2ef5b61b5b8c4e","observation_id":"0644292d-7824-4a44-9892-9765d637987a","resolution":{"observed_at":"2026-08-11T23:48:12.230415Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-11T23:48:12.211795Z","title":"Albert, S","venue":null,"work_id":"90e546e4-dacb-45ac-8fa8-760d60ce5f6e","year":2010},"citing_paper":{"arxiv_id":"2412.02244","last_updated":"2024-12-03T08:16:59Z","snapshot_observed_at":"2026-08-15T17:45:29.152307Z","submitted_at":"2024-12-03T08:16:59Z","title":"On Simplifying Large-Scale Spatial Vectors: Fast, Memory-Efficient, and Cost-Predictable k-means","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-11T23:48:11.097381Z"},"links":{"citing_paper":"/paper/2412.02244"},"observation_digest":"sha256:fd0825f84252640ec67f7c3c1dcd737e7e186317dfeae00a420d8512ec92dd48","observation_id":"d8bdaa0d-f548-4716-b65e-2be4762e4884","resolution":{"observed_at":"2026-08-11T23:48:12.216097Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-11T23:48:12.199003Z","title":null,"venue":null,"work_id":"e900596b-12e3-45ae-a4a2-58d498299ed9","year":2015},"citing_paper":{"arxiv_id":"2412.02244","last_updated":"2024-12-03T08:16:59Z","snapshot_observed_at":"2026-08-15T17:45:29.152307Z","submitted_at":"2024-12-03T08:16:59Z","title":"On Simplifying Large-Scale Spatial Vectors: Fast, Memory-Efficient, and Cost-Predictable k-means","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-11T23:48:11.101318Z"},"links":{"citing_paper":"/paper/2412.02244"},"observation_digest":"sha256:a26a7947b38a6d08bd50844f880e285407e75a8f4b214d8f882063f0bb7a369b","observation_id":"cad5648e-f6cb-4e59-8c07-441727d98eed","resolution":{"observed_at":"2026-08-11T23:48:12.203054Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-11T23:48:12.186038Z","title":"Brand, J","venue":null,"work_id":"2e4d90f5-3bb4-4af0-b093-1527a0289cda","year":2018},"citing_paper":{"arxiv_id":"2412.02244","last_updated":"2024-12-03T08:16:59Z","snapshot_observed_at":"2026-08-15T17:45:29.152307Z","submitted_at":"2024-12-03T08:16:59Z","title":"On Simplifying Large-Scale Spatial Vectors: Fast, Memory-Efficient, and Cost-Predictable k-means","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-11T23:48:11.105422Z"},"links":{"citing_paper":"/paper/2412.02244"},"observation_digest":"sha256:a6d5bd303f235c4744554c3337c93e807eab560c6eb2e7b3e872f8d45c074c6d","observation_id":"30d0f2ee-3f89-4ea7-84a6-ca7fb4e57e92","resolution":{"observed_at":"2026-08-11T23:48:12.190605Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1605.07678","last_updated":"2017-04-14T23:40:21Z","snapshot_observed_at":"2026-08-14T21:55:52.571212Z","submitted_at":"2016-05-24T22:36:02Z","title":"An Analysis of Deep Neural Network Models for Practical Applications","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1605.07678","snapshot_observed_at":"2026-08-11T23:48:11.109282Z","title":"Canziani, A","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2412.02244","last_updated":"2024-12-03T08:16:59Z","snapshot_observed_at":"2026-08-15T17:45:29.152307Z","submitted_at":"2024-12-03T08:16:59Z","title":"On Simplifying Large-Scale Spatial Vectors: Fast, Memory-Efficient, and Cost-Predictable k-means","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-11T23:48:11.109282Z"},"links":{"cited_paper":"/paper/1605.07678","citing_paper":"/paper/2412.02244"},"observation_digest":"sha256:4636a9789a564c736ef8057bdda8c3667d6541b43c8aeb489bfd8e11e08f3f57","observation_id":"eaca1e45-9ac3-4e5c-b049-898e1ca03189","resolution":{"observed_at":"2026-08-11T23:48:11.109282Z","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-11T23:48:12.173911Z","title":"Castelo, F","venue":null,"work_id":"5c2b7dc2-b494-415a-97d0-4b27cab19313","year":2021},"citing_paper":{"arxiv_id":"2412.02244","last_updated":"2024-12-03T08:16:59Z","snapshot_observed_at":"2026-08-15T17:45:29.152307Z","submitted_at":"2024-12-03T08:16:59Z","title":"On Simplifying Large-Scale Spatial Vectors: Fast, Memory-Efficient, and Cost-Predictable k-means","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-11T23:48:11.116509Z"},"links":{"citing_paper":"/paper/2412.02244"},"observation_digest":"sha256:ba97359fa995f0f637048a5e610262dcce62848cac84dba5fb2493f2199ae8b1","observation_id":"6e4ac268-395a-43af-9ae9-74a93ad5afeb","resolution":{"observed_at":"2026-08-11T23:48:12.177815Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-11T23:48:12.162182Z","title":"Chang, J","venue":null,"work_id":"3b118dc0-a33b-4890-8d7a-80b786eab22c","year":2019},"citing_paper":{"arxiv_id":"2412.02244","last_updated":"2024-12-03T08:16:59Z","snapshot_observed_at":"2026-08-15T17:45:29.152307Z","submitted_at":"2024-12-03T08:16:59Z","title":"On Simplifying Large-Scale Spatial Vectors: Fast, Memory-Efficient, and Cost-Predictable k-means","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-11T23:48:11.121513Z"},"links":{"citing_paper":"/paper/2412.02244"},"observation_digest":"sha256:71aea7a91fa873f2414820d49e4d36f3f06f2726669f7453519b78b6e26cf079","observation_id":"86311e1b-f40e-4db2-a15c-bec8e6ccbf7c","resolution":{"observed_at":"2026-08-11T23:48:12.166217Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-11T23:48:12.150333Z","title":"Chicco, M","venue":null,"work_id":"85df6268-15e7-4cec-aa40-b0ab88ba82f9","year":2021},"citing_paper":{"arxiv_id":"2412.02244","last_updated":"2024-12-03T08:16:59Z","snapshot_observed_at":"2026-08-15T17:45:29.152307Z","submitted_at":"2024-12-03T08:16:59Z","title":"On Simplifying Large-Scale Spatial Vectors: Fast, Memory-Efficient, and Cost-Predictable k-means","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-11T23:48:11.125207Z"},"links":{"citing_paper":"/paper/2412.02244"},"observation_digest":"sha256:1259047a18a22898c3b4be1dce0e7d7c09ca4b26956d3bb2fd43f63f4a718f05","observation_id":"b5bf9505-8ce2-46c1-a84e-d8f04eab4732","resolution":{"observed_at":"2026-08-11T23:48:12.154427Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-11T23:48:12.137823Z","title":null,"venue":null,"work_id":"c5c57948-a491-4fb9-9b0e-2ba0e5012388","year":2015},"citing_paper":{"arxiv_id":"2412.02244","last_updated":"2024-12-03T08:16:59Z","snapshot_observed_at":"2026-08-15T17:45:29.152307Z","submitted_at":"2024-12-03T08:16:59Z","title":"On Simplifying Large-Scale Spatial Vectors: Fast, Memory-Efficient, and Cost-Predictable k-means","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-11T23:48:11.129040Z"},"links":{"citing_paper":"/paper/2412.02244"},"observation_digest":"sha256:206c7a9beb3e392d3d453c3daec2e714a9d31dbb612b69b13c4e3dda9e1c37aa","observation_id":"47948463-16ba-4e96-b7db-023fbc2639af","resolution":{"observed_at":"2026-08-11T23:48:12.142588Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-11T23:48:12.125723Z","title":"Doan and J","venue":null,"work_id":"b88f9048-2b98-4464-be85-ab58a2a8dfe0","year":1929},"citing_paper":{"arxiv_id":"2412.02244","last_updated":"2024-12-03T08:16:59Z","snapshot_observed_at":"2026-08-15T17:45:29.152307Z","submitted_at":"2024-12-03T08:16:59Z","title":"On Simplifying Large-Scale Spatial Vectors: Fast, Memory-Efficient, and Cost-Predictable k-means","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-11T23:48:11.132671Z"},"links":{"citing_paper":"/paper/2412.02244"},"observation_digest":"sha256:1eb23332cdd0a7f88b14c7523a1d8c7bbac5c5cfdd603fe4a035888b4aaf87eb","observation_id":"118f4fd9-62e4-448b-8fba-18eb91be6889","resolution":{"observed_at":"2026-08-11T23:48:12.129873Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-11T23:48:12.114843Z","title":null,"venue":null,"work_id":"8af5d96b-b723-47bd-a427-5f5d88b8fe07","year":2013},"citing_paper":{"arxiv_id":"2412.02244","last_updated":"2024-12-03T08:16:59Z","snapshot_observed_at":"2026-08-15T17:45:29.152307Z","submitted_at":"2024-12-03T08:16:59Z","title":"On Simplifying Large-Scale Spatial Vectors: Fast, Memory-Efficient, and Cost-Predictable k-means","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-11T23:48:11.136464Z"},"links":{"citing_paper":"/paper/2412.02244"},"observation_digest":"sha256:d0d58f575b1c5b8d5b60587e1da4ea3701eb173d0add20a7ae8e77c2f56337b8","observation_id":"f602f703-e0ff-4584-811f-d9c81d00d10f","resolution":{"observed_at":"2026-08-11T23:48:12.118658Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-11T23:48:12.102598Z","title":"Eggensperger, M","venue":null,"work_id":"ee66e515-0f68-46cd-be4b-fcf9f7393b19","year":2018},"citing_paper":{"arxiv_id":"2412.02244","last_updated":"2024-12-03T08:16:59Z","snapshot_observed_at":"2026-08-15T17:45:29.152307Z","submitted_at":"2024-12-03T08:16:59Z","title":"On Simplifying Large-Scale Spatial Vectors: Fast, Memory-Efficient, and Cost-Predictable k-means","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-11T23:48:11.140516Z"},"links":{"citing_paper":"/paper/2412.02244"},"observation_digest":"sha256:954142ec26ff39cd709b1c26f5c880ac8c69f23c773e1813fc4e31993d7eecb1","observation_id":"32f98a79-a908-4ec6-b18d-d4a8081527e9","resolution":{"observed_at":"2026-08-11T23:48:12.106649Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-11T23:48:12.089472Z","title":null,"venue":null,"work_id":"2c11f9b0-f768-4187-9c27-87bb568a515a","year":2003},"citing_paper":{"arxiv_id":"2412.02244","last_updated":"2024-12-03T08:16:59Z","snapshot_observed_at":"2026-08-15T17:45:29.152307Z","submitted_at":"2024-12-03T08:16:59Z","title":"On Simplifying Large-Scale Spatial Vectors: Fast, Memory-Efficient, and Cost-Predictable k-means","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-11T23:48:11.144257Z"},"links":{"citing_paper":"/paper/2412.02244"},"observation_digest":"sha256:fb7ccb64bbeabf44c52cd8ebf7e00279a42a11d9cc7c7f26c18a57879f22e551","observation_id":"9ed526dd-6c4a-4905-b467-5b03019c0c27","resolution":{"observed_at":"2026-08-11T23:48:12.094178Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-11T23:48:12.074755Z","title":null,"venue":null,"work_id":"55b8e248-cc57-478b-9c66-29e8b9c5b470","year":2017},"citing_paper":{"arxiv_id":"2412.02244","last_updated":"2024-12-03T08:16:59Z","snapshot_observed_at":"2026-08-15T17:45:29.152307Z","submitted_at":"2024-12-03T08:16:59Z","title":"On Simplifying Large-Scale Spatial Vectors: Fast, Memory-Efficient, and Cost-Predictable k-means","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-11T23:48:11.148093Z"},"links":{"citing_paper":"/paper/2412.02244"},"observation_digest":"sha256:b549d0965071afc82533580dbfa4f023a4cca533a04ba4fd9ff54262f83e715f","observation_id":"a41a3a8d-a01c-4803-b81a-f18eaf6f845c","resolution":{"observed_at":"2026-08-11T23:48:12.079520Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-11T23:48:12.062336Z","title":null,"venue":null,"work_id":"074c6ec6-502d-42b9-9e01-8bb08be1d51a","year":2020},"citing_paper":{"arxiv_id":"2412.02244","last_updated":"2024-12-03T08:16:59Z","snapshot_observed_at":"2026-08-15T17:45:29.152307Z","submitted_at":"2024-12-03T08:16:59Z","title":"On Simplifying Large-Scale Spatial Vectors: Fast, Memory-Efficient, and Cost-Predictable k-means","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-11T23:48:11.151814Z"},"links":{"citing_paper":"/paper/2412.02244"},"observation_digest":"sha256:2f2865f7f2ac17f659ddee142f3f64b73b1ae559a1a9d822ea31b95d9a33bbf8","observation_id":"9dd2082d-44dd-4ca6-8a69-2b0535e63c9a","resolution":{"observed_at":"2026-08-11T23:48:12.066612Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-11T23:48:12.051155Z","title":null,"venue":null,"work_id":"412fc20b-44de-438e-84f2-49fc36cfc787","year":2023},"citing_paper":{"arxiv_id":"2412.02244","last_updated":"2024-12-03T08:16:59Z","snapshot_observed_at":"2026-08-15T17:45:29.152307Z","submitted_at":"2024-12-03T08:16:59Z","title":"On Simplifying Large-Scale Spatial Vectors: Fast, Memory-Efficient, and Cost-Predictable k-means","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-11T23:48:11.155521Z"},"links":{"citing_paper":"/paper/2412.02244"},"observation_digest":"sha256:e2b8c7947531e2131a063d5de65321931e7622f2f6c2c1c64b5ed53bd6895bd5","observation_id":"e71ab19b-faf2-48e2-a0c4-1e015ef03735","resolution":{"observed_at":"2026-08-11T23:48:12.055088Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-11T23:48:12.040020Z","title":null,"venue":null,"work_id":"73460f1e-545e-41ef-aa51-5ea66217b63f","year":2020},"citing_paper":{"arxiv_id":"2412.02244","last_updated":"2024-12-03T08:16:59Z","snapshot_observed_at":"2026-08-15T17:45:29.152307Z","submitted_at":"2024-12-03T08:16:59Z","title":"On Simplifying Large-Scale Spatial Vectors: Fast, Memory-Efficient, and Cost-Predictable k-means","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-11T23:48:11.159168Z"},"links":{"citing_paper":"/paper/2412.02244"},"observation_digest":"sha256:50989ee76ce0b64c3680d16aa74e89dc17a5e94cea138d8a645cdcadfdf92444","observation_id":"b03637c4-f101-4339-890e-058c95a7f8ee","resolution":{"observed_at":"2026-08-11T23:48:12.044334Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-11T23:48:12.028794Z","title":null,"venue":null,"work_id":"2fcfa054-a32a-44a5-b00c-201b4c22a8f1","year":2010},"citing_paper":{"arxiv_id":"2412.02244","last_updated":"2024-12-03T08:16:59Z","snapshot_observed_at":"2026-08-15T17:45:29.152307Z","submitted_at":"2024-12-03T08:16:59Z","title":"On Simplifying Large-Scale Spatial Vectors: Fast, Memory-Efficient, and Cost-Predictable k-means","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-11T23:48:11.162905Z"},"links":{"citing_paper":"/paper/2412.02244"},"observation_digest":"sha256:d510c6973cab06f495541de1bfbc4bb2116844a2ca3dcc1b03dd1fda1ecbee17","observation_id":"5d281458-1e7e-4f0b-80ab-fe664b776326","resolution":{"observed_at":"2026-08-11T23:48:12.032671Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-11T23:48:12.017212Z","title":"Hamerly and J","venue":null,"work_id":"16c47e5f-5bf6-4753-8cca-a759417b4af0","year":2015},"citing_paper":{"arxiv_id":"2412.02244","last_updated":"2024-12-03T08:16:59Z","snapshot_observed_at":"2026-08-15T17:45:29.152307Z","submitted_at":"2024-12-03T08:16:59Z","title":"On Simplifying Large-Scale Spatial Vectors: Fast, Memory-Efficient, and Cost-Predictable k-means","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-11T23:48:11.166661Z"},"links":{"citing_paper":"/paper/2412.02244"},"observation_digest":"sha256:3c8df25eff2c0b5dc3d33cc42f814938ef7f2bc04c39811cb99a48a76437c1ac","observation_id":"77a99c46-1265-43b3-be01-dc7f03fec9c8","resolution":{"observed_at":"2026-08-11T23:48:12.021211Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-11T23:48:12.005324Z","title":null,"venue":null,"work_id":"bffef7ba-d72b-45b5-8a07-d53c22ce4f98","year":2022},"citing_paper":{"arxiv_id":"2412.02244","last_updated":"2024-12-03T08:16:59Z","snapshot_observed_at":"2026-08-15T17:45:29.152307Z","submitted_at":"2024-12-03T08:16:59Z","title":"On Simplifying Large-Scale Spatial Vectors: Fast, Memory-Efficient, and Cost-Predictable k-means","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-11T23:48:11.170483Z"},"links":{"citing_paper":"/paper/2412.02244"},"observation_digest":"sha256:aa759276bfce62e0f03899b44fed0a308ebb3d905119532ef71e9306c79f7406","observation_id":"8e3d5b13-9836-497d-93e2-5be57cc5f533","resolution":{"observed_at":"2026-08-11T23:48:12.009032Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-11T23:48:11.993931Z","title":null,"venue":null,"work_id":"75f99d47-c79f-49c4-bca8-536204924b1e","year":2019},"citing_paper":{"arxiv_id":"2412.02244","last_updated":"2024-12-03T08:16:59Z","snapshot_observed_at":"2026-08-15T17:45:29.152307Z","submitted_at":"2024-12-03T08:16:59Z","title":"On Simplifying Large-Scale Spatial Vectors: Fast, Memory-Efficient, and Cost-Predictable k-means","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-11T23:48:11.173980Z"},"links":{"citing_paper":"/paper/2412.02244"},"observation_digest":"sha256:e90a465092d20d8b9c34d5ff8c9bc5b4207f32f6032308b5807e288b533b6962","observation_id":"5fcc3ef8-e684-4028-9635-c37640cc0c7f","resolution":{"observed_at":"2026-08-11T23:48:11.997694Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-11T23:48:11.982245Z","title":null,"venue":null,"work_id":"d5d25136-d54b-41b6-91ae-bd6990eac0f4","year":2020},"citing_paper":{"arxiv_id":"2412.02244","last_updated":"2024-12-03T08:16:59Z","snapshot_observed_at":"2026-08-15T17:45:29.152307Z","submitted_at":"2024-12-03T08:16:59Z","title":"On Simplifying Large-Scale Spatial Vectors: Fast, Memory-Efficient, and Cost-Predictable k-means","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-11T23:48:11.177827Z"},"links":{"citing_paper":"/paper/2412.02244"},"observation_digest":"sha256:8cc46a2cca0a4cef5f907cf6b61c6b8b437e678640d3ef6cc6f2acadef1534c9","observation_id":"3a28e6cd-a41e-46bb-ba54-52a9ebb3249c","resolution":{"observed_at":"2026-08-11T23:48:11.986254Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-11T23:48:11.968960Z","title":"Hutter, L","venue":null,"work_id":"73e47ba1-4138-482c-84a0-63cde35c6c00","year":2015},"citing_paper":{"arxiv_id":"2412.02244","last_updated":"2024-12-03T08:16:59Z","snapshot_observed_at":"2026-08-15T17:45:29.152307Z","submitted_at":"2024-12-03T08:16:59Z","title":"On Simplifying Large-Scale Spatial Vectors: Fast, Memory-Efficient, and Cost-Predictable k-means","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-11T23:48:11.181698Z"},"links":{"citing_paper":"/paper/2412.02244"},"observation_digest":"sha256:5e0774cfdc74d304c3c3fc2551fff3defa3afb9f4aa52847b1e714deeb3afaf6","observation_id":"3c6ee6f6-fa6f-4260-a85b-c6e6217332df","resolution":{"observed_at":"2026-08-11T23:48:11.972930Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-11T23:48:11.955736Z","title":"Jayasumana, R","venue":null,"work_id":"d26f3d6d-cbfb-4d0c-b147-8108a85d1915","year":2015},"citing_paper":{"arxiv_id":"2412.02244","last_updated":"2024-12-03T08:16:59Z","snapshot_observed_at":"2026-08-15T17:45:29.152307Z","submitted_at":"2024-12-03T08:16:59Z","title":"On Simplifying Large-Scale Spatial Vectors: Fast, Memory-Efficient, and Cost-Predictable k-means","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-11T23:48:11.185221Z"},"links":{"citing_paper":"/paper/2412.02244"},"observation_digest":"sha256:29bd5257340b171582a6bb6b52e9be3636dd3a713b070dfb8d606188c7643935","observation_id":"1a4f5d7d-3f36-458d-8b32-2009ca341b69","resolution":{"observed_at":"2026-08-11T23:48:11.959560Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-11T23:48:11.944278Z","title":"Kapus and C","venue":null,"work_id":"ce6966c0-fbec-4f6c-be9b-794b230b07fe","year":2019},"citing_paper":{"arxiv_id":"2412.02244","last_updated":"2024-12-03T08:16:59Z","snapshot_observed_at":"2026-08-15T17:45:29.152307Z","submitted_at":"2024-12-03T08:16:59Z","title":"On Simplifying Large-Scale Spatial Vectors: Fast, Memory-Efficient, and Cost-Predictable k-means","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-11T23:48:11.189176Z"},"links":{"citing_paper":"/paper/2412.02244"},"observation_digest":"sha256:a3079223ee14cc7d54f56d1e382fd0b8a327b44fdea8dbe0cf81c72874155ba4","observation_id":"dbd5bc2e-ce6a-4eeb-84de-75ff8f7549ec","resolution":{"observed_at":"2026-08-11T23:48:11.948196Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-11T23:48:11.933489Z","title":"Kleindessner, P","venue":null,"work_id":"ffdcc4f8-3535-49a0-8ceb-1d1d2d9b2d38","year":2019},"citing_paper":{"arxiv_id":"2412.02244","last_updated":"2024-12-03T08:16:59Z","snapshot_observed_at":"2026-08-15T17:45:29.152307Z","submitted_at":"2024-12-03T08:16:59Z","title":"On Simplifying Large-Scale Spatial Vectors: Fast, Memory-Efficient, and Cost-Predictable k-means","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-11T23:48:11.193004Z"},"links":{"citing_paper":"/paper/2412.02244"},"observation_digest":"sha256:f2de134e9ba964da42b17b651a61caed76009ca9ea3241fd4e095fd5e7ddedbc","observation_id":"07999f9b-2b13-41a6-8322-9b8bd9450762","resolution":{"observed_at":"2026-08-11T23:48:11.937313Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-11T23:48:11.922349Z","title":"Krulis and M","venue":null,"work_id":"a03406e2-4d30-47d3-939a-ccd65835f877","year":2020},"citing_paper":{"arxiv_id":"2412.02244","last_updated":"2024-12-03T08:16:59Z","snapshot_observed_at":"2026-08-15T17:45:29.152307Z","submitted_at":"2024-12-03T08:16:59Z","title":"On Simplifying Large-Scale Spatial Vectors: Fast, Memory-Efficient, and Cost-Predictable k-means","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-11T23:48:11.196550Z"},"links":{"citing_paper":"/paper/2412.02244"},"observation_digest":"sha256:8b8e5b884bdf7c1b7b9c8ce69aedfe86aa178cd332fa121678d1071aef69dc5c","observation_id":"5f612591-206c-4ed2-bf2d-0d51fac78ba7","resolution":{"observed_at":"2026-08-11T23:48:11.926529Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-11T23:48:11.910083Z","title":null,"venue":null,"work_id":"3c8f3b08-2a04-4c21-a403-5f5d286f2bf0","year":2020},"citing_paper":{"arxiv_id":"2412.02244","last_updated":"2024-12-03T08:16:59Z","snapshot_observed_at":"2026-08-15T17:45:29.152307Z","submitted_at":"2024-12-03T08:16:59Z","title":"On Simplifying Large-Scale Spatial Vectors: Fast, Memory-Efficient, and Cost-Predictable k-means","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-11T23:48:11.200288Z"},"links":{"citing_paper":"/paper/2412.02244"},"observation_digest":"sha256:75ae2a0cc9faeee79de9ad3ccdda8d9545b3dfa5e05604730652752bbb633c72","observation_id":"51ca90e9-7719-4433-900e-0403a7493b2a","resolution":{"observed_at":"2026-08-11T23:48:11.914184Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-11T23:48:11.898037Z","title":"Leyton-Brown, E","venue":null,"work_id":"13fcf742-72a6-4b33-ab4c-1104c504a854","year":2009},"citing_paper":{"arxiv_id":"2412.02244","last_updated":"2024-12-03T08:16:59Z","snapshot_observed_at":"2026-08-15T17:45:29.152307Z","submitted_at":"2024-12-03T08:16:59Z","title":"On Simplifying Large-Scale Spatial Vectors: Fast, Memory-Efficient, and Cost-Predictable k-means","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-11T23:48:11.203691Z"},"links":{"citing_paper":"/paper/2412.02244"},"observation_digest":"sha256:4e20fb71397a4b19ff6b403574b44244e13932b5ce2e6c50eac6a9609a0337af","observation_id":"1de3c449-e33e-47ec-ab81-8a145d2ef9f4","resolution":{"observed_at":"2026-08-11T23:48:11.902433Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-11T23:48:11.884978Z","title":null,"venue":null,"work_id":"eaf5b448-a0c6-475a-9778-74f4144a3ca6","year":2013},"citing_paper":{"arxiv_id":"2412.02244","last_updated":"2024-12-03T08:16:59Z","snapshot_observed_at":"2026-08-15T17:45:29.152307Z","submitted_at":"2024-12-03T08:16:59Z","title":"On Simplifying Large-Scale Spatial Vectors: Fast, Memory-Efficient, and Cost-Predictable k-means","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-11T23:48:11.207346Z"},"links":{"citing_paper":"/paper/2412.02244"},"observation_digest":"sha256:9f2c836689f9800d148fc0618c33308178d2a958a9f2de54f399cb67f8d7694b","observation_id":"91256f3c-ce1e-4d59-8c3d-b70ffca339a3","resolution":{"observed_at":"2026-08-11T23:48:11.888883Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-11T23:48:11.872291Z","title":null,"venue":null,"work_id":"eb67a2ac-5454-4267-8525-cac8148acd16","year":1982},"citing_paper":{"arxiv_id":"2412.02244","last_updated":"2024-12-03T08:16:59Z","snapshot_observed_at":"2026-08-15T17:45:29.152307Z","submitted_at":"2024-12-03T08:16:59Z","title":"On Simplifying Large-Scale Spatial Vectors: Fast, Memory-Efficient, and Cost-Predictable k-means","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-11T23:48:11.211276Z"},"links":{"citing_paper":"/paper/2412.02244"},"observation_digest":"sha256:2177e86d25a51cee871033baa4b6e1187146bd6d3fe4b34d2d37e41d00bc7522","observation_id":"c18de0b4-42ef-429d-9f97-9c677433f17c","resolution":{"observed_at":"2026-08-11T23:48:11.876709Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-11T23:48:11.859394Z","title":null,"venue":null,"work_id":"a21acd8b-732d-4f77-ac17-61e0012a44c4","year":2021},"citing_paper":{"arxiv_id":"2412.02244","last_updated":"2024-12-03T08:16:59Z","snapshot_observed_at":"2026-08-15T17:45:29.152307Z","submitted_at":"2024-12-03T08:16:59Z","title":"On Simplifying Large-Scale Spatial Vectors: Fast, Memory-Efficient, and Cost-Predictable k-means","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-11T23:48:11.215530Z"},"links":{"citing_paper":"/paper/2412.02244"},"observation_digest":"sha256:2c8c25abf66149174bbef102c6ce29163fb257efc6aaccde4cf59257d0932ce6","observation_id":"83055de6-a9a5-4b13-a6f9-1426f339bb3c","resolution":{"observed_at":"2026-08-11T23:48:11.863344Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-11T23:48:11.844001Z","title":"Mariam, A","venue":null,"work_id":"5101fb9b-3849-4fbf-8168-5ba15f020052","year":2020},"citing_paper":{"arxiv_id":"2412.02244","last_updated":"2024-12-03T08:16:59Z","snapshot_observed_at":"2026-08-15T17:45:29.152307Z","submitted_at":"2024-12-03T08:16:59Z","title":"On Simplifying Large-Scale Spatial Vectors: Fast, Memory-Efficient, and Cost-Predictable k-means","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-11T23:48:11.219373Z"},"links":{"citing_paper":"/paper/2412.02244"},"observation_digest":"sha256:868eaae3b63a24e4c7c9e25edccf2679852ef0e771fc032e3ab56d9b887c2593","observation_id":"9196c817-c6de-4f97-9e21-d528e29dac21","resolution":{"observed_at":"2026-08-11T23:48:11.849951Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-11T23:48:11.831618Z","title":"Maulud and A","venue":null,"work_id":"1e917f62-2b2a-415e-92f5-2ad462884310","year":2020},"citing_paper":{"arxiv_id":"2412.02244","last_updated":"2024-12-03T08:16:59Z","snapshot_observed_at":"2026-08-15T17:45:29.152307Z","submitted_at":"2024-12-03T08:16:59Z","title":"On Simplifying Large-Scale Spatial Vectors: Fast, Memory-Efficient, and Cost-Predictable k-means","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-11T23:48:11.223245Z"},"links":{"citing_paper":"/paper/2412.02244"},"observation_digest":"sha256:284c9404fc08a40b565f796724e97e43bfffdeb5530b2c9ac260525217d6a4bb","observation_id":"8c7b7fc6-1eaf-4dea-9d1e-f53b97d2ddfc","resolution":{"observed_at":"2026-08-11T23:48:11.835527Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-11T23:48:11.818663Z","title":null,"venue":null,"work_id":"e455e5c1-c0f5-4b0d-ba31-2ba997f4d9ff","year":2021},"citing_paper":{"arxiv_id":"2412.02244","last_updated":"2024-12-03T08:16:59Z","snapshot_observed_at":"2026-08-15T17:45:29.152307Z","submitted_at":"2024-12-03T08:16:59Z","title":"On Simplifying Large-Scale Spatial Vectors: Fast, Memory-Efficient, and Cost-Predictable k-means","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-11T23:48:11.226955Z"},"links":{"citing_paper":"/paper/2412.02244"},"observation_digest":"sha256:bfc62c7730569cadd9d48a0f4ace1783024ea21b00ce3bc598ceaeff6e2e83c7","observation_id":"5d2e5c3b-01ea-4f37-995a-ff54216d5ec0","resolution":{"observed_at":"2026-08-11T23:48:11.822753Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-11T23:48:11.806758Z","title":null,"venue":null,"work_id":"18486e5c-5284-4a1d-b690-fdd9efa704f6","year":2000},"citing_paper":{"arxiv_id":"2412.02244","last_updated":"2024-12-03T08:16:59Z","snapshot_observed_at":"2026-08-15T17:45:29.152307Z","submitted_at":"2024-12-03T08:16:59Z","title":"On Simplifying Large-Scale Spatial Vectors: Fast, Memory-Efficient, and Cost-Predictable k-means","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-11T23:48:11.230959Z"},"links":{"citing_paper":"/paper/2412.02244"},"observation_digest":"sha256:855348bd98e9c1e73f99f3f4177f4f5032c7dbe0bc66797e740676bd8099a23e","observation_id":"ff911692-04dc-4049-add1-a531721fb042","resolution":{"observed_at":"2026-08-11T23:48:11.810471Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-11T23:48:11.796034Z","title":"Newling and F","venue":null,"work_id":"0872581f-b473-482b-94ac-090a20f36acc","year":2016},"citing_paper":{"arxiv_id":"2412.02244","last_updated":"2024-12-03T08:16:59Z","snapshot_observed_at":"2026-08-15T17:45:29.152307Z","submitted_at":"2024-12-03T08:16:59Z","title":"On Simplifying Large-Scale Spatial Vectors: Fast, Memory-Efficient, and Cost-Predictable k-means","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-11T23:48:11.234736Z"},"links":{"citing_paper":"/paper/2412.02244"},"observation_digest":"sha256:6c314760f36ba940ecf53bd2c635c878c6d9c695c438b3642a87ab12aee1944d","observation_id":"9d3938d1-2d9b-4ee0-898a-1f29c2d27e26","resolution":{"observed_at":"2026-08-11T23:48:11.799772Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-11T23:48:11.783844Z","title":"Newling and F","venue":null,"work_id":"79148632-8f2e-4d7e-9e70-10713ec5075d","year":2017},"citing_paper":{"arxiv_id":"2412.02244","last_updated":"2024-12-03T08:16:59Z","snapshot_observed_at":"2026-08-15T17:45:29.152307Z","submitted_at":"2024-12-03T08:16:59Z","title":"On Simplifying Large-Scale Spatial Vectors: Fast, Memory-Efficient, and Cost-Predictable k-means","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-11T23:48:11.238821Z"},"links":{"citing_paper":"/paper/2412.02244"},"observation_digest":"sha256:9381cec7936ffe4c14cda419af1e9ef692e70c8e180a6dc2b5ee2046db419130","observation_id":"78621d4f-cb7b-45a4-9d21-6a4ec155e664","resolution":{"observed_at":"2026-08-11T23:48:11.788619Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-11T23:48:11.772020Z","title":null,"venue":null,"work_id":"f84419db-f62e-4464-92ea-12747a858168","year":1989},"citing_paper":{"arxiv_id":"2412.02244","last_updated":"2024-12-03T08:16:59Z","snapshot_observed_at":"2026-08-15T17:45:29.152307Z","submitted_at":"2024-12-03T08:16:59Z","title":"On Simplifying Large-Scale Spatial Vectors: Fast, Memory-Efficient, and Cost-Predictable k-means","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-11T23:48:11.242635Z"},"links":{"citing_paper":"/paper/2412.02244"},"observation_digest":"sha256:d72bb92bc4bf509b2730c3ff9fc4ef6d2e6abb4e9e77815897bcb0efcf098423","observation_id":"e4466e86-5d24-4a9d-afc0-cc9ada9fc709","resolution":{"observed_at":"2026-08-11T23:48:11.775958Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-11T23:48:11.761017Z","title":"Pedregosa, G","venue":null,"work_id":"ca9fcad6-ade5-4036-a4e6-68d319cd8487","year":2011},"citing_paper":{"arxiv_id":"2412.02244","last_updated":"2024-12-03T08:16:59Z","snapshot_observed_at":"2026-08-15T17:45:29.152307Z","submitted_at":"2024-12-03T08:16:59Z","title":"On Simplifying Large-Scale Spatial Vectors: Fast, Memory-Efficient, and Cost-Predictable k-means","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-11T23:48:11.246563Z"},"links":{"citing_paper":"/paper/2412.02244"},"observation_digest":"sha256:908292147cf963f93f60f37935c13daef6a27a9bf2b158c71edd57bda35c1ea0","observation_id":"11dfd3c3-ac5d-4098-aa03-025da4777717","resolution":{"observed_at":"2026-08-11T23:48:11.764800Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-11T23:48:11.750532Z","title":null,"venue":null,"work_id":"89ad4398-93f7-4061-a949-53262c87a27a","year":2017},"citing_paper":{"arxiv_id":"2412.02244","last_updated":"2024-12-03T08:16:59Z","snapshot_observed_at":"2026-08-15T17:45:29.152307Z","submitted_at":"2024-12-03T08:16:59Z","title":"On Simplifying Large-Scale Spatial Vectors: Fast, Memory-Efficient, and Cost-Predictable k-means","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-11T23:48:11.250060Z"},"links":{"citing_paper":"/paper/2412.02244"},"observation_digest":"sha256:9c1dd0be346676f0cd35f96de66a4fc934292826c3ec16c9e47207a05bc26d02","observation_id":"69af638b-384e-4f8e-a232-a3ec7a8eafaa","resolution":{"observed_at":"2026-08-11T23:48:11.754294Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-11T23:48:11.739079Z","title":null,"venue":null,"work_id":"48812f73-de32-4cbd-a205-5204b9be21be","year":2017},"citing_paper":{"arxiv_id":"2412.02244","last_updated":"2024-12-03T08:16:59Z","snapshot_observed_at":"2026-08-15T17:45:29.152307Z","submitted_at":"2024-12-03T08:16:59Z","title":"On Simplifying Large-Scale Spatial Vectors: Fast, Memory-Efficient, and Cost-Predictable k-means","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-11T23:48:11.253730Z"},"links":{"citing_paper":"/paper/2412.02244"},"observation_digest":"sha256:1f606c4f08d182bd70cef4076a2db80420fe3a73bb8c75a15e60d801aa7d3d94","observation_id":"13924eeb-065a-4be5-b962-002096c39d8a","resolution":{"observed_at":"2026-08-11T23:48:11.742876Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-11T23:48:11.728320Z","title":"Roynard, J","venue":null,"work_id":"f1b00960-aca9-4bd5-9bbe-0a76afcb387d","year":2018},"citing_paper":{"arxiv_id":"2412.02244","last_updated":"2024-12-03T08:16:59Z","snapshot_observed_at":"2026-08-15T17:45:29.152307Z","submitted_at":"2024-12-03T08:16:59Z","title":"On Simplifying Large-Scale Spatial Vectors: Fast, Memory-Efficient, and Cost-Predictable k-means","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-11T23:48:11.257344Z"},"links":{"citing_paper":"/paper/2412.02244"},"observation_digest":"sha256:91d43d53bcd0d14647039c310e435fa76f9c30bc9fa0eacc8c90bc8ac98202b3","observation_id":"6be5a3fd-0b82-458a-a52b-cdc9dfd4ceab","resolution":{"observed_at":"2026-08-11T23:48:11.732173Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-11T23:48:11.717195Z","title":"Ry ˇsav´y and G","venue":null,"work_id":"2d91255e-4b4f-4585-a78f-02f00a3ae464","year":2016},"citing_paper":{"arxiv_id":"2412.02244","last_updated":"2024-12-03T08:16:59Z","snapshot_observed_at":"2026-08-15T17:45:29.152307Z","submitted_at":"2024-12-03T08:16:59Z","title":"On Simplifying Large-Scale Spatial Vectors: Fast, Memory-Efficient, and Cost-Predictable k-means","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-11T23:48:11.261147Z"},"links":{"citing_paper":"/paper/2412.02244"},"observation_digest":"sha256:38fa0f613704b88bb1d80653ad5154aa4c52a13518208feb3a0336eeda3403a9","observation_id":"e57034c9-4759-4fe1-9fa3-be7f23cf6579","resolution":{"observed_at":"2026-08-11T23:48:11.721195Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-11T23:48:11.705853Z","title":null,"venue":null,"work_id":"7c52c364-cd9f-4e05-801e-3a2de4b0f147","year":2020},"citing_paper":{"arxiv_id":"2412.02244","last_updated":"2024-12-03T08:16:59Z","snapshot_observed_at":"2026-08-15T17:45:29.152307Z","submitted_at":"2024-12-03T08:16:59Z","title":"On Simplifying Large-Scale Spatial Vectors: Fast, Memory-Efficient, and Cost-Predictable k-means","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-11T23:48:11.264533Z"},"links":{"citing_paper":"/paper/2412.02244"},"observation_digest":"sha256:ba7247ac81c8a0364a4b7c6471bb8be75b288e914ae9c9041d06dc5b5e23e745","observation_id":"7a07e1d7-c7ea-4846-b537-6222db8e046d","resolution":{"observed_at":"2026-08-11T23:48:11.709744Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-11T23:48:11.694516Z","title":null,"venue":null,"work_id":"bf2cbd19-5e91-4b98-a7bf-e19aace9dc84","year":2012},"citing_paper":{"arxiv_id":"2412.02244","last_updated":"2024-12-03T08:16:59Z","snapshot_observed_at":"2026-08-15T17:45:29.152307Z","submitted_at":"2024-12-03T08:16:59Z","title":"On Simplifying Large-Scale Spatial Vectors: Fast, Memory-Efficient, and Cost-Predictable k-means","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-11T23:48:11.268195Z"},"links":{"citing_paper":"/paper/2412.02244"},"observation_digest":"sha256:788eaf29fae5e9315e4bfc0f69ff9ebac6e158f9b4e5282172951d0cde342b3c","observation_id":"92fd9ee1-eb9a-4f88-834b-f6566a123a53","resolution":{"observed_at":"2026-08-11T23:48:11.698607Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-11T23:48:11.681940Z","title":null,"venue":null,"work_id":"f32e75cd-d185-4c0e-ae0c-0032afc73571","year":2019},"citing_paper":{"arxiv_id":"2412.02244","last_updated":"2024-12-03T08:16:59Z","snapshot_observed_at":"2026-08-15T17:45:29.152307Z","submitted_at":"2024-12-03T08:16:59Z","title":"On Simplifying Large-Scale Spatial Vectors: Fast, Memory-Efficient, and Cost-Predictable k-means","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-11T23:48:11.271837Z"},"links":{"citing_paper":"/paper/2412.02244"},"observation_digest":"sha256:15f523def9560c215f442a0cbf63a54f2f27de47a586c9a4a78de9faa1f35e5b","observation_id":"4c869fec-42a3-44d0-915b-df5b0e005815","resolution":{"observed_at":"2026-08-11T23:48:11.686318Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-11T23:48:11.666195Z","title":null,"venue":null,"work_id":"1103f5de-bf57-4836-9bde-1143e83dc40a","year":2010},"citing_paper":{"arxiv_id":"2412.02244","last_updated":"2024-12-03T08:16:59Z","snapshot_observed_at":"2026-08-15T17:45:29.152307Z","submitted_at":"2024-12-03T08:16:59Z","title":"On Simplifying Large-Scale Spatial Vectors: Fast, Memory-Efficient, and Cost-Predictable k-means","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-11T23:48:11.276005Z"},"links":{"citing_paper":"/paper/2412.02244"},"observation_digest":"sha256:d69bb118c6b9d56cab688ee71fe56ffb480d38be0c3d228fe5fe42be2d6eaa5b","observation_id":"2d52ef0c-eac0-4981-923b-525e6af9836a","resolution":{"observed_at":"2026-08-11T23:48:11.670167Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-11T23:48:11.651939Z","title":"Tuero and M","venue":null,"work_id":"a1974383-8b96-46d5-9581-51f1ba54045d","year":2021},"citing_paper":{"arxiv_id":"2412.02244","last_updated":"2024-12-03T08:16:59Z","snapshot_observed_at":"2026-08-15T17:45:29.152307Z","submitted_at":"2024-12-03T08:16:59Z","title":"On Simplifying Large-Scale Spatial Vectors: Fast, Memory-Efficient, and Cost-Predictable k-means","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-11T23:48:11.279636Z"},"links":{"citing_paper":"/paper/2412.02244"},"observation_digest":"sha256:971707d876556471318a4f373d6a91eebcdb8eab51e2bdf0069bfe02ee5154b9","observation_id":"53c4ef6f-3dba-498f-98c3-6479fb9995e1","resolution":{"observed_at":"2026-08-11T23:48:11.656644Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-11T23:48:11.640015Z","title":"Verbauwhede, C","venue":null,"work_id":"b436337f-49b8-4f74-a405-9371a09354f7","year":1994},"citing_paper":{"arxiv_id":"2412.02244","last_updated":"2024-12-03T08:16:59Z","snapshot_observed_at":"2026-08-15T17:45:29.152307Z","submitted_at":"2024-12-03T08:16:59Z","title":"On Simplifying Large-Scale Spatial Vectors: Fast, Memory-Efficient, and Cost-Predictable k-means","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-11T23:48:11.283389Z"},"links":{"citing_paper":"/paper/2412.02244"},"observation_digest":"sha256:e676431871e7e282d78be475891fb17d3903ae3bf0d688d03ef59879c112bd23","observation_id":"d92e88bc-2853-406c-b572-476a1881cedd","resolution":{"observed_at":"2026-08-11T23:48:11.644007Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-11T23:48:11.627604Z","title":null,"venue":null,"work_id":"44bcb64c-581d-4ed5-ab41-cfc2f0de1540","year":2021},"citing_paper":{"arxiv_id":"2412.02244","last_updated":"2024-12-03T08:16:59Z","snapshot_observed_at":"2026-08-15T17:45:29.152307Z","submitted_at":"2024-12-03T08:16:59Z","title":"On Simplifying Large-Scale Spatial Vectors: Fast, Memory-Efficient, and Cost-Predictable k-means","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-11T23:48:11.286976Z"},"links":{"citing_paper":"/paper/2412.02244"},"observation_digest":"sha256:4b01b9cbefe71df9cf40960a216c0df07fb0333426806cd8a70541abd306a406","observation_id":"83fc091c-34fe-4345-992f-00c69ccf73d1","resolution":{"observed_at":"2026-08-11T23:48:11.632222Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-11T23:48:11.616401Z","title":null,"venue":null,"work_id":"8a42b76d-1697-4046-830c-4a3456e7e77f","year":2022},"citing_paper":{"arxiv_id":"2412.02244","last_updated":"2024-12-03T08:16:59Z","snapshot_observed_at":"2026-08-15T17:45:29.152307Z","submitted_at":"2024-12-03T08:16:59Z","title":"On Simplifying Large-Scale Spatial Vectors: Fast, Memory-Efficient, and Cost-Predictable k-means","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-11T23:48:11.291018Z"},"links":{"citing_paper":"/paper/2412.02244"},"observation_digest":"sha256:abc781eddefe151ef42704b721beb56ba325c86a976e7755fb807a95cae834f8","observation_id":"875e884c-3c6d-46e8-b0df-f94de8e93020","resolution":{"observed_at":"2026-08-11T23:48:11.620169Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-11T23:48:11.604163Z","title":null,"venue":null,"work_id":"e6712ef6-2fcd-41d0-8aaa-422d1bbe2755","year":2021},"citing_paper":{"arxiv_id":"2412.02244","last_updated":"2024-12-03T08:16:59Z","snapshot_observed_at":"2026-08-15T17:45:29.152307Z","submitted_at":"2024-12-03T08:16:59Z","title":"On Simplifying Large-Scale Spatial Vectors: Fast, Memory-Efficient, and Cost-Predictable k-means","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-11T23:48:11.294721Z"},"links":{"citing_paper":"/paper/2412.02244"},"observation_digest":"sha256:1041050a412426b3f691cd29e83830b127f4f0a614750e336adf8559649e13be","observation_id":"ca5fbd26-d14c-433f-b720-c79ed4cc92de","resolution":{"observed_at":"2026-08-11T23:48:11.608031Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2301.00493","last_updated":"2023-01-02T00:36:22Z","snapshot_observed_at":"2026-08-12T21:55:36.747659Z","submitted_at":"2023-01-02T00:36:22Z","title":"Argoverse 2: Next Generation Datasets for Self-Driving Perception and Forecasting","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2301.00493","snapshot_observed_at":"2026-08-11T23:48:11.298633Z","title":"Wilson, W","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.02244","last_updated":"2024-12-03T08:16:59Z","snapshot_observed_at":"2026-08-15T17:45:29.152307Z","submitted_at":"2024-12-03T08:16:59Z","title":"On Simplifying Large-Scale Spatial Vectors: Fast, Memory-Efficient, and Cost-Predictable k-means","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-11T23:48:11.298633Z"},"links":{"cited_paper":"/paper/2301.00493","citing_paper":"/paper/2412.02244"},"observation_digest":"sha256:c1d71648f620828d210457c5b4ea5de4d8fb8f007fcba2fbe88c998efa1f0a4b","observation_id":"6fab701e-d9fd-416f-89ab-0d532b2e0c50","resolution":{"observed_at":"2026-08-11T23:48:11.298633Z","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-11T23:48:11.592442Z","title":"Wortsman, G","venue":null,"work_id":"24de8d0c-fdeb-4549-971d-53effb777b0d","year":2022},"citing_paper":{"arxiv_id":"2412.02244","last_updated":"2024-12-03T08:16:59Z","snapshot_observed_at":"2026-08-15T17:45:29.152307Z","submitted_at":"2024-12-03T08:16:59Z","title":"On Simplifying Large-Scale Spatial Vectors: Fast, Memory-Efficient, and Cost-Predictable k-means","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-11T23:48:11.302922Z"},"links":{"citing_paper":"/paper/2412.02244"},"observation_digest":"sha256:a9ed1057afda3286aaf6a70274bbad590f82c962b1f34d71547248873f7ae7ab","observation_id":"104ed3bb-9935-46af-9b16-6beca6d21267","resolution":{"observed_at":"2026-08-11T23:48:11.596485Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-11T23:48:11.579158Z","title":null,"venue":null,"work_id":"cf38c47a-bcd2-426c-b5ce-055cb7dbc08d","year":2020},"citing_paper":{"arxiv_id":"2412.02244","last_updated":"2024-12-03T08:16:59Z","snapshot_observed_at":"2026-08-15T17:45:29.152307Z","submitted_at":"2024-12-03T08:16:59Z","title":"On Simplifying Large-Scale Spatial Vectors: Fast, Memory-Efficient, and Cost-Predictable k-means","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-11T23:48:11.306733Z"},"links":{"citing_paper":"/paper/2412.02244"},"observation_digest":"sha256:3a9f1f4e75c6f8bd77413b76d63b0909b9ffb22e41c2125f7d26a4ec47345555","observation_id":"5afa534a-7c07-43c4-ad82-b357563076c2","resolution":{"observed_at":"2026-08-11T23:48:11.583684Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-11T23:48:11.566299Z","title":"Xu and G","venue":null,"work_id":"f2f66d40-2349-45d5-aad3-1f7176816a09","year":2020},"citing_paper":{"arxiv_id":"2412.02244","last_updated":"2024-12-03T08:16:59Z","snapshot_observed_at":"2026-08-15T17:45:29.152307Z","submitted_at":"2024-12-03T08:16:59Z","title":"On Simplifying Large-Scale Spatial Vectors: Fast, Memory-Efficient, and Cost-Predictable k-means","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-11T23:48:11.310612Z"},"links":{"citing_paper":"/paper/2412.02244"},"observation_digest":"sha256:2b1e287b198e09290005bba972e89e6993e26bb40ef4fbb1dbfc36f578cca726","observation_id":"95952345-763e-40d3-9a02-1b5f4f25ad11","resolution":{"observed_at":"2026-08-11T23:48:11.570568Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-11T23:48:11.554195Z","title":null,"venue":null,"work_id":"90262cc4-af8f-4857-b825-384124d0875c","year":2020},"citing_paper":{"arxiv_id":"2412.02244","last_updated":"2024-12-03T08:16:59Z","snapshot_observed_at":"2026-08-15T17:45:29.152307Z","submitted_at":"2024-12-03T08:16:59Z","title":"On Simplifying Large-Scale Spatial Vectors: Fast, Memory-Efficient, and Cost-Predictable k-means","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-11T23:48:11.314233Z"},"links":{"citing_paper":"/paper/2412.02244"},"observation_digest":"sha256:6b93912ed04cba303c293e80b723b3365d5f337b2d548d58cdc7ee969f220396","observation_id":"ac7f0d17-a19b-4575-9d5f-41ea7a29dd25","resolution":{"observed_at":"2026-08-11T23:48:11.558338Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-11T23:48:11.541438Z","title":null,"venue":null,"work_id":"6e8cfc85-e2ee-4f8e-8ae5-b8887f8bd4b0","year":2020},"citing_paper":{"arxiv_id":"2412.02244","last_updated":"2024-12-03T08:16:59Z","snapshot_observed_at":"2026-08-15T17:45:29.152307Z","submitted_at":"2024-12-03T08:16:59Z","title":"On Simplifying Large-Scale Spatial Vectors: Fast, Memory-Efficient, and Cost-Predictable k-means","version":1},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-11T23:48:11.317947Z"},"links":{"citing_paper":"/paper/2412.02244"},"observation_digest":"sha256:e86ac429f2ca88e562cd21a6b9230c407d8a776ad20564d468570ca657b15260","observation_id":"71649ea4-c65c-426b-82ff-690c28ce412b","resolution":{"observed_at":"2026-08-11T23:48:11.545515Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-11T23:48:11.528809Z","title":null,"venue":null,"work_id":"b70a34e4-036f-4910-8bcb-6427c6ed8557","year":2010},"citing_paper":{"arxiv_id":"2412.02244","last_updated":"2024-12-03T08:16:59Z","snapshot_observed_at":"2026-08-15T17:45:29.152307Z","submitted_at":"2024-12-03T08:16:59Z","title":"On Simplifying Large-Scale Spatial Vectors: Fast, Memory-Efficient, and Cost-Predictable k-means","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-11T23:48:11.322081Z"},"links":{"citing_paper":"/paper/2412.02244"},"observation_digest":"sha256:d2132b1f1bdd2f2fb0ae6e66b5fa80282c8e3164874f56bf9e2d00e407283ce9","observation_id":"3f0388bb-05e1-4478-b585-106801e5bc37","resolution":{"observed_at":"2026-08-11T23:48:11.532932Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2412.02244","last_updated":"2024-12-03T08:16:59Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-15T17:45:29.152307Z","submitted_at":"2024-12-03T08:16:59Z","title":"On Simplifying Large-Scale Spatial Vectors: Fast, Memory-Efficient, and Cost-Predictable k-means"},"reference_resolution":{"displayed":68,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":35,"verified_exact":1,"verified_fuzzy":31},"total_outbound_references":68},"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-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"thesis":"As of 22 August 2026, this Paper Citation Record lists 68 of 68 outbound references and 0 inbound Pith citation observations for arXiv:2412.02244."}