Pith. sign in

Paper Citation Record · LEDGER

The Complexity of Pebbling and Cover Pebbling

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

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

pith.paper-citation-record.v1
math/0503511 v3

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-09T06:31:02.800959+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-07T15:16:29.768056Z

measured 0 of 1 external citation measurements

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

Source: pith, observed 2026-08-07T13:04:17.486377Z

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 57675117-300b-4e72-9405-655eb36ed6a7 · inbound

A Weight Function Lemma Heuristic for Graph Pebbling cites this paper.

A Weight Function Lemma Heuristic for Graph Pebbling The Complexity of Pebbling and Cover Pebbling

Reference 12

Resolution
unresolved
no resolver link, observed 2026-08-07T15:16:29.768056Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-07T15:16:29.768056Z digest=sha256:1ad9b7c447579163edad25a0f4dc2086a323407b8d6d296b14f7b9cb16c4e7fc

Observation 2e67d5a9-90c4-41b9-bc9e-78530cca874e · inbound

The only Class 0 Flower snark is the smallest cites this paper.

The only Class 0 Flower snark is the smallest The Complexity of Pebbling and Cover Pebbling

Reference 14

Resolution
verified exact
local_arxiv, observed 2026-08-07T13:04:17.529796Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=pdf_text observed=2026-08-07T13:04:17.208050Z digest=sha256:589f87a64d4139ea7f379c2498d4c4ac460e97cde090bec832db23f5d2f2a214

Observation 622dc492-0f22-41c2-8339-b5c31abbe614 · inbound

Applying Hurlbert's Linear Optimization Technique to Establish Bounds on Pebbling Numbers cites this paper.

Applying Hurlbert's Linear Optimization Technique to Establish Bounds on Pebbling Numbers The Complexity of Pebbling and Cover Pebbling

Reference 13

Resolution
unresolved
no resolver link, observed 2026-08-04T17:23:22.922458Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-04T17:23:22.922458Z digest=sha256:8e7522dd7f17a145fe3ad8ed137e1b8b51b85482950aa586a61b3fd59a604d81