{"as_of":"2026-08-22T08:55:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2a57833a6ca3af92b81625de4942702fc748ed59a7c9cd62517e3679e7c47cf5","coverage":[{"denominator":42,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":42,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T13:54:36.483348Z","state":"measured"},{"denominator":42,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":42,"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/2502.07081/citation-record","integrity":"/paper/2502.07081/integrity","json":"/paper/2502.07081/citation-record.json","paper":"/paper/2502.07081"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T13:54:36.308464Z","title":"Some methods for classification and analysis of multivariate observations","venue":null,"work_id":null,"year":1967},"citing_paper":{"arxiv_id":"2502.07081","last_updated":"2025-02-15T20:57:13Z","snapshot_observed_at":"2026-08-09T14:46:40.705209Z","submitted_at":"2025-02-10T22:19:08Z","title":"Fast Clustering of Categorical Big Data","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-08T13:54:36.308464Z"},"links":{"citing_paper":"/paper/2502.07081"},"observation_digest":"sha256:258266acf9c66520bcc524dc1f04d273ecdc0b1fcb295a995fa51a5eabb72505","observation_id":"5fcc1d63-a273-47d2-9083-62e59027756e","resolution":{"observed_at":"2026-08-08T13:54:36.308464Z","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-08T13:54:38.150894Z","title":"A fast clustering algorithm to cluster very large categorical data sets in data mining","venue":null,"work_id":"035e8af8-166b-412f-842a-8ea88f02f5f3","year":1997},"citing_paper":{"arxiv_id":"2502.07081","last_updated":"2025-02-15T20:57:13Z","snapshot_observed_at":"2026-08-09T14:46:40.705209Z","submitted_at":"2025-02-10T22:19:08Z","title":"Fast Clustering of Categorical Big Data","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-08T13:54:36.313917Z"},"links":{"citing_paper":"/paper/2502.07081"},"observation_digest":"sha256:1b20c2bfcf3c06b53bb9ba68fed18fe0347d92046a6860e87c414b9a9cdb8d7c","observation_id":"dc50f3f4-7d0f-4546-8af4-bf5012607906","resolution":{"observed_at":"2026-08-08T13:54:38.155102Z","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-08T13:54:38.138141Z","title":"Extensions to the k-means algorithm for clustering large data sets with categorical values","venue":null,"work_id":"2f12a62e-ee8b-43b8-ab6a-81655d4482e9","year":1998},"citing_paper":{"arxiv_id":"2502.07081","last_updated":"2025-02-15T20:57:13Z","snapshot_observed_at":"2026-08-09T14:46:40.705209Z","submitted_at":"2025-02-10T22:19:08Z","title":"Fast Clustering of Categorical Big Data","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-08T13:54:36.318590Z"},"links":{"citing_paper":"/paper/2502.07081"},"observation_digest":"sha256:8eb00908410dde8a02ff18cb048b91d54d62c3439d07182a3edcace5b14f568d","observation_id":"536c3873-d200-461e-974b-82be74aa4c07","resolution":{"observed_at":"2026-08-08T13:54:38.142059Z","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-08T13:54:38.125608Z","title":"A new initialization method for categorical data clustering","venue":null,"work_id":"68fa4066-bced-46d2-a9f9-7adf6d34c3a9","year":2009},"citing_paper":{"arxiv_id":"2502.07081","last_updated":"2025-02-15T20:57:13Z","snapshot_observed_at":"2026-08-09T14:46:40.705209Z","submitted_at":"2025-02-10T22:19:08Z","title":"Fast Clustering of Categorical Big Data","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-08T13:54:36.323432Z"},"links":{"citing_paper":"/paper/2502.07081"},"observation_digest":"sha256:3465f26654ee8f9e718220549d6daeda254f7566b09e0763b0193bef136a3984","observation_id":"6cc002f0-db55-4629-84d3-874e0a53d760","resolution":{"observed_at":"2026-08-08T13:54:38.129535Z","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-08T13:54:38.112998Z","title":"Cluster center initialization algorithm for k-modes clustering","venue":null,"work_id":"101d80e2-1651-4528-b81f-d6fee5048458","year":2013},"citing_paper":{"arxiv_id":"2502.07081","last_updated":"2025-02-15T20:57:13Z","snapshot_observed_at":"2026-08-09T14:46:40.705209Z","submitted_at":"2025-02-10T22:19:08Z","title":"Fast Clustering of Categorical Big Data","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-08T13:54:36.327879Z"},"links":{"citing_paper":"/paper/2502.07081"},"observation_digest":"sha256:430fcbc2da542646ac97ad5a3689cb903a34dcdda227f28752dd4a2e723854e3","observation_id":"b3304310-8938-485f-b1a3-aed270b9df7c","resolution":{"observed_at":"2026-08-08T13:54:38.116924Z","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-08T13:54:38.100947Z","title":"Fast global k-means clustering based on local geometrical information","venue":null,"work_id":"6426022f-9956-41d9-adfd-56a35d76ec06","year":2013},"citing_paper":{"arxiv_id":"2502.07081","last_updated":"2025-02-15T20:57:13Z","snapshot_observed_at":"2026-08-09T14:46:40.705209Z","submitted_at":"2025-02-10T22:19:08Z","title":"Fast Clustering of Categorical Big Data","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-08T13:54:36.332506Z"},"links":{"citing_paper":"/paper/2502.07081"},"observation_digest":"sha256:d5659e597bce9d4d51a730d733fb1caa30dbb6cd7c2dc3a46deca036d094e153","observation_id":"fd8553ef-cc1a-451d-b009-5f63ea3c665b","resolution":{"observed_at":"2026-08-08T13:54:38.104820Z","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-08T13:54:38.088448Z","title":"An iterative initial-points refinement algorithm for categorical data clustering","venue":null,"work_id":"79416599-51fa-4ac7-b09a-be650190d05e","year":2002},"citing_paper":{"arxiv_id":"2502.07081","last_updated":"2025-02-15T20:57:13Z","snapshot_observed_at":"2026-08-09T14:46:40.705209Z","submitted_at":"2025-02-10T22:19:08Z","title":"Fast Clustering of Categorical Big Data","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-08T13:54:36.337506Z"},"links":{"citing_paper":"/paper/2502.07081"},"observation_digest":"sha256:304de0b95340b1a61dfeefcb57f288c7defc72cc41c41de8fcdbdaf57d4f3d10","observation_id":"e6ddd945-dabc-4988-a332-d0f97b394400","resolution":{"observed_at":"2026-08-08T13:54:38.092581Z","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-08T13:54:38.075266Z","title":"Refining initial points for k-means clustering","venue":null,"work_id":"7f3da145-ad7e-4b17-b11b-ce4cd467e783","year":1998},"citing_paper":{"arxiv_id":"2502.07081","last_updated":"2025-02-15T20:57:13Z","snapshot_observed_at":"2026-08-09T14:46:40.705209Z","submitted_at":"2025-02-10T22:19:08Z","title":"Fast Clustering of Categorical Big Data","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-08T13:54:36.341774Z"},"links":{"citing_paper":"/paper/2502.07081"},"observation_digest":"sha256:34dae40b7c17e396778cabccc1a2b0a1754f56d054c1fd17285743168c817a29","observation_id":"82f52652-c747-4a9b-a2dc-c9c800c0de41","resolution":{"observed_at":"2026-08-08T13:54:38.079473Z","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-08T13:54:38.061974Z","title":"A new initialization method for clustering categorical data","venue":null,"work_id":"d1830a3b-98e4-4871-89d0-f1bd82f8f9af","year":2007},"citing_paper":{"arxiv_id":"2502.07081","last_updated":"2025-02-15T20:57:13Z","snapshot_observed_at":"2026-08-09T14:46:40.705209Z","submitted_at":"2025-02-10T22:19:08Z","title":"Fast Clustering of Categorical Big Data","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-08T13:54:36.345980Z"},"links":{"citing_paper":"/paper/2502.07081"},"observation_digest":"sha256:c641135c141691401d55b9cb2b3a0ce7128cbc755baf25c84fb40e656bbf6027","observation_id":"f9e5f522-a001-4cea-9923-869625758ea8","resolution":{"observed_at":"2026-08-08T13:54:38.066263Z","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-08T13:54:38.046662Z","title":"An initialization method to simultaneously find initial cluster centers and the number of clusters for clustering categorical data","venue":null,"work_id":"c82cdc1d-a123-4d0a-b645-36bb3f34d7bf","year":2011},"citing_paper":{"arxiv_id":"2502.07081","last_updated":"2025-02-15T20:57:13Z","snapshot_observed_at":"2026-08-09T14:46:40.705209Z","submitted_at":"2025-02-10T22:19:08Z","title":"Fast Clustering of Categorical Big Data","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-08T13:54:36.350206Z"},"links":{"citing_paper":"/paper/2502.07081"},"observation_digest":"sha256:219c3d3fa5f227fb6365fc5dd3541ace1b453ff06c1594ee7fb18fd9888e9e9d","observation_id":"26135ea7-cc15-4bb8-90d3-00cea97ffaf1","resolution":{"observed_at":"2026-08-08T13:54:38.051092Z","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-08T13:54:38.032697Z","title":"A global k-modes algorithm for clustering categorical data","venue":null,"work_id":"dda0c11a-6bff-48c6-92b2-e326cd670216","year":2012},"citing_paper":{"arxiv_id":"2502.07081","last_updated":"2025-02-15T20:57:13Z","snapshot_observed_at":"2026-08-09T14:46:40.705209Z","submitted_at":"2025-02-10T22:19:08Z","title":"Fast Clustering of Categorical Big Data","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-08T13:54:36.354106Z"},"links":{"citing_paper":"/paper/2502.07081"},"observation_digest":"sha256:7c02123ceaab095abf8792d5574842c72c772dc81ba5664c8467b51777545d2a","observation_id":"96e25cb4-6659-4b8a-8750-cbe6defc29a5","resolution":{"observed_at":"2026-08-08T13:54:38.037186Z","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-08T13:54:38.018426Z","title":"Initialization of k-modes clustering using outlier detection techniques","venue":null,"work_id":"b7f836e8-5412-4139-a048-4f569f567894","year":2016},"citing_paper":{"arxiv_id":"2502.07081","last_updated":"2025-02-15T20:57:13Z","snapshot_observed_at":"2026-08-09T14:46:40.705209Z","submitted_at":"2025-02-10T22:19:08Z","title":"Fast Clustering of Categorical Big Data","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-08T13:54:36.358123Z"},"links":{"citing_paper":"/paper/2502.07081"},"observation_digest":"sha256:6a7ed7c112204bd4a8a95706742d698996c25fd20330d82fc2484eec79a556c0","observation_id":"7941b500-ae15-42c5-9254-267d914ebc0f","resolution":{"observed_at":"2026-08-08T13:54:38.022928Z","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-08T13:54:38.004526Z","title":"UCI machine learning repository, 2017","venue":null,"work_id":"bf5bde61-7568-43dd-b7bf-65f02e2e60d1","year":2017},"citing_paper":{"arxiv_id":"2502.07081","last_updated":"2025-02-15T20:57:13Z","snapshot_observed_at":"2026-08-09T14:46:40.705209Z","submitted_at":"2025-02-10T22:19:08Z","title":"Fast Clustering of Categorical Big Data","version":2},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-08T13:54:36.361785Z"},"links":{"citing_paper":"/paper/2502.07081"},"observation_digest":"sha256:9b6148c8efbf78c061b82f9b4e159da5d6c51594e6234918d132082e26f5559a","observation_id":"59a7b887-f653-40ca-87f9-c0beb693c85e","resolution":{"observed_at":"2026-08-08T13:54:38.008592Z","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-08T13:54:37.991369Z","title":"An evaluation of statistical approaches to text categorization","venue":null,"work_id":"9d061e35-cc26-435e-993e-77f5f8c0ad82","year":1999},"citing_paper":{"arxiv_id":"2502.07081","last_updated":"2025-02-15T20:57:13Z","snapshot_observed_at":"2026-08-09T14:46:40.705209Z","submitted_at":"2025-02-10T22:19:08Z","title":"Fast Clustering of Categorical Big Data","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-08T13:54:36.365476Z"},"links":{"citing_paper":"/paper/2502.07081"},"observation_digest":"sha256:77f19dbfb237df43a0b14d8fc5556cc5e8c67477f4267ff66c04dc062e7708c6","observation_id":"d632e1bd-f54b-4e68-ac84-e876a9b7f2eb","resolution":{"observed_at":"2026-08-08T13:54:37.995344Z","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-08T13:54:37.976857Z","title":"Cluster analysis for applications accademic press","venue":null,"work_id":"63a6fabb-bbec-4c59-9725-9ade50570dbc","year":1973},"citing_paper":{"arxiv_id":"2502.07081","last_updated":"2025-02-15T20:57:13Z","snapshot_observed_at":"2026-08-09T14:46:40.705209Z","submitted_at":"2025-02-10T22:19:08Z","title":"Fast Clustering of Categorical Big Data","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-08T13:54:36.369130Z"},"links":{"citing_paper":"/paper/2502.07081"},"observation_digest":"sha256:15eaff78fb62a1687ddad7ecf5658a41c673991cf18da36845cf2327a6f2fb65","observation_id":"04ec8664-f441-48b4-adf3-c656ba6cdde4","resolution":{"observed_at":"2026-08-08T13:54:37.981619Z","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-08T13:54:37.962445Z","title":"A comparison of document clustering techniques","venue":null,"work_id":"4db623f2-270b-49b8-a82e-7088f9438716","year":2000},"citing_paper":{"arxiv_id":"2502.07081","last_updated":"2025-02-15T20:57:13Z","snapshot_observed_at":"2026-08-09T14:46:40.705209Z","submitted_at":"2025-02-10T22:19:08Z","title":"Fast Clustering of Categorical Big Data","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-08T13:54:36.372655Z"},"links":{"citing_paper":"/paper/2502.07081"},"observation_digest":"sha256:57a6175da371c5bd1e4c9ab5f71041f08de78a2afa6ab00e8f68897aaaf3aba0","observation_id":"b206b656-85c9-46a9-93de-b36dca70408a","resolution":{"observed_at":"2026-08-08T13:54:37.966472Z","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-08T13:54:37.948720Z","title":"A limited-iteration bisecting k-means for fast clustering large datasets","venue":null,"work_id":"cb83beb5-8388-49f2-b298-46cb5373855f","year":2016},"citing_paper":{"arxiv_id":"2502.07081","last_updated":"2025-02-15T20:57:13Z","snapshot_observed_at":"2026-08-09T14:46:40.705209Z","submitted_at":"2025-02-10T22:19:08Z","title":"Fast Clustering of Categorical Big Data","version":2},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-08T13:54:36.376237Z"},"links":{"citing_paper":"/paper/2502.07081"},"observation_digest":"sha256:f4aad6c49180c6ef01e01a436a1e6806e36c8c29c47176d9a8496ad011dec735","observation_id":"1700aec3-ce10-4b35-b93f-82f2f6bf1f78","resolution":{"observed_at":"2026-08-08T13:54:37.953026Z","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-08T13:54:37.934635Z","title":"Computation of initial modes for k-modes clustering algorithm using evidence accumulation","venue":null,"work_id":"a19ecc61-b5e5-4447-8b89-29af1a042a3f","year":2007},"citing_paper":{"arxiv_id":"2502.07081","last_updated":"2025-02-15T20:57:13Z","snapshot_observed_at":"2026-08-09T14:46:40.705209Z","submitted_at":"2025-02-10T22:19:08Z","title":"Fast Clustering of Categorical Big Data","version":2},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-08T13:54:36.379823Z"},"links":{"citing_paper":"/paper/2502.07081"},"observation_digest":"sha256:d965b10e0e9fd5ed5e2715029f0394014be5aba88091a1c933ae910f8d6fa8c7","observation_id":"79d254b6-dd90-466b-94d0-273e1663b026","resolution":{"observed_at":"2026-08-08T13:54:37.938752Z","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-08T13:54:37.920577Z","title":"A cluster centers initialization method for clustering categorical data","venue":null,"work_id":"627ec4c6-e888-4760-81dd-456b368614cc","year":2012},"citing_paper":{"arxiv_id":"2502.07081","last_updated":"2025-02-15T20:57:13Z","snapshot_observed_at":"2026-08-09T14:46:40.705209Z","submitted_at":"2025-02-10T22:19:08Z","title":"Fast Clustering of Categorical Big Data","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-08T13:54:36.383219Z"},"links":{"citing_paper":"/paper/2502.07081"},"observation_digest":"sha256:e257377d2e2fa5ccdf6af03f6cd4824d2c49715738a26d932c55b00e530a6079","observation_id":"c12ab0be-10ee-48d3-97ac-21ef3b279d23","resolution":{"observed_at":"2026-08-08T13:54:37.924978Z","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-08T13:54:37.906648Z","title":"A linear method for deviation detection in large databases","venue":null,"work_id":"adaaccc2-49b4-46f0-aecb-e466199eb1c6","year":1996},"citing_paper":{"arxiv_id":"2502.07081","last_updated":"2025-02-15T20:57:13Z","snapshot_observed_at":"2026-08-09T14:46:40.705209Z","submitted_at":"2025-02-10T22:19:08Z","title":"Fast Clustering of Categorical Big Data","version":2},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-08T13:54:36.387564Z"},"links":{"citing_paper":"/paper/2502.07081"},"observation_digest":"sha256:53fb2cbb9fe14b0af10dce61508bf5506e48d359b2216cc9f838f351fd78c49d","observation_id":"d658704f-160b-4c37-b24a-795e94e0c622","resolution":{"observed_at":"2026-08-08T13:54:37.910959Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T13:54:36.391635Z","title":"Lof: identifying density-based local outliers","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2502.07081","last_updated":"2025-02-15T20:57:13Z","snapshot_observed_at":"2026-08-09T14:46:40.705209Z","submitted_at":"2025-02-10T22:19:08Z","title":"Fast Clustering of Categorical Big Data","version":2},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-08T13:54:36.391635Z"},"links":{"citing_paper":"/paper/2502.07081"},"observation_digest":"sha256:6e3af1376f4bd63bed0ab336d498b2385431816c4f3f451e6940be2297ff4ef1","observation_id":"66d06a82-7df8-4c99-9458-ce858ae1dad4","resolution":{"observed_at":"2026-08-08T13:54:36.391635Z","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-08T13:54:37.883582Z","title":null,"venue":null,"work_id":"c97e30e3-a614-4817-9390-40a7da6ce9fa","year":2002},"citing_paper":{"arxiv_id":"2502.07081","last_updated":"2025-02-15T20:57:13Z","snapshot_observed_at":"2026-08-09T14:46:40.705209Z","submitted_at":"2025-02-10T22:19:08Z","title":"Fast Clustering of Categorical Big Data","version":2},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-08T13:54:36.395416Z"},"links":{"citing_paper":"/paper/2502.07081"},"observation_digest":"sha256:415263bca279e8da81273fbe669e266e11793773ee5235740ea93a516456bf08","observation_id":"a84355a6-bf7c-4c40-b411-a63bb1e101c7","resolution":{"observed_at":"2026-08-08T13:54:37.887768Z","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-08T13:54:37.870278Z","title":"Computing initial points using density based multiscale data condensation for clustering categorical data","venue":null,"work_id":"b8133920-d90f-4431-a0e6-334e85ba2719","year":2003},"citing_paper":{"arxiv_id":"2502.07081","last_updated":"2025-02-15T20:57:13Z","snapshot_observed_at":"2026-08-09T14:46:40.705209Z","submitted_at":"2025-02-10T22:19:08Z","title":"Fast Clustering of Categorical Big Data","version":2},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-08T13:54:36.399435Z"},"links":{"citing_paper":"/paper/2502.07081"},"observation_digest":"sha256:f15534008b1fac3403e7c6f4cf7314b82af8eae19e14278a23db6c3343d723e8","observation_id":"5d10f319-908f-40af-9a2e-5f1096329b68","resolution":{"observed_at":"2026-08-08T13:54:37.874656Z","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-08T13:54:37.856886Z","title":"Data clustering using evidence accumulation","venue":null,"work_id":"b1b3099c-65a7-4154-a51a-7b0c7724bfa3","year":2002},"citing_paper":{"arxiv_id":"2502.07081","last_updated":"2025-02-15T20:57:13Z","snapshot_observed_at":"2026-08-09T14:46:40.705209Z","submitted_at":"2025-02-10T22:19:08Z","title":"Fast Clustering of Categorical Big Data","version":2},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-08T13:54:36.403464Z"},"links":{"citing_paper":"/paper/2502.07081"},"observation_digest":"sha256:0e24268206d43fbf782907b95636f4e4184617b3ef9f2e8b57ed84518548b92a","observation_id":"b069317e-7c55-4ca2-bb58-32509f8af815","resolution":{"observed_at":"2026-08-08T13:54:37.861074Z","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":"cs/0610043","last_updated":"2006-10-09T12:12:45Z","snapshot_observed_at":"2026-08-16T08:28:51.529650Z","submitted_at":"2006-10-09T12:12:45Z","title":"Farthest-Point Heuristic based Initialization Methods for K-Modes Clustering","version":1},"cited_work":{"arxiv_id":"cs/0610043","doi":null,"metadata_source":"pith","pith_arxiv_id":"cs/0610043","snapshot_observed_at":"2026-08-08T13:54:37.735200Z","title":"Farthest-Point Heuristic based Initialization Methods for K-Modes Clustering","venue":"cs.AI","work_id":"bcea7aba-2db6-4eea-af6c-eed081a7dccc","year":2006},"citing_paper":{"arxiv_id":"2502.07081","last_updated":"2025-02-15T20:57:13Z","snapshot_observed_at":"2026-08-09T14:46:40.705209Z","submitted_at":"2025-02-10T22:19:08Z","title":"Fast Clustering of Categorical Big Data","version":2},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-08T13:54:36.407600Z"},"links":{"cited_paper":"/paper/cs/0610043","citing_paper":"/paper/2502.07081"},"observation_digest":"sha256:44152fbf443d5cbcfd68dbefde2714a87644d2ea4c987ec49391fd7d48e27645","observation_id":"dd976241-bc37-4510-9729-3653b98a2d7e","resolution":{"observed_at":"2026-08-08T13:54:37.739360Z","resolver_source":"local_arxiv","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-08T13:54:37.843781Z","title":"Clustering to minimize the maximum intercluster distance","venue":null,"work_id":"6a4d46cc-6924-4468-b847-44d7038d6f4c","year":1985},"citing_paper":{"arxiv_id":"2502.07081","last_updated":"2025-02-15T20:57:13Z","snapshot_observed_at":"2026-08-09T14:46:40.705209Z","submitted_at":"2025-02-10T22:19:08Z","title":"Fast Clustering of Categorical Big Data","version":2},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-08T13:54:36.412118Z"},"links":{"citing_paper":"/paper/2502.07081"},"observation_digest":"sha256:44f03832405478cff257f9e3e2dc3910c8e6a871710bcb347f12ad22fb639d80","observation_id":"6e7d20d2-791c-436d-9aa3-bd5848b55be3","resolution":{"observed_at":"2026-08-08T13:54:37.847893Z","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-08T13:54:37.829985Z","title":"A fast deep learning method for security vulnerability study of xor pufs","venue":null,"work_id":"98582479-1011-4a7a-a921-502a9db51802","year":2020},"citing_paper":{"arxiv_id":"2502.07081","last_updated":"2025-02-15T20:57:13Z","snapshot_observed_at":"2026-08-09T14:46:40.705209Z","submitted_at":"2025-02-10T22:19:08Z","title":"Fast Clustering of Categorical Big Data","version":2},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-08T13:54:36.416322Z"},"links":{"citing_paper":"/paper/2502.07081"},"observation_digest":"sha256:3ca255e3863a33694e85bcab9045a11551443656d3470b17bf93b6684c69f419","observation_id":"200cb6bb-65a8-465d-a72a-acee71de5fc8","resolution":{"observed_at":"2026-08-08T13:54:37.834297Z","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-08T13:54:37.816563Z","title":"A hybrid-optimizer-enhanced neural network method for the security vulnerability study of multiplexer arbiter pufs","venue":null,"work_id":"aa863f09-6558-4a8f-9dca-4c5b633bd4d5","year":null},"citing_paper":{"arxiv_id":"2502.07081","last_updated":"2025-02-15T20:57:13Z","snapshot_observed_at":"2026-08-09T14:46:40.705209Z","submitted_at":"2025-02-10T22:19:08Z","title":"Fast Clustering of Categorical Big Data","version":2},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-08T13:54:36.420755Z"},"links":{"citing_paper":"/paper/2502.07081"},"observation_digest":"sha256:3ea68198227bda572a3e567c3ab748826aa0972da0791845e7e7874aa6e9b0a9","observation_id":"1f9ba2e1-9d23-43ec-a5e0-47afb4287607","resolution":{"observed_at":"2026-08-08T13:54:37.820744Z","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-08T13:54:37.800519Z","title":"Extensive examination of xor arbiter pufs as security primitives for resource-constrained iot devices","venue":null,"work_id":"ee56dfef-a58e-452a-a5cd-f4b16271e27e","year":2019},"citing_paper":{"arxiv_id":"2502.07081","last_updated":"2025-02-15T20:57:13Z","snapshot_observed_at":"2026-08-09T14:46:40.705209Z","submitted_at":"2025-02-10T22:19:08Z","title":"Fast Clustering of Categorical Big Data","version":2},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-08T13:54:36.424913Z"},"links":{"citing_paper":"/paper/2502.07081"},"observation_digest":"sha256:54fd38f29e084dcb6bfdd9248d5f714c6d668f0d9547057fe577dfccd2168074","observation_id":"9b161c46-22d6-41b5-80aa-0c4c69d82026","resolution":{"observed_at":"2026-08-08T13:54:37.806359Z","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-08T13:54:37.786934Z","title":"A machine learning-based security vulnerability study on xor pufs for resource-constraint internet of things","venue":null,"work_id":"ebfb5363-6109-46c2-8273-382acae7aa14","year":2018},"citing_paper":{"arxiv_id":"2502.07081","last_updated":"2025-02-15T20:57:13Z","snapshot_observed_at":"2026-08-09T14:46:40.705209Z","submitted_at":"2025-02-10T22:19:08Z","title":"Fast Clustering of Categorical Big Data","version":2},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-08T13:54:36.429243Z"},"links":{"citing_paper":"/paper/2502.07081"},"observation_digest":"sha256:ffcb516eb579a0950a79194d0297b35279eeea44bf059c12ce60476b9cdbe81a","observation_id":"a9f15803-666a-4e18-81b1-147fc9011f1b","resolution":{"observed_at":"2026-08-08T13:54:37.791246Z","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-08T13:54:37.774102Z","title":"A conceptual version of the k-means algorithm","venue":null,"work_id":"e3ab491d-a93e-4278-99ee-a239391803f2","year":1995},"citing_paper":{"arxiv_id":"2502.07081","last_updated":"2025-02-15T20:57:13Z","snapshot_observed_at":"2026-08-09T14:46:40.705209Z","submitted_at":"2025-02-10T22:19:08Z","title":"Fast Clustering of Categorical Big Data","version":2},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-08T13:54:36.433444Z"},"links":{"citing_paper":"/paper/2502.07081"},"observation_digest":"sha256:564360fcf52cdf3a84805d3dfecda785c03a989ea9677f5c103aa3b4930a747d","observation_id":"4a132860-367d-436b-b2bb-0d5c3c8e4892","resolution":{"observed_at":"2026-08-08T13:54:37.778218Z","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-08T13:54:37.760932Z","title":"Symbolic clustering using a new dissimilarity measure","venue":null,"work_id":"2c3513aa-3f13-45b6-bbb2-e78750e871e2","year":1991},"citing_paper":{"arxiv_id":"2502.07081","last_updated":"2025-02-15T20:57:13Z","snapshot_observed_at":"2026-08-09T14:46:40.705209Z","submitted_at":"2025-02-10T22:19:08Z","title":"Fast Clustering of Categorical Big Data","version":2},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-08T13:54:36.437612Z"},"links":{"citing_paper":"/paper/2502.07081"},"observation_digest":"sha256:0509292296980a041ec86007738ccab0444b3bdadfa2a26a6798a59edd991503","observation_id":"421bdbe7-9da6-4560-8096-663ba35c90b4","resolution":{"observed_at":"2026-08-08T13:54:37.765044Z","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-08T13:54:37.748317Z","title":"Rock: A robust clustering algorithm for categorical attributes","venue":null,"work_id":"6abb79e8-6015-4369-92ce-a166cda861cc","year":2000},"citing_paper":{"arxiv_id":"2502.07081","last_updated":"2025-02-15T20:57:13Z","snapshot_observed_at":"2026-08-09T14:46:40.705209Z","submitted_at":"2025-02-10T22:19:08Z","title":"Fast Clustering of Categorical Big Data","version":2},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-08T13:54:36.441829Z"},"links":{"citing_paper":"/paper/2502.07081"},"observation_digest":"sha256:1e041d83517dae2619ab0e2326d6302aea3fc75f493c60b070346a2e82ebc104","observation_id":"d1d1c0bd-bb5b-4c1b-8549-987299580b6e","resolution":{"observed_at":"2026-08-08T13:54:37.752256Z","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":"2410.11765","last_updated":"2024-10-15T16:39:38Z","snapshot_observed_at":"2026-08-16T13:09:06.682827Z","submitted_at":"2024-10-15T16:39:38Z","title":"ECGN: A Cluster-Aware Approach to Graph Neural Networks for Imbalanced Classification","version":1},"cited_work":{"arxiv_id":"2410.11765","doi":"10.48550/arxiv.2410.11765","metadata_source":"pith","pith_arxiv_id":"2410.11765","snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"ECGN: A Cluster-Aware Approach to Graph Neural Networks for Imbalanced Classification","venue":"cs.LG","work_id":"c2cbbd51-17c8-4979-a445-fba68e814ce8","year":2024},"citing_paper":{"arxiv_id":"2502.07081","last_updated":"2025-02-15T20:57:13Z","snapshot_observed_at":"2026-08-09T14:46:40.705209Z","submitted_at":"2025-02-10T22:19:08Z","title":"Fast Clustering of Categorical Big Data","version":2},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-08T13:54:36.446197Z"},"links":{"cited_paper":"/paper/2410.11765","citing_paper":"/paper/2502.07081"},"observation_digest":"sha256:6c71e5bee7e0bd08391ecc9d7470cdc6dc612e50bfa341918d8470efe4fdc041","observation_id":"374b34c1-3725-4039-a97e-d0e270aa3973","resolution":{"observed_at":"2026-08-08T13:54:37.453441Z","resolver_source":"local_arxiv","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T13:54:36.450755Z","title":"Calhoun, and Jingyu Liu","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2502.07081","last_updated":"2025-02-15T20:57:13Z","snapshot_observed_at":"2026-08-09T14:46:40.705209Z","submitted_at":"2025-02-10T22:19:08Z","title":"Fast Clustering of Categorical Big Data","version":2},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-08T13:54:36.450755Z"},"links":{"citing_paper":"/paper/2502.07081"},"observation_digest":"sha256:d17024deda964303c68724c372f7e191a18fcf307be026218a784cc24c694efe","observation_id":"1442b259-073e-4049-a151-a647e8325b24","resolution":{"observed_at":"2026-08-08T13:54:36.450755Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T13:54:36.455277Z","title":"Graph-based deep learning models in the prediction of early-stage alzheimers","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.07081","last_updated":"2025-02-15T20:57:13Z","snapshot_observed_at":"2026-08-09T14:46:40.705209Z","submitted_at":"2025-02-10T22:19:08Z","title":"Fast Clustering of Categorical Big Data","version":2},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-08T13:54:36.455277Z"},"links":{"citing_paper":"/paper/2502.07081"},"observation_digest":"sha256:e6b2e98759546f3c0a4c4a51023cd8354c61af426c7d76d35c1791d94baf5d64","observation_id":"ac98b3e2-12a7-40ca-9284-faf406da98c9","resolution":{"observed_at":"2026-08-08T13:54:36.455277Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T13:54:36.459538Z","title":"Calhoun, and Jingyu Liu","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2502.07081","last_updated":"2025-02-15T20:57:13Z","snapshot_observed_at":"2026-08-09T14:46:40.705209Z","submitted_at":"2025-02-10T22:19:08Z","title":"Fast Clustering of Categorical Big Data","version":2},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-08T13:54:36.459538Z"},"links":{"citing_paper":"/paper/2502.07081"},"observation_digest":"sha256:609181d157ebec8b9038fcbd15e09da349f94ce9936149dfeb81933d18e6962b","observation_id":"abfcee4a-9110-4daf-a14a-148aa945ce53","resolution":{"observed_at":"2026-08-08T13:54:36.459538Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1511.06335","last_updated":"2016-05-24T22:27:35Z","snapshot_observed_at":"2026-08-14T22:22:10.022214Z","submitted_at":"2015-11-19T20:06:14Z","title":"Unsupervised Deep Embedding for Clustering Analysis","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1511.06335","snapshot_observed_at":"2026-08-08T13:54:36.464162Z","title":"Unsupervised deep embedding for clustering analysis, 2015","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2502.07081","last_updated":"2025-02-15T20:57:13Z","snapshot_observed_at":"2026-08-09T14:46:40.705209Z","submitted_at":"2025-02-10T22:19:08Z","title":"Fast Clustering of Categorical Big Data","version":2},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-08T13:54:36.464162Z"},"links":{"cited_paper":"/paper/1511.06335","citing_paper":"/paper/2502.07081"},"observation_digest":"sha256:0d5622ec5d04f6033117e92ce22bc374ad9586db16c38eb382d0e48fa821a217","observation_id":"a4bad1d9-4a3d-46e9-8f92-36f1488163c5","resolution":{"observed_at":"2026-08-08T13:54:36.464162Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1801.07648","last_updated":"2018-09-13T19:41:22Z","snapshot_observed_at":"2026-08-14T19:52:44.364649Z","submitted_at":"2018-01-23T16:41:03Z","title":"Clustering with Deep Learning: Taxonomy and New Methods","version":2},"cited_work":{"arxiv_id":"1801.07648","doi":null,"metadata_source":"pith","pith_arxiv_id":"1801.07648","snapshot_observed_at":"2026-08-08T13:54:37.467829Z","title":"Clustering with Deep Learning: Taxonomy and New Methods","venue":"cs.LG","work_id":"5937c054-119f-4f19-883d-aee083180502","year":2018},"citing_paper":{"arxiv_id":"2502.07081","last_updated":"2025-02-15T20:57:13Z","snapshot_observed_at":"2026-08-09T14:46:40.705209Z","submitted_at":"2025-02-10T22:19:08Z","title":"Fast Clustering of Categorical Big Data","version":2},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-08T13:54:36.468854Z"},"links":{"cited_paper":"/paper/1801.07648","citing_paper":"/paper/2502.07081"},"observation_digest":"sha256:baa69c41ce3840655848aec44f8ba7f3d81b012cb507066d8082035acb8f1163","observation_id":"b1e9e75e-b598-44f7-b703-7f82dffd6c88","resolution":{"observed_at":"2026-08-08T13:54:37.472359Z","resolver_source":"local_arxiv","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":"10.1007/978-3-540-77004-6_5","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":null,"venue":"Lecture notes in computer science","work_id":"85729f58-07b2-4df3-8363-0126efd06e77","year":null},"citing_paper":{"arxiv_id":"2502.07081","last_updated":"2025-02-15T20:57:13Z","snapshot_observed_at":"2026-08-09T14:46:40.705209Z","submitted_at":"2025-02-10T22:19:08Z","title":"Fast Clustering of Categorical Big Data","version":2},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-08T13:54:36.473392Z"},"links":{"citing_paper":"/paper/2502.07081"},"observation_digest":"sha256:6fcdce64e8fe7382c8b73b3f3fe2159a8901dc4ef25b85b9772035c83cdbe877","observation_id":"5181c85f-d17a-4997-888b-6c186f4a05fc","resolution":{"observed_at":"2026-08-08T13:54:37.433948Z","resolver_source":"doi","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":{"arxiv_id":"2501.16345","last_updated":"2025-02-07T08:57:37Z","snapshot_observed_at":"2026-08-13T10:23:56.051279Z","submitted_at":"2025-01-17T20:21:31Z","title":"Self-Clustering Graph Transformer Approach to Model Resting-State Functional Brain Activity","version":2},"cited_work":{"arxiv_id":"2501.16345","doi":"10.48550/arxiv.2501.16345","metadata_source":"pith","pith_arxiv_id":"2501.16345","snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Self-Clustering Graph Transformer Approach to Model Resting-State Functional Brain Activity","venue":"cs.LG","work_id":"9a0313cd-df1d-4f6b-a249-f45610a6dbb5","year":2025},"citing_paper":{"arxiv_id":"2502.07081","last_updated":"2025-02-15T20:57:13Z","snapshot_observed_at":"2026-08-09T14:46:40.705209Z","submitted_at":"2025-02-10T22:19:08Z","title":"Fast Clustering of Categorical Big Data","version":2},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-08T13:54:36.478500Z"},"links":{"cited_paper":"/paper/2501.16345","citing_paper":"/paper/2502.07081"},"observation_digest":"sha256:543a5b60244fdca9c0358bb498bf7fd99148317a7e58002f2140428a5c2c3b15","observation_id":"9f51d202-3873-45be-8569-bf6e9f2382c2","resolution":{"observed_at":"2026-08-08T13:54:36.537411Z","resolver_source":"local_arxiv","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":"10.24963/ijcai.2020/693","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Deep learning for community detection: Progress, challenges and opportunities","venue":null,"work_id":"d554f7ae-a579-49b8-88e0-f582b683ca7a","year":2020},"citing_paper":{"arxiv_id":"2502.07081","last_updated":"2025-02-15T20:57:13Z","snapshot_observed_at":"2026-08-09T14:46:40.705209Z","submitted_at":"2025-02-10T22:19:08Z","title":"Fast Clustering of Categorical Big Data","version":2},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-08T13:54:36.483348Z"},"links":{"citing_paper":"/paper/2502.07081"},"observation_digest":"sha256:d77709952cc4388077715c1aeb4353ccedca541df19eb8cf8222284b88fd3fdb","observation_id":"5bd82d1d-4e4f-49ac-8f4a-d6dbb53551d2","resolution":{"observed_at":"2026-08-08T13:54:36.518420Z","resolver_source":"doi","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"}}],"paper":{"arxiv_id":"2502.07081","last_updated":"2025-02-15T20:57:13Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-09T14:46:40.705209Z","submitted_at":"2025-02-10T22:19:08Z","title":"Fast Clustering of Categorical Big Data"},"reference_resolution":{"displayed":42,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":7,"verified_exact":6,"verified_fuzzy":29},"total_outbound_references":42},"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 42 of 42 outbound references and 0 inbound Pith citation observations for arXiv:2502.07081."}