{"as_of":"2026-08-17T07:28:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2105487696db2f173a729f6f7a16e51b044c13e51acae562a69c9345a5b24f3c","coverage":[{"denominator":54,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":54,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T10:46:26.912628Z","state":"measured"},{"denominator":54,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":54,"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/2504.17615/citation-record","integrity":"/paper/2504.17615/integrity","json":"/paper/2504.17615/citation-record.json","paper":"/paper/2504.17615"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2006.16393","last_updated":"2021-02-02T15:43:57Z","snapshot_observed_at":"2026-08-10T12:42:41.155386Z","submitted_at":"2020-06-29T21:22:15Z","title":"COAX: Correlation-Aware Indexing on Multidimensional Data with Soft Functional Dependencies","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2006.16393","snapshot_observed_at":"2026-08-16T10:46:26.680503Z","title":"Multilevel Algorithms for Partitioning Power-Law Graphs","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2504.17615","last_updated":"2025-04-24T14:39:16Z","snapshot_observed_at":"2026-08-16T10:33:02.323355Z","submitted_at":"2025-04-24T14:39:16Z","title":"Linear-Time Multilevel Graph Partitioning via Edge Sparsification","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-16T10:46:26.680503Z"},"links":{"cited_paper":"/paper/2006.16393","citing_paper":"/paper/2504.17615"},"observation_digest":"sha256:176b3d203bd01fd4970ed0906b9a83729c12a00498e2caeb9580c2536b604fd0","observation_id":"bab99b6a-12c3-41a5-8847-49e7cb345583","resolution":{"observed_at":"2026-08-16T10:46:26.680503Z","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":"10.1145/2601438","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:46:27.269463Z","title":"Ahmed, Jennifer Neville, and Ramana Rao Kompella","venue":null,"work_id":"bb1b66da-1359-4109-88a2-4f81cb405c9a","year":2013},"citing_paper":{"arxiv_id":"2504.17615","last_updated":"2025-04-24T14:39:16Z","snapshot_observed_at":"2026-08-16T10:33:02.323355Z","submitted_at":"2025-04-24T14:39:16Z","title":"Linear-Time Multilevel Graph Partitioning via Edge Sparsification","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-16T10:46:26.685981Z"},"links":{"citing_paper":"/paper/2504.17615"},"observation_digest":"sha256:c51939c5e9286e8da26a8b15f49686689e2d2715cd152d100155aed3d6958cb6","observation_id":"2af81c20-14fa-4462-a824-f5a9df56a000","resolution":{"observed_at":"2026-08-16T10:46:27.274051Z","resolver_source":"doi","status":"verified_exact"},"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":"10.1007/978-3-319-96983-1_47","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:46:27.255702Z","title":"High-Quality Shared-Memory Graph Partitioning","venue":null,"work_id":"03661118-645e-4922-bb51-5dc4f68e7dd5","year":2018},"citing_paper":{"arxiv_id":"2504.17615","last_updated":"2025-04-24T14:39:16Z","snapshot_observed_at":"2026-08-16T10:33:02.323355Z","submitted_at":"2025-04-24T14:39:16Z","title":"Linear-Time Multilevel Graph Partitioning via Edge Sparsification","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-16T10:46:26.690834Z"},"links":{"citing_paper":"/paper/2504.17615"},"observation_digest":"sha256:a91f79e251aef5688e8e3bb2e005bf47b3cae2a855d5d7fcd880dedd93cdb39f","observation_id":"74e210db-3097-4df6-9a57-8d081a710069","resolution":{"observed_at":"2026-08-16T10:46:27.260120Z","resolver_source":"doi","status":"verified_exact"},"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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:46:26.695505Z","title":"Balanced Graph Partitioning","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2504.17615","last_updated":"2025-04-24T14:39:16Z","snapshot_observed_at":"2026-08-16T10:33:02.323355Z","submitted_at":"2025-04-24T14:39:16Z","title":"Linear-Time Multilevel Graph Partitioning via Edge Sparsification","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-16T10:46:26.695505Z"},"links":{"citing_paper":"/paper/2504.17615"},"observation_digest":"sha256:b61be911b1c29d88a14f50058cac340f8bddce56b9ee828ce5510e428add399b","observation_id":"33a9d23f-3a0a-44a9-b61a-c8906c276be0","resolution":{"observed_at":"2026-08-16T10:46:26.695505Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:46:26.700280Z","title":"Algorithms for Large-Scale Network Analysis and the NetworKit Toolkit","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2504.17615","last_updated":"2025-04-24T14:39:16Z","snapshot_observed_at":"2026-08-16T10:33:02.323355Z","submitted_at":"2025-04-24T14:39:16Z","title":"Linear-Time Multilevel Graph Partitioning via Edge Sparsification","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-16T10:46:26.700280Z"},"links":{"citing_paper":"/paper/2504.17615"},"observation_digest":"sha256:40293d343562e511fc45f0d6ec4038a66c924d5356fe02d1488e0525fda99f05","observation_id":"bf9a8a6d-8a94-4447-8eb9-80eb5e79e47b","resolution":{"observed_at":"2026-08-16T10:46:26.700280Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:46:26.704433Z","title":"Prioritized Restreaming Algorithms for Balanced Graph Partitioning","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2504.17615","last_updated":"2025-04-24T14:39:16Z","snapshot_observed_at":"2026-08-16T10:33:02.323355Z","submitted_at":"2025-04-24T14:39:16Z","title":"Linear-Time Multilevel Graph Partitioning via Edge Sparsification","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-16T10:46:26.704433Z"},"links":{"citing_paper":"/paper/2504.17615"},"observation_digest":"sha256:6ebb2d748a93ee7f35e6bf33f3148458bad972bd6fc2207b6c264e1f7c511356","observation_id":"86438aec-cfd1-4f97-9cac-d0b8d5e23db2","resolution":{"observed_at":"2026-08-16T10:46:26.704433Z","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":"10.1016/j.jpdc.2006.05.005","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:46:27.232830Z","title":null,"venue":null,"work_id":"5a9daae5-badd-4a1d-a071-545da687f671","year":2007},"citing_paper":{"arxiv_id":"2504.17615","last_updated":"2025-04-24T14:39:16Z","snapshot_observed_at":"2026-08-16T10:33:02.323355Z","submitted_at":"2025-04-24T14:39:16Z","title":"Linear-Time Multilevel Graph Partitioning via Edge Sparsification","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-16T10:46:26.709161Z"},"links":{"citing_paper":"/paper/2504.17615"},"observation_digest":"sha256:4d035b679359ef7c94cfe46e1aaf76554fe1d8c154207e5d2aba757d2e37b1c5","observation_id":"4f1d00fe-85f1-4818-8915-4be424fc1856","resolution":{"observed_at":"2026-08-16T10:46:27.237292Z","resolver_source":"doi","status":"verified_exact"},"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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:46:26.713546Z","title":"Bader, Henning Meyerhenke, Peter Sanders, and Dorothea Wagner","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2504.17615","last_updated":"2025-04-24T14:39:16Z","snapshot_observed_at":"2026-08-16T10:33:02.323355Z","submitted_at":"2025-04-24T14:39:16Z","title":"Linear-Time Multilevel Graph Partitioning via Edge Sparsification","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-16T10:46:26.713546Z"},"links":{"citing_paper":"/paper/2504.17615"},"observation_digest":"sha256:7e815cb6a98deea36ca6877a9b0dd53c746ed9d73de7904fd82e949b5c14176c","observation_id":"29d2b400-8775-4803-84bc-d6ef79d0fbf9","resolution":{"observed_at":"2026-08-16T10:46:26.713546Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:46:26.717687Z","title":"Bencz\\' u r and David R","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2504.17615","last_updated":"2025-04-24T14:39:16Z","snapshot_observed_at":"2026-08-16T10:33:02.323355Z","submitted_at":"2025-04-24T14:39:16Z","title":"Linear-Time Multilevel Graph Partitioning via Edge Sparsification","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-16T10:46:26.717687Z"},"links":{"citing_paper":"/paper/2504.17615"},"observation_digest":"sha256:ed50b8e14ff91961c72808d056ecab52b0aa4242fdac5cea4989177b502039af","observation_id":"ce89921a-2e4a-42db-ac4e-a9c373127143","resolution":{"observed_at":"2026-08-16T10:46:26.717687Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:46:26.721763Z","title":"Blondel, Jean Guillaume, Renaud Lambiotte, and Etienne Lefebvre","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2504.17615","last_updated":"2025-04-24T14:39:16Z","snapshot_observed_at":"2026-08-16T10:33:02.323355Z","submitted_at":"2025-04-24T14:39:16Z","title":"Linear-Time Multilevel Graph Partitioning via Edge Sparsification","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-16T10:46:26.721763Z"},"links":{"citing_paper":"/paper/2504.17615"},"observation_digest":"sha256:006358dfb25496ef4af2a2c46dfc7737180fab4bdb52552b8f95cff1901fdc26","observation_id":"85b26c59-a822-4057-87cc-d13781304db7","resolution":{"observed_at":"2026-08-16T10:46:26.721763Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:46:26.726276Z","title":"Boman, Karen D","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2504.17615","last_updated":"2025-04-24T14:39:16Z","snapshot_observed_at":"2026-08-16T10:33:02.323355Z","submitted_at":"2025-04-24T14:39:16Z","title":"Linear-Time Multilevel Graph Partitioning via Edge Sparsification","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-16T10:46:26.726276Z"},"links":{"citing_paper":"/paper/2504.17615"},"observation_digest":"sha256:d5a31e0fadc5711dddf6d495dc2ebdba7c1427b217452e4e928f40312942a8eb","observation_id":"5c13be48-656b-4c4e-9413-cbec62b90784","resolution":{"observed_at":"2026-08-16T10:46:26.726276Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"physics/0608255","last_updated":"2006-08-30T09:49:23Z","snapshot_observed_at":"2026-08-15T11:05:12.632381Z","submitted_at":"2006-08-25T16:46:12Z","title":"Maximizing Modularity is hard","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"physics/0608255","snapshot_observed_at":"2026-08-16T10:46:26.730469Z","title":"Maximizing Modularity is Hard , 2006","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2504.17615","last_updated":"2025-04-24T14:39:16Z","snapshot_observed_at":"2026-08-16T10:33:02.323355Z","submitted_at":"2025-04-24T14:39:16Z","title":"Linear-Time Multilevel Graph Partitioning via Edge Sparsification","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-16T10:46:26.730469Z"},"links":{"cited_paper":"/paper/physics/0608255","citing_paper":"/paper/2504.17615"},"observation_digest":"sha256:6a71746ae0e6b7a9dd89d0f111665594adcec5d5498b92a56e14ae0606ed5431","observation_id":"839ffd80-60b0-4c57-862c-5cd787291679","resolution":{"observed_at":"2026-08-16T10:46:26.730469Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:46:26.735050Z","title":"Recent Advances in Graph Partitioning","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2504.17615","last_updated":"2025-04-24T14:39:16Z","snapshot_observed_at":"2026-08-16T10:33:02.323355Z","submitted_at":"2025-04-24T14:39:16Z","title":"Linear-Time Multilevel Graph Partitioning via Edge Sparsification","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-16T10:46:26.735050Z"},"links":{"citing_paper":"/paper/2504.17615"},"observation_digest":"sha256:0d17de8e37a79a2e10841961277a0acf84109a2173e6a1cdc6b2b5acd7e90d03","observation_id":"66907e6a-1cc7-4ad0-a762-1c2f5652699f","resolution":{"observed_at":"2026-08-16T10:46:26.735050Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:46:26.739206Z","title":"U mit C ataly \\","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2504.17615","last_updated":"2025-04-24T14:39:16Z","snapshot_observed_at":"2026-08-16T10:33:02.323355Z","submitted_at":"2025-04-24T14:39:16Z","title":"Linear-Time Multilevel Graph Partitioning via Edge Sparsification","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-16T10:46:26.739206Z"},"links":{"citing_paper":"/paper/2504.17615"},"observation_digest":"sha256:bfb0d320d068b2ca41a221e5f8c62bac617f64d43cc5aabc36ed2f03e3202159","observation_id":"0cdca916-9cd6-423e-98fc-6c6303596338","resolution":{"observed_at":"2026-08-16T10:46:26.739206Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:46:26.743222Z","title":"R-MAT: A Recursive Model for Graph Mining","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2504.17615","last_updated":"2025-04-24T14:39:16Z","snapshot_observed_at":"2026-08-16T10:33:02.323355Z","submitted_at":"2025-04-24T14:39:16Z","title":"Linear-Time Multilevel Graph Partitioning via Edge Sparsification","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-16T10:46:26.743222Z"},"links":{"citing_paper":"/paper/2504.17615"},"observation_digest":"sha256:0452473c78f967aa904cc00906c9e276a61ebf6f78e9cb8c5df0ef55279fb20c","observation_id":"cc9addfc-cdaa-4de5-a8b4-e29ad0420650","resolution":{"observed_at":"2026-08-16T10:46:26.743222Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:46:26.747325Z","title":"Bronstein, Ronald G","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2504.17615","last_updated":"2025-04-24T14:39:16Z","snapshot_observed_at":"2026-08-16T10:33:02.323355Z","submitted_at":"2025-04-24T14:39:16Z","title":"Linear-Time Multilevel Graph Partitioning via Edge Sparsification","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-16T10:46:26.747325Z"},"links":{"citing_paper":"/paper/2504.17615"},"observation_digest":"sha256:e2980e04ffd5137ab1bfe20447ee8c4682aa24d4d0ab60f21a5451f1ad52647d","observation_id":"b187558e-0c9a-4fea-a40b-731e31f652a2","resolution":{"observed_at":"2026-08-16T10:46:26.747325Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.07732","last_updated":"2024-10-10T09:00:32Z","snapshot_observed_at":"2026-08-16T13:10:47.277989Z","submitted_at":"2024-10-10T09:00:32Z","title":"Partitioning Trillion Edge Graphs on Edge Devices","version":1},"cited_work":{"arxiv_id":"2410.07732","doi":null,"metadata_source":"pith","pith_arxiv_id":"2410.07732","snapshot_observed_at":"2026-08-16T10:46:28.085454Z","title":"Partitioning Trillion Edge Graphs on Edge Devices","venue":"cs.DS","work_id":"bf183f11-392a-462f-a209-4eaf752ba782","year":2024},"citing_paper":{"arxiv_id":"2504.17615","last_updated":"2025-04-24T14:39:16Z","snapshot_observed_at":"2026-08-16T10:33:02.323355Z","submitted_at":"2025-04-24T14:39:16Z","title":"Linear-Time Multilevel Graph Partitioning via Edge Sparsification","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-16T10:46:26.751430Z"},"links":{"cited_paper":"/paper/2410.07732","citing_paper":"/paper/2504.17615"},"observation_digest":"sha256:0bfc316bb159ff9cc2ec6ae1f3e8697a71f1e60a39e786bb83a8c43a68ee1fd6","observation_id":"70bf652b-8bb1-49b2-bef9-0902b33ce0d4","resolution":{"observed_at":"2026-08-16T10:46:28.090143Z","resolver_source":"local_arxiv","status":"verified_exact"},"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":"10.1145/3337792","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:46:27.160096Z","title":"Davis, William W","venue":null,"work_id":"19c11834-268c-4443-ac3d-58e1471f1c2b","year":2020},"citing_paper":{"arxiv_id":"2504.17615","last_updated":"2025-04-24T14:39:16Z","snapshot_observed_at":"2026-08-16T10:33:02.323355Z","submitted_at":"2025-04-24T14:39:16Z","title":"Linear-Time Multilevel Graph Partitioning via Edge Sparsification","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-16T10:46:26.755842Z"},"links":{"citing_paper":"/paper/2504.17615"},"observation_digest":"sha256:765e1cb30a11ec4d046db758e9eebecb75f1881037cd8af5f3ca3c5f9ebb70b7","observation_id":"0c4ce134-16d6-4261-88b7-d8203e7d9294","resolution":{"observed_at":"2026-08-16T10:46:27.164454Z","resolver_source":"doi","status":"verified_exact"},"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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:46:26.760265Z","title":"Davis and Yifan Hu","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2504.17615","last_updated":"2025-04-24T14:39:16Z","snapshot_observed_at":"2026-08-16T10:33:02.323355Z","submitted_at":"2025-04-24T14:39:16Z","title":"Linear-Time Multilevel Graph Partitioning via Edge Sparsification","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-16T10:46:26.760265Z"},"links":{"citing_paper":"/paper/2504.17615"},"observation_digest":"sha256:cc74ffd5e57adc03a1ee282bfa4736dc6aa27bb85cdd288122d4f96480da1632","observation_id":"5d1f624f-d8a6-43fd-8fc3-eb446396e591","resolution":{"observed_at":"2026-08-16T10:46:26.760265Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:46:26.764276Z","title":"Dolan and Jorge J","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2504.17615","last_updated":"2025-04-24T14:39:16Z","snapshot_observed_at":"2026-08-16T10:33:02.323355Z","submitted_at":"2025-04-24T14:39:16Z","title":"Linear-Time Multilevel Graph Partitioning via Edge Sparsification","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-16T10:46:26.764276Z"},"links":{"citing_paper":"/paper/2504.17615"},"observation_digest":"sha256:1489bf67a7ede674a006ce4d0d5688bd1b07d670eb4c4a14d089b4b44dc5b3ef","observation_id":"550d8348-0feb-4ecf-8445-5726d1b6f672","resolution":{"observed_at":"2026-08-16T10:46:26.764276Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:46:26.768383Z","title":"Buffered Streaming Graph Partitioning","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2504.17615","last_updated":"2025-04-24T14:39:16Z","snapshot_observed_at":"2026-08-16T10:33:02.323355Z","submitted_at":"2025-04-24T14:39:16Z","title":"Linear-Time Multilevel Graph Partitioning via Edge Sparsification","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-16T10:46:26.768383Z"},"links":{"citing_paper":"/paper/2504.17615"},"observation_digest":"sha256:efd928c908c00a1c6ede9825dffb78f9560e84a36974d52683233348a9e9abd6","observation_id":"a0b2ebb9-c524-44b1-8ed8-ba0beb072a6f","resolution":{"observed_at":"2026-08-16T10:46:26.768383Z","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":"10.1007/s00453-022-01053-4","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:46:27.128454Z","title":"Faster Cut Sparsification of Weighted Graphs","venue":null,"work_id":"b72bccaf-942e-4f28-a16c-b32ba4f0f406","year":2022},"citing_paper":{"arxiv_id":"2504.17615","last_updated":"2025-04-24T14:39:16Z","snapshot_observed_at":"2026-08-16T10:33:02.323355Z","submitted_at":"2025-04-24T14:39:16Z","title":"Linear-Time Multilevel Graph Partitioning via Edge Sparsification","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-16T10:46:26.772437Z"},"links":{"citing_paper":"/paper/2504.17615"},"observation_digest":"sha256:0cb53cf4626f8619786f84f8d67a9e405fa583e344da172ec283e861a958561d","observation_id":"fb249591-d892-441a-a3aa-5577921fd994","resolution":{"observed_at":"2026-08-16T10:46:27.133166Z","resolver_source":"doi","status":"verified_exact"},"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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:46:26.776512Z","title":"Resolution limit in community detection","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2504.17615","last_updated":"2025-04-24T14:39:16Z","snapshot_observed_at":"2026-08-16T10:33:02.323355Z","submitted_at":"2025-04-24T14:39:16Z","title":"Linear-Time Multilevel Graph Partitioning via Edge Sparsification","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-16T10:46:26.776512Z"},"links":{"citing_paper":"/paper/2504.17615"},"observation_digest":"sha256:5bfe5b3df1966819c6f9d2380f03089f8d38433c09ffe5fa734f2e8a825cb524","observation_id":"a8635f1a-b294-43ce-9fc3-a44b8c312c76","resolution":{"observed_at":"2026-08-16T10:46:26.776512Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:46:26.780548Z","title":"Communication-free Massively Distributed Graph Generation","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2504.17615","last_updated":"2025-04-24T14:39:16Z","snapshot_observed_at":"2026-08-16T10:33:02.323355Z","submitted_at":"2025-04-24T14:39:16Z","title":"Linear-Time Multilevel Graph Partitioning via Edge Sparsification","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-16T10:46:26.780548Z"},"links":{"citing_paper":"/paper/2504.17615"},"observation_digest":"sha256:230e3b1e294a475853bdb6dae1029a17a97e3bb184ea9f5b4d97436d20c17d67","observation_id":"ac2e6dc5-8b93-4e0f-9bea-173d129ffc05","resolution":{"observed_at":"2026-08-16T10:46:26.780548Z","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":"10.1137/23m1559129","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:46:27.106210Z","title":"Gilbert, Kamesh Madduri, Erik G","venue":null,"work_id":"85ae3593-1c4b-418d-9bc8-5d1a5d192a30","year":2024},"citing_paper":{"arxiv_id":"2504.17615","last_updated":"2025-04-24T14:39:16Z","snapshot_observed_at":"2026-08-16T10:33:02.323355Z","submitted_at":"2025-04-24T14:39:16Z","title":"Linear-Time Multilevel Graph Partitioning via Edge Sparsification","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-16T10:46:26.784633Z"},"links":{"citing_paper":"/paper/2504.17615"},"observation_digest":"sha256:454759859be873fd00b9df132b69b3814a9ed37d6eca42f3eb7d0cc1392fcea3","observation_id":"ce8f00bb-5d27-414b-965d-cae35a2a65aa","resolution":{"observed_at":"2026-08-16T10:46:27.110630Z","resolver_source":"doi","status":"verified_exact"},"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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:46:26.788780Z","title":"Scalable High-Quality Hypergraph Partitioning","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2504.17615","last_updated":"2025-04-24T14:39:16Z","snapshot_observed_at":"2026-08-16T10:33:02.323355Z","submitted_at":"2025-04-24T14:39:16Z","title":"Linear-Time Multilevel Graph Partitioning via Edge Sparsification","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-16T10:46:26.788780Z"},"links":{"citing_paper":"/paper/2504.17615"},"observation_digest":"sha256:eca325eb9dbea7df738fed2e62d10174b40dc27154c4ee8c9c388bccedd617f9","observation_id":"c881537c-fc93-4d97-957d-30b6d243a1e4","resolution":{"observed_at":"2026-08-16T10:46:26.788780Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:46:26.793412Z","title":"Scalable Shared-Memory Hypergraph Partitioning","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2504.17615","last_updated":"2025-04-24T14:39:16Z","snapshot_observed_at":"2026-08-16T10:33:02.323355Z","submitted_at":"2025-04-24T14:39:16Z","title":"Linear-Time Multilevel Graph Partitioning via Edge Sparsification","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-16T10:46:26.793412Z"},"links":{"citing_paper":"/paper/2504.17615"},"observation_digest":"sha256:e9beb10a960d250f6a1889b627e743b06e5d5108c4b199e56b014cebbc96ab78","observation_id":"ed7afe8b-070f-413a-bccf-767a55d21eee","resolution":{"observed_at":"2026-08-16T10:46:26.793412Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:46:26.797638Z","title":"Deep Multilevel Graph Partitioning","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2504.17615","last_updated":"2025-04-24T14:39:16Z","snapshot_observed_at":"2026-08-16T10:33:02.323355Z","submitted_at":"2025-04-24T14:39:16Z","title":"Linear-Time Multilevel Graph Partitioning via Edge Sparsification","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-16T10:46:26.797638Z"},"links":{"citing_paper":"/paper/2504.17615"},"observation_digest":"sha256:7a15b6a1519f281e3e220b88094a60980d0473f9ab81bfc9a494f804dcf5798e","observation_id":"878d319a-9495-4928-a2cf-4716c07eda3c","resolution":{"observed_at":"2026-08-16T10:46:26.797638Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:46:26.801741Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2504.17615","last_updated":"2025-04-24T14:39:16Z","snapshot_observed_at":"2026-08-16T10:33:02.323355Z","submitted_at":"2025-04-24T14:39:16Z","title":"Linear-Time Multilevel Graph Partitioning via Edge Sparsification","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-16T10:46:26.801741Z"},"links":{"citing_paper":"/paper/2504.17615"},"observation_digest":"sha256:cc8756c1f0cfd1c00c549f2a3df93a09b58ca806b98305bbcae0a1624be258e4","observation_id":"bbfa7620-1511-47b3-96ad-a4cedca6c555","resolution":{"observed_at":"2026-08-16T10:46:26.801741Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:46:26.810296Z","title":"Improving Coarsening Schemes for Hypergraph Partitioning by Exploiting Community Structure","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2504.17615","last_updated":"2025-04-24T14:39:16Z","snapshot_observed_at":"2026-08-16T10:33:02.323355Z","submitted_at":"2025-04-24T14:39:16Z","title":"Linear-Time Multilevel Graph Partitioning via Edge Sparsification","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-16T10:46:26.810296Z"},"links":{"citing_paper":"/paper/2504.17615"},"observation_digest":"sha256:0c0c4e6c1fac94356421a19005f615daecaf099ec91171c179eae82013eec056","observation_id":"0c4a9ec0-1f5d-4cfa-aabc-f8a409b4982a","resolution":{"observed_at":"2026-08-16T10:46:26.810296Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:46:26.814504Z","title":"Faster Fully Compressed Pattern Matching by Recompression","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2504.17615","last_updated":"2025-04-24T14:39:16Z","snapshot_observed_at":"2026-08-16T10:33:02.323355Z","submitted_at":"2025-04-24T14:39:16Z","title":"Linear-Time Multilevel Graph Partitioning via Edge Sparsification","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-16T10:46:26.814504Z"},"links":{"citing_paper":"/paper/2504.17615"},"observation_digest":"sha256:1ab2f4e7aa6acaed45a5c9a361955e22c4b4b78db0c8e095f842244bd9122eb6","observation_id":"aa89be42-6199-497a-af96-bc2f04a7f8ac","resolution":{"observed_at":"2026-08-16T10:46:26.814504Z","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":"4170.22422","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:46:27.883261Z","title":"Analysis of Multilevel Graph Partitioning","venue":null,"work_id":"fcd9f52a-1135-4fba-9045-82316143bfa9","year":1995},"citing_paper":{"arxiv_id":"2504.17615","last_updated":"2025-04-24T14:39:16Z","snapshot_observed_at":"2026-08-16T10:33:02.323355Z","submitted_at":"2025-04-24T14:39:16Z","title":"Linear-Time Multilevel Graph Partitioning via Edge Sparsification","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-16T10:46:26.818677Z"},"links":{"citing_paper":"/paper/2504.17615"},"observation_digest":"sha256:a49423573358fff0b3c42441e501fea94661048f2dc91d65eee859b3c78f7c80","observation_id":"a5ffa7dc-b045-4e97-bd59-8bd75ba9193f","resolution":{"observed_at":"2026-08-16T10:46:27.890382Z","resolver_source":"raw_fallback","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:46:26.822814Z","title":"A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2504.17615","last_updated":"2025-04-24T14:39:16Z","snapshot_observed_at":"2026-08-16T10:33:02.323355Z","submitted_at":"2025-04-24T14:39:16Z","title":"Linear-Time Multilevel Graph Partitioning via Edge Sparsification","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-16T10:46:26.822814Z"},"links":{"citing_paper":"/paper/2504.17615"},"observation_digest":"sha256:ae24cb79a34039ae2a8f0c861be382c02bc13568828ca5530e1d4d291ac7106a","observation_id":"60cfb381-11ad-4b35-9ab0-d5157c845154","resolution":{"observed_at":"2026-08-16T10:46:26.822814Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.12013","last_updated":"2025-05-12T13:49:43Z","snapshot_observed_at":"2026-08-16T12:38:17.993570Z","submitted_at":"2025-04-16T12:13:21Z","title":"Deterministic Parallel High-Quality Hypergraph Partitioning","version":2},"cited_work":{"arxiv_id":"2504.12013","doi":null,"metadata_source":"pith","pith_arxiv_id":"2504.12013","snapshot_observed_at":"2026-08-16T10:46:27.817048Z","title":"Deterministic Parallel High-Quality Hypergraph Partitioning","venue":"cs.DC","work_id":"e080eb7d-8f6d-478c-898b-45f6236d379d","year":2025},"citing_paper":{"arxiv_id":"2504.17615","last_updated":"2025-04-24T14:39:16Z","snapshot_observed_at":"2026-08-16T10:33:02.323355Z","submitted_at":"2025-04-24T14:39:16Z","title":"Linear-Time Multilevel Graph Partitioning via Edge Sparsification","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-16T10:46:26.827168Z"},"links":{"cited_paper":"/paper/2504.12013","citing_paper":"/paper/2504.17615"},"observation_digest":"sha256:8347c00c8fe96845483d7b1672091d4e1a233f081d5143ce35eabeaff42e7c19","observation_id":"a72ef4a9-c73c-4d03-9859-e4e7758904ed","resolution":{"observed_at":"2026-08-16T10:46:27.821715Z","resolver_source":"local_arxiv","status":"verified_exact"},"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":"10.1109/ipdps.2013.50","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:46:27.038913Z","title":"Multi-threaded Graph Partitioning","venue":null,"work_id":"a149777e-219d-4773-a155-6cadb6b0fdc8","year":2013},"citing_paper":{"arxiv_id":"2504.17615","last_updated":"2025-04-24T14:39:16Z","snapshot_observed_at":"2026-08-16T10:33:02.323355Z","submitted_at":"2025-04-24T14:39:16Z","title":"Linear-Time Multilevel Graph Partitioning via Edge Sparsification","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-16T10:46:26.831581Z"},"links":{"citing_paper":"/paper/2504.17615"},"observation_digest":"sha256:fc9c947ca4788e0149ccf202116ca4d330d777f76300c7cb20cc5e8156618327","observation_id":"3c333fc3-1eb4-4b84-94eb-707577d5024f","resolution":{"observed_at":"2026-08-16T10:46:27.043413Z","resolver_source":"doi","status":"verified_exact"},"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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:46:26.835800Z","title":"Mostofa Ali Patwary, Nadathur Satish, Narayanan Sundaram, Pradeep Dubey, and George Karypis","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2504.17615","last_updated":"2025-04-24T14:39:16Z","snapshot_observed_at":"2026-08-16T10:33:02.323355Z","submitted_at":"2025-04-24T14:39:16Z","title":"Linear-Time Multilevel Graph Partitioning via Edge Sparsification","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-16T10:46:26.835800Z"},"links":{"citing_paper":"/paper/2504.17615"},"observation_digest":"sha256:b6249410fb63fde4f188dc4c16a7032484cb49071c0fc3b81c59e0860630928c","observation_id":"8bca9137-0161-4bd7-9e55-c47ef1265dd4","resolution":{"observed_at":"2026-08-16T10:46:26.835800Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:46:26.839994Z","title":"Sampling from Large Graphs","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2504.17615","last_updated":"2025-04-24T14:39:16Z","snapshot_observed_at":"2026-08-16T10:33:02.323355Z","submitted_at":"2025-04-24T14:39:16Z","title":"Linear-Time Multilevel Graph Partitioning via Edge Sparsification","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-16T10:46:26.839994Z"},"links":{"citing_paper":"/paper/2504.17615"},"observation_digest":"sha256:f6bd962c8f1a44d255cd6f2f68572db21c81af6e889fff721ce65eaea91095ae","observation_id":"2aa778c1-50ff-4549-8240-656761335b4e","resolution":{"observed_at":"2026-08-16T10:46:26.839994Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:46:26.844077Z","title":"Graph Evolution: Densification and Shrinking Diameters","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2504.17615","last_updated":"2025-04-24T14:39:16Z","snapshot_observed_at":"2026-08-16T10:33:02.323355Z","submitted_at":"2025-04-24T14:39:16Z","title":"Linear-Time Multilevel Graph Partitioning via Edge Sparsification","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-16T10:46:26.844077Z"},"links":{"citing_paper":"/paper/2504.17615"},"observation_digest":"sha256:a48522519004bd403a8dba2b9377b64935c10180a73dfdb040b2bc308f149c3b","observation_id":"3c1a5fe0-06c9-4864-9236-a01624e41b98","resolution":{"observed_at":"2026-08-16T10:46:26.844077Z","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-16T10:46:28.438068Z","title":"SNAP Datasets: Stanford Large Network Dataset Collection","venue":null,"work_id":"22b3eb1f-9976-4a8f-b2ec-c197bdd4df6e","year":2014},"citing_paper":{"arxiv_id":"2504.17615","last_updated":"2025-04-24T14:39:16Z","snapshot_observed_at":"2026-08-16T10:33:02.323355Z","submitted_at":"2025-04-24T14:39:16Z","title":"Linear-Time Multilevel Graph Partitioning via Edge Sparsification","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-16T10:46:26.848459Z"},"links":{"citing_paper":"/paper/2504.17615"},"observation_digest":"sha256:06aca5b128ddd2993c6c8675ebd77f9e0bce2414a6900b4f11b6c84b981dd693","observation_id":"cbdba706-c194-45c4-86ab-8927b4ffa210","resolution":{"observed_at":"2026-08-16T10:46:28.442782Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:46:26.852376Z","title":"Staudt, Michael Hamann, Henning Meyerhenke, and Dorothea Wagner","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2504.17615","last_updated":"2025-04-24T14:39:16Z","snapshot_observed_at":"2026-08-16T10:33:02.323355Z","submitted_at":"2025-04-24T14:39:16Z","title":"Linear-Time Multilevel Graph Partitioning via Edge Sparsification","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-16T10:46:26.852376Z"},"links":{"citing_paper":"/paper/2504.17615"},"observation_digest":"sha256:5ce3f15e582c8231d6bcfe1c3bdeae71a825e88edee380c102cc7f8923d3d254","observation_id":"ffd63517-121c-4431-b864-fff990e1cea9","resolution":{"observed_at":"2026-08-16T10:46:26.852376Z","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":"10.1137/1.9781611977929.3","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:46:27.024373Z","title":"Parallel Unconstrained Local Search for Partitioning Irregular Graphs","venue":null,"work_id":"efc066b8-b666-4059-8753-e001ffe81f25","year":2024},"citing_paper":{"arxiv_id":"2504.17615","last_updated":"2025-04-24T14:39:16Z","snapshot_observed_at":"2026-08-16T10:33:02.323355Z","submitted_at":"2025-04-24T14:39:16Z","title":"Linear-Time Multilevel Graph Partitioning via Edge Sparsification","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-16T10:46:26.856364Z"},"links":{"citing_paper":"/paper/2504.17615"},"observation_digest":"sha256:1208dd5767cf363123a69517722e0102a293613482d2f1a02f3afd089a4d0628","observation_id":"2da469c6-1378-415d-8af6-244be176c0b5","resolution":{"observed_at":"2026-08-16T10:46:27.029502Z","resolver_source":"doi","status":"verified_exact"},"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":"10.1007/978-3-319-07959-2_30","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:46:27.009163Z","title":"Partitioning Complex Networks via Size-Constrained Clustering","venue":null,"work_id":"7e3017ca-8f57-49b8-96ed-d3f96b94de2d","year":2014},"citing_paper":{"arxiv_id":"2504.17615","last_updated":"2025-04-24T14:39:16Z","snapshot_observed_at":"2026-08-16T10:33:02.323355Z","submitted_at":"2025-04-24T14:39:16Z","title":"Linear-Time Multilevel Graph Partitioning via Edge Sparsification","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-16T10:46:26.860924Z"},"links":{"citing_paper":"/paper/2504.17615"},"observation_digest":"sha256:5fb508b65e48d2fd6f278f5b98c9a4fb7d85c4a6a32950516cd914e66950b321","observation_id":"9f27284f-fa60-49cd-84b3-8cbfabf92d03","resolution":{"observed_at":"2026-08-16T10:46:27.014464Z","resolver_source":"doi","status":"verified_exact"},"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":"10.1007/978-3-642-21286-4_10","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:46:26.995700Z","title":"Miller and Aric A","venue":null,"work_id":"070ba891-a0f1-4def-9c17-8ec90c47b779","year":2011},"citing_paper":{"arxiv_id":"2504.17615","last_updated":"2025-04-24T14:39:16Z","snapshot_observed_at":"2026-08-16T10:33:02.323355Z","submitted_at":"2025-04-24T14:39:16Z","title":"Linear-Time Multilevel Graph Partitioning via Edge Sparsification","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-16T10:46:26.865224Z"},"links":{"citing_paper":"/paper/2504.17615"},"observation_digest":"sha256:3d28d5bad7782e23b7c218b9d903503530ca3e6fc2d3483188e321abb01b821e","observation_id":"685711f8-d41d-4f1a-aa54-75d434e7410b","resolution":{"observed_at":"2026-08-16T10:46:27.000223Z","resolver_source":"doi","status":"verified_exact"},"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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:46:26.869340Z","title":null,"venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2504.17615","last_updated":"2025-04-24T14:39:16Z","snapshot_observed_at":"2026-08-16T10:33:02.323355Z","submitted_at":"2025-04-24T14:39:16Z","title":"Linear-Time Multilevel Graph Partitioning via Edge Sparsification","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-16T10:46:26.869340Z"},"links":{"citing_paper":"/paper/2504.17615"},"observation_digest":"sha256:0ac1dd80b63cfe8d2709c28f04ebf759881ea0e8fb1c2f6b3bc21e3a5f8a392b","observation_id":"b30a686b-59f9-4148-bb1d-3eaec407a888","resolution":{"observed_at":"2026-08-16T10:46:26.869340Z","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-16T10:46:28.423629Z","title":"Intel Threading Building Blocks","venue":null,"work_id":"214d2d0c-420e-4615-84fa-a47d1c784fbf","year":2008},"citing_paper":{"arxiv_id":"2504.17615","last_updated":"2025-04-24T14:39:16Z","snapshot_observed_at":"2026-08-16T10:33:02.323355Z","submitted_at":"2025-04-24T14:39:16Z","title":"Linear-Time Multilevel Graph Partitioning via Edge Sparsification","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-16T10:46:26.873595Z"},"links":{"citing_paper":"/paper/2504.17615"},"observation_digest":"sha256:a003a2c981543fc0812bf2c83e46824d32f47c4af518dd642a6caf134d097e8f","observation_id":"45b8010d-80a7-46a2-a90f-dac65e5a3d9d","resolution":{"observed_at":"2026-08-16T10:46:28.428138Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:46:26.877949Z","title":"Rossi and Nesreen K","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2504.17615","last_updated":"2025-04-24T14:39:16Z","snapshot_observed_at":"2026-08-16T10:33:02.323355Z","submitted_at":"2025-04-24T14:39:16Z","title":"Linear-Time Multilevel Graph Partitioning via Edge Sparsification","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-16T10:46:26.877949Z"},"links":{"citing_paper":"/paper/2504.17615"},"observation_digest":"sha256:0af1279d0bf0094957b3714e843a0a0a725f9a25f1e77de970fdc5f2eb74984f","observation_id":"8bc23424-0f54-4f42-98f9-18f6ddd8d1dc","resolution":{"observed_at":"2026-08-16T10:46:26.877949Z","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":"4838.24848","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:46:27.561810Z","title":"GPS: A Graph Processing System","venue":null,"work_id":"2038e8db-81c9-46e1-a592-7c9bb7dfd74c","year":2013},"citing_paper":{"arxiv_id":"2504.17615","last_updated":"2025-04-24T14:39:16Z","snapshot_observed_at":"2026-08-16T10:33:02.323355Z","submitted_at":"2025-04-24T14:39:16Z","title":"Linear-Time Multilevel Graph Partitioning via Edge Sparsification","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-16T10:46:26.882243Z"},"links":{"citing_paper":"/paper/2504.17615"},"observation_digest":"sha256:b2810d9270f97c07ac2e2fbc15fee1358c6b2c82c00b68402a20b2aeb6c2143b","observation_id":"3f1e8525-d5dc-4cfa-b9e2-3fd618e3c340","resolution":{"observed_at":"2026-08-16T10:46:27.568672Z","resolver_source":"raw_fallback","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":{"arxiv_id":"2410.19119","last_updated":"2024-10-24T19:43:17Z","snapshot_observed_at":"2026-08-16T13:06:08.506255Z","submitted_at":"2024-10-24T19:43:17Z","title":"Tera-Scale Multilevel Graph Partitioning","version":1},"cited_work":{"arxiv_id":"2410.19119","doi":null,"metadata_source":"pith","pith_arxiv_id":"2410.19119","snapshot_observed_at":"2026-08-16T10:46:27.491302Z","title":"Tera-Scale Multilevel Graph Partitioning","venue":"cs.DS","work_id":"ba7c1c50-972d-49ce-8a0e-01da30476122","year":2024},"citing_paper":{"arxiv_id":"2504.17615","last_updated":"2025-04-24T14:39:16Z","snapshot_observed_at":"2026-08-16T10:33:02.323355Z","submitted_at":"2025-04-24T14:39:16Z","title":"Linear-Time Multilevel Graph Partitioning via Edge Sparsification","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-16T10:46:26.886556Z"},"links":{"cited_paper":"/paper/2410.19119","citing_paper":"/paper/2504.17615"},"observation_digest":"sha256:593f51124c7dba4965f595718074821c4e9de710cf6832554e31e6b5aef49f14","observation_id":"300afa2f-bb7e-4326-9617-8146df9e9dbc","resolution":{"observed_at":"2026-08-16T10:46:27.496124Z","resolver_source":"local_arxiv","status":"verified_exact"},"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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:46:26.891367Z","title":"Slota, Kamesh Madduri, and Sivasankaran Rajamanickam","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2504.17615","last_updated":"2025-04-24T14:39:16Z","snapshot_observed_at":"2026-08-16T10:33:02.323355Z","submitted_at":"2025-04-24T14:39:16Z","title":"Linear-Time Multilevel Graph Partitioning via Edge Sparsification","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-16T10:46:26.891367Z"},"links":{"citing_paper":"/paper/2504.17615"},"observation_digest":"sha256:b1150b824442ad00116c2570f81d5b3d82c78458e646574235cb50d5671ce592","observation_id":"64a8eaab-b7ef-4750-81e7-f5eca5aa345a","resolution":{"observed_at":"2026-08-16T10:46:26.891367Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:46:26.895817Z","title":"Spielman and Nikhil Srivastava","venue":null,"work_id":null,"year":1913},"citing_paper":{"arxiv_id":"2504.17615","last_updated":"2025-04-24T14:39:16Z","snapshot_observed_at":"2026-08-16T10:33:02.323355Z","submitted_at":"2025-04-24T14:39:16Z","title":"Linear-Time Multilevel Graph Partitioning via Edge Sparsification","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-16T10:46:26.895817Z"},"links":{"citing_paper":"/paper/2504.17615"},"observation_digest":"sha256:a1bc44a8b4dc4cbb5e769269db8190e7fb7138f4f2278cf2413f13ce1f2cb355","observation_id":"5fcf505c-89af-44ee-8578-a5a86c8df6d4","resolution":{"observed_at":"2026-08-16T10:46:26.895817Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:46:26.900069Z","title":"Staudt and Henning Meyerhenke","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2504.17615","last_updated":"2025-04-24T14:39:16Z","snapshot_observed_at":"2026-08-16T10:33:02.323355Z","submitted_at":"2025-04-24T14:39:16Z","title":"Linear-Time Multilevel Graph Partitioning via Edge Sparsification","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-16T10:46:26.900069Z"},"links":{"citing_paper":"/paper/2504.17615"},"observation_digest":"sha256:420ce3e06f9c51928efa911ad7f592cbe79442c7202f4af051366b24c2247a0c","observation_id":"b30f6e27-7481-498d-8d48-00de2746f8f1","resolution":{"observed_at":"2026-08-16T10:46:26.900069Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:46:26.904177Z","title":"Tsourakakis, Christos Gkantsidis, Bozidar Radunovic, and Milan Vojnovic","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2504.17615","last_updated":"2025-04-24T14:39:16Z","snapshot_observed_at":"2026-08-16T10:33:02.323355Z","submitted_at":"2025-04-24T14:39:16Z","title":"Linear-Time Multilevel Graph Partitioning via Edge Sparsification","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-16T10:46:26.904177Z"},"links":{"citing_paper":"/paper/2504.17615"},"observation_digest":"sha256:067e779a901db3320709626648d0af44ecf605edfd2f210fee4b07fe41c2d903","observation_id":"ce7471e2-a2d1-4291-8504-1c952a47d7ae","resolution":{"observed_at":"2026-08-16T10:46:26.904177Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:46:26.908388Z","title":"Event Detection in Twitter","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2504.17615","last_updated":"2025-04-24T14:39:16Z","snapshot_observed_at":"2026-08-16T10:33:02.323355Z","submitted_at":"2025-04-24T14:39:16Z","title":"Linear-Time Multilevel Graph Partitioning via Edge Sparsification","version":1},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-16T10:46:26.908388Z"},"links":{"citing_paper":"/paper/2504.17615"},"observation_digest":"sha256:794264bcbb04f156dd8aab7781b2221749b63cc05f6545d546588ec24a08b6f0","observation_id":"5cbd6c79-a6b3-439c-8479-cb526ba3a053","resolution":{"observed_at":"2026-08-16T10:46:26.908388Z","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":"10.1609/aaai.v24i1.7524","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:46:26.942571Z","title":"Lyu, and Irwin King","venue":null,"work_id":"5c2caf06-a68d-4cee-94f9-c65b0bdf3393","year":2010},"citing_paper":{"arxiv_id":"2504.17615","last_updated":"2025-04-24T14:39:16Z","snapshot_observed_at":"2026-08-16T10:33:02.323355Z","submitted_at":"2025-04-24T14:39:16Z","title":"Linear-Time Multilevel Graph Partitioning via Edge Sparsification","version":1},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-16T10:46:26.912628Z"},"links":{"citing_paper":"/paper/2504.17615"},"observation_digest":"sha256:20730469445b3603aa515ca6128f102401a441ecea4822e99da670bdd935ada8","observation_id":"557ed8b1-7a88-487c-bccb-4927da2fc9c0","resolution":{"observed_at":"2026-08-16T10:46:26.948134Z","resolver_source":"doi","status":"verified_exact"},"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":"2504.17615","last_updated":"2025-04-24T14:39:16Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-16T10:33:02.323355Z","submitted_at":"2025-04-24T14:39:16Z","title":"Linear-Time Multilevel Graph Partitioning via Edge Sparsification"},"reference_resolution":{"displayed":54,"state_counts":{"malformed_identifier":0,"metadata_mismatch":2,"parse_uncertain":0,"unresolved":36,"verified_exact":14,"verified_fuzzy":2},"total_outbound_references":54},"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 54 of 54 outbound references and 0 inbound Pith citation observations for arXiv:2504.17615."}