Pith. sign in

Paper Citation Record · LEDGER

Efficiently matching random inhomogeneous graphs via degree profiles

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

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

pith.paper-citation-record.v1
2310.10441 v2

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

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

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-11T23:20:10.723544Z

measured 0 of 1 external citation measurements

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

Source: arxiv_reference, observed 2026-05-24T03:48:53.080557Z

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 649f3529-7da4-472a-8bd6-317812b0cbcc · inbound

The Umeyama algorithm for matching correlated Gaussian geometric models in the low-dimensional regime cites this paper.

The Umeyama algorithm for matching correlated Gaussian geometric models in the low-dimensional regime Efficiently matching random inhomogeneous graphs via degree profiles

Reference 18

Resolution
verified exact
arxiv_id, observed 2026-05-24T03:48:53.083627Z

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-05-24T03:46:11.205970Z digest=sha256:2ebbf6544f3dc46ff723c0f730961800581267083540de00d6be68705c8228ce

Observation 440cb041-a9c9-421c-9adc-4221191960f6 · inbound

Efficient Graph Matching for Correlated Stochastic Block Models cites this paper.

Efficient Graph Matching for Correlated Stochastic Block Models Efficiently matching random inhomogeneous graphs via degree profiles

Reference 19

Resolution
unresolved
no resolver link, observed 2026-08-11T23:20:10.723544Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-11T23:20:10.723544Z digest=sha256:e936f6816303c60dc52b11ca6d734ca1cf71bd1028c620d88c5d151f215bb625

Observation cee3cf71-a301-404b-aa2a-bda8bb499581 · inbound

Harnessing Multiple Correlated Networks for Exact Community Recovery cites this paper.

Harnessing Multiple Correlated Networks for Exact Community Recovery Efficiently matching random inhomogeneous graphs via degree profiles

Reference 19

Resolution
unresolved
no resolver link, observed 2026-08-11T23:13:28.919711Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-11T23:13:28.919711Z digest=sha256:69dd780c2026338588f0773962702c39f1cd2147dbb436c384c1bc005f963504

Observation 23c16cd2-c490-4c63-9bd3-d8433cbd5b2e · inbound

Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm cites this paper.

Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm Efficiently matching random inhomogeneous graphs via degree profiles

Reference 24

Resolution
unresolved
no resolver link, observed 2026-08-11T10:42:31.367073Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-11T10:42:31.367073Z digest=sha256:479bda2d0812019548852c36dbc74562c2bf4a577a4e410d7a5cd82fb50ddd99

Observation cdfd6023-effa-4922-a545-c812a04e3b91 · inbound

Sample Complexity of Correlation Detection in the Gaussian Wigner Model cites this paper.

Sample Complexity of Correlation Detection in the Gaussian Wigner Model Efficiently matching random inhomogeneous graphs via degree profiles

Reference 6

Resolution
unresolved
no resolver link, observed 2026-08-07T15:45:24.547987Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-07T15:45:24.547987Z digest=sha256:022483531fc5476aa7abc07b66b784a918dea7d5ff08aa575dfe3ad8ac4719dd