{"as_of":"2026-08-17T15:34:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8e82d7b8a08944d26072002b526f8c4aa093043a20aa1e824b7bb371e2165616","coverage":[{"denominator":47,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":47,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T13:03:17.478181Z","state":"measured"},{"denominator":47,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":47,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2412.13592/citation-record","integrity":"/paper/2412.13592/integrity","json":"/paper/2412.13592/citation-record.json","paper":"/paper/2412.13592"},"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-11T13:03:18.379139Z","title":"Statistics and computing 17 (2007)","venue":null,"work_id":"6e3c5abe-c8d0-41c2-a6e4-31e19f5e7e3e","year":2007},"citing_paper":{"arxiv_id":"2412.13592","last_updated":"2025-06-12T08:23:21Z","snapshot_observed_at":"2026-08-14T00:39:09.191604Z","submitted_at":"2024-12-18T08:15:55Z","title":"PASCO (PArallel Structured COarsening): an overlay to speed up graph clustering algorithms","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-11T13:03:17.245827Z"},"links":{"citing_paper":"/paper/2412.13592"},"observation_digest":"sha256:fef4832cd4541ca3f7e5527ba541ea2c1b7a7c19621b3e106762202c03dcddf0","observation_id":"1b5a2126-ae2e-4967-bd67-c939ac6067f4","resolution":{"observed_at":"2026-08-11T13:03:18.383815Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T13:03:18.362968Z","title":"Physics reports 486 (2010)","venue":null,"work_id":"8e1b908b-b9e2-4962-8d8f-b40cf3479bc4","year":2010},"citing_paper":{"arxiv_id":"2412.13592","last_updated":"2025-06-12T08:23:21Z","snapshot_observed_at":"2026-08-14T00:39:09.191604Z","submitted_at":"2024-12-18T08:15:55Z","title":"PASCO (PArallel Structured COarsening): an overlay to speed up graph clustering algorithms","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-11T13:03:17.251543Z"},"links":{"citing_paper":"/paper/2412.13592"},"observation_digest":"sha256:31a2ba9ec2b3473cc5d171c8c98fc75c22c66c6aec492e39f90fbb0f635d4283","observation_id":"ee584a44-decc-43fb-8e5f-1f4e998314a4","resolution":{"observed_at":"2026-08-11T13:03:18.367815Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T13:03:18.346748Z","title":"Physics Reports 659 (2016)","venue":null,"work_id":"fd71700b-eaaa-4631-b3c7-f50ec563352a","year":2016},"citing_paper":{"arxiv_id":"2412.13592","last_updated":"2025-06-12T08:23:21Z","snapshot_observed_at":"2026-08-14T00:39:09.191604Z","submitted_at":"2024-12-18T08:15:55Z","title":"PASCO (PArallel Structured COarsening): an overlay to speed up graph clustering algorithms","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-11T13:03:17.257355Z"},"links":{"citing_paper":"/paper/2412.13592"},"observation_digest":"sha256:366fd50793a0a1cc143ab9fb539cc924e111d7597227e5c1fb170b1d4680851c","observation_id":"1ff0cb00-78e6-4dcb-833f-8d9bee1c002d","resolution":{"observed_at":"2026-08-11T13:03:18.351897Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T13:03:18.330746Z","title":"In: 2018 International Congress on Big Data, Deep Learning and Fighting Cyber Terrorism (IBIGDELFT) (2018)","venue":null,"work_id":"ec10610e-6321-4d36-8f42-934b88f884dd","year":2018},"citing_paper":{"arxiv_id":"2412.13592","last_updated":"2025-06-12T08:23:21Z","snapshot_observed_at":"2026-08-14T00:39:09.191604Z","submitted_at":"2024-12-18T08:15:55Z","title":"PASCO (PArallel Structured COarsening): an overlay to speed up graph clustering algorithms","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-11T13:03:17.263425Z"},"links":{"citing_paper":"/paper/2412.13592"},"observation_digest":"sha256:c197f799e378fa374dc1803823fd8b06debf8ab73d61cf1327c11668ba9bb61f","observation_id":"ee690eac-5488-4a12-a30f-8c439ca2e9a9","resolution":{"observed_at":"2026-08-11T13:03:18.335950Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T13:03:18.315633Z","title":"PLOS ONE 6 (2011)","venue":null,"work_id":"21478793-d26f-4479-abe5-c384f214977e","year":2011},"citing_paper":{"arxiv_id":"2412.13592","last_updated":"2025-06-12T08:23:21Z","snapshot_observed_at":"2026-08-14T00:39:09.191604Z","submitted_at":"2024-12-18T08:15:55Z","title":"PASCO (PArallel Structured COarsening): an overlay to speed up graph clustering algorithms","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-11T13:03:17.268738Z"},"links":{"citing_paper":"/paper/2412.13592"},"observation_digest":"sha256:4a8300d7050630c06cf537c111f21ca3d5b5130495784852f1c387d77bb9fe2f","observation_id":"0bbb7a86-acfa-4014-a634-eacbf8709b1c","resolution":{"observed_at":"2026-08-11T13:03:18.320437Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T13:03:18.299022Z","title":"Physical Review E 89(1) (2014)","venue":null,"work_id":"455172b1-3f3e-4d58-a0c0-880517002d01","year":2014},"citing_paper":{"arxiv_id":"2412.13592","last_updated":"2025-06-12T08:23:21Z","snapshot_observed_at":"2026-08-14T00:39:09.191604Z","submitted_at":"2024-12-18T08:15:55Z","title":"PASCO (PArallel Structured COarsening): an overlay to speed up graph clustering algorithms","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-11T13:03:17.273966Z"},"links":{"citing_paper":"/paper/2412.13592"},"observation_digest":"sha256:96e389def1f015b967638f25af7ba1f0e865d8333a563f320e171a97d2283967","observation_id":"9ec6ec7b-2d13-473f-88a0-df461d1884ec","resolution":{"observed_at":"2026-08-11T13:03:18.303952Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T13:03:18.283115Z","title":"Journal of statistical mechanics: theory and experiment 2008(10) (2008)","venue":null,"work_id":"c5645c55-cb6c-4d34-8ae5-5ea7d458fa22","year":2008},"citing_paper":{"arxiv_id":"2412.13592","last_updated":"2025-06-12T08:23:21Z","snapshot_observed_at":"2026-08-14T00:39:09.191604Z","submitted_at":"2024-12-18T08:15:55Z","title":"PASCO (PArallel Structured COarsening): an overlay to speed up graph clustering algorithms","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-11T13:03:17.279645Z"},"links":{"citing_paper":"/paper/2412.13592"},"observation_digest":"sha256:cff6bf130de5b030c73b9e0587ee216a819804fca8722273ff33c04193a94f5d","observation_id":"9ade05a9-fcf0-4e8c-bb99-1fc915947ee0","resolution":{"observed_at":"2026-08-11T13:03:18.288181Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T13:03:18.267744Z","title":"IEEE Open Journal of Signal Processing 1 (2020)","venue":null,"work_id":"826e8803-669a-4535-ae87-183c8b2a9c13","year":2020},"citing_paper":{"arxiv_id":"2412.13592","last_updated":"2025-06-12T08:23:21Z","snapshot_observed_at":"2026-08-14T00:39:09.191604Z","submitted_at":"2024-12-18T08:15:55Z","title":"PASCO (PArallel Structured COarsening): an overlay to speed up graph clustering algorithms","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-11T13:03:17.284251Z"},"links":{"citing_paper":"/paper/2412.13592"},"observation_digest":"sha256:f43b62873486877e37d8390f107197374e25a9fe772142b18326c671e9c0428c","observation_id":"a13189b7-f381-458f-9493-515cf9d729d4","resolution":{"observed_at":"2026-08-11T13:03:18.272746Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T13:03:18.251586Z","title":"In: ICML (2015)","venue":null,"work_id":"c8e3d5f4-b0ee-4875-8262-8c9e3a0f6b01","year":2015},"citing_paper":{"arxiv_id":"2412.13592","last_updated":"2025-06-12T08:23:21Z","snapshot_observed_at":"2026-08-14T00:39:09.191604Z","submitted_at":"2024-12-18T08:15:55Z","title":"PASCO (PArallel Structured COarsening): an overlay to speed up graph clustering algorithms","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-11T13:03:17.289089Z"},"links":{"citing_paper":"/paper/2412.13592"},"observation_digest":"sha256:e0fd19b3f05447e512b2a99a9bdcd999264772600b86423199e0c5357a50cbd1","observation_id":"42c4105f-183e-4260-aee8-65667b31d232","resolution":{"observed_at":"2026-08-11T13:03:18.256436Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T13:03:18.236054Z","title":"ICML (2016)","venue":null,"work_id":"0085f311-5c72-453a-9612-e21cbc7867ed","year":2016},"citing_paper":{"arxiv_id":"2412.13592","last_updated":"2025-06-12T08:23:21Z","snapshot_observed_at":"2026-08-14T00:39:09.191604Z","submitted_at":"2024-12-18T08:15:55Z","title":"PASCO (PArallel Structured COarsening): an overlay to speed up graph clustering algorithms","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-11T13:03:17.293910Z"},"links":{"citing_paper":"/paper/2412.13592"},"observation_digest":"sha256:a6634a66bc17ea549bc51ee7ac0c50d3735b22d699b1fb4664a90dc3b49b86d0","observation_id":"6e7b228d-b70b-48d3-a581-e0557b24aad1","resolution":{"observed_at":"2026-08-11T13:03:18.241413Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T13:03:18.098958Z","title":"SIAM Journal on Computing 40(4) (2011) 19","venue":null,"work_id":"796cad04-d9fd-4388-94d7-0881953a6e6e","year":2011},"citing_paper":{"arxiv_id":"2412.13592","last_updated":"2025-06-12T08:23:21Z","snapshot_observed_at":"2026-08-14T00:39:09.191604Z","submitted_at":"2024-12-18T08:15:55Z","title":"PASCO (PArallel Structured COarsening): an overlay to speed up graph clustering algorithms","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-11T13:03:17.298623Z"},"links":{"citing_paper":"/paper/2412.13592"},"observation_digest":"sha256:ad6162b1e048cdb551506f2abcf5660ef1967ffc80e22e7e1f2a1cc31053e970","observation_id":"5caa4a30-e681-441d-9663-8592f3323af2","resolution":{"observed_at":"2026-08-11T13:03:18.104165Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T13:03:18.083830Z","title":"In: Proceedings of the Fortieth Annual ACM Symposium on Theory of Computing (2008)","venue":null,"work_id":"9918e572-0000-4677-9a61-4737d3d25746","year":2008},"citing_paper":{"arxiv_id":"2412.13592","last_updated":"2025-06-12T08:23:21Z","snapshot_observed_at":"2026-08-14T00:39:09.191604Z","submitted_at":"2024-12-18T08:15:55Z","title":"PASCO (PArallel Structured COarsening): an overlay to speed up graph clustering algorithms","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-11T13:03:17.303403Z"},"links":{"citing_paper":"/paper/2412.13592"},"observation_digest":"sha256:cac7711524ddda28da95713d3a0a7c1bbf84305de9412e4f97839647120f39b3","observation_id":"408686ce-8e89-47d9-bc23-6659c106bfec","resolution":{"observed_at":"2026-08-11T13:03:18.088391Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T13:03:18.069309Z","title":"Sampling Techniques for Supervised or Unsupervised Tasks (2020)","venue":null,"work_id":"ac61a15a-d5ff-4a22-b3cb-d009fec49176","year":2020},"citing_paper":{"arxiv_id":"2412.13592","last_updated":"2025-06-12T08:23:21Z","snapshot_observed_at":"2026-08-14T00:39:09.191604Z","submitted_at":"2024-12-18T08:15:55Z","title":"PASCO (PArallel Structured COarsening): an overlay to speed up graph clustering algorithms","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-11T13:03:17.308251Z"},"links":{"citing_paper":"/paper/2412.13592"},"observation_digest":"sha256:5ea6381c53bec53d4b650aa2033f33a68a6e6d1e2658f3d0ede78427f89a5cb1","observation_id":"f1a07e98-c4b7-4a99-b7b9-cedb59cfb02a","resolution":{"observed_at":"2026-08-11T13:03:18.074027Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T13:03:18.054559Z","title":"In: Pro- ceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (2009)","venue":null,"work_id":"51f66b84-f2f3-4c29-abf9-065bde25d594","year":2009},"citing_paper":{"arxiv_id":"2412.13592","last_updated":"2025-06-12T08:23:21Z","snapshot_observed_at":"2026-08-14T00:39:09.191604Z","submitted_at":"2024-12-18T08:15:55Z","title":"PASCO (PArallel Structured COarsening): an overlay to speed up graph clustering algorithms","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-11T13:03:17.313009Z"},"links":{"citing_paper":"/paper/2412.13592"},"observation_digest":"sha256:845623ef05a14261169aa884bad7f7c960468bca27bb5da1bc4a656cad95e6d1","observation_id":"06bf93d4-b122-40c7-9d7c-0e7eeac03fa0","resolution":{"observed_at":"2026-08-11T13:03:18.059118Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T13:03:18.037955Z","title":"In: AAAI (2015)","venue":null,"work_id":"22bc6464-78e6-4851-8ea9-ddfad17f0b38","year":2015},"citing_paper":{"arxiv_id":"2412.13592","last_updated":"2025-06-12T08:23:21Z","snapshot_observed_at":"2026-08-14T00:39:09.191604Z","submitted_at":"2024-12-18T08:15:55Z","title":"PASCO (PArallel Structured COarsening): an overlay to speed up graph clustering algorithms","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-11T13:03:17.317571Z"},"links":{"citing_paper":"/paper/2412.13592"},"observation_digest":"sha256:549ad6f4950ef36aa318468a3bde5c755bcb166440de9a8e8b80b96695b12641","observation_id":"2a6b7280-4591-4a7d-9803-0c376cfa8123","resolution":{"observed_at":"2026-08-11T13:03:18.042713Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T13:03:18.021013Z","title":"SC 95(28) (1995)","venue":null,"work_id":"c13ce7eb-1420-4c16-b5d5-734490ff079d","year":1995},"citing_paper":{"arxiv_id":"2412.13592","last_updated":"2025-06-12T08:23:21Z","snapshot_observed_at":"2026-08-14T00:39:09.191604Z","submitted_at":"2024-12-18T08:15:55Z","title":"PASCO (PArallel Structured COarsening): an overlay to speed up graph clustering algorithms","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-11T13:03:17.322743Z"},"links":{"citing_paper":"/paper/2412.13592"},"observation_digest":"sha256:b8e3f8c02c05fc36ef13a7168ee7c92ef73e698bf147250640c450636f546d71","observation_id":"3f7f5ea0-10a0-4526-933b-420d5029a261","resolution":{"observed_at":"2026-08-11T13:03:18.027056Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T13:03:18.006075Z","title":"IEEE transactions on pattern analysis and machine intelligence 29(11) (2007)","venue":null,"work_id":"8a2c92b9-33ab-4f18-8bd1-c395854b18a0","year":2007},"citing_paper":{"arxiv_id":"2412.13592","last_updated":"2025-06-12T08:23:21Z","snapshot_observed_at":"2026-08-14T00:39:09.191604Z","submitted_at":"2024-12-18T08:15:55Z","title":"PASCO (PArallel Structured COarsening): an overlay to speed up graph clustering algorithms","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-11T13:03:17.327366Z"},"links":{"citing_paper":"/paper/2412.13592"},"observation_digest":"sha256:ea4890f61070566b32d05592bda766e8a8afdc3a6a22203cad9532dc347c95ae","observation_id":"94a44d94-2577-4a03-8e15-f3186b91e679","resolution":{"observed_at":"2026-08-11T13:03:18.010940Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T13:03:17.989377Z","title":"Journal of Machine Learning Research 20(116) (2019)","venue":null,"work_id":"0e90ce8b-230e-496b-83ed-c87b890485e8","year":2019},"citing_paper":{"arxiv_id":"2412.13592","last_updated":"2025-06-12T08:23:21Z","snapshot_observed_at":"2026-08-14T00:39:09.191604Z","submitted_at":"2024-12-18T08:15:55Z","title":"PASCO (PArallel Structured COarsening): an overlay to speed up graph clustering algorithms","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-11T13:03:17.332382Z"},"links":{"citing_paper":"/paper/2412.13592"},"observation_digest":"sha256:d47072f51579678bb52c5c5e1fc277e30dcaef1f1f094ca984936b58f9a3fda6","observation_id":"201ed880-d45b-4494-b7ee-57e1c7921866","resolution":{"observed_at":"2026-08-11T13:03:17.994476Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T13:03:17.973458Z","title":"Applied Mathematics & Nonlinear Sciences 4(1) (2019)","venue":null,"work_id":"3417e3d2-2e9f-40bf-85ea-7f22c23600a3","year":2019},"citing_paper":{"arxiv_id":"2412.13592","last_updated":"2025-06-12T08:23:21Z","snapshot_observed_at":"2026-08-14T00:39:09.191604Z","submitted_at":"2024-12-18T08:15:55Z","title":"PASCO (PArallel Structured COarsening): an overlay to speed up graph clustering algorithms","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-11T13:03:17.336928Z"},"links":{"citing_paper":"/paper/2412.13592"},"observation_digest":"sha256:f7ddb98f5042d40b5af1a3f15231c06a6e5a88133a9db64bd31712b54929c91b","observation_id":"081c951a-71a3-4d9a-8eac-43d2f3c7831c","resolution":{"observed_at":"2026-08-11T13:03:17.978898Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T13:03:17.957980Z","title":"In: International Conference on Artificial Intelligence and Statistics, pp","venue":null,"work_id":"877ab1d2-147b-479a-9bae-8daa4318c353","year":2020},"citing_paper":{"arxiv_id":"2412.13592","last_updated":"2025-06-12T08:23:21Z","snapshot_observed_at":"2026-08-14T00:39:09.191604Z","submitted_at":"2024-12-18T08:15:55Z","title":"PASCO (PArallel Structured COarsening): an overlay to speed up graph clustering algorithms","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-11T13:03:17.341095Z"},"links":{"citing_paper":"/paper/2412.13592"},"observation_digest":"sha256:4f9c95ccba83f8a5b6df1966958ecf417d3503e88d677d7bdd4c83796317842a","observation_id":"58446e98-bc8a-4770-80c4-690bd5cba59f","resolution":{"observed_at":"2026-08-11T13:03:17.962884Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T13:03:17.941666Z","title":"SeMA Journal 79(1), 187–223 (2022)","venue":null,"work_id":"f811eda0-de0f-4b7a-b152-2741b6e60c5f","year":2022},"citing_paper":{"arxiv_id":"2412.13592","last_updated":"2025-06-12T08:23:21Z","snapshot_observed_at":"2026-08-14T00:39:09.191604Z","submitted_at":"2024-12-18T08:15:55Z","title":"PASCO (PArallel Structured COarsening): an overlay to speed up graph clustering algorithms","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-11T13:03:17.345534Z"},"links":{"citing_paper":"/paper/2412.13592"},"observation_digest":"sha256:80075fca4c8596a9237977864faa82f75e67ead42eb52cb2c902f0f4b63ef37a","observation_id":"3f02357c-00fa-4445-a0a8-0017fde6ded2","resolution":{"observed_at":"2026-08-11T13:03:17.946655Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2105.02022","last_updated":"2021-05-05T12:43:22Z","snapshot_observed_at":"2026-08-16T18:26:52.756197Z","submitted_at":"2021-05-05T12:43:22Z","title":"Deep Multilevel Graph Partitioning","version":1},"cited_work":{"arxiv_id":"2105.02022","doi":null,"metadata_source":"pith","pith_arxiv_id":"2105.02022","snapshot_observed_at":"2026-08-11T13:03:17.546135Z","title":"Deep Multilevel Graph Partitioning","venue":"cs.DS","work_id":"b061fa37-cdfe-435a-a16a-80b6d1e3fb1d","year":2021},"citing_paper":{"arxiv_id":"2412.13592","last_updated":"2025-06-12T08:23:21Z","snapshot_observed_at":"2026-08-14T00:39:09.191604Z","submitted_at":"2024-12-18T08:15:55Z","title":"PASCO (PArallel Structured COarsening): an overlay to speed up graph clustering algorithms","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-11T13:03:17.349793Z"},"links":{"cited_paper":"/paper/2105.02022","citing_paper":"/paper/2412.13592"},"observation_digest":"sha256:de4dd36fbc0e1823bc052b086e81cc934ef42c1e872b1f82b1c8bdf93f0451e2","observation_id":"1cb07f01-0a85-4d3d-94a3-e69f9b105252","resolution":{"observed_at":"2026-08-11T13:03:17.554740Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T13:03:17.925536Z","title":"Journal of Experimental Algorithmics (JEA) 16, 2–1 (2011)","venue":null,"work_id":"14195441-367f-4812-82ca-802eb3ae45b7","year":2011},"citing_paper":{"arxiv_id":"2412.13592","last_updated":"2025-06-12T08:23:21Z","snapshot_observed_at":"2026-08-14T00:39:09.191604Z","submitted_at":"2024-12-18T08:15:55Z","title":"PASCO (PArallel Structured COarsening): an overlay to speed up graph clustering algorithms","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-11T13:03:17.354778Z"},"links":{"citing_paper":"/paper/2412.13592"},"observation_digest":"sha256:a213c9605a4d4a008a94aea6858b4075492ac26aa85bdc2466241914ba6f5da0","observation_id":"5de96455-9c04-46f5-8913-71adbe96c288","resolution":{"observed_at":"2026-08-11T13:03:17.930703Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T13:03:17.910718Z","title":"The European physical journal B 86, 1–14 (2013)","venue":null,"work_id":"6c1b1ca8-c651-4d84-8832-0c73055303d9","year":2013},"citing_paper":{"arxiv_id":"2412.13592","last_updated":"2025-06-12T08:23:21Z","snapshot_observed_at":"2026-08-14T00:39:09.191604Z","submitted_at":"2024-12-18T08:15:55Z","title":"PASCO (PArallel Structured COarsening): an overlay to speed up graph clustering algorithms","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-11T13:03:17.359398Z"},"links":{"citing_paper":"/paper/2412.13592"},"observation_digest":"sha256:ffa47807c09d2ae3d80ab52e7491916a8342065f4d9058ace291532bed372f1a","observation_id":"5318b48b-0a2a-42b7-9057-09576b35c594","resolution":{"observed_at":"2026-08-11T13:03:17.915497Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T13:03:17.895227Z","title":"Data Clustering (2018) 20","venue":null,"work_id":"506bb500-867f-4c64-9f9f-6093d3307eb9","year":2018},"citing_paper":{"arxiv_id":"2412.13592","last_updated":"2025-06-12T08:23:21Z","snapshot_observed_at":"2026-08-14T00:39:09.191604Z","submitted_at":"2024-12-18T08:15:55Z","title":"PASCO (PArallel Structured COarsening): an overlay to speed up graph clustering algorithms","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-11T13:03:17.363852Z"},"links":{"citing_paper":"/paper/2412.13592"},"observation_digest":"sha256:a50842d0f601afacfedec6a9635ab78cedf0b43b54030e473e027ac54c479b5a","observation_id":"b0d24617-840a-49fb-8716-f29f494357cf","resolution":{"observed_at":"2026-08-11T13:03:17.900201Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T13:03:17.881152Z","title":"IEEE transactions on knowledge and data engineering 27(1) (2014)","venue":null,"work_id":"0086de44-21e9-4fa2-888a-f9c046cbda7c","year":2014},"citing_paper":{"arxiv_id":"2412.13592","last_updated":"2025-06-12T08:23:21Z","snapshot_observed_at":"2026-08-14T00:39:09.191604Z","submitted_at":"2024-12-18T08:15:55Z","title":"PASCO (PArallel Structured COarsening): an overlay to speed up graph clustering algorithms","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-11T13:03:17.368713Z"},"links":{"citing_paper":"/paper/2412.13592"},"observation_digest":"sha256:e316959e97aa350adc3bf6ab146d08ff6056c89ef9fa4951d88550d90c6e5bf8","observation_id":"e902e820-6f0f-439c-ab5d-b8f27fe87050","resolution":{"observed_at":"2026-08-11T13:03:17.885407Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T13:03:17.867622Z","title":"In: International Work- shop on Multiple Classifier Systems (2001)","venue":null,"work_id":"d2a94c06-c155-42a7-8c83-adb881b1f3aa","year":2001},"citing_paper":{"arxiv_id":"2412.13592","last_updated":"2025-06-12T08:23:21Z","snapshot_observed_at":"2026-08-14T00:39:09.191604Z","submitted_at":"2024-12-18T08:15:55Z","title":"PASCO (PArallel Structured COarsening): an overlay to speed up graph clustering algorithms","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-11T13:03:17.374118Z"},"links":{"citing_paper":"/paper/2412.13592"},"observation_digest":"sha256:619cdfe136f09fb9300d862912d5016d7f6be7433856d9f34aa814c8cb82a2a5","observation_id":"9d2fcc4f-afca-4b6d-b879-c6c766dc5551","resolution":{"observed_at":"2026-08-11T13:03:17.871741Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T13:03:17.854121Z","title":"Foundations and Trends® in Machine Learning 11(5-6) (2019)","venue":null,"work_id":"5a5687d0-0211-449d-8fd2-6cc6403f2bbf","year":2019},"citing_paper":{"arxiv_id":"2412.13592","last_updated":"2025-06-12T08:23:21Z","snapshot_observed_at":"2026-08-14T00:39:09.191604Z","submitted_at":"2024-12-18T08:15:55Z","title":"PASCO (PArallel Structured COarsening): an overlay to speed up graph clustering algorithms","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-11T13:03:17.379358Z"},"links":{"citing_paper":"/paper/2412.13592"},"observation_digest":"sha256:5d731519fdaa4e899697a533f9ec7e3e81ad20e6596e36970e429740e2b27e48","observation_id":"dca0fa98-b47f-4b8f-8627-5be1d7566b07","resolution":{"observed_at":"2026-08-11T13:03:17.858365Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T13:03:17.839840Z","title":"SIAM Journal on scientific Computing 20(1) (1998)","venue":null,"work_id":"d21ea91b-969c-419f-85cd-a4d7c45e911e","year":1998},"citing_paper":{"arxiv_id":"2412.13592","last_updated":"2025-06-12T08:23:21Z","snapshot_observed_at":"2026-08-14T00:39:09.191604Z","submitted_at":"2024-12-18T08:15:55Z","title":"PASCO (PArallel Structured COarsening): an overlay to speed up graph clustering algorithms","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-11T13:03:17.385319Z"},"links":{"citing_paper":"/paper/2412.13592"},"observation_digest":"sha256:318e0acf3cba83445d7d2683c8817ed8800a52910890a0947588bdae73fb87e8","observation_id":"0e70b4fd-c473-4230-b254-1e97cb508e4f","resolution":{"observed_at":"2026-08-11T13:03:17.844583Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T13:03:17.824666Z","title":"Statistical Analysis and Data Mining: The ASA Data Science Journal 12(5) (2019)","venue":null,"work_id":"b1a1d9f3-a8f0-46ee-91d0-6365c62858f2","year":2019},"citing_paper":{"arxiv_id":"2412.13592","last_updated":"2025-06-12T08:23:21Z","snapshot_observed_at":"2026-08-14T00:39:09.191604Z","submitted_at":"2024-12-18T08:15:55Z","title":"PASCO (PArallel Structured COarsening): an overlay to speed up graph clustering algorithms","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-11T13:03:17.390483Z"},"links":{"citing_paper":"/paper/2412.13592"},"observation_digest":"sha256:f2c92e6463b20f770b7b26f3cbda91386cf306d9d94ce2ae084c2c73dc11a871","observation_id":"00b7bdf0-6e09-4e8f-848e-75b7da15d4e1","resolution":{"observed_at":"2026-08-11T13:03:17.829707Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T13:03:17.809056Z","title":"JMLR 22(78) (2021)","venue":null,"work_id":"c6e190bb-e4b7-4c88-97bf-41e359f43ccc","year":2021},"citing_paper":{"arxiv_id":"2412.13592","last_updated":"2025-06-12T08:23:21Z","snapshot_observed_at":"2026-08-14T00:39:09.191604Z","submitted_at":"2024-12-18T08:15:55Z","title":"PASCO (PArallel Structured COarsening): an overlay to speed up graph clustering algorithms","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-11T13:03:17.395921Z"},"links":{"citing_paper":"/paper/2412.13592"},"observation_digest":"sha256:283c96e94fd68e4d99b548f5053fba5a8171b92413afb1e91de75d1be1971011","observation_id":"07cccbd6-fcc7-426e-9309-3ea18732dcd9","resolution":{"observed_at":"2026-08-11T13:03:17.814084Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T13:03:17.793946Z","title":"In: ICML (2014)","venue":null,"work_id":"96b7cde6-84fb-42f9-af3f-ef7f4d2f9569","year":2014},"citing_paper":{"arxiv_id":"2412.13592","last_updated":"2025-06-12T08:23:21Z","snapshot_observed_at":"2026-08-14T00:39:09.191604Z","submitted_at":"2024-12-18T08:15:55Z","title":"PASCO (PArallel Structured COarsening): an overlay to speed up graph clustering algorithms","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-11T13:03:17.401140Z"},"links":{"citing_paper":"/paper/2412.13592"},"observation_digest":"sha256:e7ef374335ebc7af7dac3077ab89ebd3a81a147cf14bbae0fc31849086011d1b","observation_id":"f4ad1bf6-4443-43d6-adb2-b3b33468bbde","resolution":{"observed_at":"2026-08-11T13:03:17.798846Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T13:03:17.777695Z","title":"Pattern Recognition 43(5) (2010)","venue":null,"work_id":"973aeffa-22c6-4dd8-8a61-ccf03ddc24b2","year":2010},"citing_paper":{"arxiv_id":"2412.13592","last_updated":"2025-06-12T08:23:21Z","snapshot_observed_at":"2026-08-14T00:39:09.191604Z","submitted_at":"2024-12-18T08:15:55Z","title":"PASCO (PArallel Structured COarsening): an overlay to speed up graph clustering algorithms","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-11T13:03:17.406110Z"},"links":{"citing_paper":"/paper/2412.13592"},"observation_digest":"sha256:378a2e36555cbd35d26ae0cdbf23aef3c497f09ebcac1315ad989a5d2d365f01","observation_id":"18e3bc41-8488-447f-aaa0-450a6af34f0f","resolution":{"observed_at":"2026-08-11T13:03:17.783027Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T13:03:17.762089Z","title":"In: AISTATS (2018)","venue":null,"work_id":"cd727a69-7bd9-4ca4-ae67-1d43672aec8d","year":2018},"citing_paper":{"arxiv_id":"2412.13592","last_updated":"2025-06-12T08:23:21Z","snapshot_observed_at":"2026-08-14T00:39:09.191604Z","submitted_at":"2024-12-18T08:15:55Z","title":"PASCO (PArallel Structured COarsening): an overlay to speed up graph clustering algorithms","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-11T13:03:17.411006Z"},"links":{"citing_paper":"/paper/2412.13592"},"observation_digest":"sha256:5133edd37520e1386fa1d97a65c267288c44b58265e32141510554726238ab3d","observation_id":"a015de76-d01e-4c7f-9bda-c962da5d3b85","resolution":{"observed_at":"2026-08-11T13:03:17.767177Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T13:03:17.745625Z","title":"https://hal.science/hal-05086352","venue":null,"work_id":"f52f91b7-ad4c-4725-8d80-953ebfd7c3d4","year":null},"citing_paper":{"arxiv_id":"2412.13592","last_updated":"2025-06-12T08:23:21Z","snapshot_observed_at":"2026-08-14T00:39:09.191604Z","submitted_at":"2024-12-18T08:15:55Z","title":"PASCO (PArallel Structured COarsening): an overlay to speed up graph clustering algorithms","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-11T13:03:17.416104Z"},"links":{"citing_paper":"/paper/2412.13592"},"observation_digest":"sha256:9dc624b79407ed255097a77d1eb8b9a84366e7304a46c4a7c2a0dcb378619525","observation_id":"378c5b82-eb4d-44c2-8356-f27455e4211b","resolution":{"observed_at":"2026-08-11T13:03:17.751243Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T13:03:17.728914Z","title":"In: ICML (2018)","venue":null,"work_id":"bccb2d64-71ad-4385-8538-275b6a5b28be","year":2018},"citing_paper":{"arxiv_id":"2412.13592","last_updated":"2025-06-12T08:23:21Z","snapshot_observed_at":"2026-08-14T00:39:09.191604Z","submitted_at":"2024-12-18T08:15:55Z","title":"PASCO (PArallel Structured COarsening): an overlay to speed up graph clustering algorithms","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-11T13:03:17.421222Z"},"links":{"citing_paper":"/paper/2412.13592"},"observation_digest":"sha256:d61ad925d6887b37adc4ccb808498f148cd0fa8fe753184f10d458546a760e99","observation_id":"0651fd0f-68f1-43ac-85e9-b2aaa2909e2a","resolution":{"observed_at":"2026-08-11T13:03:17.733968Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2005.00687","last_updated":"2021-02-25T02:06:27Z","snapshot_observed_at":"2026-08-16T13:28:09.232356Z","submitted_at":"2020-05-02T03:09:50Z","title":"Open Graph Benchmark: Datasets for Machine Learning on Graphs","version":7},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2005.00687","snapshot_observed_at":"2026-08-11T13:03:17.426897Z","title":"arXiv preprint arXiv:2005.00687 (2020)","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2412.13592","last_updated":"2025-06-12T08:23:21Z","snapshot_observed_at":"2026-08-14T00:39:09.191604Z","submitted_at":"2024-12-18T08:15:55Z","title":"PASCO (PArallel Structured COarsening): an overlay to speed up graph clustering algorithms","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-11T13:03:17.426897Z"},"links":{"cited_paper":"/paper/2005.00687","citing_paper":"/paper/2412.13592"},"observation_digest":"sha256:edac1b45748e8cc9aa31cc8eafd13ac4b82e65aa05e6eafaa1f551ca4378b356","observation_id":"c276d391-3d1a-4781-bae7-ed59ce8d4ef9","resolution":{"observed_at":"2026-08-11T13:03:17.426897Z","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-11T13:03:17.712680Z","title":"In: Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (2004)","venue":null,"work_id":"ebcc3652-9476-434e-9edf-f579f6f7d5e9","year":2004},"citing_paper":{"arxiv_id":"2412.13592","last_updated":"2025-06-12T08:23:21Z","snapshot_observed_at":"2026-08-14T00:39:09.191604Z","submitted_at":"2024-12-18T08:15:55Z","title":"PASCO (PArallel Structured COarsening): an overlay to speed up graph clustering algorithms","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-11T13:03:17.432181Z"},"links":{"citing_paper":"/paper/2412.13592"},"observation_digest":"sha256:90e458d2c478e58226b68801013bca6011fa37ea6990add4bb239e854c98739e","observation_id":"3bfc19f6-b614-48ce-99c7-fde840a453c8","resolution":{"observed_at":"2026-08-11T13:03:17.717420Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T13:03:17.696237Z","title":"Scientific reports 9(1) (2019)","venue":null,"work_id":"85320db0-c1f3-4639-b6a6-6814c5438402","year":2019},"citing_paper":{"arxiv_id":"2412.13592","last_updated":"2025-06-12T08:23:21Z","snapshot_observed_at":"2026-08-14T00:39:09.191604Z","submitted_at":"2024-12-18T08:15:55Z","title":"PASCO (PArallel Structured COarsening): an overlay to speed up graph clustering algorithms","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-11T13:03:17.437025Z"},"links":{"citing_paper":"/paper/2412.13592"},"observation_digest":"sha256:0c4bdc6950c9cbcb26ae1b929d4cb6394b521d8dafea6e8ec5256849d3d7f667","observation_id":"6ecf21e4-0e4e-416b-aead-1f0a3bc96610","resolution":{"observed_at":"2026-08-11T13:03:17.701475Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T13:03:17.680706Z","title":"Physical review E 69 (2004) 21","venue":null,"work_id":"10b7732b-6b71-4ce1-a413-044416ec56fd","year":2004},"citing_paper":{"arxiv_id":"2412.13592","last_updated":"2025-06-12T08:23:21Z","snapshot_observed_at":"2026-08-14T00:39:09.191604Z","submitted_at":"2024-12-18T08:15:55Z","title":"PASCO (PArallel Structured COarsening): an overlay to speed up graph clustering algorithms","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-11T13:03:17.441873Z"},"links":{"citing_paper":"/paper/2412.13592"},"observation_digest":"sha256:cfa222b63b4ca33e29c819496b778c1d8ced19fcf58205674f312ab77739baf2","observation_id":"8814da54-4ac5-441f-8b3b-862551612da0","resolution":{"observed_at":"2026-08-11T13:03:17.685469Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T13:03:17.665054Z","title":null,"venue":null,"work_id":"9d075526-8016-4e74-bd56-870ebad5528d","year":2007},"citing_paper":{"arxiv_id":"2412.13592","last_updated":"2025-06-12T08:23:21Z","snapshot_observed_at":"2026-08-14T00:39:09.191604Z","submitted_at":"2024-12-18T08:15:55Z","title":"PASCO (PArallel Structured COarsening): an overlay to speed up graph clustering algorithms","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-11T13:03:17.447018Z"},"links":{"citing_paper":"/paper/2412.13592"},"observation_digest":"sha256:34f48afb1be3ba1db81bae4811526516ea3861eb79abe9ce0d53ea8574bf7e9c","observation_id":"204b0579-9cec-49e1-b462-5c776631eac7","resolution":{"observed_at":"2026-08-11T13:03:17.669399Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T13:03:17.647878Z","title":"Mathematical programming 45(1) (1989)","venue":null,"work_id":"74188f7a-54e5-4b2b-975d-d882bb7aa326","year":1989},"citing_paper":{"arxiv_id":"2412.13592","last_updated":"2025-06-12T08:23:21Z","snapshot_observed_at":"2026-08-14T00:39:09.191604Z","submitted_at":"2024-12-18T08:15:55Z","title":"PASCO (PArallel Structured COarsening): an overlay to speed up graph clustering algorithms","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-11T13:03:17.452104Z"},"links":{"citing_paper":"/paper/2412.13592"},"observation_digest":"sha256:fc3d66608e0ea3702b0090643f34e81c82e51aa7188962d3ed4995b1cc36e940","observation_id":"6833d87f-1247-4dd3-99fb-2be949c12be1","resolution":{"observed_at":"2026-08-11T13:03:17.654053Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T13:03:17.632292Z","title":null,"venue":null,"work_id":"046cd29c-b294-407e-89ea-8b8e5ceaf030","year":2010},"citing_paper":{"arxiv_id":"2412.13592","last_updated":"2025-06-12T08:23:21Z","snapshot_observed_at":"2026-08-14T00:39:09.191604Z","submitted_at":"2024-12-18T08:15:55Z","title":"PASCO (PArallel Structured COarsening): an overlay to speed up graph clustering algorithms","version":2},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-11T13:03:17.457082Z"},"links":{"citing_paper":"/paper/2412.13592"},"observation_digest":"sha256:1f0069cc994fd57de6c0c8f794f16bc40478428553bd2cb52cdbe8962fb7973c","observation_id":"16b3c23f-922d-4be0-8421-c7dbbd5f2e0c","resolution":{"observed_at":"2026-08-11T13:03:17.636520Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T13:03:17.615911Z","title":"Linux Journal 2013(235), 3 (2013)","venue":null,"work_id":"bad66133-e5a8-4c58-87b0-6f42ee4c0b03","year":2013},"citing_paper":{"arxiv_id":"2412.13592","last_updated":"2025-06-12T08:23:21Z","snapshot_observed_at":"2026-08-14T00:39:09.191604Z","submitted_at":"2024-12-18T08:15:55Z","title":"PASCO (PArallel Structured COarsening): an overlay to speed up graph clustering algorithms","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-11T13:03:17.462050Z"},"links":{"citing_paper":"/paper/2412.13592"},"observation_digest":"sha256:be2bf3dc5f8972585d69fbd016af634ddb1da8c9aa24fcb4cbb01f5800f4f845","observation_id":"b8373a69-5232-435b-82c5-71f94ea76512","resolution":{"observed_at":"2026-08-11T13:03:17.621109Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T13:03:17.599820Z","title":"AAAI (2015)","venue":null,"work_id":"37d7effb-3ef8-4c4a-98fd-1eefec6369bd","year":2015},"citing_paper":{"arxiv_id":"2412.13592","last_updated":"2025-06-12T08:23:21Z","snapshot_observed_at":"2026-08-14T00:39:09.191604Z","submitted_at":"2024-12-18T08:15:55Z","title":"PASCO (PArallel Structured COarsening): an overlay to speed up graph clustering algorithms","version":2},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-11T13:03:17.467191Z"},"links":{"citing_paper":"/paper/2412.13592"},"observation_digest":"sha256:5eb5e32693342cd51021c1f976335582ad06ab8294c9ce76e016f62ace2f7376","observation_id":"01b09e3c-3eeb-4ee6-8b56-f38c822430c7","resolution":{"observed_at":"2026-08-11T13:03:17.604495Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T13:03:17.583222Z","title":"re-aligned partition","venue":null,"work_id":"476a093c-b293-4f40-b82b-1c93ac4d0a35","year":2009},"citing_paper":{"arxiv_id":"2412.13592","last_updated":"2025-06-12T08:23:21Z","snapshot_observed_at":"2026-08-14T00:39:09.191604Z","submitted_at":"2024-12-18T08:15:55Z","title":"PASCO (PArallel Structured COarsening): an overlay to speed up graph clustering algorithms","version":2},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-11T13:03:17.472043Z"},"links":{"citing_paper":"/paper/2412.13592"},"observation_digest":"sha256:ed4d3bdaceb045814f0432d7a50585113a6000a55ede1ed793544c053424b1f0","observation_id":"a92b566c-7584-4121-b109-4ba87ce9ef9f","resolution":{"observed_at":"2026-08-11T13:03:17.588612Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T13:03:17.567113Z","title":null,"venue":null,"work_id":"25e28b08-838d-4690-8857-caa9ee263878","year":null},"citing_paper":{"arxiv_id":"2412.13592","last_updated":"2025-06-12T08:23:21Z","snapshot_observed_at":"2026-08-14T00:39:09.191604Z","submitted_at":"2024-12-18T08:15:55Z","title":"PASCO (PArallel Structured COarsening): an overlay to speed up graph clustering algorithms","version":2},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-11T13:03:17.478181Z"},"links":{"citing_paper":"/paper/2412.13592"},"observation_digest":"sha256:becbc53dbecfffeb89ddfa8ec5f0acb5908054cc4f165bdf5975082220da8765","observation_id":"df4780fe-2cf5-494b-92fd-3c04c4a31007","resolution":{"observed_at":"2026-08-11T13:03:17.572857Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2412.13592","last_updated":"2025-06-12T08:23:21Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-14T00:39:09.191604Z","submitted_at":"2024-12-18T08:15:55Z","title":"PASCO (PArallel Structured COarsening): an overlay to speed up graph clustering algorithms"},"reference_resolution":{"displayed":47,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":4,"verified_exact":0,"verified_fuzzy":42},"total_outbound_references":47},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 47 of 47 outbound references and 0 inbound Pith citation observations for arXiv:2412.13592."}