{"as_of":"2026-08-23T21:13:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:eb8ed72af67f6d362a66ba826ced42c63b9f713f8bc813c6158714e3cf7d0b26","coverage":[{"denominator":36,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":36,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T21:53:52.676358Z","state":"measured"},{"denominator":36,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":36,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-23T06:30:58.430688+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2412.04082/citation-record","integrity":"/paper/2412.04082/integrity","json":"/paper/2412.04082/citation-record.json","paper":"/paper/2412.04082"},"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-11T21:53:53.103039Z","title":"Learning the parts of objects by non-negative matrix factorization,","venue":null,"work_id":"239e28c1-7f7b-4159-8369-6ee3bcf8b192","year":1999},"citing_paper":{"arxiv_id":"2412.04082","last_updated":"2024-12-05T11:32:53Z","snapshot_observed_at":"2026-08-19T12:25:57.970037Z","submitted_at":"2024-12-05T11:32:53Z","title":"Learnable Similarity and Dissimilarity Guided Symmetric Non-Negative Matrix Factorization","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-11T21:53:52.528582Z"},"links":{"citing_paper":"/paper/2412.04082"},"observation_digest":"sha256:269ac76de475a8e033a86ef7752cb1ad39306dc61f7ebdaace4594a65800358f","observation_id":"efa476ae-6fad-4614-82f4-d2efd4904d0a","resolution":{"observed_at":"2026-08-11T21:53:53.107165Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-11T21:53:53.090597Z","title":"Algorithms for non-negative matrix factorization,","venue":null,"work_id":"18cfdfa9-906a-4a5e-bdc9-bbc3dbc88626","year":2000},"citing_paper":{"arxiv_id":"2412.04082","last_updated":"2024-12-05T11:32:53Z","snapshot_observed_at":"2026-08-19T12:25:57.970037Z","submitted_at":"2024-12-05T11:32:53Z","title":"Learnable Similarity and Dissimilarity Guided Symmetric Non-Negative Matrix Factorization","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-11T21:53:52.533670Z"},"links":{"citing_paper":"/paper/2412.04082"},"observation_digest":"sha256:eb357478c2b438ae6ab72eb4d0c14d8f72f217483cbbee80dbb15c21966d9800","observation_id":"dbbee9b3-f799-49c5-9f1f-560200fead50","resolution":{"observed_at":"2026-08-11T21:53:53.094732Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-11T21:53:53.078889Z","title":"Document cluster- ing using nonnegative matrix factorization,","venue":null,"work_id":"a451f6a8-30a9-45c2-9df7-6bf2921d6935","year":2006},"citing_paper":{"arxiv_id":"2412.04082","last_updated":"2024-12-05T11:32:53Z","snapshot_observed_at":"2026-08-19T12:25:57.970037Z","submitted_at":"2024-12-05T11:32:53Z","title":"Learnable Similarity and Dissimilarity Guided Symmetric Non-Negative Matrix Factorization","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-11T21:53:52.539039Z"},"links":{"citing_paper":"/paper/2412.04082"},"observation_digest":"sha256:5047fca1f8ca05c1dc839585c6a9f8cb7efe073d884420c2cbbdb079577f62db","observation_id":"dfb06e96-8f6e-4ac1-80bf-346863c620da","resolution":{"observed_at":"2026-08-11T21:53:53.082956Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-11T21:53:53.067139Z","title":"Document clustering based on nonnegative sparse matrix factorization,","venue":null,"work_id":"b5def4ea-db1d-48e5-a7f9-64d33615d4a1","year":2005},"citing_paper":{"arxiv_id":"2412.04082","last_updated":"2024-12-05T11:32:53Z","snapshot_observed_at":"2026-08-19T12:25:57.970037Z","submitted_at":"2024-12-05T11:32:53Z","title":"Learnable Similarity and Dissimilarity Guided Symmetric Non-Negative Matrix Factorization","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-11T21:53:52.544139Z"},"links":{"citing_paper":"/paper/2412.04082"},"observation_digest":"sha256:fc3ec3b1a096cd8aafe1a2f824c84fe5c2aeaa24e5a395ea5579893ef995749d","observation_id":"43f32ffa-f15a-4992-a62f-3725ab2816f3","resolution":{"observed_at":"2026-08-11T21:53:53.071448Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-11T21:53:53.056064Z","title":"Nonnegative ma- trix factorization with mixed hypergraph regularization for community detection,","venue":null,"work_id":"f0228e92-0aa8-4232-b9a3-c8e2d667d316","year":2018},"citing_paper":{"arxiv_id":"2412.04082","last_updated":"2024-12-05T11:32:53Z","snapshot_observed_at":"2026-08-19T12:25:57.970037Z","submitted_at":"2024-12-05T11:32:53Z","title":"Learnable Similarity and Dissimilarity Guided Symmetric Non-Negative Matrix Factorization","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-11T21:53:52.549234Z"},"links":{"citing_paper":"/paper/2412.04082"},"observation_digest":"sha256:7d722a4dd952790302a4af49c871383763d50f270d5d83c282dea6c5bf55fe1d","observation_id":"7cd7dfb9-e9bf-405c-ac50-75bec584ea49","resolution":{"observed_at":"2026-08-11T21:53:53.059946Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-11T21:53:52.553807Z","title":"Nonnegative matrix factorization: A comprehensive review,","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2412.04082","last_updated":"2024-12-05T11:32:53Z","snapshot_observed_at":"2026-08-19T12:25:57.970037Z","submitted_at":"2024-12-05T11:32:53Z","title":"Learnable Similarity and Dissimilarity Guided Symmetric Non-Negative Matrix Factorization","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-11T21:53:52.553807Z"},"links":{"citing_paper":"/paper/2412.04082"},"observation_digest":"sha256:f0cfe2664e233dc6febf42372f527c2d917fc596fe4fea601b3cc8ba2504e6d4","observation_id":"4eba1280-edd4-4dcb-99f8-4b923297520b","resolution":{"observed_at":"2026-08-11T21:53:52.553807Z","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-11T21:53:53.038277Z","title":"Symnmf: nonnegative low-rank approximation of a similarity matrix for graph clustering,","venue":null,"work_id":"36c89305-31d6-42fa-b608-e25704b3568e","year":2015},"citing_paper":{"arxiv_id":"2412.04082","last_updated":"2024-12-05T11:32:53Z","snapshot_observed_at":"2026-08-19T12:25:57.970037Z","submitted_at":"2024-12-05T11:32:53Z","title":"Learnable Similarity and Dissimilarity Guided Symmetric Non-Negative Matrix Factorization","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-11T21:53:52.558419Z"},"links":{"citing_paper":"/paper/2412.04082"},"observation_digest":"sha256:705052f365a4d4baeab4f1ad01b3a05cba20b78155bb1b14bf63989a2651b258","observation_id":"8a994d63-001b-486c-81bb-2c6411a85648","resolution":{"observed_at":"2026-08-11T21:53:53.042717Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-11T21:53:53.026740Z","title":"On the equivalence of nonnegative matrix factorization and spectral clustering,","venue":null,"work_id":"49953e90-20d2-464d-9c2d-a4bb7464b1aa","year":2005},"citing_paper":{"arxiv_id":"2412.04082","last_updated":"2024-12-05T11:32:53Z","snapshot_observed_at":"2026-08-19T12:25:57.970037Z","submitted_at":"2024-12-05T11:32:53Z","title":"Learnable Similarity and Dissimilarity Guided Symmetric Non-Negative Matrix Factorization","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-11T21:53:52.563287Z"},"links":{"citing_paper":"/paper/2412.04082"},"observation_digest":"sha256:c5ffa8b8354f56a54a1877926c381fe930a0e7a9c03786c6728710085a2f3d20","observation_id":"133d0df5-e29d-4a16-8ad4-000436826dfb","resolution":{"observed_at":"2026-08-11T21:53:53.030652Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-11T21:53:53.016090Z","title":"Relational clustering by symmetric convex coding,","venue":null,"work_id":"192b17f1-7d32-4645-bbdb-01841ff9aa17","year":2007},"citing_paper":{"arxiv_id":"2412.04082","last_updated":"2024-12-05T11:32:53Z","snapshot_observed_at":"2026-08-19T12:25:57.970037Z","submitted_at":"2024-12-05T11:32:53Z","title":"Learnable Similarity and Dissimilarity Guided Symmetric Non-Negative Matrix Factorization","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-11T21:53:52.567744Z"},"links":{"citing_paper":"/paper/2412.04082"},"observation_digest":"sha256:831011142fb59372688706507c73ee893b3e32921717fe5c27d77cc7d2cfda97","observation_id":"5a41d919-e49a-4f84-9e5f-bfde5cbcc1f8","resolution":{"observed_at":"2026-08-11T21:53:53.019823Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-11T21:53:53.004324Z","title":"Symmetric nonnegative matrix factorization for graph clustering,","venue":null,"work_id":"c8883401-0adb-48c1-9b26-096be6aeb115","year":2012},"citing_paper":{"arxiv_id":"2412.04082","last_updated":"2024-12-05T11:32:53Z","snapshot_observed_at":"2026-08-19T12:25:57.970037Z","submitted_at":"2024-12-05T11:32:53Z","title":"Learnable Similarity and Dissimilarity Guided Symmetric Non-Negative Matrix Factorization","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-11T21:53:52.571637Z"},"links":{"citing_paper":"/paper/2412.04082"},"observation_digest":"sha256:f7a30cdf389a90c97182780ccbc0cb4f555875789d372c58fae6f6b81d86132f","observation_id":"db0b5eb9-b2fd-41a5-a2be-c8fa0f6eaf95","resolution":{"observed_at":"2026-08-11T21:53:53.008635Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-11T21:53:52.992590Z","title":"Pairwise constraint propagation- induced symmetric nonnegative matrix factorization,","venue":null,"work_id":"c39fa86e-b1d7-45c6-92d1-ffd142391e76","year":2018},"citing_paper":{"arxiv_id":"2412.04082","last_updated":"2024-12-05T11:32:53Z","snapshot_observed_at":"2026-08-19T12:25:57.970037Z","submitted_at":"2024-12-05T11:32:53Z","title":"Learnable Similarity and Dissimilarity Guided Symmetric Non-Negative Matrix Factorization","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-11T21:53:52.575362Z"},"links":{"citing_paper":"/paper/2412.04082"},"observation_digest":"sha256:7fcab0b1de3466deb65b543796b7980e29360f3f3e5df17e7b602f905e9419b6","observation_id":"0b8882db-098b-4842-8538-7a1820c83221","resolution":{"observed_at":"2026-08-11T21:53:52.996706Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-11T21:53:52.980919Z","title":"Self-tuning spectral clustering,","venue":null,"work_id":"c91458ec-9c36-4d12-9a40-219de85498e4","year":2004},"citing_paper":{"arxiv_id":"2412.04082","last_updated":"2024-12-05T11:32:53Z","snapshot_observed_at":"2026-08-19T12:25:57.970037Z","submitted_at":"2024-12-05T11:32:53Z","title":"Learnable Similarity and Dissimilarity Guided Symmetric Non-Negative Matrix Factorization","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-11T21:53:52.579777Z"},"links":{"citing_paper":"/paper/2412.04082"},"observation_digest":"sha256:0ed88587285a376d2c1f5a3c6265a68ab99f5075df088ae9eb2d7b0daeb25818","observation_id":"41c63020-13b4-4135-9263-a28319505b72","resolution":{"observed_at":"2026-08-11T21:53:52.984926Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-11T21:53:52.583395Z","title":"A tutorial on spectral clustering,","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2412.04082","last_updated":"2024-12-05T11:32:53Z","snapshot_observed_at":"2026-08-19T12:25:57.970037Z","submitted_at":"2024-12-05T11:32:53Z","title":"Learnable Similarity and Dissimilarity Guided Symmetric Non-Negative Matrix Factorization","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-11T21:53:52.583395Z"},"links":{"citing_paper":"/paper/2412.04082"},"observation_digest":"sha256:5adb2815b58c0b4dac735ce92ff09d9d4dd48f26326cb824c8e1c44a9cd71000","observation_id":"00b0f356-dd00-4c61-9390-da55b2bdc08d","resolution":{"observed_at":"2026-08-11T21:53:52.583395Z","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-11T21:53:52.950798Z","title":"Clustering and projected clustering with adaptive neighbors,","venue":null,"work_id":"2cc80350-b6f2-4391-add5-76dd005ddec8","year":2014},"citing_paper":{"arxiv_id":"2412.04082","last_updated":"2024-12-05T11:32:53Z","snapshot_observed_at":"2026-08-19T12:25:57.970037Z","submitted_at":"2024-12-05T11:32:53Z","title":"Learnable Similarity and Dissimilarity Guided Symmetric Non-Negative Matrix Factorization","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-11T21:53:52.590931Z"},"links":{"citing_paper":"/paper/2412.04082"},"observation_digest":"sha256:fd1742b4d53aed373ed47f246e42ea7db684948f660798121c669c4957177b9a","observation_id":"95911ef5-e0c7-439f-8001-dcfa032e37eb","resolution":{"observed_at":"2026-08-11T21:53:52.955019Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-11T21:53:52.939755Z","title":"Nonnegative matrix factorization with adaptive neighbors,","venue":null,"work_id":"2cac347a-9c03-4fd1-af40-21c7e9fb46b7","year":2017},"citing_paper":{"arxiv_id":"2412.04082","last_updated":"2024-12-05T11:32:53Z","snapshot_observed_at":"2026-08-19T12:25:57.970037Z","submitted_at":"2024-12-05T11:32:53Z","title":"Learnable Similarity and Dissimilarity Guided Symmetric Non-Negative Matrix Factorization","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-11T21:53:52.595542Z"},"links":{"citing_paper":"/paper/2412.04082"},"observation_digest":"sha256:b700505d45deb9248b6be3d1968e8a7538a02557cc9cebb535026b9481e27162","observation_id":"6c99599a-d9e1-487a-a6ed-6c4fff131d8b","resolution":{"observed_at":"2026-08-11T21:53:52.943363Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-11T21:53:52.929245Z","title":"Robust bi-stochastic graph regularized matrix factorization for data clustering,","venue":null,"work_id":"536cbb42-8228-4d12-8f5d-53f3e0432e6b","year":2022},"citing_paper":{"arxiv_id":"2412.04082","last_updated":"2024-12-05T11:32:53Z","snapshot_observed_at":"2026-08-19T12:25:57.970037Z","submitted_at":"2024-12-05T11:32:53Z","title":"Learnable Similarity and Dissimilarity Guided Symmetric Non-Negative Matrix Factorization","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-11T21:53:52.599511Z"},"links":{"citing_paper":"/paper/2412.04082"},"observation_digest":"sha256:4f0aedafa64acd26ca8ef5ae921a641eb3b40def43b3c87f454eaa4f1539bb51","observation_id":"c866423f-7b83-449c-afbb-36849a927e84","resolution":{"observed_at":"2026-08-11T21:53:52.933051Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-11T21:53:52.917380Z","title":"Clustering-aware graph con- struction: A joint learning perspective,","venue":null,"work_id":"5dce8e03-377e-42ba-bae0-747b2514178c","year":2020},"citing_paper":{"arxiv_id":"2412.04082","last_updated":"2024-12-05T11:32:53Z","snapshot_observed_at":"2026-08-19T12:25:57.970037Z","submitted_at":"2024-12-05T11:32:53Z","title":"Learnable Similarity and Dissimilarity Guided Symmetric Non-Negative Matrix Factorization","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-11T21:53:52.603115Z"},"links":{"citing_paper":"/paper/2412.04082"},"observation_digest":"sha256:b0fe95994cdd86b96275b8d40be6ba3db9effd8ea02308a3087d175239cd7bf5","observation_id":"304c1301-a5dd-4f5c-a415-6fecd82395e2","resolution":{"observed_at":"2026-08-11T21:53:52.921495Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-11T21:53:52.962088Z","title":"Semisupervised adaptive symmetric non-negative matrix factorization,","venue":null,"work_id":"c9190318-67ed-463e-9628-4ebfcf0b074d","year":2021},"citing_paper":{"arxiv_id":"2412.04082","last_updated":"2024-12-05T11:32:53Z","snapshot_observed_at":"2026-08-19T12:25:57.970037Z","submitted_at":"2024-12-05T11:32:53Z","title":"Learnable Similarity and Dissimilarity Guided Symmetric Non-Negative Matrix Factorization","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-11T21:53:52.607316Z"},"links":{"citing_paper":"/paper/2412.04082"},"observation_digest":"sha256:dc22cba39457eba0c89e872feb07f966ca22ea0a7c150fd080624afe082057c5","observation_id":"a0f993f8-9fb2-4164-bfec-020d3ee4a9a2","resolution":{"observed_at":"2026-08-11T21:53:52.966050Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-11T21:53:52.906106Z","title":"Pairwise constraint propagation with dual adversarial manifold regularization,","venue":null,"work_id":"585da79c-c8ab-4158-beec-7562a9549f25","year":2020},"citing_paper":{"arxiv_id":"2412.04082","last_updated":"2024-12-05T11:32:53Z","snapshot_observed_at":"2026-08-19T12:25:57.970037Z","submitted_at":"2024-12-05T11:32:53Z","title":"Learnable Similarity and Dissimilarity Guided Symmetric Non-Negative Matrix Factorization","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-11T21:53:52.611971Z"},"links":{"citing_paper":"/paper/2412.04082"},"observation_digest":"sha256:473237280bf651a02dd69c8c818eaf77002ef8c554a03db9790ee9a2b0fa90e9","observation_id":"cee5ec62-992e-48d9-8c7c-fe28bb4fb969","resolution":{"observed_at":"2026-08-11T21:53:52.910559Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.02688","last_updated":"2024-10-27T08:23:08Z","snapshot_observed_at":"2026-08-16T13:55:24.740806Z","submitted_at":"2024-05-04T14:58:47Z","title":"Semi-supervised Symmetric Non-negative Matrix Factorization with Low-Rank Tensor Representation","version":2},"cited_work":{"arxiv_id":"2405.02688","doi":null,"metadata_source":"pith","pith_arxiv_id":"2405.02688","snapshot_observed_at":"2026-08-11T21:53:52.738768Z","title":"Semi-supervised Symmetric Non-negative Matrix Factorization with Low-Rank Tensor Representation","venue":"cs.LG","work_id":"b3407620-3a42-4da8-9c8b-63ecbe620095","year":2024},"citing_paper":{"arxiv_id":"2412.04082","last_updated":"2024-12-05T11:32:53Z","snapshot_observed_at":"2026-08-19T12:25:57.970037Z","submitted_at":"2024-12-05T11:32:53Z","title":"Learnable Similarity and Dissimilarity Guided Symmetric Non-Negative Matrix Factorization","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-11T21:53:52.615608Z"},"links":{"cited_paper":"/paper/2405.02688","citing_paper":"/paper/2412.04082"},"observation_digest":"sha256:ae64f191e987b94f5f0b0d0332bb4e2b4ef4f40dc2f8c3856dff38b2242b3b3f","observation_id":"e59b4176-d4e9-443d-8835-b13aece7eb81","resolution":{"observed_at":"2026-08-11T21:53:52.745104Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-11T21:53:52.895624Z","title":"Positive and negative label-driven nonnegative matrix factorization,","venue":null,"work_id":"2f4dc604-b14a-4585-9400-48c305005ab8","year":2021},"citing_paper":{"arxiv_id":"2412.04082","last_updated":"2024-12-05T11:32:53Z","snapshot_observed_at":"2026-08-19T12:25:57.970037Z","submitted_at":"2024-12-05T11:32:53Z","title":"Learnable Similarity and Dissimilarity Guided Symmetric Non-Negative Matrix Factorization","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-11T21:53:52.619777Z"},"links":{"citing_paper":"/paper/2412.04082"},"observation_digest":"sha256:f43ff14403774e0e2f53fdc27c7959f337b10b7ed833d66fe2e454d2d4a7e3a4","observation_id":"1adf8bd2-935f-44de-8028-8e033d1413be","resolution":{"observed_at":"2026-08-11T21:53:52.899256Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1605.05349","last_updated":"2016-05-17T20:22:12Z","snapshot_observed_at":"2026-08-14T21:56:57.804672Z","submitted_at":"2016-05-17T20:22:12Z","title":"Orthogonal symmetric non-negative matrix factorization under the stochastic block model","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1605.05349","snapshot_observed_at":"2026-08-11T21:53:52.623453Z","title":"Orthogonal symmetric non-negative ma- trix factorization under the stochastic block model,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2412.04082","last_updated":"2024-12-05T11:32:53Z","snapshot_observed_at":"2026-08-19T12:25:57.970037Z","submitted_at":"2024-12-05T11:32:53Z","title":"Learnable Similarity and Dissimilarity Guided Symmetric Non-Negative Matrix Factorization","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-11T21:53:52.623453Z"},"links":{"cited_paper":"/paper/1605.05349","citing_paper":"/paper/2412.04082"},"observation_digest":"sha256:6b2f01098f94ebc9eadb5652a99410b4bf8dcd12094b170964058c6bb161bf85","observation_id":"4fb5e21b-702d-4a30-bc95-af4d120239f4","resolution":{"observed_at":"2026-08-11T21:53:52.623453Z","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-11T21:53:52.883763Z","title":"Two algorithms for orthogonal nonnegative matrix factorization with application to clustering,","venue":null,"work_id":"dca72de5-67e1-4cd6-aac6-4abc61e67fca","year":2014},"citing_paper":{"arxiv_id":"2412.04082","last_updated":"2024-12-05T11:32:53Z","snapshot_observed_at":"2026-08-19T12:25:57.970037Z","submitted_at":"2024-12-05T11:32:53Z","title":"Learnable Similarity and Dissimilarity Guided Symmetric Non-Negative Matrix Factorization","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-11T21:53:52.627286Z"},"links":{"citing_paper":"/paper/2412.04082"},"observation_digest":"sha256:91a097801dbddfd37770aff029161a582904717a11f215d4cc48aec8784c6302","observation_id":"89484ab6-5320-43cc-ae6e-271bbdb85c02","resolution":{"observed_at":"2026-08-11T21:53:52.888282Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-11T21:53:52.871932Z","title":"Orthogonal nonnegative matrix t- factorizations for clustering,","venue":null,"work_id":"09f94da4-6f8e-4105-8590-9029d8df4bbf","year":2006},"citing_paper":{"arxiv_id":"2412.04082","last_updated":"2024-12-05T11:32:53Z","snapshot_observed_at":"2026-08-19T12:25:57.970037Z","submitted_at":"2024-12-05T11:32:53Z","title":"Learnable Similarity and Dissimilarity Guided Symmetric Non-Negative Matrix Factorization","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-11T21:53:52.630942Z"},"links":{"citing_paper":"/paper/2412.04082"},"observation_digest":"sha256:9be4e0e65f086d72aef92cd45f391eb238f2a8f98bdc1cff76bc41765847c361","observation_id":"7f720190-007c-4b87-9fb2-a1ecde308f1d","resolution":{"observed_at":"2026-08-11T21:53:52.876650Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-11T21:53:52.860789Z","title":"Clustering by orthogonal nmf model and non-convex penalty optimization,","venue":null,"work_id":"2989d4b0-082c-495a-8d2d-019ef60a63a8","year":2021},"citing_paper":{"arxiv_id":"2412.04082","last_updated":"2024-12-05T11:32:53Z","snapshot_observed_at":"2026-08-19T12:25:57.970037Z","submitted_at":"2024-12-05T11:32:53Z","title":"Learnable Similarity and Dissimilarity Guided Symmetric Non-Negative Matrix Factorization","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-11T21:53:52.634644Z"},"links":{"citing_paper":"/paper/2412.04082"},"observation_digest":"sha256:1a463b6ab711986be58bb99ca26ab50e332cb88f934a0706f2304703be3fb792","observation_id":"08ecfb7b-b771-446c-aa81-636ec5b26756","resolution":{"observed_at":"2026-08-11T21:53:52.864941Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-11T21:53:52.849814Z","title":"Two efficient algorithms for ap- proximately orthogonal nonnegative matrix factorization,","venue":null,"work_id":"e9f5a1e1-07a7-48dc-aeb3-3e2ed90b43f7","year":2015},"citing_paper":{"arxiv_id":"2412.04082","last_updated":"2024-12-05T11:32:53Z","snapshot_observed_at":"2026-08-19T12:25:57.970037Z","submitted_at":"2024-12-05T11:32:53Z","title":"Learnable Similarity and Dissimilarity Guided Symmetric Non-Negative Matrix Factorization","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-11T21:53:52.638331Z"},"links":{"citing_paper":"/paper/2412.04082"},"observation_digest":"sha256:11e5fa39442302122e9242e8d610f109229ed094cd91334d59e20d84dae11928","observation_id":"6595a1e0-1f87-4f57-804f-e23c6661a226","resolution":{"observed_at":"2026-08-11T21:53:52.853842Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-11T21:53:52.839140Z","title":"Large-cone nonnegative matrix factor- ization,","venue":null,"work_id":"15abd03d-371d-4f11-8c5d-0d63cbb01e38","year":2017},"citing_paper":{"arxiv_id":"2412.04082","last_updated":"2024-12-05T11:32:53Z","snapshot_observed_at":"2026-08-19T12:25:57.970037Z","submitted_at":"2024-12-05T11:32:53Z","title":"Learnable Similarity and Dissimilarity Guided Symmetric Non-Negative Matrix Factorization","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-11T21:53:52.642245Z"},"links":{"citing_paper":"/paper/2412.04082"},"observation_digest":"sha256:9d571b57dcaae77c4c2ef231f82fa189ec7f0e722340dfd6271a8c2c5285517c","observation_id":"46cd5c37-8e72-4037-8ef7-a4be0be2b855","resolution":{"observed_at":"2026-08-11T21:53:52.842914Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-11T21:53:52.827309Z","title":"A progressive hierarchical alternating least squares method for symmetric nonnegative matrix factorization,","venue":null,"work_id":"4b364e72-7135-4d06-ba47-755f34f2a138","year":2023},"citing_paper":{"arxiv_id":"2412.04082","last_updated":"2024-12-05T11:32:53Z","snapshot_observed_at":"2026-08-19T12:25:57.970037Z","submitted_at":"2024-12-05T11:32:53Z","title":"Learnable Similarity and Dissimilarity Guided Symmetric Non-Negative Matrix Factorization","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-11T21:53:52.645929Z"},"links":{"citing_paper":"/paper/2412.04082"},"observation_digest":"sha256:f19dfac63fd85a6a8aa07ecdd2de146e5c460f674a9b3b6a168c5d80a5af35be","observation_id":"1433f1ca-2ed8-4a86-b93a-8dafa9273566","resolution":{"observed_at":"2026-08-11T21:53:52.831244Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-11T21:53:52.816139Z","title":"Self-supervised symmetric nonnegative matrix factorization,","venue":null,"work_id":"28d3258a-206d-4398-a6b0-609e20d22789","year":2022},"citing_paper":{"arxiv_id":"2412.04082","last_updated":"2024-12-05T11:32:53Z","snapshot_observed_at":"2026-08-19T12:25:57.970037Z","submitted_at":"2024-12-05T11:32:53Z","title":"Learnable Similarity and Dissimilarity Guided Symmetric Non-Negative Matrix Factorization","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-11T21:53:52.649256Z"},"links":{"citing_paper":"/paper/2412.04082"},"observation_digest":"sha256:041d981e7a2c16c5a6eade4e0728251e7b91adf7dbd922e2bfa47c0d0e1ebfaa","observation_id":"a5a22b23-5482-44bd-aeab-9e2683b2607a","resolution":{"observed_at":"2026-08-11T21:53:52.820077Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-11T21:53:52.802928Z","title":"Two fast vector-wise update algorithms for orthogonal nonnegative matrix factorization with sparsity constraint,","venue":null,"work_id":"e31b8ade-69e9-4dfd-b6bd-19881a9a33ea","year":2020},"citing_paper":{"arxiv_id":"2412.04082","last_updated":"2024-12-05T11:32:53Z","snapshot_observed_at":"2026-08-19T12:25:57.970037Z","submitted_at":"2024-12-05T11:32:53Z","title":"Learnable Similarity and Dissimilarity Guided Symmetric Non-Negative Matrix Factorization","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-11T21:53:52.653398Z"},"links":{"citing_paper":"/paper/2412.04082"},"observation_digest":"sha256:b623aae67d236ae40232906576d2c0c6e8ada9f62718fe71b8fb006474caa9b8","observation_id":"e46fbd22-da44-4810-9b49-6e6604b18bd0","resolution":{"observed_at":"2026-08-11T21:53:52.807202Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-11T21:53:52.791350Z","title":"On spectral clustering: Analysis and an algorithm,","venue":null,"work_id":"a53df57b-a518-4ea2-a614-1357b977bbb8","year":2002},"citing_paper":{"arxiv_id":"2412.04082","last_updated":"2024-12-05T11:32:53Z","snapshot_observed_at":"2026-08-19T12:25:57.970037Z","submitted_at":"2024-12-05T11:32:53Z","title":"Learnable Similarity and Dissimilarity Guided Symmetric Non-Negative Matrix Factorization","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-11T21:53:52.656939Z"},"links":{"citing_paper":"/paper/2412.04082"},"observation_digest":"sha256:a77458bc6a905c3324a319ff1d5447d56e9b02275a0530294eecc6bc71046785","observation_id":"cf97bf6d-5977-49bf-bcb9-cdb52839c725","resolution":{"observed_at":"2026-08-11T21:53:52.795519Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1309.1541","last_updated":"2013-09-06T05:48:40Z","snapshot_observed_at":"2026-08-19T12:20:40.074719Z","submitted_at":"2013-09-06T05:48:40Z","title":"Projection onto the probability simplex: An efficient algorithm with a simple proof, and an application","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1309.1541","snapshot_observed_at":"2026-08-11T21:53:52.660735Z","title":"Projection onto the probability simplex: An efficient algorithm with a simple proof, and an application,","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2412.04082","last_updated":"2024-12-05T11:32:53Z","snapshot_observed_at":"2026-08-19T12:25:57.970037Z","submitted_at":"2024-12-05T11:32:53Z","title":"Learnable Similarity and Dissimilarity Guided Symmetric Non-Negative Matrix Factorization","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-11T21:53:52.660735Z"},"links":{"cited_paper":"/paper/1309.1541","citing_paper":"/paper/2412.04082"},"observation_digest":"sha256:f808b7b23ae680fb76b9b96241695ccc78c04d31fb2e7d83ef49f67b70843c9e","observation_id":"398bd212-3082-43fe-9b4b-df728100ff77","resolution":{"observed_at":"2026-08-11T21:53:52.660735Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1710.02812","last_updated":"2019-05-10T09:37:09Z","snapshot_observed_at":"2026-08-20T02:10:17.899534Z","submitted_at":"2017-10-08T09:28:07Z","title":"A Hierarchical Singular Value Decomposition Algorithm for Low Rank Matrices","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1710.02812","snapshot_observed_at":"2026-08-11T21:53:52.664943Z","title":"A hierarchical singular value decomposition algorithm for low rank matrices,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2412.04082","last_updated":"2024-12-05T11:32:53Z","snapshot_observed_at":"2026-08-19T12:25:57.970037Z","submitted_at":"2024-12-05T11:32:53Z","title":"Learnable Similarity and Dissimilarity Guided Symmetric Non-Negative Matrix Factorization","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-11T21:53:52.664943Z"},"links":{"cited_paper":"/paper/1710.02812","citing_paper":"/paper/2412.04082"},"observation_digest":"sha256:6173029e67d8e24cacd7d1d49ea20566fb8832e1cd6be60db1cf4c9824aeabd8","observation_id":"3dafd564-1bc4-42ec-a959-6a9a513e0b53","resolution":{"observed_at":"2026-08-11T21:53:52.664943Z","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-11T21:53:52.778078Z","title":"Dropping symmetry for fast symmetric nonnegative matrix factorization,","venue":null,"work_id":"4dcbb362-5f18-491e-a3f7-ba13c75b343c","year":2018},"citing_paper":{"arxiv_id":"2412.04082","last_updated":"2024-12-05T11:32:53Z","snapshot_observed_at":"2026-08-19T12:25:57.970037Z","submitted_at":"2024-12-05T11:32:53Z","title":"Learnable Similarity and Dissimilarity Guided Symmetric Non-Negative Matrix Factorization","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-11T21:53:52.668943Z"},"links":{"citing_paper":"/paper/2412.04082"},"observation_digest":"sha256:14dfa52446ee86623bcccffc490b8d2f98ede4b6ff07ccce7856e2ec27b01ea5","observation_id":"a39b8c65-7528-4b6e-9b68-339d9e47dc01","resolution":{"observed_at":"2026-08-11T21:53:52.783202Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-11T21:53:52.765821Z","title":"Inexact block coordinate descent methods for symmetric nonnegative matrix factor- ization,","venue":null,"work_id":"baff02c3-9067-4705-92fa-6de0821c1860","year":2017},"citing_paper":{"arxiv_id":"2412.04082","last_updated":"2024-12-05T11:32:53Z","snapshot_observed_at":"2026-08-19T12:25:57.970037Z","submitted_at":"2024-12-05T11:32:53Z","title":"Learnable Similarity and Dissimilarity Guided Symmetric Non-Negative Matrix Factorization","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-11T21:53:52.672798Z"},"links":{"citing_paper":"/paper/2412.04082"},"observation_digest":"sha256:eb3cd7ef291d1099c89dc4769a3dc81e2f52cef116c8068d58163b1b6b25199a","observation_id":"5fbb5be6-2797-4179-a1f7-f2719caeff9f","resolution":{"observed_at":"2026-08-11T21:53:52.769993Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-11T21:53:52.753608Z","title":"Graph regularized symmetric non-negative matrix factorization for graph clustering,","venue":null,"work_id":"246ee4ee-bdf8-440d-9a0c-c702cfbe5b60","year":2018},"citing_paper":{"arxiv_id":"2412.04082","last_updated":"2024-12-05T11:32:53Z","snapshot_observed_at":"2026-08-19T12:25:57.970037Z","submitted_at":"2024-12-05T11:32:53Z","title":"Learnable Similarity and Dissimilarity Guided Symmetric Non-Negative Matrix Factorization","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-11T21:53:52.676358Z"},"links":{"citing_paper":"/paper/2412.04082"},"observation_digest":"sha256:bacc6a1cc8acbc94ebdb67194588632fa300bdd6db784d779fd9bfd665a4821d","observation_id":"5177fd0f-fa12-4ca8-b623-9d89c078b61c","resolution":{"observed_at":"2026-08-11T21:53:52.757881Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2412.04082","last_updated":"2024-12-05T11:32:53Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-19T12:25:57.970037Z","submitted_at":"2024-12-05T11:32:53Z","title":"Learnable Similarity and Dissimilarity Guided Symmetric Non-Negative Matrix Factorization"},"reference_resolution":{"displayed":36,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":5,"verified_exact":1,"verified_fuzzy":30},"total_outbound_references":36},"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-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"thesis":"As of 23 August 2026, this Paper Citation Record lists 36 of 36 outbound references and 0 inbound Pith citation observations for arXiv:2412.04082."}