{"as_of":"2026-08-17T21:40:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:66639a97015957f17941b6dc6ca9e9d6028e8dd3ad4e176f6f22e4c523fad059","coverage":[{"denominator":31,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":31,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T21:55:51.544793Z","state":"measured"},{"denominator":31,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":31,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+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/2505.08594/citation-record","integrity":"/paper/2505.08594/integrity","json":"/paper/2505.08594/citation-record.json","paper":"/paper/2505.08594"},"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-15T21:55:51.903809Z","title":"Data clustering: application and trends,","venue":null,"work_id":"d190b012-154f-4375-998d-e06bd480cd11","year":2023},"citing_paper":{"arxiv_id":"2505.08594","last_updated":"2025-05-13T14:06:13Z","snapshot_observed_at":"2026-08-15T21:48:34.679887Z","submitted_at":"2025-05-13T14:06:13Z","title":"Clustering of Incomplete Data via a Bipartite Graph Structure","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-15T21:55:51.422769Z"},"links":{"citing_paper":"/paper/2505.08594"},"observation_digest":"sha256:25c892abd038aa0408a4fca0468d027cffb6cb534105280681467b410087a375","observation_id":"5b308c7c-6288-498f-a69e-d47d60028412","resolution":{"observed_at":"2026-08-15T21:55:51.907756Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T21:55:51.891188Z","title":"Cluster analysis and display of genome-wide expression patterns,","venue":null,"work_id":"8d6c1359-e793-4bb3-9c62-b133538366ef","year":1998},"citing_paper":{"arxiv_id":"2505.08594","last_updated":"2025-05-13T14:06:13Z","snapshot_observed_at":"2026-08-15T21:48:34.679887Z","submitted_at":"2025-05-13T14:06:13Z","title":"Clustering of Incomplete Data via a Bipartite Graph Structure","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-15T21:55:51.427348Z"},"links":{"citing_paper":"/paper/2505.08594"},"observation_digest":"sha256:273e62c215582b341a4ea8e900ed144ba395dd3d0cac28fada642c00bbe4cbbd","observation_id":"25e81dd5-4ff4-470e-bf05-486f8b6fa051","resolution":{"observed_at":"2026-08-15T21:55:51.895403Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T21:55:51.431672Z","title":"Normalized cuts and image segmentation,","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2505.08594","last_updated":"2025-05-13T14:06:13Z","snapshot_observed_at":"2026-08-15T21:48:34.679887Z","submitted_at":"2025-05-13T14:06:13Z","title":"Clustering of Incomplete Data via a Bipartite Graph Structure","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-15T21:55:51.431672Z"},"links":{"citing_paper":"/paper/2505.08594"},"observation_digest":"sha256:0ffb2e156471aa22c1aaa74b3eef2910159885715a05cde0f594cb4315aa4f37","observation_id":"d73f7ca5-ab89-4f4b-a69c-97175346cb59","resolution":{"observed_at":"2026-08-15T21:55:51.431672Z","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-15T21:55:51.870270Z","title":"Clustering of people in social network based on textual similarity,","venue":null,"work_id":"c8b5510e-e7b4-4f12-9b55-2b97776a03d1","year":2016},"citing_paper":{"arxiv_id":"2505.08594","last_updated":"2025-05-13T14:06:13Z","snapshot_observed_at":"2026-08-15T21:48:34.679887Z","submitted_at":"2025-05-13T14:06:13Z","title":"Clustering of Incomplete Data via a Bipartite Graph Structure","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-15T21:55:51.435738Z"},"links":{"citing_paper":"/paper/2505.08594"},"observation_digest":"sha256:bd40dff2e992b2858e8c19bc5f74952fd03448463ad31ec66779ba10be9f5f4d","observation_id":"29fb5143-2665-4240-9e46-9856071b2708","resolution":{"observed_at":"2026-08-15T21:55:51.874443Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1703.00485","last_updated":"2020-11-03T06:56:52Z","snapshot_observed_at":"2026-08-17T00:04:30.580411Z","submitted_at":"2017-03-01T20:19:49Z","title":"A review of two decades of correlations, hierarchies, networks and clustering in financial markets","version":7},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1703.00485","snapshot_observed_at":"2026-08-15T21:55:51.440259Z","title":"Marti, F","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.08594","last_updated":"2025-05-13T14:06:13Z","snapshot_observed_at":"2026-08-15T21:48:34.679887Z","submitted_at":"2025-05-13T14:06:13Z","title":"Clustering of Incomplete Data via a Bipartite Graph Structure","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-15T21:55:51.440259Z"},"links":{"cited_paper":"/paper/1703.00485","citing_paper":"/paper/2505.08594"},"observation_digest":"sha256:9097964b0ff4e82a2c1817f2fb898b8a946f03a3abe93ca923fcbf262ef39d03","observation_id":"169d1731-983d-49a2-9156-0b970a89873c","resolution":{"observed_at":"2026-08-15T21:55:51.440259Z","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-15T21:55:51.857440Z","title":"Hierarchical clustering schemes,","venue":null,"work_id":"05171dc0-b483-4c70-95c4-833286538e40","year":1967},"citing_paper":{"arxiv_id":"2505.08594","last_updated":"2025-05-13T14:06:13Z","snapshot_observed_at":"2026-08-15T21:48:34.679887Z","submitted_at":"2025-05-13T14:06:13Z","title":"Clustering of Incomplete Data via a Bipartite Graph Structure","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-15T21:55:51.444600Z"},"links":{"citing_paper":"/paper/2505.08594"},"observation_digest":"sha256:f68a5e60f2ed113041016fc6d3bcd9438ed532e85d2e32f14a6366a6a9421cf7","observation_id":"41ba2d8d-8ed5-4313-88ad-6b0135517d7c","resolution":{"observed_at":"2026-08-15T21:55:51.861566Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T21:55:51.844352Z","title":"A density-based algorithm for discovering clusters in large spatial databases with noise,","venue":null,"work_id":"96511a6c-143c-416b-a56b-edf7c419c16d","year":1996},"citing_paper":{"arxiv_id":"2505.08594","last_updated":"2025-05-13T14:06:13Z","snapshot_observed_at":"2026-08-15T21:48:34.679887Z","submitted_at":"2025-05-13T14:06:13Z","title":"Clustering of Incomplete Data via a Bipartite Graph Structure","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-15T21:55:51.448970Z"},"links":{"citing_paper":"/paper/2505.08594"},"observation_digest":"sha256:ebdbfa00d3989b2cdcfc96667089bb81756d4a194b76769953614707fbda387b","observation_id":"1a983d9e-4b92-4eb1-bcbf-8634665f54ca","resolution":{"observed_at":"2026-08-15T21:55:51.848597Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T21:55:51.832458Z","title":null,"venue":null,"work_id":"5353a094-783e-4e70-8124-2548747bba26","year":2004},"citing_paper":{"arxiv_id":"2505.08594","last_updated":"2025-05-13T14:06:13Z","snapshot_observed_at":"2026-08-15T21:48:34.679887Z","submitted_at":"2025-05-13T14:06:13Z","title":"Clustering of Incomplete Data via a Bipartite Graph Structure","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-15T21:55:51.452939Z"},"links":{"citing_paper":"/paper/2505.08594"},"observation_digest":"sha256:e01c5884c0ab7894c8e2c84ed76f5efd8ab2c463b05f1b48440d918cbe15b24b","observation_id":"9d86951e-7f26-4401-96fe-3d39152bb657","resolution":{"observed_at":"2026-08-15T21:55:51.836211Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T21:55:51.456959Z","title":"Graph-based Methods for Visualization and Clustering,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2505.08594","last_updated":"2025-05-13T14:06:13Z","snapshot_observed_at":"2026-08-15T21:48:34.679887Z","submitted_at":"2025-05-13T14:06:13Z","title":"Clustering of Incomplete Data via a Bipartite Graph Structure","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-15T21:55:51.456959Z"},"links":{"citing_paper":"/paper/2505.08594"},"observation_digest":"sha256:3dab63e7d9c7e861c68588c6ab5618a396ddf4d84b711d217c91d1c33baab669","observation_id":"1cd64d0d-3b7e-4018-8ffd-da1bc86f0743","resolution":{"observed_at":"2026-08-15T21:55:51.456959Z","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-15T21:55:51.812206Z","title":"On Spectral Clustering: Analysis and an algorithm,","venue":null,"work_id":"7b86bf26-bf51-41ce-9137-9502bee9ac58","year":2001},"citing_paper":{"arxiv_id":"2505.08594","last_updated":"2025-05-13T14:06:13Z","snapshot_observed_at":"2026-08-15T21:48:34.679887Z","submitted_at":"2025-05-13T14:06:13Z","title":"Clustering of Incomplete Data via a Bipartite Graph Structure","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-15T21:55:51.460974Z"},"links":{"citing_paper":"/paper/2505.08594"},"observation_digest":"sha256:2a919709dff3dd72f5df36201caa801aaaf1ecacc76b92483138b6f483f254a6","observation_id":"a00b6bb9-ae6f-404b-bc78-5de4601094d4","resolution":{"observed_at":"2026-08-15T21:55:51.816282Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T21:55:51.465059Z","title":"Sparse inverse covariance estimation with the graphical lasso,","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2505.08594","last_updated":"2025-05-13T14:06:13Z","snapshot_observed_at":"2026-08-15T21:48:34.679887Z","submitted_at":"2025-05-13T14:06:13Z","title":"Clustering of Incomplete Data via a Bipartite Graph Structure","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-15T21:55:51.465059Z"},"links":{"citing_paper":"/paper/2505.08594"},"observation_digest":"sha256:a2a41b7d80c72ef8e58a03d6fc0b488cb0b5f96508dc83070f5622c9d3c8f21e","observation_id":"e18e8cc2-40a4-4a7c-83bb-df23f5b3803b","resolution":{"observed_at":"2026-08-15T21:55:51.465059Z","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-15T21:55:51.468874Z","title":"Discovering structure by learning sparse graphs,","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2505.08594","last_updated":"2025-05-13T14:06:13Z","snapshot_observed_at":"2026-08-15T21:48:34.679887Z","submitted_at":"2025-05-13T14:06:13Z","title":"Clustering of Incomplete Data via a Bipartite Graph Structure","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-15T21:55:51.468874Z"},"links":{"citing_paper":"/paper/2505.08594"},"observation_digest":"sha256:3aef2f264fed69a0bbdddb46e71d00832ca73a2aeb21caf80099cbab146da149","observation_id":"5d797254-da4c-4935-9544-39fd2d642440","resolution":{"observed_at":"2026-08-15T21:55:51.468874Z","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-15T21:55:51.473902Z","title":"Graph Learning From Data Under Laplacian and Structural Constraints,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2505.08594","last_updated":"2025-05-13T14:06:13Z","snapshot_observed_at":"2026-08-15T21:48:34.679887Z","submitted_at":"2025-05-13T14:06:13Z","title":"Clustering of Incomplete Data via a Bipartite Graph Structure","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-15T21:55:51.473902Z"},"links":{"citing_paper":"/paper/2505.08594"},"observation_digest":"sha256:4394739599a3bc121176b6bfbfb7634212fcd09a5b40a5e395932a884ec6cc67","observation_id":"eff2b737-0e00-42fd-9c38-47f0f99f7af2","resolution":{"observed_at":"2026-08-15T21:55:51.473902Z","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-15T21:55:51.477844Z","title":"Optimization Algorithms for Graph Laplacian Estimation via ADMM and MM,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2505.08594","last_updated":"2025-05-13T14:06:13Z","snapshot_observed_at":"2026-08-15T21:48:34.679887Z","submitted_at":"2025-05-13T14:06:13Z","title":"Clustering of Incomplete Data via a Bipartite Graph Structure","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-15T21:55:51.477844Z"},"links":{"citing_paper":"/paper/2505.08594"},"observation_digest":"sha256:f0351f0f088854ae6ffdd5034ab13e98e36b2515538908974b5d3bd1e75f622a","observation_id":"b0655edd-544d-4ed6-b235-839ceb5c8ba9","resolution":{"observed_at":"2026-08-15T21:55:51.477844Z","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-15T21:55:51.767186Z","title":"Nonconvex Sparse Graph Learning under Laplacian Constrained Graphical Model,","venue":null,"work_id":"f8a09f62-6a23-4310-9cb2-bd04091eb993","year":2020},"citing_paper":{"arxiv_id":"2505.08594","last_updated":"2025-05-13T14:06:13Z","snapshot_observed_at":"2026-08-15T21:48:34.679887Z","submitted_at":"2025-05-13T14:06:13Z","title":"Clustering of Incomplete Data via a Bipartite Graph Structure","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-15T21:55:51.481782Z"},"links":{"citing_paper":"/paper/2505.08594"},"observation_digest":"sha256:081767c38288663b70d2c6a7ac498ee04025313c0754608e2db119572c4fc594","observation_id":"2bd0cd76-fbfb-46f9-8894-9679669337c9","resolution":{"observed_at":"2026-08-15T21:55:51.771614Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T21:55:51.754239Z","title":"Learning Spatiotemporal Graphical Models From Incomplete Observations,","venue":null,"work_id":"a12875a9-83c9-49b0-b6a2-1f13f191230a","year":2024},"citing_paper":{"arxiv_id":"2505.08594","last_updated":"2025-05-13T14:06:13Z","snapshot_observed_at":"2026-08-15T21:48:34.679887Z","submitted_at":"2025-05-13T14:06:13Z","title":"Clustering of Incomplete Data via a Bipartite Graph Structure","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-15T21:55:51.485709Z"},"links":{"citing_paper":"/paper/2505.08594"},"observation_digest":"sha256:9296afcfaa86a77600c75a5d56baf783e38a07f6cf70a56746ace1b3b64e8dfe","observation_id":"0ea0a561-0e0a-4cf5-aca4-7ac54edb21e5","resolution":{"observed_at":"2026-08-15T21:55:51.758497Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T21:55:51.740979Z","title":"The Constrained Laplacian Rank algorithm for graph-based clustering,","venue":null,"work_id":"551bce28-3c54-4ac9-bbeb-46258b420270","year":2016},"citing_paper":{"arxiv_id":"2505.08594","last_updated":"2025-05-13T14:06:13Z","snapshot_observed_at":"2026-08-15T21:48:34.679887Z","submitted_at":"2025-05-13T14:06:13Z","title":"Clustering of Incomplete Data via a Bipartite Graph Structure","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-15T21:55:51.489414Z"},"links":{"citing_paper":"/paper/2505.08594"},"observation_digest":"sha256:2b11a8a1f8dc6ae8221b664abbc04a9012754f04e095e47dfed12059b3f57852","observation_id":"4af1fb51-35e1-4bc0-9bd6-217ceb0d2e89","resolution":{"observed_at":"2026-08-15T21:55:51.745236Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T21:55:51.493256Z","title":"A Unified Framework for Structured Graph Learning via Spectral Constraints,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.08594","last_updated":"2025-05-13T14:06:13Z","snapshot_observed_at":"2026-08-15T21:48:34.679887Z","submitted_at":"2025-05-13T14:06:13Z","title":"Clustering of Incomplete Data via a Bipartite Graph Structure","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-15T21:55:51.493256Z"},"links":{"citing_paper":"/paper/2505.08594"},"observation_digest":"sha256:58ad51c4a146d89d9854237efbd462e85039c428d4a9c2dc45700da5a0b2a810","observation_id":"6bd5363a-50a2-447d-9794-0d043116a070","resolution":{"observed_at":"2026-08-15T21:55:51.493256Z","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-15T21:55:51.719583Z","title":"Graphical models in heavy-tailed markets,","venue":null,"work_id":"3656ae80-056f-4b0c-888d-b96c3406b304","year":2021},"citing_paper":{"arxiv_id":"2505.08594","last_updated":"2025-05-13T14:06:13Z","snapshot_observed_at":"2026-08-15T21:48:34.679887Z","submitted_at":"2025-05-13T14:06:13Z","title":"Clustering of Incomplete Data via a Bipartite Graph Structure","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-15T21:55:51.496974Z"},"links":{"citing_paper":"/paper/2505.08594"},"observation_digest":"sha256:ba7f85979539d8925aca498f620206324cbe381e3ab51a9c0442d4dbd88d7d4d","observation_id":"c4db98a6-72ce-4782-ab50-d74a87835eff","resolution":{"observed_at":"2026-08-15T21:55:51.723794Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T21:55:51.500912Z","title":"Graph Learning for Balanced Clustering of Heavy-Tailed Data,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.08594","last_updated":"2025-05-13T14:06:13Z","snapshot_observed_at":"2026-08-15T21:48:34.679887Z","submitted_at":"2025-05-13T14:06:13Z","title":"Clustering of Incomplete Data via a Bipartite Graph Structure","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-15T21:55:51.500912Z"},"links":{"citing_paper":"/paper/2505.08594"},"observation_digest":"sha256:0cde86b3ab948ca7519a0dd7dabaf3d101862b99d8e95beb1149afbf708467df","observation_id":"05ef0db5-c1b2-4be8-a011-6fc521555a9b","resolution":{"observed_at":"2026-08-15T21:55:51.500912Z","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-15T21:55:51.698359Z","title":"Learning time-varying graphs for heavy-tailed data clustering,","venue":null,"work_id":"1672fa06-4286-460d-9e82-c756628e01fd","year":2024},"citing_paper":{"arxiv_id":"2505.08594","last_updated":"2025-05-13T14:06:13Z","snapshot_observed_at":"2026-08-15T21:48:34.679887Z","submitted_at":"2025-05-13T14:06:13Z","title":"Clustering of Incomplete Data via a Bipartite Graph Structure","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-15T21:55:51.505035Z"},"links":{"citing_paper":"/paper/2505.08594"},"observation_digest":"sha256:3b201f6b61a98909b77b3e747b586305d11252ca6a910c1e149b2ee84e0b058c","observation_id":"173bbef5-3ba8-4db0-ae40-17b3cd178ff4","resolution":{"observed_at":"2026-08-15T21:55:51.702534Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T21:55:51.684916Z","title":"Learning a structured optimal bipartite graph for co-clustering,","venue":null,"work_id":"01a501ae-1096-468a-a621-200eb2c032ea","year":2017},"citing_paper":{"arxiv_id":"2505.08594","last_updated":"2025-05-13T14:06:13Z","snapshot_observed_at":"2026-08-15T21:48:34.679887Z","submitted_at":"2025-05-13T14:06:13Z","title":"Clustering of Incomplete Data via a Bipartite Graph Structure","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-15T21:55:51.508768Z"},"links":{"citing_paper":"/paper/2505.08594"},"observation_digest":"sha256:1cb9cbf08233bceafece9c7055e090808f708597c9213f87a6b9f0abe8f0fc82","observation_id":"bc0e9094-95bc-48f0-a48c-983b158ceda4","resolution":{"observed_at":"2026-08-15T21:55:51.689462Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T21:55:51.671983Z","title":"Learning Bipartite Graphs: Heavy Tails and Multiple Components,","venue":null,"work_id":"1912dff1-a6de-44e5-9bd0-f3fc7e6bfc6c","year":2022},"citing_paper":{"arxiv_id":"2505.08594","last_updated":"2025-05-13T14:06:13Z","snapshot_observed_at":"2026-08-15T21:48:34.679887Z","submitted_at":"2025-05-13T14:06:13Z","title":"Clustering of Incomplete Data via a Bipartite Graph Structure","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-15T21:55:51.512736Z"},"links":{"citing_paper":"/paper/2505.08594"},"observation_digest":"sha256:e3fb0e9c159c9ef6fd1b27a2500f5ca20d4cd6c2d9c664d76d6decd1a8df1128","observation_id":"bf9a5768-fe03-401c-a77d-91c337d04b0c","resolution":{"observed_at":"2026-08-15T21:55:51.676132Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T21:55:51.516465Z","title":"Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers,","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2505.08594","last_updated":"2025-05-13T14:06:13Z","snapshot_observed_at":"2026-08-15T21:48:34.679887Z","submitted_at":"2025-05-13T14:06:13Z","title":"Clustering of Incomplete Data via a Bipartite Graph Structure","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-15T21:55:51.516465Z"},"links":{"citing_paper":"/paper/2505.08594"},"observation_digest":"sha256:f7661baec06bf57d7aaf14b2b235d4b9a4ead9794c905513e6379cb600e4559d","observation_id":"60de74d1-4811-4120-ac47-e5737d961081","resolution":{"observed_at":"2026-08-15T21:55:51.516465Z","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-15T21:55:51.520458Z","title":"Majorization-Minimization Algo- rithms in Signal Processing, Communications, and Machine Learning,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2505.08594","last_updated":"2025-05-13T14:06:13Z","snapshot_observed_at":"2026-08-15T21:48:34.679887Z","submitted_at":"2025-05-13T14:06:13Z","title":"Clustering of Incomplete Data via a Bipartite Graph Structure","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-15T21:55:51.520458Z"},"links":{"citing_paper":"/paper/2505.08594"},"observation_digest":"sha256:0665546e2d1d6382534136242050f063390e115b5ff3257bfea60fd66afe8a93","observation_id":"624ffd9d-f911-4854-bcbb-391d8df1e56a","resolution":{"observed_at":"2026-08-15T21:55:51.520458Z","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-15T21:55:51.641747Z","title":"Boyd and L","venue":null,"work_id":"c981cfbb-2738-4873-b32a-8c30136774b7","year":2004},"citing_paper":{"arxiv_id":"2505.08594","last_updated":"2025-05-13T14:06:13Z","snapshot_observed_at":"2026-08-15T21:48:34.679887Z","submitted_at":"2025-05-13T14:06:13Z","title":"Clustering of Incomplete Data via a Bipartite Graph Structure","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-15T21:55:51.524421Z"},"links":{"citing_paper":"/paper/2505.08594"},"observation_digest":"sha256:e14fad9db2ec89a28185058844ef81f0cc1b728356db8f492b2815ae9f95f7d9","observation_id":"437724f1-477f-49d0-9224-10bbab32f9af","resolution":{"observed_at":"2026-08-15T21:55:51.645847Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T21:55:51.628446Z","title":"Graphical Models in Heavy-Tailed Markets,","venue":null,"work_id":"e8bb49e7-9217-46c7-affa-36f62c341599","year":2021},"citing_paper":{"arxiv_id":"2505.08594","last_updated":"2025-05-13T14:06:13Z","snapshot_observed_at":"2026-08-15T21:48:34.679887Z","submitted_at":"2025-05-13T14:06:13Z","title":"Clustering of Incomplete Data via a Bipartite Graph Structure","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-15T21:55:51.528389Z"},"links":{"citing_paper":"/paper/2505.08594"},"observation_digest":"sha256:a29641ef93390345a34eea46889b125663b769f98cd092a9c6b860f2549b8cd0","observation_id":"3efa9f79-752e-48b9-91fc-2effe6f911eb","resolution":{"observed_at":"2026-08-15T21:55:51.632791Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T21:55:51.532232Z","title":"Everitt, Ed., Cluster analysis , Wiley series in probability and statistics","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2505.08594","last_updated":"2025-05-13T14:06:13Z","snapshot_observed_at":"2026-08-15T21:48:34.679887Z","submitted_at":"2025-05-13T14:06:13Z","title":"Clustering of Incomplete Data via a Bipartite Graph Structure","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-15T21:55:51.532232Z"},"links":{"citing_paper":"/paper/2505.08594"},"observation_digest":"sha256:061f040458d9404bfc03a56d0522d9d90caff7f191fcf9c05a182cb9e53d0336","observation_id":"40bad3ce-6b3d-456a-8aa8-089614c018e8","resolution":{"observed_at":"2026-08-15T21:55:51.532232Z","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-15T21:55:51.537257Z","title":"Modularity and community structure in networks,","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2505.08594","last_updated":"2025-05-13T14:06:13Z","snapshot_observed_at":"2026-08-15T21:48:34.679887Z","submitted_at":"2025-05-13T14:06:13Z","title":"Clustering of Incomplete Data via a Bipartite Graph Structure","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-15T21:55:51.537257Z"},"links":{"citing_paper":"/paper/2505.08594"},"observation_digest":"sha256:a37e5e6456566abc18e5a903e804372457ffa9c5d331225f3c6775306462416b","observation_id":"210eff19-ea3f-4f7a-a522-f63cd26643a4","resolution":{"observed_at":"2026-08-15T21:55:51.537257Z","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-15T21:55:51.541043Z","title":"Objective Criteria for the Evaluation of Clustering Methods,","venue":null,"work_id":null,"year":1971},"citing_paper":{"arxiv_id":"2505.08594","last_updated":"2025-05-13T14:06:13Z","snapshot_observed_at":"2026-08-15T21:48:34.679887Z","submitted_at":"2025-05-13T14:06:13Z","title":"Clustering of Incomplete Data via a Bipartite Graph Structure","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-15T21:55:51.541043Z"},"links":{"citing_paper":"/paper/2505.08594"},"observation_digest":"sha256:dd4422c8352d799bbde3015637d5bfc9f3c86ddc5ace39d01e2658158a365916","observation_id":"5f73343c-d954-4e30-b36c-2c0b0c4d6158","resolution":{"observed_at":"2026-08-15T21:55:51.541043Z","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-15T21:55:51.587524Z","title":"A dendrite method for cluster analysis,","venue":null,"work_id":"1b23f5d0-7400-43bd-a5fa-2986283f7f02","year":1974},"citing_paper":{"arxiv_id":"2505.08594","last_updated":"2025-05-13T14:06:13Z","snapshot_observed_at":"2026-08-15T21:48:34.679887Z","submitted_at":"2025-05-13T14:06:13Z","title":"Clustering of Incomplete Data via a Bipartite Graph Structure","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-15T21:55:51.544793Z"},"links":{"citing_paper":"/paper/2505.08594"},"observation_digest":"sha256:e74daa1e76da612e3ca18481117e1f354d212eb15e654df7cc1760d85d2bfe2e","observation_id":"7d4390ab-1b75-40b4-9560-3f773b684768","resolution":{"observed_at":"2026-08-15T21:55:51.593460Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2505.08594","last_updated":"2025-05-13T14:06:13Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-15T21:48:34.679887Z","submitted_at":"2025-05-13T14:06:13Z","title":"Clustering of Incomplete Data via a Bipartite Graph Structure"},"reference_resolution":{"displayed":31,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":15,"verified_exact":0,"verified_fuzzy":16},"total_outbound_references":31},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 31 of 31 outbound references and 0 inbound Pith citation observations for arXiv:2505.08594."}