Paper Citation Record · LEDGER

Maximizing Modularity is hard

As of 17 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:physics/0608255.

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

pith.paper-citation-record.v1
physics/0608255 v2

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 4 of 4 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-17T06:30:58.91139+00:00

measured 4 of 4 inbound itemization

Pith citing papers itemized under the disclosed page cap.

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

measured 0 of 1 external citation measurements

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

Source: pith, observed 2026-07-01T22:06:17.158069Z

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 7c691cf1-eea6-45dd-bed9-84f4fa0ba3d2 · inbound

GraphHash: Graph Clustering Enables Parameter Efficiency in Recommender Systems cites this paper.

GraphHash: Graph Clustering Enables Parameter Efficiency in Recommender Systems Maximizing Modularity is hard

Reference 8

Resolution: unresolved; no resolver link, observed 2026-08-11T05:46:43.381499Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

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

Linear-Time Multilevel Graph Partitioning via Edge Sparsification cites this paper.

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 86c8a39c-c9a8-4a72-a2f3-e2dffedaa35c · inbound

Imputation-free and Alignment-free: Incomplete Multi-view Clustering Driven by Consensus Semantic Learning cites this paper.

Imputation-free and Alignment-free: Incomplete Multi-view Clustering Driven by Consensus Semantic Learning Maximizing Modularity is hard

Reference 1

Resolution: unresolved; no resolver link, observed 2026-08-15T21:01:45.019760Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8c83419e-8896-411d-9b9a-c63302f562c2 · inbound

Flexible Online Representation Learning Based on Similarity Matching cites this paper.

Flexible Online Representation Learning Based on Similarity Matching Maximizing Modularity is hard

Reference 23

Resolution: verified exact; local_arxiv, observed 2026-07-01T22:06:17.159162Z

Source-reported events for the cited work

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