Paper Citation Record · LEDGER

Maximizing Algebraic Connectivity with $2(n-2)$ Edges: The Large Vertex Number Case

As of 10 August 2026, this Paper Citation Record lists 12 of 12 outbound references and 0 inbound Pith citation observations for arXiv:2608.07360.

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

pith.paper-citation-record.v1
2608.07360 v1

Coverage vector

measured 12 of 12 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-10T05:44:54.454255Z

measured 12 of 12 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-10T06:31:04.303077+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

12 of 12 outbound references displayed

verified exact5
verified fuzzy0
unresolved7
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 7b683b4d-bdbc-477e-981e-3fa0e9532c40 · outbound

This paper cites The Moore bound for irregular graphs.

Maximizing Algebraic Connectivity with $2(n-2)$ Edges: The Large Vertex Number Case The Moore bound for irregular graphs

Reference 1

Resolution: unresolved; no resolver link, observed 2026-08-10T05:44:54.402131Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 959ee62f-3708-4a18-9df0-7e0e434e3ea4 · outbound

This paper cites an unresolved cited work.

Maximizing Algebraic Connectivity with $2(n-2)$ Edges: The Large Vertex Number Case Unresolved cited work

Reference 2

Resolution: unresolved; no resolver link, observed 2026-08-10T05:44:54.407105Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 87db64be-f9f8-4d9c-9200-1c0f4b361c6d · outbound

This paper cites Mem0: Building Production-Ready AI Agents with Scalable Long-Term Memory.

Maximizing Algebraic Connectivity with $2(n-2)$ Edges: The Large Vertex Number Case Mem0: Building Production-Ready AI Agents with Scalable Long-Term Memory

Reference 3

Resolution: unresolved; no resolver link, observed 2026-08-10T05:44:54.411297Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 55a1be74-8c46-4c4a-bee5-a5bdf04a5781 · outbound

This paper cites Algebraic connectivity of graphs.

Maximizing Algebraic Connectivity with $2(n-2)$ Edges: The Large Vertex Number Case Algebraic connectivity of graphs

Reference 4

Resolution: verified exact; arxiv_id_nonexistent, observed 2026-08-10T05:44:55.558285Z

Source-reported events for the cited work

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

Observation cf145f56-ffae-4824-8ccb-5d99fa904263 · outbound

This paper cites an unresolved cited work.

Maximizing Algebraic Connectivity with $2(n-2)$ Edges: The Large Vertex Number Case Unresolved cited work

Reference 5

Resolution: unresolved; no resolver link, observed 2026-08-10T05:44:54.421001Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 33a1ecb8-7124-45e7-b4bf-af99d388a0e3 · outbound

This paper cites Maximizing algebraic connectivity for certain families of graphs.

Maximizing Algebraic Connectivity with $2(n-2)$ Edges: The Large Vertex Number Case Maximizing algebraic connectivity for certain families of graphs

Reference 6

Resolution: verified exact; local_arxiv, observed 2026-08-10T05:44:55.363460Z

Source-reported events for the cited work

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

Observation ca86a389-b365-4884-bd4e-23139050df87 · outbound

This paper cites MerLean-Prover: A Recursive Looping Harness for Lean 4 Theorem Proving.

Maximizing Algebraic Connectivity with $2(n-2)$ Edges: The Large Vertex Number Case MerLean-Prover: A Recursive Looping Harness for Lean 4 Theorem Proving

Reference 7

Resolution: verified exact; local_arxiv, observed 2026-08-10T05:44:55.341613Z

Source-reported events for the cited work

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

Observation ae7dc91d-d704-4494-921c-ab1f8bfd42c4 · outbound

This paper cites The Lean 4 theorem prover and programming language.

Maximizing Algebraic Connectivity with $2(n-2)$ Edges: The Large Vertex Number Case The Lean 4 theorem prover and programming language

Reference 8

Resolution: unresolved; no resolver link, observed 2026-08-10T05:44:54.436144Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b74713c4-90e2-4ce4-a883-ab6490223ddb · outbound

This paper cites Maximizing Algebraic Connectivity in the Space of Graphs with a Fixed Number of Vertices and Edges.

Maximizing Algebraic Connectivity with $2(n-2)$ Edges: The Large Vertex Number Case Maximizing Algebraic Connectivity in the Space of Graphs with a Fixed Number of Vertices and Edges

Reference 9

Resolution: verified exact; arxiv_id_nonexistent, observed 2026-08-10T05:44:55.321513Z

Source-reported events for the cited work

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

Observation 75e7f471-3a6a-403f-a01d-e906d5b3f973 · outbound

This paper cites an unresolved cited work.

Maximizing Algebraic Connectivity with $2(n-2)$ Edges: The Large Vertex Number Case Unresolved cited work

Reference 10

Resolution: unresolved; no resolver link, observed 2026-08-10T05:44:54.444972Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ee7c7173-a9e2-412a-aab7-5b25ad76042a · outbound

This paper cites Algebraic Connectivity: Local and Global Max- imizer Graphs.

Maximizing Algebraic Connectivity with $2(n-2)$ Edges: The Large Vertex Number Case Algebraic Connectivity: Local and Global Max- imizer Graphs

Reference 11

Resolution: verified exact; arxiv_id_nonexistent, observed 2026-08-10T05:44:54.736174Z

Source-reported events for the cited work

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

Observation bc4ede93-258d-4fd3-95fd-0ab92ba94ddc · outbound

This paper cites The Lean mathematical library.

Maximizing Algebraic Connectivity with $2(n-2)$ Edges: The Large Vertex Number Case The Lean mathematical library

Reference 12

Resolution: unresolved; no resolver link, observed 2026-08-10T05:44:54.454255Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Pith citing papers

No inbound Pith citation observations are available.