Paper Citation Record · LEDGER

Linear-Time Multilevel Graph Partitioning via Edge Sparsification

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.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2504.17615 v1

Coverage vector

measured 54 of 54 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-16T10:46:26.912628Z

measured 54 of 54 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-16T06:30:59.297886+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: cited_works

Reference resolution

54 of 54 outbound references displayed

verified exact14
verified fuzzy2
unresolved36
parse uncertain0
malformed identifier0
metadata mismatch2

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation bab99b6a-12c3-41a5-8847-49e7cb345583 · outbound

This paper cites COAX: Correlation-Aware Indexing on Multidimensional Data with Soft Functional Dependencies.

Linear-Time Multilevel Graph Partitioning via Edge Sparsification COAX: Correlation-Aware Indexing on Multidimensional Data with Soft Functional Dependencies

Reference 1

Resolution: unresolved; no resolver link, observed 2026-08-16T10:46:26.680503Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2af81c20-14fa-4462-a824-f5a9df56a000 · outbound

This paper cites Ahmed, Jennifer Neville, and Ramana Rao Kompella.

Linear-Time Multilevel Graph Partitioning via Edge Sparsification Ahmed, Jennifer Neville, and Ramana Rao Kompella

Reference 2

Resolution: verified exact; doi, observed 2026-08-16T10:46:27.274051Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 74e210db-3097-4df6-9a57-8d081a710069 · outbound

This paper cites High-Quality Shared-Memory Graph Partitioning.

Linear-Time Multilevel Graph Partitioning via Edge Sparsification High-Quality Shared-Memory Graph Partitioning

Reference 3

Resolution: verified exact; doi, observed 2026-08-16T10:46:27.260120Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 33a9d23f-3a0a-44a9-b61a-c8906c276be0 · outbound

This paper cites Balanced Graph Partitioning.

Linear-Time Multilevel Graph Partitioning via Edge Sparsification Balanced Graph Partitioning

Reference 4

Resolution: unresolved; no resolver link, observed 2026-08-16T10:46:26.695505Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation bf9a8a6d-8a94-4447-8eb9-80eb5e79e47b · outbound

This paper cites Algorithms for Large-Scale Network Analysis and the NetworKit Toolkit.

Linear-Time Multilevel Graph Partitioning via Edge Sparsification Algorithms for Large-Scale Network Analysis and the NetworKit Toolkit

Reference 5

Resolution: unresolved; no resolver link, observed 2026-08-16T10:46:26.700280Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 86438aec-cfd1-4f97-9cac-d0b8d5e23db2 · outbound

This paper cites Prioritized Restreaming Algorithms for Balanced Graph Partitioning.

Linear-Time Multilevel Graph Partitioning via Edge Sparsification Prioritized Restreaming Algorithms for Balanced Graph Partitioning

Reference 6

Resolution: unresolved; no resolver link, observed 2026-08-16T10:46:26.704433Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4f1d00fe-85f1-4818-8915-4be424fc1856 · outbound

This paper cites an unresolved cited work.

Linear-Time Multilevel Graph Partitioning via Edge Sparsification Unresolved cited work

Reference 7

Resolution: verified exact; doi, observed 2026-08-16T10:46:27.237292Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 29d2b400-8775-4803-84bc-d6ef79d0fbf9 · outbound

This paper cites Bader, Henning Meyerhenke, Peter Sanders, and Dorothea Wagner.

Linear-Time Multilevel Graph Partitioning via Edge Sparsification Bader, Henning Meyerhenke, Peter Sanders, and Dorothea Wagner

Reference 8

Resolution: unresolved; no resolver link, observed 2026-08-16T10:46:26.713546Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ce89921a-2e4a-42db-ac4e-a9c373127143 · outbound

This paper cites Bencz\' u r and David R.

Linear-Time Multilevel Graph Partitioning via Edge Sparsification Bencz\' u r and David R

Reference 9

Resolution: unresolved; no resolver link, observed 2026-08-16T10:46:26.717687Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 85b26c59-a822-4057-87cc-d13781304db7 · outbound

This paper cites Blondel, Jean Guillaume, Renaud Lambiotte, and Etienne Lefebvre.

Linear-Time Multilevel Graph Partitioning via Edge Sparsification Blondel, Jean Guillaume, Renaud Lambiotte, and Etienne Lefebvre

Reference 10

Resolution: unresolved; no resolver link, observed 2026-08-16T10:46:26.721763Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5c13be48-656b-4c4e-9413-cbec62b90784 · outbound

This paper cites Boman, Karen D.

Linear-Time Multilevel Graph Partitioning via Edge Sparsification Boman, Karen D

Reference 11

Resolution: unresolved; no resolver link, observed 2026-08-16T10:46:26.726276Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 839ffd80-60b0-4c57-862c-5cd787291679 · outbound

This paper cites Maximizing Modularity is hard.

Linear-Time Multilevel Graph Partitioning via Edge Sparsification Maximizing Modularity is hard

Reference 12

Resolution: unresolved; no resolver link, observed 2026-08-16T10:46:26.730469Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 66907e6a-1cc7-4ad0-a762-1c2f5652699f · outbound

This paper cites Recent Advances in Graph Partitioning.

Linear-Time Multilevel Graph Partitioning via Edge Sparsification Recent Advances in Graph Partitioning

Reference 13

Resolution: unresolved; no resolver link, observed 2026-08-16T10:46:26.735050Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0cdca916-9cd6-423e-98fc-6c6303596338 · outbound

This paper cites U mit C ataly \.

Linear-Time Multilevel Graph Partitioning via Edge Sparsification U mit C ataly \

Reference 14

Resolution: unresolved; no resolver link, observed 2026-08-16T10:46:26.739206Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation cc9addfc-cdaa-4de5-a8b4-e29ad0420650 · outbound

This paper cites R-MAT: A Recursive Model for Graph Mining.

Linear-Time Multilevel Graph Partitioning via Edge Sparsification R-MAT: A Recursive Model for Graph Mining

Reference 15

Resolution: unresolved; no resolver link, observed 2026-08-16T10:46:26.743222Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b187558e-0c9a-4fea-a40b-731e31f652a2 · outbound

This paper cites Bronstein, Ronald G.

Linear-Time Multilevel Graph Partitioning via Edge Sparsification Bronstein, Ronald G

Reference 16

Resolution: unresolved; no resolver link, observed 2026-08-16T10:46:26.747325Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 70bf652b-8bb1-49b2-bef9-0902b33ce0d4 · outbound

This paper cites Partitioning Trillion Edge Graphs on Edge Devices.

Linear-Time Multilevel Graph Partitioning via Edge Sparsification Partitioning Trillion Edge Graphs on Edge Devices

Reference 17

Resolution: verified exact; local_arxiv, observed 2026-08-16T10:46:28.090143Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 0c4ce134-16d6-4261-88b7-d8203e7d9294 · outbound

This paper cites Davis, William W.

Linear-Time Multilevel Graph Partitioning via Edge Sparsification Davis, William W

Reference 18

Resolution: verified exact; doi, observed 2026-08-16T10:46:27.164454Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 5d1f624f-d8a6-43fd-8fc3-eb446396e591 · outbound

This paper cites Davis and Yifan Hu.

Linear-Time Multilevel Graph Partitioning via Edge Sparsification Davis and Yifan Hu

Reference 19

Resolution: unresolved; no resolver link, observed 2026-08-16T10:46:26.760265Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 550d8348-0feb-4ecf-8445-5726d1b6f672 · outbound

This paper cites Dolan and Jorge J.

Linear-Time Multilevel Graph Partitioning via Edge Sparsification Dolan and Jorge J

Reference 20

Resolution: unresolved; no resolver link, observed 2026-08-16T10:46:26.764276Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a0b2ebb9-c524-44b1-8ed8-ba0beb072a6f · outbound

This paper cites Buffered Streaming Graph Partitioning.

Linear-Time Multilevel Graph Partitioning via Edge Sparsification Buffered Streaming Graph Partitioning

Reference 21

Resolution: unresolved; no resolver link, observed 2026-08-16T10:46:26.768383Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation fb249591-d892-441a-a3aa-5577921fd994 · outbound

This paper cites Faster Cut Sparsification of Weighted Graphs.

Linear-Time Multilevel Graph Partitioning via Edge Sparsification Faster Cut Sparsification of Weighted Graphs

Reference 22

Resolution: verified exact; doi, observed 2026-08-16T10:46:27.133166Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation a8635f1a-b294-43ce-9fc3-a44b8c312c76 · outbound

This paper cites Resolution limit in community detection.

Linear-Time Multilevel Graph Partitioning via Edge Sparsification Resolution limit in community detection

Reference 23

Resolution: unresolved; no resolver link, observed 2026-08-16T10:46:26.776512Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ac2e6dc5-8b93-4e0f-9bea-173d129ffc05 · outbound

This paper cites Communication-free Massively Distributed Graph Generation.

Linear-Time Multilevel Graph Partitioning via Edge Sparsification Communication-free Massively Distributed Graph Generation

Reference 24

Resolution: unresolved; no resolver link, observed 2026-08-16T10:46:26.780548Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ce8f00bb-5d27-414b-965d-cae35a2a65aa · outbound

This paper cites Gilbert, Kamesh Madduri, Erik G.

Linear-Time Multilevel Graph Partitioning via Edge Sparsification Gilbert, Kamesh Madduri, Erik G

Reference 25

Resolution: verified exact; doi, observed 2026-08-16T10:46:27.110630Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation c881537c-fc93-4d97-957d-30b6d243a1e4 · outbound

This paper cites Scalable High-Quality Hypergraph Partitioning.

Linear-Time Multilevel Graph Partitioning via Edge Sparsification Scalable High-Quality Hypergraph Partitioning

Reference 26

Resolution: unresolved; no resolver link, observed 2026-08-16T10:46:26.788780Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ed7afe8b-070f-413a-bccf-767a55d21eee · outbound

This paper cites Scalable Shared-Memory Hypergraph Partitioning.

Linear-Time Multilevel Graph Partitioning via Edge Sparsification Scalable Shared-Memory Hypergraph Partitioning

Reference 27

Resolution: unresolved; no resolver link, observed 2026-08-16T10:46:26.793412Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 878d319a-9495-4928-a2cf-4716c07eda3c · outbound

This paper cites Deep Multilevel Graph Partitioning.

Linear-Time Multilevel Graph Partitioning via Edge Sparsification Deep Multilevel Graph Partitioning

Reference 28

Resolution: unresolved; no resolver link, observed 2026-08-16T10:46:26.797638Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation bbfa7620-1511-47b3-96ad-a4cedca6c555 · outbound

This paper cites an unresolved cited work.

Linear-Time Multilevel Graph Partitioning via Edge Sparsification Unresolved cited work

Reference 29

Resolution: unresolved; no resolver link, observed 2026-08-16T10:46:26.801741Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0c4a9ec0-1f5d-4cfa-aabc-f8a409b4982a · outbound

This paper cites Improving Coarsening Schemes for Hypergraph Partitioning by Exploiting Community Structure.

Linear-Time Multilevel Graph Partitioning via Edge Sparsification Improving Coarsening Schemes for Hypergraph Partitioning by Exploiting Community Structure

Reference 31

Resolution: unresolved; no resolver link, observed 2026-08-16T10:46:26.810296Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation aa89be42-6199-497a-af96-bc2f04a7f8ac · outbound

This paper cites Faster Fully Compressed Pattern Matching by Recompression.

Linear-Time Multilevel Graph Partitioning via Edge Sparsification Faster Fully Compressed Pattern Matching by Recompression

Reference 32

Resolution: unresolved; no resolver link, observed 2026-08-16T10:46:26.814504Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a5ffa7dc-b045-4e97-bd59-8bd75ba9193f · outbound

This paper cites Analysis of Multilevel Graph Partitioning.

Linear-Time Multilevel Graph Partitioning via Edge Sparsification Analysis of Multilevel Graph Partitioning

Reference 33

Resolution: metadata mismatch; raw_fallback, observed 2026-08-16T10:46:27.890382Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 60cfb381-11ad-4b35-9ab0-d5157c845154 · outbound

This paper cites A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs.

Linear-Time Multilevel Graph Partitioning via Edge Sparsification A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs

Reference 34

Resolution: unresolved; no resolver link, observed 2026-08-16T10:46:26.822814Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a72ef4a9-c73c-4d03-9859-e4e7758904ed · outbound

This paper cites Deterministic Parallel High-Quality Hypergraph Partitioning.

Linear-Time Multilevel Graph Partitioning via Edge Sparsification Deterministic Parallel High-Quality Hypergraph Partitioning

Reference 35

Resolution: verified exact; local_arxiv, observed 2026-08-16T10:46:27.821715Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 3c333fc3-1eb4-4b84-94eb-707577d5024f · outbound

This paper cites Multi-threaded Graph Partitioning.

Linear-Time Multilevel Graph Partitioning via Edge Sparsification Multi-threaded Graph Partitioning

Reference 36

Resolution: verified exact; doi, observed 2026-08-16T10:46:27.043413Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 8bca9137-0161-4bd7-9e55-c47ef1265dd4 · outbound

This paper cites Mostofa Ali Patwary, Nadathur Satish, Narayanan Sundaram, Pradeep Dubey, and George Karypis.

Linear-Time Multilevel Graph Partitioning via Edge Sparsification Mostofa Ali Patwary, Nadathur Satish, Narayanan Sundaram, Pradeep Dubey, and George Karypis

Reference 37

Resolution: unresolved; no resolver link, observed 2026-08-16T10:46:26.835800Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2aa778c1-50ff-4549-8240-656761335b4e · outbound

This paper cites Sampling from Large Graphs.

Linear-Time Multilevel Graph Partitioning via Edge Sparsification Sampling from Large Graphs

Reference 38

Resolution: unresolved; no resolver link, observed 2026-08-16T10:46:26.839994Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3c1a5fe0-06c9-4864-9236-a01624e41b98 · outbound

This paper cites Graph Evolution: Densification and Shrinking Diameters.

Linear-Time Multilevel Graph Partitioning via Edge Sparsification Graph Evolution: Densification and Shrinking Diameters

Reference 39

Resolution: unresolved; no resolver link, observed 2026-08-16T10:46:26.844077Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation cbdba706-c194-45c4-86ab-8927b4ffa210 · outbound

This paper cites SNAP Datasets: Stanford Large Network Dataset Collection.

Linear-Time Multilevel Graph Partitioning via Edge Sparsification SNAP Datasets: Stanford Large Network Dataset Collection

Reference 40

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T10:46:28.442782Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation ffd63517-121c-4431-b864-fff990e1cea9 · outbound

This paper cites Staudt, Michael Hamann, Henning Meyerhenke, and Dorothea Wagner.

Linear-Time Multilevel Graph Partitioning via Edge Sparsification Staudt, Michael Hamann, Henning Meyerhenke, and Dorothea Wagner

Reference 41

Resolution: unresolved; no resolver link, observed 2026-08-16T10:46:26.852376Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2da469c6-1378-415d-8af6-244be176c0b5 · outbound

This paper cites Parallel Unconstrained Local Search for Partitioning Irregular Graphs.

Linear-Time Multilevel Graph Partitioning via Edge Sparsification Parallel Unconstrained Local Search for Partitioning Irregular Graphs

Reference 42

Resolution: verified exact; doi, observed 2026-08-16T10:46:27.029502Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 9f27284f-fa60-49cd-84b3-8cbfabf92d03 · outbound

This paper cites Partitioning Complex Networks via Size-Constrained Clustering.

Linear-Time Multilevel Graph Partitioning via Edge Sparsification Partitioning Complex Networks via Size-Constrained Clustering

Reference 43

Resolution: verified exact; doi, observed 2026-08-16T10:46:27.014464Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 685711f8-d41d-4f1a-aa54-75d434e7410b · outbound

This paper cites Miller and Aric A.

Linear-Time Multilevel Graph Partitioning via Edge Sparsification Miller and Aric A

Reference 44

Resolution: verified exact; doi, observed 2026-08-16T10:46:27.000223Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation b30a686b-59f9-4148-bb1d-3eaec407a888 · outbound

This paper cites an unresolved cited work.

Linear-Time Multilevel Graph Partitioning via Edge Sparsification Unresolved cited work

Reference 45

Resolution: unresolved; no resolver link, observed 2026-08-16T10:46:26.869340Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 45b8010d-80a7-46a2-a90f-dac65e5a3d9d · outbound

This paper cites Intel Threading Building Blocks.

Linear-Time Multilevel Graph Partitioning via Edge Sparsification Intel Threading Building Blocks

Reference 46

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T10:46:28.428138Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 8bc23424-0f54-4f42-98f9-18f6ddd8d1dc · outbound

This paper cites Rossi and Nesreen K.

Linear-Time Multilevel Graph Partitioning via Edge Sparsification Rossi and Nesreen K

Reference 47

Resolution: unresolved; no resolver link, observed 2026-08-16T10:46:26.877949Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3f1e8525-d5dc-4cfa-b9e2-3fd618e3c340 · outbound

This paper cites GPS: A Graph Processing System.

Linear-Time Multilevel Graph Partitioning via Edge Sparsification GPS: A Graph Processing System

Reference 48

Resolution: metadata mismatch; raw_fallback, observed 2026-08-16T10:46:27.568672Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 300afa2f-bb7e-4326-9617-8146df9e9dbc · outbound

This paper cites Tera-Scale Multilevel Graph Partitioning.

Linear-Time Multilevel Graph Partitioning via Edge Sparsification Tera-Scale Multilevel Graph Partitioning

Reference 49

Resolution: verified exact; local_arxiv, observed 2026-08-16T10:46:27.496124Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 64a8eaab-b7ef-4750-81e7-f5eca5aa345a · outbound

This paper cites Slota, Kamesh Madduri, and Sivasankaran Rajamanickam.

Linear-Time Multilevel Graph Partitioning via Edge Sparsification Slota, Kamesh Madduri, and Sivasankaran Rajamanickam

Reference 50

Resolution: unresolved; no resolver link, observed 2026-08-16T10:46:26.891367Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5fcf505c-89af-44ee-8578-a5a86c8df6d4 · outbound

This paper cites Spielman and Nikhil Srivastava.

Linear-Time Multilevel Graph Partitioning via Edge Sparsification Spielman and Nikhil Srivastava

Reference 51

Resolution: unresolved; no resolver link, observed 2026-08-16T10:46:26.895817Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b30f6e27-7481-498d-8d48-00de2746f8f1 · outbound

This paper cites Staudt and Henning Meyerhenke.

Linear-Time Multilevel Graph Partitioning via Edge Sparsification Staudt and Henning Meyerhenke

Reference 52

Resolution: unresolved; no resolver link, observed 2026-08-16T10:46:26.900069Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ce7471e2-a2d1-4291-8504-1c952a47d7ae · outbound

This paper cites Tsourakakis, Christos Gkantsidis, Bozidar Radunovic, and Milan Vojnovic.

Linear-Time Multilevel Graph Partitioning via Edge Sparsification Tsourakakis, Christos Gkantsidis, Bozidar Radunovic, and Milan Vojnovic

Reference 53

Resolution: unresolved; no resolver link, observed 2026-08-16T10:46:26.904177Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5cbd6c79-a6b3-439c-8479-cb526ba3a053 · outbound

This paper cites Event Detection in Twitter.

Linear-Time Multilevel Graph Partitioning via Edge Sparsification Event Detection in Twitter

Reference 54

Resolution: unresolved; no resolver link, observed 2026-08-16T10:46:26.908388Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 557ed8b1-7a88-487c-bccb-4927da2fc9c0 · outbound

This paper cites Lyu, and Irwin King.

Linear-Time Multilevel Graph Partitioning via Edge Sparsification Lyu, and Irwin King

Reference 55

Resolution: verified exact; doi, observed 2026-08-16T10:46:26.948134Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Pith citing papers

No inbound Pith citation observations are available.