{"as_of":"2026-08-19T06:08:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2e404579cf9125ef37cc36e3dc928fa1988566896ce56b4387599bb04deae731","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-18T06:34:40.430872+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-18T19:34:49.358298Z","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:f8b7b901a87607982e72d2de8b5aafc635ba2056328b05ae34c6a001d3f7ca79","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-18T19:34:49.358298Z","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:49d9b94df96580a3549be227f86d9a165343a2ae5fcabe3ef8d321343081d4c8","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-18T19:34:49.358298Z","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:886c4e2d630c2b5741fc27cd5c5881af6c5a28af0c1e6f46ede3d2c9b3d89761","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-18T19:34:49.358298Z","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:86a0ec143c79843cf0cac785dbe53ca4144204971c4c44a91ed7dc429636b16d","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-18T19:34:49.358298Z","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:3381d4943382541317f231c4f4701b9672d9d561017dcfa0c7a8fa5857e3432e","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-18T19:34:49.358298Z","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:31ce90e66927daad54ad5ca85b0de42b9dd346391f5f367195f6d57f88713710","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-18T19:34:49.358298Z","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:3a3eadc605321dfc1d25c14301d8fd76cbd11fe2e351826ffa82a4f12cd2488e","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-18T19:34:49.358298Z","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:83f9b3331a6baa41c8ffd23153b7bf80053ffb0bf978625b4f1f3063a383ad7c","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-18T19:34:49.358298Z","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:5ee18a2a421a03c54e526c532f73acbfaf9d50b186d4cbd34a06c625260d1c0e","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-08-17T10:49:36.026134Z","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-18T19:34:49.358298Z","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:770cbbb68ac2720fc550ecd8bb05a85059aa1c977ca2ef027d939584a0e8020f","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-14T21:29:27.927932Z","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-18T19:34:49.358298Z","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:b4758bc8634127c21d30a57945e390a91eae4e51d18c163ec22257feabf2ac9d","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-18T19:34:49.358298Z","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:c538821e2ea42f70668c0a391c3cdd41f9454ecc9b8434bd08767257005a68cb","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-18T19:34:49.358298Z","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:f0f605dc0b649cb1e6b91d0eb07dcd954d2ff83e72258471c7ed44392d20d6f0","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-18T19:34:49.358298Z","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:3ba4ba5cc9023c611cdf2ae692ee444049c91f1d506a165ba5bab9a143b46dd2","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-18T19:34:49.358298Z","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:d067bb4c9f8c49c30690b563177ee7e24d5b465f040792bf9d4165cba06ac6a8","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-18T19:34:49.358298Z","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:1e365f5c8a4d29469b8bd3b0c5ef25df0afb826fbae8652bb90bb9c9bb6f4080","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-08-14T18:53:38.574749Z","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-18T19:34:49.358298Z","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:51b9d616ed57cca72a2a22e361e29e1d2e198fdacd4ba5b2ad8d14fe1b1e966c","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-08-16T01:20:39.785877Z","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-18T19:34:49.358298Z","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:6e564d953826ea4f8124de659655a319b1a23e4f1396469f66cbc2c746bd979e","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-18T19:34:49.358298Z","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:2b9679e254354498170fb98ba701479d16040555eae52c138f4e9277bd9b7ada","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T23:39:48.575656Z","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-18T19:34:49.358298Z","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:49bde56053d7937ab7e39580dfe90b038e85a17013983cb47c45d03e44a9882c","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-18T19:34:49.358298Z","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:187aeef6dd06615fb513810ddd4883584e9cc072b894c3d1f850ea714f834f7c","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-18T19:34:49.358298Z","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:550ed451ea1894a0cc370496ed10963c90bba00d49e894d591212d2195a25c2d","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-18T19:34:49.358298Z","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:d7fc785957b5889fa7127b279ce48e6f99516fbac85ea5fa8fbc59ff89563fb3","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-18T19:34:49.358298Z","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:674cb09d49edbac14a228728988f50c21dc7e3ee7a6f405270349adc972bb3e1","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-18T19:34:49.358298Z","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:a7013a0bdf5040ae4a675cf9823020f6fb40fbd0bd916b3828e88070d1dcfe9c","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-18T19:34:49.358298Z","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:c43a84a91ffa83010ff523b0317e116593c6ba1255f19c78f1699ee17b07e7a1","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-18T19:34:49.358298Z","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:bf8665d3e131fad0aece41c21d580b7c9f5789075741d4c2466c4fb8755bcb44","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-18T19:34:49.358298Z","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:b754a10871a41cad185fe4d0c611baa16c725fa864e067095b930c9d31470fc0","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-18T19:34:49.358298Z","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:b98394dd1b6856fbcf7077290b0596d89fdb492051a95b2a173dce5ccbc58db4","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-18T19:34:49.358298Z","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:6cccd2a612a0bff8e30fd01f79a6f21e84ce8a7f43099dd88317248dcee084b3","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-08-14T16:15:10.923807Z","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-18T19:34:49.358298Z","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:6486914f5314c24520e9da050f7b58f182da1a740c2340cd482c8da59d954f37","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-16T18:15:38.369896Z","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-18T19:34:49.358298Z","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:2809aa0bd2be297032851e532859c3d3be4f0eef142caaacc94fa75ee68938d7","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T17:51:47.039950Z","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-18T19:34:49.358298Z","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:50a8936e056dc77b7585f5741376a535b54e2156bf47fdd496603e9cb26d7b85","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-18T19:34:49.358298Z","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:f8535b503c0957f9c96d62c361426efb7b34ab15a826033edb773cd1b0eadcbc","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-18T19:34:49.358298Z","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:755798b96ab7483883221c42e8f7c4c85c941152897f8b861034a8686c1e4dd8","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-18T19:34:49.358298Z","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:046acb5c3b26a9f31e2d5c53befee6a8acd42eae4349a65926ac5dfda7186944","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-18T19:34:49.358298Z","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:07fb2828d9bfd84c4d8e3ae708c31b86db7e7cc4b4b0adafea92f06dbbb19edd","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-18T19:34:49.358298Z","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:590b16a074b68dfd29dd88fd3f3b1ebec9bf45e1e15a5f075f3b78830faad900","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-18T19:34:49.358298Z","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:2923dc58821bfcbeb1207046d20062e415169d103889cd3943bc3dc0c633e6fa","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-18T19:34:49.358298Z","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:db120f98f7c1c20877da4a80508511fbe06fc147b9330e3b98c0e08f58a8b273","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-18T19:34:49.358298Z","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:c875e2ea8fd2670f412efc7d57052df049019217991e214ea15b94d36dc10ce1","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-18T19:34:49.358298Z","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:4598cd0592662b4e40ea95c0111fac5c63b76a7dc3c746c305d62f0682a48205","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-18T19:43:01.466508Z","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-18T19:34:49.358298Z","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:9ec4a0bf5589ba27af2a3ed2810ea90ec68674a569561556237df394453b78ee","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-18T19:34:49.358298Z","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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 43 of 43 outbound references and 0 inbound Pith citation observations for arXiv:2507.13765."}