Paper Citation Record · LEDGER

An O(m) Algorithm for Cores Decomposition of Networks

As of 18 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 22 inbound Pith citation observations for arXiv:cs/0310049.

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

pith.paper-citation-record.v1
cs/0310049 v1

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 22 of 22 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-18T06:34:40.430872+00:00

measured 22 of 22 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-16T11:14:12.637060Z

measured 0 of 1 external citation measurements

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

Source: pith, observed 2026-07-09T11:56:12.349276Z

Reference resolution

0 of 0 outbound references displayed

verified exact0
verified fuzzy0
unresolved0
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

No outbound reference observations are available for this paper version.

Pith citing papers

Observation 6f982a8c-f5ef-4cc1-be81-fa8a6f0c9f37 · inbound

Streaming and Batch Algorithms for Truss Decomposition cites this paper.

Streaming and Batch Algorithms for Truss Decomposition An O(m) Algorithm for Cores Decomposition of Networks

Reference 17

Resolution: unresolved; no resolver link, observed 2026-08-14T10:45:48.273503Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 755dd057-c792-4997-a776-a14c52ac6448 · inbound

Parameter-free Structural Diversity Search cites this paper.

Parameter-free Structural Diversity Search An O(m) Algorithm for Cores Decomposition of Networks

Reference 2

Resolution: unresolved; no resolver link, observed 2026-08-14T10:18:28.927473Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5728a481-b996-4c66-aa6d-1bd8e1f12ce9 · inbound

Fast Algorithms for Intimate-Core Group Search in Weighted Graphs cites this paper.

Fast Algorithms for Intimate-Core Group Search in Weighted Graphs An O(m) Algorithm for Cores Decomposition of Networks

Reference 2

Resolution: unresolved; no resolver link, observed 2026-08-14T10:12:55.930872Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c6f94982-ec8c-415c-9c9d-c749aac91b0e · inbound

A Survey of Densest Subgraph Discovery on Large Graphs cites this paper.

A Survey of Densest Subgraph Discovery on Large Graphs An O(m) Algorithm for Cores Decomposition of Networks

Reference 14

Resolution: metadata mismatch; local_arxiv, observed 2026-05-24T08:24:11.276083Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 240e7997-96fb-47e3-8dd8-a695c7a1cc2d · inbound

Identifying Key Nodes for the Influence Spread using a Machine Learning Approach cites this paper.

Identifying Key Nodes for the Influence Spread using a Machine Learning Approach An O(m) Algorithm for Cores Decomposition of Networks

Reference 34

Resolution: unresolved; no resolver link, observed 2026-08-12T00:06:45.059511Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7d55d28b-474a-48dd-976c-afe210e10104 · inbound

Bridging Visualization and Optimization: Multimodal Large Language Models on Graph-Structured Combinatorial Optimization cites this paper.

Bridging Visualization and Optimization: Multimodal Large Language Models on Graph-Structured Combinatorial Optimization An O(m) Algorithm for Cores Decomposition of Networks

Reference 32

Resolution: unresolved; no resolver link, observed 2026-08-10T17:43:08.123078Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6c2e8ade-c5a3-42b9-9bcf-a7247414e592 · inbound

Parallel $k$-Core Decomposition: Theory and Practice cites this paper.

Parallel $k$-Core Decomposition: Theory and Practice An O(m) Algorithm for Cores Decomposition of Networks

Reference 10

Resolution: unresolved; no resolver link, observed 2026-08-08T11:14:38.548358Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 914ab768-bffb-46c5-8f61-ea4d6ee73204 · inbound

Monero Peer-to-peer Network Topology Analysis cites this paper.

Monero Peer-to-peer Network Topology Analysis An O(m) Algorithm for Cores Decomposition of Networks

Reference 19

Resolution: unresolved; no resolver link, observed 2026-08-16T11:14:12.637060Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 46456326-3f63-4fd3-a0ad-9a3ebc772546 · inbound

Effective Index Construction Algorithm for Optimal $(k,\eta)$-cores Computation cites this paper.

Effective Index Construction Algorithm for Optimal $(k,\eta)$-cores Computation An O(m) Algorithm for Cores Decomposition of Networks

Reference 3

Resolution: unresolved; no resolver link, observed 2026-08-16T05:29:07.546979Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1241176b-c61d-45e4-8533-ee56f1f4c210 · inbound

Density-aware Walks for Coordinated Campaign Detection cites this paper.

Density-aware Walks for Coordinated Campaign Detection An O(m) Algorithm for Cores Decomposition of Networks

Reference 2

Resolution: unresolved; no resolver link, observed 2026-08-07T00:29:28.420294Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 67426b43-9abf-4e62-b38b-ca49deb62b95 · inbound

Uncovering High-Order Cohesive Structures: Efficient (k,g)-Core Computation and Decomposition for Large Hypergraphs cites this paper.

Uncovering High-Order Cohesive Structures: Efficient (k,g)-Core Computation and Decomposition for Large Hypergraphs An O(m) Algorithm for Cores Decomposition of Networks

Reference 4

Resolution: unresolved; no resolver link, observed 2026-08-06T18:33:34.806693Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5db34d3c-f060-42ca-96aa-f9b50c058cdc · inbound

Experimental Analysis and Evaluation of Cohesive Subgraph Discovery cites this paper.

Experimental Analysis and Evaluation of Cohesive Subgraph Discovery An O(m) Algorithm for Cores Decomposition of Networks

Reference 5

Resolution: unresolved; no resolver link, observed 2026-08-06T17:39:07.783280Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation bc7847c0-e892-43e5-9095-7bc7d364475e · inbound

CS-Agent: LLM-based Community Search via Dual-agent Collaboration cites this paper.

CS-Agent: LLM-based Community Search via Dual-agent Collaboration An O(m) Algorithm for Cores Decomposition of Networks

Reference 4

Resolution: unresolved; no resolver link, observed 2026-08-05T21:02:43.652650Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 37131248-45f2-465c-a2bc-f35fbb6b79ab · inbound

Accelerating Historical K-Core Search in Temporal Graphs cites this paper.

Accelerating Historical K-Core Search in Temporal Graphs An O(m) Algorithm for Cores Decomposition of Networks

Reference 4

Resolution: unresolved; no resolver link, observed 2026-08-15T17:04:53.507476Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 614dfa62-7ef4-4753-9821-addfbc39a263 · inbound

Hardness of Dynamic Core and Truss Decompositions cites this paper.

Hardness of Dynamic Core and Truss Decompositions An O(m) Algorithm for Cores Decomposition of Networks

Reference 4

Resolution: unresolved; no resolver link, observed 2026-08-04T16:40:00.120950Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f25526fe-1def-4a4b-b004-ae20d5ea5a81 · inbound

Toward a universal foundation model for graph-structured data cites this paper.

Toward a universal foundation model for graph-structured data An O(m) Algorithm for Cores Decomposition of Networks

Reference 22

Resolution: verified exact; arxiv_id, observed 2026-05-11T00:25:52.008022Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation b12d5762-b189-451d-a70f-d0b665246b6a · inbound

Hybrid Sketching Methods for Dynamic Connectivity on Sparse Graphs cites this paper.

Hybrid Sketching Methods for Dynamic Connectivity on Sparse Graphs An O(m) Algorithm for Cores Decomposition of Networks

Reference 9

Resolution: verified exact; local_arxiv, observed 2026-05-15T03:03:57.692298Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation cad8c89a-80db-4585-b9d8-1d25dc739b6c · inbound

Scalable Algorithm for Dynamic Quasi-clique Detection cites this paper.

Scalable Algorithm for Dynamic Quasi-clique Detection An O(m) Algorithm for Cores Decomposition of Networks

Reference 3

Resolution: verified exact; local_arxiv, observed 2026-06-29T19:13:52.673010Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation f6be6d5b-7f10-4287-91af-a473c1239a6c · inbound

Querying Cohesive Subgraph regarding Span-Constrained Triangles on Temporal Graphs with Dynamic Index Maintenance cites this paper.

Querying Cohesive Subgraph regarding Span-Constrained Triangles on Temporal Graphs with Dynamic Index Maintenance An O(m) Algorithm for Cores Decomposition of Networks

Reference 41

Resolution: verified exact; local_arxiv, observed 2026-07-03T13:28:19.143507Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 4ad1ca16-03f2-4c85-8974-61e7ed83bacd · inbound

Syndesmoscope: The Power of Invariant Plots Linked to Traditional Network Views cites this paper.

Syndesmoscope: The Power of Invariant Plots Linked to Traditional Network Views An O(m) Algorithm for Cores Decomposition of Networks

Reference 8

Resolution: verified exact; local_arxiv, observed 2026-07-04T05:09:35.684320Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 4337062b-e946-459a-8aff-e6d3ba5eef48 · inbound

Revisiting Maximum $k$-Biplex Search Through $k$-Bounded-Degree Deletion cites this paper.

Revisiting Maximum $k$-Biplex Search Through $k$-Bounded-Degree Deletion An O(m) Algorithm for Cores Decomposition of Networks

Reference 3

Resolution: verified exact; local_arxiv, observed 2026-07-09T11:56:12.350684Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 2f1c4391-6b2c-43c0-82c1-13a062fa0cbd · inbound

Rethinking Learning-Based Influence Maximization: Simple Neural Surrogates and Native Discrete Search cites this paper.

Rethinking Learning-Based Influence Maximization: Simple Neural Surrogates and Native Discrete Search An O(m) Algorithm for Cores Decomposition of Networks

Reference 1

Resolution: unresolved; no resolver link, observed 2026-08-14T04:41:25.736142Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.