{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:IX67CRHXMVUORGQM6UCYBPOLMJ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"ae82fe4cee9a8c508a64443966eae1f7b90f38e055f480819f21227e2f4b1d0c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-07-11T14:37:24Z","title_canon_sha256":"405e525ad70a4fa4a631f2964cd31edc8266f05d26c64842aed9631ee87835a9"},"schema_version":"1.0","source":{"id":"1307.3129","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.3129","created_at":"2026-05-18T01:25:47Z"},{"alias_kind":"arxiv_version","alias_value":"1307.3129v2","created_at":"2026-05-18T01:25:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.3129","created_at":"2026-05-18T01:25:47Z"},{"alias_kind":"pith_short_12","alias_value":"IX67CRHXMVUO","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"IX67CRHXMVUORGQM","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"IX67CRHX","created_at":"2026-05-18T12:27:49Z"}],"graph_snapshots":[{"event_id":"sha256:fddb7e00968c8d46921731b93eed267666871da86966c4c03c092ea0d4615fc6","target":"graph","created_at":"2026-05-18T01:25:47Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"This work re-examines a classical construction of a 2-connected (simple) graph where every intermediate graph is 2-connected before detailing an analogous construction for 3-connected graphs which requires a graph equivalence relation $\\sim_2$ and a related concept of the $\\sim_2$-core of a graph. The case of $k$-connected graphs for $k\\geq 4$ is also addressed.","authors_text":"Jonathan McLaughlin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-07-11T14:37:24Z","title":"Constructing 2- and 3-connected graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.3129","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:531a98f9aee9c3e375a148f1daabc3e5e9099ebf6d5dd39bc3d753175a0d4ff3","target":"record","created_at":"2026-05-18T01:25:47Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"ae82fe4cee9a8c508a64443966eae1f7b90f38e055f480819f21227e2f4b1d0c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-07-11T14:37:24Z","title_canon_sha256":"405e525ad70a4fa4a631f2964cd31edc8266f05d26c64842aed9631ee87835a9"},"schema_version":"1.0","source":{"id":"1307.3129","kind":"arxiv","version":2}},"canonical_sha256":"45fdf144f76568e89a0cf50580bdcb625e4dca9244e585f074d83b089c531e3e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"45fdf144f76568e89a0cf50580bdcb625e4dca9244e585f074d83b089c531e3e","first_computed_at":"2026-05-18T01:25:47.850910Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:25:47.850910Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SKhLeZNf2D3iChv3qRal0OExxqPcszqcRqB4kCTAHphv8GGs1jKsqE/GAcWVzl4WNkZ+F0s7Fy/QJF6P5lDIBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:25:47.851520Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.3129","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:531a98f9aee9c3e375a148f1daabc3e5e9099ebf6d5dd39bc3d753175a0d4ff3","sha256:fddb7e00968c8d46921731b93eed267666871da86966c4c03c092ea0d4615fc6"],"state_sha256":"07e96955924c1942fe4ff9b105aa12fa3861b8600a16861843121ad10e5f583a"}