Pith. sign in

Paper Citation Record · LEDGER

Popular conjectures imply strong lower bounds for dynamic problems

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

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

pith.paper-citation-record.v1
1402.0054 v1

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 2 of 2 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 2 of 2 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-04T16:40:00.108405Z

measured 1 of 1 external citation measurements

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

Source: arxiv_reference, observed 2026-08-05T02:28:24.338817Z

Reference resolution

0 of 0 outbound references displayed

  • verified exact0
  • verified fuzzy0
  • unresolved0
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

45
arxiv_reference, observed 2026-08-05T02:28:24.338817Z

Outbound references

No outbound reference observations are available for this paper version.

Pith citing papers

Observation c251b3c9-760a-4359-a6f9-40071d0f6ca5 · inbound

Hardness of Dynamic Core and Truss Decompositions cites this paper.

Hardness of Dynamic Core and Truss Decompositions Popular conjectures imply strong lower bounds for dynamic problems

Reference 2

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-04T16:40:00.108405Z digest=sha256:406fd00af6f37c6e51f17be50fbdf7e4065db4881ce98fa6a94ab18da9c6aee1

Observation 0c3a4da7-6750-4ed2-bd3d-79a4c0ac551b · inbound

On the Complexity of the Matching Problem of Regular Expressions with Backreferences cites this paper.

On the Complexity of the Matching Problem of Regular Expressions with Backreferences Popular conjectures imply strong lower bounds for dynamic problems

Reference 2

Resolution
verified exact
arxiv_id, observed 2026-07-04T18:49:00.800156Z

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.

source=pdf_text observed=2026-05-11T01:08:54.904472Z digest=sha256:13f9038b1ddd080cae6ec10cc2cb9cb57124fcfa0b8fc467dc9318557021a8cc