Paper Citation Record · LEDGER

Using Neighborhood Diversity to Solve Hard Problems

As of 19 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:1201.3091.

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

pith.paper-citation-record.v1
1201.3091 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-19T06:32:44.657259+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-11T11:20:08.345391Z

measured 0 of 1 external citation measurements

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

Source: arxiv_reference, observed 2026-05-10T08:58:13.118014Z

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 247aff70-f529-4a0e-bca4-3a75cc04eb4e · inbound

Distance Vector Domination cites this paper.

Distance Vector Domination Using Neighborhood Diversity to Solve Hard Problems

Reference 30

Resolution: unresolved; no resolver link, observed 2026-08-11T11:20:08.345391Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 38c9025f-33ea-4a46-aaa1-c000735792dd · inbound

On the Complexity of Problems on Graphs Defined on Groups cites this paper.

On the Complexity of Problems on Graphs Defined on Groups Using Neighborhood Diversity to Solve Hard Problems

Reference 17

Resolution: unresolved; no resolver link, observed 2026-08-06T19:38:13.427979Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2b98d05a-cd7e-492b-94fc-76ea6923d105 · inbound

The Parameterized Complexity of Coloring Mixed Graphs cites this paper.

The Parameterized Complexity of Coloring Mixed Graphs Using Neighborhood Diversity to Solve Hard Problems

Reference 4

Resolution: verified exact; arxiv_id, observed 2026-07-04T18:00:21.637406Z

Source-reported events for the cited work

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

Observation 38991b7b-960a-46f4-98cf-4b2f50d9e25a · inbound

Parameterized Complexity of Fair Coloring Problem cites this paper.

Parameterized Complexity of Fair Coloring Problem Using Neighborhood Diversity to Solve Hard Problems

Reference 16

Resolution: unresolved; no resolver link, observed 2026-07-30T14:22:54.041636Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.