Pith. sign in

Paper Citation Record · LEDGER

Every $d(d+1)$-connected graph is globally rigid in $\mathbb{R}^d$

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

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

pith.paper-citation-record.v1
2312.02028 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-13T06:32:02.005865+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-11T13:29:53.791575Z

measured 0 of 1 external citation measurements

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

Source: pith, observed 2026-08-11T12:31:52.493648Z

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 437638b3-1cb1-43e6-a0c2-90bfc23755ae · inbound

On the Rigidity of Random Graphs in high-dimensional spaces cites this paper.

On the Rigidity of Random Graphs in high-dimensional spaces Every $d(d+1)$-connected graph is globally rigid in $\mathbb{R}^d$

Reference 22

Resolution
unresolved
no resolver link, observed 2026-08-11T13:29:53.791575Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-11T13:29:53.791575Z digest=sha256:fe06eff17e6444a583d8f119785d4e3307308769b6031409203aefa1756dc12b

Observation a8f92060-ae81-47af-bea6-16a97044589d · inbound

Minimum degree conditions for graph rigidity cites this paper.

Minimum degree conditions for graph rigidity Every $d(d+1)$-connected graph is globally rigid in $\mathbb{R}^d$

Reference 25

Resolution
verified exact
local_arxiv, observed 2026-08-11T12:31:52.498561Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-08-11T12:31:52.474286Z digest=sha256:b60c58892931556e8764b59a50e3ba32b9ef6924bd18b56cbd054d57e3f7d0ea