Paper Citation Record · LEDGER

Local Certification of Vertex and Edge Connectivity

As of 9 August 2026, this Paper Citation Record lists 17 of 17 outbound references and 0 inbound Pith citation observations for arXiv:2607.13677.

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

pith.paper-citation-record.v1
2607.13677 v1

Coverage vector

measured 17 of 17 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-02T04:40:15.709398Z

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

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

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

Source: cited_works

Reference resolution

17 of 17 outbound references displayed

verified exact3
verified fuzzy0
unresolved11
parse uncertain0
malformed identifier3
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 79fe7a86-566d-4bda-80c5-28acb3c9430a · outbound

This paper cites Alon and M.

Local Certification of Vertex and Edge Connectivity Alon and M

Reference 1

Resolution: verified exact; doi, observed 2026-08-02T04:43:29.018344Z

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.

Observation 2188299e-65bc-4214-84f1-4b959a20631a · outbound

This paper cites [Jae79] F.

Local Certification of Vertex and Edge Connectivity [Jae79] F

Reference 8

Resolution: unresolved; no resolver link, observed 2026-08-02T04:40:15.282839Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 62ca39f8-5abf-4215-a232-89258f830d4c · outbound

This paper cites Distributed minimum cut approximation.

Local Certification of Vertex and Edge Connectivity Distributed minimum cut approximation

Reference 9

Resolution: unresolved; no resolver link, observed 2026-08-02T04:40:14.875534Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 44413140-f0de-413d-8522-4bd448508928 · outbound

This paper cites 1145/3519270.3538429.

Local Certification of Vertex and Edge Connectivity 1145/3519270.3538429

Reference 12

Resolution: unresolved; no resolver link, observed 2026-08-02T04:40:15.210380Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation fc368508-76cd-428c-8c69-8c734a7e7c26 · outbound

This paper cites Proof labeling schemes.

Local Certification of Vertex and Edge Connectivity Proof labeling schemes

Reference 14

Resolution: unresolved; no resolver link, observed 2026-08-02T04:40:15.382722Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 46c41c3e-6596-4d4d-8767-8d7e38c69877 · outbound

This paper cites an unresolved cited work.

Local Certification of Vertex and Edge Connectivity Unresolved cited work

Reference 77

Resolution: malformed identifier; no resolver link, observed 2026-08-02T04:40:14.930797Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ccd146bd-8f6f-4328-9d68-34c5c08ab887 · outbound

This paper cites A linear-time algorithm for finding a sparsek-connected spanning subgraph of ak-connected graph.Algorithmica, 7:583–596, 1992.url:https://api.semanticscholar.org/CorpusID:35970274.

Local Certification of Vertex and Edge Connectivity A linear-time algorithm for finding a sparsek-connected spanning subgraph of ak-connected graph.Algorithmica, 7:583–596, 1992.url:https://api.semanticscholar.org/CorpusID:35970274

Reference 1960

Resolution: unresolved; no resolver link, observed 2026-08-02T04:40:15.494131Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4782c89e-87b0-40a1-9f58-aaab7f2278dd · outbound

This paper cites [CPP20] Keren Censor-Hillel, Ami Paz, and Mor Perry.

Local Certification of Vertex and Edge Connectivity [CPP20] Keren Censor-Hillel, Ami Paz, and Mor Perry

Reference 1988

Resolution: malformed identifier; no resolver link, observed 2026-08-02T04:40:14.662821Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0be37c5f-5ddb-4637-9788-60d5d4cf694a · outbound

This paper cites Locally checkable proofs in distributed computing.

Local Certification of Vertex and Edge Connectivity Locally checkable proofs in distributed computing

Reference 1991

Resolution: verified exact; doi, observed 2026-08-02T04:43:28.790203Z

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.

Observation dec42174-a493-4f47-8d15-03e0c1cb98b2 · outbound

This paper cites Three tree-paths.Journal of Graph Theory, 13(2):175– 188, 1989.doi:https : / / doi.

Local Certification of Vertex and Edge Connectivity Three tree-paths.Journal of Graph Theory, 13(2):175– 188, 1989.doi:https : / / doi

Reference 1998

Resolution: unresolved; no resolver link, observed 2026-08-02T04:40:15.709398Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 31138d96-82cb-44eb-a344-06b761778f7a · outbound

This paper cites A tight meta-theorem for LOCAL certification of MSO 2 properties within bounded treewidth graphs.

Local Certification of Vertex and Edge Connectivity A tight meta-theorem for LOCAL certification of MSO 2 properties within bounded treewidth graphs

Reference 2014

Resolution: unresolved; no resolver link, observed 2026-08-02T04:40:14.429275Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0cbb6239-29f2-4e6a-9fac-a943e9101c75 · outbound

This paper cites Algorithms for parallel k-vertex con- nectivity and sparse certificates.

Local Certification of Vertex and Edge Connectivity Algorithms for parallel k-vertex con- nectivity and sparse certificates

Reference 2018

Resolution: unresolved; no resolver link, observed 2026-08-02T04:40:14.730236Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f77508e1-55e0-4989-b23d-80fa03b7dc7b · outbound

This paper cites Almost-tight distributed minimum cut algo- rithms.

Local Certification of Vertex and Edge Connectivity Almost-tight distributed minimum cut algo- rithms

Reference 2020

Resolution: unresolved; no resolver link, observed 2026-08-02T04:40:15.600367Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5a8269a8-9243-4ff4-9006-928fa7c8336e · outbound

This paper cites Compact distributed certification of planar graphs.

Local Certification of Vertex and Edge Connectivity Compact distributed certification of planar graphs

Reference 2022

Resolution: malformed identifier; no resolver link, observed 2026-08-02T04:40:14.782422Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation bfd7c566-1021-4e21-adae-c34834d45b99 · outbound

This paper cites Tight bounds on vertex connectivity under sampling.ACM Trans.

Local Certification of Vertex and Edge Connectivity Tight bounds on vertex connectivity under sampling.ACM Trans

Reference 2024

Resolution: verified exact; doi, observed 2026-08-02T04:43:28.893255Z

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.

Observation 1135a008-1634-4ee8-a68c-88795b78e99d · outbound

This paper cites Local certification of graph decompositions and applications to minor-free classes.Journal of Parallel and Dis- tributed Computing, 193:104954, 2024.issn: 0743-7315.

Local Certification of Vertex and Edge Connectivity Local certification of graph decompositions and applications to minor-free classes.Journal of Parallel and Dis- tributed Computing, 193:104954, 2024.issn: 0743-7315

Reference 2025

Resolution: unresolved; no resolver link, observed 2026-08-02T04:40:14.172646Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3f6e6814-4a1b-419e-ab4d-1ad1b01d082a · outbound

This paper cites The local complexity of certifying parity.

Local Certification of Vertex and Edge Connectivity The local complexity of certifying parity

Reference 2026

Resolution: unresolved; no resolver link, observed 2026-08-02T04:40:14.274726Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Pith citing papers

No inbound Pith citation observations are available.