Pith. sign in

Paper Citation Record · LEDGER

Finding large and small dense subgraphs

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

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

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

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 3 of 3 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-22T06:32:14.747728+00:00

measured 3 of 3 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-03T12:17:31.630581Z

measured 0 of 1 external citation measurements

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

Source: pith, observed 2026-07-01T16:55:50.849895Z

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 14d40adc-9b9e-482d-93c5-b8ade264bc82 · inbound

Fast and Simple Densest Subgraph with Predictions cites this paper.

Fast and Simple Densest Subgraph with Predictions Finding large and small dense subgraphs

Reference 3

Resolution
verified exact
local_arxiv, observed 2026-05-22T15:14:57.345616Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

source=pdf_text observed=2026-05-22T15:13:55.535934Z digest=sha256:7b6bded3a0340e9dcc85f3ce588d85945f54ab4e8b9e144bcd0485111af2110e

Observation e2f7cb87-e1aa-4fed-831b-8d4103b77500 · inbound

Provably Finding a Hidden Dense Submatrix among Many Planted Dense Submatrices via Convex Programming cites this paper.

Provably Finding a Hidden Dense Submatrix among Many Planted Dense Submatrices via Convex Programming Finding large and small dense subgraphs

Reference 8

Resolution
unresolved
no resolver link, observed 2026-08-03T12:17:31.630581Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T12:17:31.630581Z digest=sha256:2b779575e3580aa2ec457a3f68d21144be442d337bcf5d5e6310c87cef5be484

Observation a8e983ca-4684-436c-a4cb-31acdc1b5a80 · inbound

A Note on Approximability of Densest At-Least-k-Subgraph cites this paper.

A Note on Approximability of Densest At-Least-k-Subgraph Finding large and small dense subgraphs

Reference 3

Resolution
verified exact
local_arxiv, observed 2026-07-01T16:55:50.851065Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

source=arxiv_source observed=2026-06-29T20:04:26.097805Z digest=sha256:ddb9ecbcf8f80ec129452475aea07083e7ad897862fcefee188a68305883fdeb