{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:GLW3A5WD2R5K4SQ3ME2TWZE3LB","short_pith_number":"pith:GLW3A5WD","schema_version":"1.0","canonical_sha256":"32edb076c3d47aae4a1b61353b649b58565ef9000e4ded1d2855c93cd2509d17","source":{"kind":"arxiv","id":"1911.09640","version":3},"attestation_state":"computed","paper":{"title":"A randomized construction of high girth regular graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Michael Simkin, Nati Linial","submitted_at":"2019-11-21T17:52:58Z","abstract_excerpt":"We describe a new random greedy algorithm for generating regular graphs of high girth: Let $k\\geq 3$ and $c \\in (0,1)$ be fixed. Let $n \\in \\mathbb{N}$ be even and set $g = c \\log_{k-1} (n)$. Begin with a Hamilton cycle $G$ on $n$ vertices. As long as the smallest degree $\\delta (G)<k$, choose, uniformly at random, two vertices $u,v \\in V(G)$ of degree $\\delta(G)$ whose distance is at least $g-1$. If there are no such vertex pairs, abort. Otherwise, add the edge $uv$ to $E(G)$.\n  We show that with high probability this algorithm yields a $k$-regular graph with girth at least $g$. Our analysis "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1911.09640","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-11-21T17:52:58Z","cross_cats_sorted":[],"title_canon_sha256":"5b0a39b2b0813748105840897e08e28373f54dd90171eb1c7ff02c5ddc4f1eaa","abstract_canon_sha256":"b8571fab1f2447b9ab12e5685f76ddbd25f658f31f9f4b3593f37b62ec76aaa3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:13:55.754263Z","signature_b64":"t7kbloZtiYNhEWDsnymFUNoG3/tN78h1sORFGMCh/t6eY3BQDujPzhQ23gvUP5N2duEBwL2U5IBDs85fPhr5Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"32edb076c3d47aae4a1b61353b649b58565ef9000e4ded1d2855c93cd2509d17","last_reissued_at":"2026-07-05T01:13:55.753795Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:13:55.753795Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A randomized construction of high girth regular graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Michael Simkin, Nati Linial","submitted_at":"2019-11-21T17:52:58Z","abstract_excerpt":"We describe a new random greedy algorithm for generating regular graphs of high girth: Let $k\\geq 3$ and $c \\in (0,1)$ be fixed. Let $n \\in \\mathbb{N}$ be even and set $g = c \\log_{k-1} (n)$. Begin with a Hamilton cycle $G$ on $n$ vertices. As long as the smallest degree $\\delta (G)<k$, choose, uniformly at random, two vertices $u,v \\in V(G)$ of degree $\\delta(G)$ whose distance is at least $g-1$. If there are no such vertex pairs, abort. Otherwise, add the edge $uv$ to $E(G)$.\n  We show that with high probability this algorithm yields a $k$-regular graph with girth at least $g$. Our analysis "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.09640","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1911.09640/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1911.09640","created_at":"2026-07-05T01:13:55.753856+00:00"},{"alias_kind":"arxiv_version","alias_value":"1911.09640v3","created_at":"2026-07-05T01:13:55.753856+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.09640","created_at":"2026-07-05T01:13:55.753856+00:00"},{"alias_kind":"pith_short_12","alias_value":"GLW3A5WD2R5K","created_at":"2026-07-05T01:13:55.753856+00:00"},{"alias_kind":"pith_short_16","alias_value":"GLW3A5WD2R5K4SQ3","created_at":"2026-07-05T01:13:55.753856+00:00"},{"alias_kind":"pith_short_8","alias_value":"GLW3A5WD","created_at":"2026-07-05T01:13:55.753856+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2602.05956","citing_title":"Quantum Approximate Optimization of Integer Graph Problems and Surpassing Semidefinite Programming for Max-k-Cut","ref_index":60,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GLW3A5WD2R5K4SQ3ME2TWZE3LB","json":"https://pith.science/pith/GLW3A5WD2R5K4SQ3ME2TWZE3LB.json","graph_json":"https://pith.science/api/pith-number/GLW3A5WD2R5K4SQ3ME2TWZE3LB/graph.json","events_json":"https://pith.science/api/pith-number/GLW3A5WD2R5K4SQ3ME2TWZE3LB/events.json","paper":"https://pith.science/paper/GLW3A5WD"},"agent_actions":{"view_html":"https://pith.science/pith/GLW3A5WD2R5K4SQ3ME2TWZE3LB","download_json":"https://pith.science/pith/GLW3A5WD2R5K4SQ3ME2TWZE3LB.json","view_paper":"https://pith.science/paper/GLW3A5WD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1911.09640&json=true","fetch_graph":"https://pith.science/api/pith-number/GLW3A5WD2R5K4SQ3ME2TWZE3LB/graph.json","fetch_events":"https://pith.science/api/pith-number/GLW3A5WD2R5K4SQ3ME2TWZE3LB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GLW3A5WD2R5K4SQ3ME2TWZE3LB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GLW3A5WD2R5K4SQ3ME2TWZE3LB/action/storage_attestation","attest_author":"https://pith.science/pith/GLW3A5WD2R5K4SQ3ME2TWZE3LB/action/author_attestation","sign_citation":"https://pith.science/pith/GLW3A5WD2R5K4SQ3ME2TWZE3LB/action/citation_signature","submit_replication":"https://pith.science/pith/GLW3A5WD2R5K4SQ3ME2TWZE3LB/action/replication_record"}},"created_at":"2026-07-05T01:13:55.753856+00:00","updated_at":"2026-07-05T01:13:55.753856+00:00"}