{"as_of":"2026-08-07T21:27:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:06379254c33c400d363c61dea5e1bc78b27cb92c300163cd0b9e699163d98f1d","coverage":[{"denominator":43,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":43,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T16:24:08.806495Z","state":"measured"},{"denominator":43,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":43,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+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/2507.13765/citation-record","integrity":"/paper/2507.13765/integrity","json":"/paper/2507.13765/citation-record.json","paper":"/paper/2507.13765"},"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-06T16:24:11.295676Z","title":null,"venue":null,"work_id":"2cfd99cb-d301-4cb0-a613-c68f7b75097b","year":2020},"citing_paper":{"arxiv_id":"2507.13765","last_updated":"2025-07-18T09:17:04Z","snapshot_observed_at":"2026-08-07T03:05:57.815310Z","submitted_at":"2025-07-18T09:17:04Z","title":"Dual-Center Graph Clustering with Neighbor Distribution","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T16:24:05.178693Z"},"links":{"citing_paper":"/paper/2507.13765"},"observation_digest":"sha256:56acbb43b1d9a1343e9120c41291286bee1ee2c3fe277c2431610bf4d352c2c8","observation_id":"71509498-0b1d-4bee-8e89-b7f95ff892c5","resolution":{"observed_at":"2026-08-06T16:24:11.300052Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T16:24:11.279711Z","title":null,"venue":null,"work_id":"87ca871c-4a21-4326-ac6f-8d160cb1ae2d","year":2020},"citing_paper":{"arxiv_id":"2507.13765","last_updated":"2025-07-18T09:17:04Z","snapshot_observed_at":"2026-08-07T03:05:57.815310Z","submitted_at":"2025-07-18T09:17:04Z","title":"Dual-Center Graph Clustering with Neighbor Distribution","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T16:24:05.249077Z"},"links":{"citing_paper":"/paper/2507.13765"},"observation_digest":"sha256:1645a8ab6ef8b4f55752055b619f1d9b8e4191e41d93659f286843fd92aabd46","observation_id":"0d40a491-5dd4-4c18-b208-37508cb85f20","resolution":{"observed_at":"2026-08-06T16:24:11.284822Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T16:24:11.264433Z","title":null,"venue":null,"work_id":"05f07e52-1d84-43d3-8d0a-4c1b334247bf","year":2020},"citing_paper":{"arxiv_id":"2507.13765","last_updated":"2025-07-18T09:17:04Z","snapshot_observed_at":"2026-08-07T03:05:57.815310Z","submitted_at":"2025-07-18T09:17:04Z","title":"Dual-Center Graph Clustering with Neighbor Distribution","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T16:24:05.343456Z"},"links":{"citing_paper":"/paper/2507.13765"},"observation_digest":"sha256:54612f70542ef6521fa230b160c4ab23f8f0131640c2416da1cb77a419a968c1","observation_id":"7342aaec-5ce6-4fb1-b100-05a01da18d1c","resolution":{"observed_at":"2026-08-06T16:24:11.268736Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T16:24:11.249614Z","title":null,"venue":null,"work_id":"0557c54d-3965-4fb1-a97a-07b85a76e42f","year":2021},"citing_paper":{"arxiv_id":"2507.13765","last_updated":"2025-07-18T09:17:04Z","snapshot_observed_at":"2026-08-07T03:05:57.815310Z","submitted_at":"2025-07-18T09:17:04Z","title":"Dual-Center Graph Clustering with Neighbor Distribution","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T16:24:05.411536Z"},"links":{"citing_paper":"/paper/2507.13765"},"observation_digest":"sha256:647dab6138a197bee0dd55a45a044e2a10b0d09cd2df28b80120c0b79a4f60dc","observation_id":"1178a072-4140-4767-8a95-0d412fc32ffb","resolution":{"observed_at":"2026-08-06T16:24:11.253911Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2104.08821","last_updated":"2022-05-18T12:29:49Z","snapshot_observed_at":"2026-07-06T11:01:05.577957Z","submitted_at":"2021-04-18T11:27:08Z","title":"SimCSE: Simple Contrastive Learning of Sentence Embeddings","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2104.08821","snapshot_observed_at":"2026-08-06T16:24:05.512533Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2507.13765","last_updated":"2025-07-18T09:17:04Z","snapshot_observed_at":"2026-08-07T03:05:57.815310Z","submitted_at":"2025-07-18T09:17:04Z","title":"Dual-Center Graph Clustering with Neighbor Distribution","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T16:24:05.512533Z"},"links":{"cited_paper":"/paper/2104.08821","citing_paper":"/paper/2507.13765"},"observation_digest":"sha256:f4641034c868fd78ce5623b01ede74ac5a3c93b59a5c7095539b46fa8ad61a36","observation_id":"d7436735-1c56-4205-8fda-0b8f8184d1a0","resolution":{"observed_at":"2026-08-06T16:24:05.512533Z","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-06T16:24:11.233891Z","title":"Ghasedi Dizaji, A","venue":null,"work_id":"628d197e-eedc-4fb0-a89c-26f56bcba403","year":2017},"citing_paper":{"arxiv_id":"2507.13765","last_updated":"2025-07-18T09:17:04Z","snapshot_observed_at":"2026-08-07T03:05:57.815310Z","submitted_at":"2025-07-18T09:17:04Z","title":"Dual-Center Graph Clustering with Neighbor Distribution","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T16:24:05.587666Z"},"links":{"citing_paper":"/paper/2507.13765"},"observation_digest":"sha256:55fb467a07d5e862d98dd061c5006a859bf529ebfd16e167150fe7091c9a6821","observation_id":"15f3a264-095b-47cc-b587-ecff0f8222f8","resolution":{"observed_at":"2026-08-06T16:24:11.238468Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T16:24:11.219777Z","title":null,"venue":null,"work_id":"e5b8909e-15a3-4a84-8203-bf94ce3be72f","year":2022},"citing_paper":{"arxiv_id":"2507.13765","last_updated":"2025-07-18T09:17:04Z","snapshot_observed_at":"2026-08-07T03:05:57.815310Z","submitted_at":"2025-07-18T09:17:04Z","title":"Dual-Center Graph Clustering with Neighbor Distribution","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T16:24:05.684850Z"},"links":{"citing_paper":"/paper/2507.13765"},"observation_digest":"sha256:8dd23a5e8e696e897fe082beabf4eecec476c6aa0d944eb7eafbcd43a23fd803","observation_id":"281f1336-dc82-4550-9778-f9b1cbfca847","resolution":{"observed_at":"2026-08-06T16:24:11.224050Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T16:24:11.205743Z","title":"Grover and J","venue":null,"work_id":"804cb06b-37c0-4f63-895f-47c03ea49081","year":2016},"citing_paper":{"arxiv_id":"2507.13765","last_updated":"2025-07-18T09:17:04Z","snapshot_observed_at":"2026-08-07T03:05:57.815310Z","submitted_at":"2025-07-18T09:17:04Z","title":"Dual-Center Graph Clustering with Neighbor Distribution","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T16:24:05.771933Z"},"links":{"citing_paper":"/paper/2507.13765"},"observation_digest":"sha256:b31b965ea226e1eaec0a321faf761adbdd5fd2cdfeb8e0bb7a4b70eaf4d14ce8","observation_id":"477e997a-5702-4605-81b0-c50334037f22","resolution":{"observed_at":"2026-08-06T16:24:11.210153Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T16:24:11.189936Z","title":null,"venue":null,"work_id":"09bea663-79e2-4042-99d8-9c39820e71ec","year":1979},"citing_paper":{"arxiv_id":"2507.13765","last_updated":"2025-07-18T09:17:04Z","snapshot_observed_at":"2026-08-07T03:05:57.815310Z","submitted_at":"2025-07-18T09:17:04Z","title":"Dual-Center Graph Clustering with Neighbor Distribution","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T16:24:05.841605Z"},"links":{"citing_paper":"/paper/2507.13765"},"observation_digest":"sha256:01938ed77587af22d26d9d959cde2ff19f420a07c37b54eddce8ef8297341ab9","observation_id":"af201278-6227-4666-a5f3-91b77f6bc509","resolution":{"observed_at":"2026-08-06T16:24:11.195274Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1609.02907","last_updated":"2017-02-22T09:55:36Z","snapshot_observed_at":"2026-07-06T05:10:16.862707Z","submitted_at":"2016-09-09T19:48:41Z","title":"Semi-Supervised Classification with Graph Convolutional Networks","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1609.02907","snapshot_observed_at":"2026-08-06T16:24:05.928970Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2507.13765","last_updated":"2025-07-18T09:17:04Z","snapshot_observed_at":"2026-08-07T03:05:57.815310Z","submitted_at":"2025-07-18T09:17:04Z","title":"Dual-Center Graph Clustering with Neighbor Distribution","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T16:24:05.928970Z"},"links":{"cited_paper":"/paper/1609.02907","citing_paper":"/paper/2507.13765"},"observation_digest":"sha256:eaf70e63af76987662bc4d37fdcdf1553b41d1d6be9453969a7dadcbda02a2de","observation_id":"481c1e73-3935-4af9-864c-1c3fbbd06f42","resolution":{"observed_at":"2026-08-06T16:24:05.928970Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1611.07308","last_updated":"2016-11-21T11:37:17Z","snapshot_observed_at":"2026-08-06T06:17:37.090691Z","submitted_at":"2016-11-21T11:37:17Z","title":"Variational Graph Auto-Encoders","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1611.07308","snapshot_observed_at":"2026-08-06T16:24:05.993651Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2507.13765","last_updated":"2025-07-18T09:17:04Z","snapshot_observed_at":"2026-08-07T03:05:57.815310Z","submitted_at":"2025-07-18T09:17:04Z","title":"Dual-Center Graph Clustering with Neighbor Distribution","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T16:24:05.993651Z"},"links":{"cited_paper":"/paper/1611.07308","citing_paper":"/paper/2507.13765"},"observation_digest":"sha256:60e2e4b5e47a9dabc7c63d65a3fa0c5533ae96d91cf69b0dad533d0045b05d74","observation_id":"c65aa53e-7ffe-4c4b-8700-2229dab94f7f","resolution":{"observed_at":"2026-08-06T16:24:05.993651Z","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-06T16:24:11.173616Z","title":null,"venue":null,"work_id":"4b7220df-d9e6-4b59-a309-8942bdf1fc65","year":2022},"citing_paper":{"arxiv_id":"2507.13765","last_updated":"2025-07-18T09:17:04Z","snapshot_observed_at":"2026-08-07T03:05:57.815310Z","submitted_at":"2025-07-18T09:17:04Z","title":"Dual-Center Graph Clustering with Neighbor Distribution","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T16:24:06.066643Z"},"links":{"citing_paper":"/paper/2507.13765"},"observation_digest":"sha256:db1b183ae1a43c75fb5573aa9876cec29ec2691595f7c875e6bc93ef1141171a","observation_id":"722eaab4-5306-4829-9b89-dd02a30eec98","resolution":{"observed_at":"2026-08-06T16:24:11.178811Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T16:24:11.152908Z","title":null,"venue":null,"work_id":"6da5493f-2a14-4262-8acd-6f6acc84d2d1","year":2022},"citing_paper":{"arxiv_id":"2507.13765","last_updated":"2025-07-18T09:17:04Z","snapshot_observed_at":"2026-08-07T03:05:57.815310Z","submitted_at":"2025-07-18T09:17:04Z","title":"Dual-Center Graph Clustering with Neighbor Distribution","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T16:24:06.129571Z"},"links":{"citing_paper":"/paper/2507.13765"},"observation_digest":"sha256:0a0359506e0f8425036d22754f8335f9698f329e848b1c4af126fbdc5dc5f4e5","observation_id":"548f1f4a-6240-4381-a679-a56701aa0a20","resolution":{"observed_at":"2026-08-06T16:24:11.159860Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T16:24:11.137307Z","title":null,"venue":null,"work_id":"127fac71-ec60-4075-b212-e38b17b7c540","year":2023},"citing_paper":{"arxiv_id":"2507.13765","last_updated":"2025-07-18T09:17:04Z","snapshot_observed_at":"2026-08-07T03:05:57.815310Z","submitted_at":"2025-07-18T09:17:04Z","title":"Dual-Center Graph Clustering with Neighbor Distribution","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T16:24:06.229208Z"},"links":{"citing_paper":"/paper/2507.13765"},"observation_digest":"sha256:2d4b07eefc08cdb7155d12dbf14dfb8f7e1343516e51099f4f85a4536c610a2a","observation_id":"0441cd98-8273-4ea1-9000-c6f5484b828c","resolution":{"observed_at":"2026-08-06T16:24:11.141732Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T16:24:11.122583Z","title":null,"venue":null,"work_id":"77c477c8-afc3-40f3-a2ff-0b1d6eb4f076","year":2022},"citing_paper":{"arxiv_id":"2507.13765","last_updated":"2025-07-18T09:17:04Z","snapshot_observed_at":"2026-08-07T03:05:57.815310Z","submitted_at":"2025-07-18T09:17:04Z","title":"Dual-Center Graph Clustering with Neighbor Distribution","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T16:24:06.320939Z"},"links":{"citing_paper":"/paper/2507.13765"},"observation_digest":"sha256:39ed36365ea9909a1554683da85f42a022865dd8fa6e00cee66b1bfc864400a8","observation_id":"48739076-f6ae-4e60-a905-4f10c26767b6","resolution":{"observed_at":"2026-08-06T16:24:11.127106Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T16:24:11.107604Z","title":null,"venue":null,"work_id":"dbe15504-0f41-4076-8f02-76e7369f58c9","year":2021},"citing_paper":{"arxiv_id":"2507.13765","last_updated":"2025-07-18T09:17:04Z","snapshot_observed_at":"2026-08-07T03:05:57.815310Z","submitted_at":"2025-07-18T09:17:04Z","title":"Dual-Center Graph Clustering with Neighbor Distribution","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T16:24:06.420732Z"},"links":{"citing_paper":"/paper/2507.13765"},"observation_digest":"sha256:67072713a77efdb9677a86b0862522154b7c6dd7c2833eb318eee089699de771","observation_id":"7ab0a9d7-cb56-42af-b032-3d59fcdc0bde","resolution":{"observed_at":"2026-08-06T16:24:11.111661Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1807.03748","last_updated":"2019-01-22T18:47:12Z","snapshot_observed_at":"2026-07-06T06:49:24.960992Z","submitted_at":"2018-07-10T16:52:11Z","title":"Representation Learning with Contrastive Predictive Coding","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1807.03748","snapshot_observed_at":"2026-08-06T16:24:06.510752Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2507.13765","last_updated":"2025-07-18T09:17:04Z","snapshot_observed_at":"2026-08-07T03:05:57.815310Z","submitted_at":"2025-07-18T09:17:04Z","title":"Dual-Center Graph Clustering with Neighbor Distribution","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T16:24:06.510752Z"},"links":{"cited_paper":"/paper/1807.03748","citing_paper":"/paper/2507.13765"},"observation_digest":"sha256:dca7d69158de26942937f9d4fabcdb6bbbf3d3d8db23a8b1760a3a3d181ded1d","observation_id":"64524d3f-4f88-4a1f-ad0a-5e0abab37439","resolution":{"observed_at":"2026-08-06T16:24:06.510752Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1802.04407","last_updated":"2019-01-08T00:26:13Z","snapshot_observed_at":"2026-07-06T06:23:05.095698Z","submitted_at":"2018-02-13T00:29:11Z","title":"Adversarially Regularized Graph Autoencoder for Graph Embedding","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1802.04407","snapshot_observed_at":"2026-08-06T16:24:06.608960Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2507.13765","last_updated":"2025-07-18T09:17:04Z","snapshot_observed_at":"2026-08-07T03:05:57.815310Z","submitted_at":"2025-07-18T09:17:04Z","title":"Dual-Center Graph Clustering with Neighbor Distribution","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T16:24:06.608960Z"},"links":{"cited_paper":"/paper/1802.04407","citing_paper":"/paper/2507.13765"},"observation_digest":"sha256:46d1025cef1bf6516a4c84776c58a10f5bc87e6f3bdb465a881804ae5f360fef","observation_id":"ad4d683a-5cc3-4248-b81a-399ea192bd74","resolution":{"observed_at":"2026-08-06T16:24:06.608960Z","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-06T16:24:11.092343Z","title":null,"venue":null,"work_id":"866aa338-8da8-42e0-92c7-4e1da9df23f0","year":2019},"citing_paper":{"arxiv_id":"2507.13765","last_updated":"2025-07-18T09:17:04Z","snapshot_observed_at":"2026-08-07T03:05:57.815310Z","submitted_at":"2025-07-18T09:17:04Z","title":"Dual-Center Graph Clustering with Neighbor Distribution","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T16:24:06.687091Z"},"links":{"citing_paper":"/paper/2507.13765"},"observation_digest":"sha256:cb0a6e6e2535c301c8af20966b85274b55eb4e31abf5f399677f23f7d4e5865c","observation_id":"5ab89cfd-19a8-4b86-a6c7-c6d347a5ed2b","resolution":{"observed_at":"2026-08-06T16:24:11.097535Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2002.05287","last_updated":"2020-02-14T01:47:35Z","snapshot_observed_at":"2026-08-07T18:28:55.768202Z","submitted_at":"2020-02-13T00:03:09Z","title":"Geom-GCN: Geometric Graph Convolutional Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2002.05287","snapshot_observed_at":"2026-08-06T16:24:06.777009Z","title":null,"venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2507.13765","last_updated":"2025-07-18T09:17:04Z","snapshot_observed_at":"2026-08-07T03:05:57.815310Z","submitted_at":"2025-07-18T09:17:04Z","title":"Dual-Center Graph Clustering with Neighbor Distribution","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-06T16:24:06.777009Z"},"links":{"cited_paper":"/paper/2002.05287","citing_paper":"/paper/2507.13765"},"observation_digest":"sha256:003e8ea6359d2d10d9b841b66a1f144a2adea61a65c752f0e8a47a32b8de3f3f","observation_id":"ae005426-ca29-46a6-85ea-f77c91843d52","resolution":{"observed_at":"2026-08-06T16:24:06.777009Z","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-06T16:24:11.076283Z","title":"Perozzi, R","venue":null,"work_id":"e905ce7f-244e-4a36-a17c-306f5437f777","year":2014},"citing_paper":{"arxiv_id":"2507.13765","last_updated":"2025-07-18T09:17:04Z","snapshot_observed_at":"2026-08-07T03:05:57.815310Z","submitted_at":"2025-07-18T09:17:04Z","title":"Dual-Center Graph Clustering with Neighbor Distribution","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-06T16:24:06.868819Z"},"links":{"citing_paper":"/paper/2507.13765"},"observation_digest":"sha256:bfe8b6820b74205571872deec1c97e78b3135e59741d633d460287d49b83a768","observation_id":"caef6fa3-5600-4090-8628-2f56719f5003","resolution":{"observed_at":"2026-08-06T16:24:11.081209Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T16:24:11.057456Z","title":null,"venue":null,"work_id":"e8b2b091-69cd-4fe0-96ab-889df3b334cc","year":2017},"citing_paper":{"arxiv_id":"2507.13765","last_updated":"2025-07-18T09:17:04Z","snapshot_observed_at":"2026-08-07T03:05:57.815310Z","submitted_at":"2025-07-18T09:17:04Z","title":"Dual-Center Graph Clustering with Neighbor Distribution","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-06T16:24:06.943644Z"},"links":{"citing_paper":"/paper/2507.13765"},"observation_digest":"sha256:360171baec1f90ac97972419265742fc03e11955762f8cc7005e075554355e0c","observation_id":"4adfec36-5e11-4038-b522-40a380748093","resolution":{"observed_at":"2026-08-06T16:24:11.063156Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T16:24:11.038859Z","title":"Rozemberczki, C","venue":null,"work_id":"178c3625-80a0-42b3-9152-987532c563e2","year":2021},"citing_paper":{"arxiv_id":"2507.13765","last_updated":"2025-07-18T09:17:04Z","snapshot_observed_at":"2026-08-07T03:05:57.815310Z","submitted_at":"2025-07-18T09:17:04Z","title":"Dual-Center Graph Clustering with Neighbor Distribution","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-06T16:24:07.032534Z"},"links":{"citing_paper":"/paper/2507.13765"},"observation_digest":"sha256:f37bcaa8ac5d84354e37c4c0ad591ee05d9fdbb869f70f5a28318e016b9d17f0","observation_id":"9fc1a392-28fa-4656-b7b9-20e48e66b374","resolution":{"observed_at":"2026-08-06T16:24:11.044691Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T16:24:11.017906Z","title":null,"venue":null,"work_id":"4d46224b-fb42-42e6-aa30-c33bd7bdef75","year":2008},"citing_paper":{"arxiv_id":"2507.13765","last_updated":"2025-07-18T09:17:04Z","snapshot_observed_at":"2026-08-07T03:05:57.815310Z","submitted_at":"2025-07-18T09:17:04Z","title":"Dual-Center Graph Clustering with Neighbor Distribution","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-06T16:24:07.129048Z"},"links":{"citing_paper":"/paper/2507.13765"},"observation_digest":"sha256:d58c1b186876a31aaf2464a3471f21bb92a4b40f539b75543855683ea8c640cd","observation_id":"3fcf55f4-aeaa-4858-bcff-774bd8068fdf","resolution":{"observed_at":"2026-08-06T16:24:11.024023Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T16:24:10.999479Z","title":"Shchur, M","venue":null,"work_id":"dbd7f440-4993-49c3-8b35-925c9838f7f0","year":2018},"citing_paper":{"arxiv_id":"2507.13765","last_updated":"2025-07-18T09:17:04Z","snapshot_observed_at":"2026-08-07T03:05:57.815310Z","submitted_at":"2025-07-18T09:17:04Z","title":"Dual-Center Graph Clustering with Neighbor Distribution","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-06T16:24:07.197765Z"},"links":{"citing_paper":"/paper/2507.13765"},"observation_digest":"sha256:01aa8c958db4e1eeba17c93b275f7e94b5d33a60d1655816c742726a2cfa5183","observation_id":"5600cdcf-4a44-443d-a1b9-067e0df1907c","resolution":{"observed_at":"2026-08-06T16:24:11.005752Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T16:24:10.980196Z","title":null,"venue":null,"work_id":"805a4c69-cda6-4e3a-a6e8-d775c6e79ed1","year":2023},"citing_paper":{"arxiv_id":"2507.13765","last_updated":"2025-07-18T09:17:04Z","snapshot_observed_at":"2026-08-07T03:05:57.815310Z","submitted_at":"2025-07-18T09:17:04Z","title":"Dual-Center Graph Clustering with Neighbor Distribution","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-06T16:24:07.294914Z"},"links":{"citing_paper":"/paper/2507.13765"},"observation_digest":"sha256:bfe8edafb2f35bfc7d5059ec73706ebcaed6e9be11b73e4d5536c939f530ce56","observation_id":"334f3758-8ece-41c2-ab00-d0ffde914dc0","resolution":{"observed_at":"2026-08-06T16:24:10.985665Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T16:24:10.962480Z","title":null,"venue":null,"work_id":"653c5fc3-74c0-4fc7-9918-878f60126f8f","year":2014},"citing_paper":{"arxiv_id":"2507.13765","last_updated":"2025-07-18T09:17:04Z","snapshot_observed_at":"2026-08-07T03:05:57.815310Z","submitted_at":"2025-07-18T09:17:04Z","title":"Dual-Center Graph Clustering with Neighbor Distribution","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-06T16:24:07.376608Z"},"links":{"citing_paper":"/paper/2507.13765"},"observation_digest":"sha256:f05db5db8283ea65c4c14043a5490ee25c182ff8309139b1758e250b06bfb5e3","observation_id":"22f1c723-26bc-48fc-a7e2-8d9240a3ea27","resolution":{"observed_at":"2026-08-06T16:24:10.967407Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T16:24:10.946313Z","title":null,"venue":null,"work_id":"2ff18b61-95ad-405d-a4ea-3b1671d3810f","year":2021},"citing_paper":{"arxiv_id":"2507.13765","last_updated":"2025-07-18T09:17:04Z","snapshot_observed_at":"2026-08-07T03:05:57.815310Z","submitted_at":"2025-07-18T09:17:04Z","title":"Dual-Center Graph Clustering with Neighbor Distribution","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-06T16:24:07.484799Z"},"links":{"citing_paper":"/paper/2507.13765"},"observation_digest":"sha256:9fc8d729bd1ed9a7af951166fe6d5fa72fd2fe8b92f501ab3d0f93688b83e88f","observation_id":"2f6ef25e-667d-45e6-a486-4b01b4c79ca4","resolution":{"observed_at":"2026-08-06T16:24:10.951023Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T16:24:10.930909Z","title":"Van der Maaten and G","venue":null,"work_id":"1037f50d-063c-465f-b152-c0a2b109683a","year":2008},"citing_paper":{"arxiv_id":"2507.13765","last_updated":"2025-07-18T09:17:04Z","snapshot_observed_at":"2026-08-07T03:05:57.815310Z","submitted_at":"2025-07-18T09:17:04Z","title":"Dual-Center Graph Clustering with Neighbor Distribution","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-06T16:24:07.543529Z"},"links":{"citing_paper":"/paper/2507.13765"},"observation_digest":"sha256:2979c2c4047981cb36afc10cb5e2a96e1d17145bed2b68594b259241266587bc","observation_id":"046b00c1-d231-4d5f-9778-5c3d3cd99e7a","resolution":{"observed_at":"2026-08-06T16:24:10.935585Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T16:24:10.914520Z","title":"Velickovic, W","venue":null,"work_id":"b2e56f50-2fbd-404b-87db-4b85c81ab62f","year":2019},"citing_paper":{"arxiv_id":"2507.13765","last_updated":"2025-07-18T09:17:04Z","snapshot_observed_at":"2026-08-07T03:05:57.815310Z","submitted_at":"2025-07-18T09:17:04Z","title":"Dual-Center Graph Clustering with Neighbor Distribution","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-06T16:24:07.660045Z"},"links":{"citing_paper":"/paper/2507.13765"},"observation_digest":"sha256:c0bcd801dde28a80a4fc6cfb138d134e6c789ae643313e8c81fe08147a68e721","observation_id":"e27e8982-81ee-48ec-b88e-62352b412ebb","resolution":{"observed_at":"2026-08-06T16:24:10.919422Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1906.06532","last_updated":"2019-06-15T11:44:42Z","snapshot_observed_at":"2026-07-06T08:00:34.188554Z","submitted_at":"2019-06-15T11:44:42Z","title":"Attributed Graph Clustering: A Deep Attentional Embedding Approach","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1906.06532","snapshot_observed_at":"2026-08-06T16:24:07.744033Z","title":null,"venue":null,"work_id":null,"year":1906},"citing_paper":{"arxiv_id":"2507.13765","last_updated":"2025-07-18T09:17:04Z","snapshot_observed_at":"2026-08-07T03:05:57.815310Z","submitted_at":"2025-07-18T09:17:04Z","title":"Dual-Center Graph Clustering with Neighbor Distribution","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-06T16:24:07.744033Z"},"links":{"cited_paper":"/paper/1906.06532","citing_paper":"/paper/2507.13765"},"observation_digest":"sha256:fc013fe510c7ad10a695496ebbbe9a1967b6d2bb3dd9848b3d1b12f6d0ff2156","observation_id":"fbec106f-426a-4f1a-97fe-a30ae2dc0794","resolution":{"observed_at":"2026-08-06T16:24:07.744033Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2106.11133","last_updated":"2021-06-21T14:12:16Z","snapshot_observed_at":"2026-08-06T06:30:01.719968Z","submitted_at":"2021-06-21T14:12:16Z","title":"GraphMixup: Improving Class-Imbalanced Node Classification on Graphs by Self-supervised Context Prediction","version":1},"cited_work":{"arxiv_id":"2106.11133","doi":null,"metadata_source":"pith","pith_arxiv_id":"2106.11133","snapshot_observed_at":"2026-08-06T16:24:08.968519Z","title":"GraphMixup: Improving Class-Imbalanced Node Classification on Graphs by Self-supervised Context Prediction","venue":"cs.LG","work_id":"970e31b4-d88e-4304-9bb2-16e9495bc8a1","year":2021},"citing_paper":{"arxiv_id":"2507.13765","last_updated":"2025-07-18T09:17:04Z","snapshot_observed_at":"2026-08-07T03:05:57.815310Z","submitted_at":"2025-07-18T09:17:04Z","title":"Dual-Center Graph Clustering with Neighbor Distribution","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-06T16:24:07.831806Z"},"links":{"cited_paper":"/paper/2106.11133","citing_paper":"/paper/2507.13765"},"observation_digest":"sha256:38fceba01e90e34bf5c931a500d2df37d6e487a99c96c6eeea5954f8321794cd","observation_id":"35af48fd-662c-4a88-bb59-f4143d48134b","resolution":{"observed_at":"2026-08-06T16:24:09.038441Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2110.02027","last_updated":"2022-06-14T02:24:02Z","snapshot_observed_at":"2026-08-07T04:47:36.387407Z","submitted_at":"2021-10-05T13:15:59Z","title":"ProGCL: Rethinking Hard Negative Mining in Graph Contrastive Learning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2110.02027","snapshot_observed_at":"2026-08-06T16:24:07.925617Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2507.13765","last_updated":"2025-07-18T09:17:04Z","snapshot_observed_at":"2026-08-07T03:05:57.815310Z","submitted_at":"2025-07-18T09:17:04Z","title":"Dual-Center Graph Clustering with Neighbor Distribution","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-06T16:24:07.925617Z"},"links":{"cited_paper":"/paper/2110.02027","citing_paper":"/paper/2507.13765"},"observation_digest":"sha256:4f4fbe22aa8912fda2e2ae52b7f3471f458837362f431c71a6bc67e7eaced1d2","observation_id":"0cf8a243-4289-4293-84a4-8f696d876cb9","resolution":{"observed_at":"2026-08-06T16:24:07.925617Z","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-06T16:24:10.766385Z","title":null,"venue":null,"work_id":"f373aa26-40fd-4a22-b1c7-edb09360bbe4","year":2016},"citing_paper":{"arxiv_id":"2507.13765","last_updated":"2025-07-18T09:17:04Z","snapshot_observed_at":"2026-08-07T03:05:57.815310Z","submitted_at":"2025-07-18T09:17:04Z","title":"Dual-Center Graph Clustering with Neighbor Distribution","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-06T16:24:08.013467Z"},"links":{"citing_paper":"/paper/2507.13765"},"observation_digest":"sha256:49e9f721e04eded63ddda5d5344e78cbd8f7bc610a25f1b1ac599ea9b05f93e5","observation_id":"6e47a43a-c14b-422b-8371-89c22339d690","resolution":{"observed_at":"2026-08-06T16:24:10.893033Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T16:24:10.535053Z","title":null,"venue":null,"work_id":"37992811-c164-42f1-bae2-742431e3f056","year":2021},"citing_paper":{"arxiv_id":"2507.13765","last_updated":"2025-07-18T09:17:04Z","snapshot_observed_at":"2026-08-07T03:05:57.815310Z","submitted_at":"2025-07-18T09:17:04Z","title":"Dual-Center Graph Clustering with Neighbor Distribution","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-06T16:24:08.104390Z"},"links":{"citing_paper":"/paper/2507.13765"},"observation_digest":"sha256:a6a1529e4ca1670ec4bf9264cef778970506513a2620d38bfa063208c04f8dd6","observation_id":"78de1683-3ec7-4fc5-a616-8f6a48ebffe2","resolution":{"observed_at":"2026-08-06T16:24:10.644115Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T16:24:10.327031Z","title":null,"venue":null,"work_id":"2e563b62-89b2-457c-b014-9e09fd91f65e","year":2022},"citing_paper":{"arxiv_id":"2507.13765","last_updated":"2025-07-18T09:17:04Z","snapshot_observed_at":"2026-08-07T03:05:57.815310Z","submitted_at":"2025-07-18T09:17:04Z","title":"Dual-Center Graph Clustering with Neighbor Distribution","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-06T16:24:08.212927Z"},"links":{"citing_paper":"/paper/2507.13765"},"observation_digest":"sha256:80a6354317ac66481ce66cd9f6d8dab68540e549e4c8589c7c38db4a5253a720","observation_id":"04fceaba-25a4-4acc-a18f-dca96f8f57c2","resolution":{"observed_at":"2026-08-06T16:24:10.396216Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T16:24:10.214652Z","title":null,"venue":null,"work_id":"47f593b4-02ee-452d-bcd0-ed6afba515cb","year":2023},"citing_paper":{"arxiv_id":"2507.13765","last_updated":"2025-07-18T09:17:04Z","snapshot_observed_at":"2026-08-07T03:05:57.815310Z","submitted_at":"2025-07-18T09:17:04Z","title":"Dual-Center Graph Clustering with Neighbor Distribution","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-06T16:24:08.278114Z"},"links":{"citing_paper":"/paper/2507.13765"},"observation_digest":"sha256:4a5573525aa21f3342deec071711c6c1a7ff5a04a156dc32f1fa17b0c48d8bfa","observation_id":"9cfbdc4a-6112-4463-ae07-5f79589f1948","resolution":{"observed_at":"2026-08-06T16:24:10.275646Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T16:24:09.982984Z","title":null,"venue":null,"work_id":"01013284-ce83-45dc-9505-37cc69002923","year":2024},"citing_paper":{"arxiv_id":"2507.13765","last_updated":"2025-07-18T09:17:04Z","snapshot_observed_at":"2026-08-07T03:05:57.815310Z","submitted_at":"2025-07-18T09:17:04Z","title":"Dual-Center Graph Clustering with Neighbor Distribution","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-06T16:24:08.359843Z"},"links":{"citing_paper":"/paper/2507.13765"},"observation_digest":"sha256:ed6e448ffb4284da5abcada3cdbf8f14c2feb69f105f21cb3866bf51f3030cae","observation_id":"7d733687-299e-4219-8d7b-70103e0730f5","resolution":{"observed_at":"2026-08-06T16:24:10.086588Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T16:24:09.723695Z","title":null,"venue":null,"work_id":"e7a4a74a-3f1b-4861-b4fa-68f319bffbc1","year":2020},"citing_paper":{"arxiv_id":"2507.13765","last_updated":"2025-07-18T09:17:04Z","snapshot_observed_at":"2026-08-07T03:05:57.815310Z","submitted_at":"2025-07-18T09:17:04Z","title":"Dual-Center Graph Clustering with Neighbor Distribution","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-06T16:24:08.478402Z"},"links":{"citing_paper":"/paper/2507.13765"},"observation_digest":"sha256:10b29d6ab96030436df738f282a4b1378b2128afc096a804063b5977ecb41e78","observation_id":"f8933fe0-0cc2-40a7-9ddc-29c416712cc1","resolution":{"observed_at":"2026-08-06T16:24:09.832025Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T16:24:09.621499Z","title":"Zhang, L","venue":null,"work_id":"750f6912-0bdd-489d-9f7d-d6ab5b546255","year":2022},"citing_paper":{"arxiv_id":"2507.13765","last_updated":"2025-07-18T09:17:04Z","snapshot_observed_at":"2026-08-07T03:05:57.815310Z","submitted_at":"2025-07-18T09:17:04Z","title":"Dual-Center Graph Clustering with Neighbor Distribution","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-06T16:24:08.546911Z"},"links":{"citing_paper":"/paper/2507.13765"},"observation_digest":"sha256:a57c7deea5499179777d9fed1e6b32980d75959a60b35e06cfb5ca4257135ffe","observation_id":"f6973f7e-1755-4865-87dd-a62a46c90c54","resolution":{"observed_at":"2026-08-06T16:24:09.688709Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T16:24:09.429222Z","title":null,"venue":null,"work_id":"3ff3de29-abef-4c42-9de4-7c604ab79be6","year":2021},"citing_paper":{"arxiv_id":"2507.13765","last_updated":"2025-07-18T09:17:04Z","snapshot_observed_at":"2026-08-07T03:05:57.815310Z","submitted_at":"2025-07-18T09:17:04Z","title":"Dual-Center Graph Clustering with Neighbor Distribution","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-06T16:24:08.633594Z"},"links":{"citing_paper":"/paper/2507.13765"},"observation_digest":"sha256:a6b82ae1e651cad71545fdf5a42f764c1715e3f4d84547d93cc4d6837b78228d","observation_id":"ebb2ee33-c122-4d7f-b660-5a980b64622c","resolution":{"observed_at":"2026-08-06T16:24:09.509492Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T16:24:09.251985Z","title":null,"venue":null,"work_id":"277df384-9b87-48b1-beef-e2b1ff1823ff","year":2020},"citing_paper":{"arxiv_id":"2507.13765","last_updated":"2025-07-18T09:17:04Z","snapshot_observed_at":"2026-08-07T03:05:57.815310Z","submitted_at":"2025-07-18T09:17:04Z","title":"Dual-Center Graph Clustering with Neighbor Distribution","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-06T16:24:08.707077Z"},"links":{"citing_paper":"/paper/2507.13765"},"observation_digest":"sha256:004887a7c5a31dd06aa85d398a59492d5ec08403ac8666e9bba4ce09fe86a4c2","observation_id":"db4f10eb-214c-4954-bb75-12408d591978","resolution":{"observed_at":"2026-08-06T16:24:09.336268Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2006.04131","last_updated":"2020-07-13T16:32:20Z","snapshot_observed_at":"2026-08-05T13:22:44.473317Z","submitted_at":"2020-06-07T11:50:45Z","title":"Deep Graph Contrastive Representation Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2006.04131","snapshot_observed_at":"2026-08-06T16:24:08.806495Z","title":null,"venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2507.13765","last_updated":"2025-07-18T09:17:04Z","snapshot_observed_at":"2026-08-07T03:05:57.815310Z","submitted_at":"2025-07-18T09:17:04Z","title":"Dual-Center Graph Clustering with Neighbor Distribution","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-06T16:24:08.806495Z"},"links":{"cited_paper":"/paper/2006.04131","citing_paper":"/paper/2507.13765"},"observation_digest":"sha256:b33673433af2e0d0ad27bd43a4f7df3bcaf97ad857939e6b070839892b16c944","observation_id":"f5db729a-f5f2-43c9-8ff8-dbc4be9ea102","resolution":{"observed_at":"2026-08-06T16:24:08.806495Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2507.13765","last_updated":"2025-07-18T09:17:04Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-07T03:05:57.815310Z","submitted_at":"2025-07-18T09:17:04Z","title":"Dual-Center Graph Clustering with Neighbor Distribution"},"reference_resolution":{"displayed":43,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":34,"verified_exact":1,"verified_fuzzy":8},"total_outbound_references":43},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 43 of 43 outbound references and 0 inbound Pith citation observations for arXiv:2507.13765."}