{"as_of":"2026-08-20T02:45:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ff4903317ae5aea48c0790ec2482e9ecaa68fadcaf1c0ff95e01355031a9d1df","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-19T06:32:44.657259+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:1b9224a1b941e943255adaf600029a09197953234d7da52baa6b8a74a7ffab3b","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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:497007dfdce14a8441cdf3d3ebca910f42515d96a833266e162f886945a5024c","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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:f58cb682f46b062d82a18df4c34256edbe005e8f315463f74ca2fc2fde0daae7","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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:5e53b11e1b0b4118a2f3d26f05b18a66be1f2db2089043fc8e1aa2134e87e812","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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:43a9bc2c9bea589313c5c0e323b8bd08c873ded705f0a3abb6626bb98b1deaa0","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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:6c8d8eff58bd28f14741d29ea293f3cc43bc850a068463bf7f701dc3d227e6af","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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:e8bddd8eac0d5790bb9ff7e5146fbd8f98ed1ce47e977d39670ccddce9219c91","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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:325de5e60899ef3cc110674bca3a93b56630e076bee91855b69f9c559f4162b1","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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:26e490109551851df6688da2ca34565b8ae460884802d94d85825235a26adeb1","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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:4a19749ea65712a2ff32790214463adebe2623260747d2c087b9f71f515676b2","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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:a8c25bc69b38c6f4d79986ab45e7e5b747a74868e9a80cd830c346097b1fb2a9","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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:e0357968aa0a31bb215b30e1f25c5d2ca519b1f8980024787708d96cd26703f2","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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:d45df398ad4741971d97e105322469570e1546ede52dafe6bdce3c7a0b85e798","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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:7b463c156f5204e4fcf0b8dbf8a07c0f8b9dde89729cf8c9f4b97b54889b6ba8","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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:739a44cf03b0a64013eb9a32dc4b116861c85aabef2c3e8ea9bf2db3902336ce","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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:4730efd9437371972810efc466e604fca456a8dd77bc3b3f20f8904f1872df44","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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:1bc30d1bfb4730a8a7c388bc4139774a8585305ff52473909f4122a71d635d3a","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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:9a9a8836165131af523970fb083e22a8519b93c599169c0375f24d527b37dccc","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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:e9db39e76f813dd728da7b852cd7c7467d032ae094e745f58cf65878b1cdcc87","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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:69614c715721c7c556af0f4bf47452e4a4daf6e52bd44c9a015c9ee0dce9353c","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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:115a6f082fd2b48e1c2c300a3a2963b780c4f1809d39d876b471eea1c0ab61af","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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:28438249da2655867bac77214594b3c2ed8cb59fa2b6b23f60d83189d7220bd9","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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:c352475217aba14c8f99ffa896dfdae3da9328d7a3eb4cb373d641e5bf4a0a43","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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:dfc4faa4d960d11387556c1885e1dc3e10fec233b96ae54bc38fc028337ba99e","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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:2f40191d13350ec19c4dd8547306ec17dc90d553823c70a901a9917cc402db57","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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:a73452072806bb54c140a948bb56094cc2bd40ca6257d24108846288199861f2","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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:4ad5491d027e715e8e4461bc8991efa6d0526b155403622ccf261390e887db66","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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:360978a5f24b53694816cef201382d637939379169d1a8d5b6a47451ca7ad502","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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:679fb3bf050db721d6518967d9988f26cc59b9f06a8eb0146e47e812a8cce709","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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:5df830a9965d49bf80a9fe2cd9f0934306f3540b70bf546c2a4f066d2cf718f5","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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:a134274dd16d28a21a3bac74e12f9b2d435e3ec50047f54333aec00ea68b139d","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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:cb8f71795cd4302346d113753ca99af776fdc617c110d6c17e8b6846b59b949b","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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:046fea0ef3f3794a61cb87891a80404cc81a3fb0813560b6f9d99c57c28c0c37","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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:4b13139680be10bc08e1a00de7e062423021a1c1dcb079b24313f339ad9dadb9","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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:91fc47a03957c2f4b49a037350d4de86b1bb5bef197a0238d0c2ccfaefd23706","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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:9117844075b921fb4b796dbc21dd03ed623487fbede5c5f16a8210a7c6b2133f","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-18T09:31:00.189576Z","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:acfeecd91201c676bab67d921f0b00b0b4af3425f4cb80301b5ebbd498a7a1b0","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:1dd0089f9d9a9ef71270c5bad60bcc36114352832a39c7796c3240595c60dcda","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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:7d587117a3f9554a062ffcc0dadb90a93881709692bb02f73981c30d0e4002cb","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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:f70f8c496dd028f89a6400b5a57f50a54ab6403c26bfc246678ec9c84b3854f5","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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:824fdc2789c029925928326a970669d0680a45460b930fe02dccf8fbc4f994ca","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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:69ecaf521c8aa9d5978a92b8f86956267cfe8dab43d3c38ce0911e495f5890ae","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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:351fc6fdd73cdcce7992c094d071c16ac7dd672ba54766421db5116dcd37e00f","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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:923044abd2dd58f28924f54caabdc08a3409122e3584e78eff3d63c6bdb2fe22","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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:82b4a1e6b6a3a738cc4ff459bdd473d778aa7d20d577d2d0271549b1ce19ad3e","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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:b7928dd224595e22af5aab0981e189c01fb788f52546acf677fd22d90ef30299","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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:4c22b1d13e2511e14f61502ff0e4ff0521388919107a66aa382dfbeb9f3f81a0","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 47 of 47 outbound references and 0 inbound Pith citation observations for arXiv:2412.13592."}