{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:FHMXJNQMPXT4QWIYJGQRKROG72","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":"14eec53f901d7443c2f23c1d89da7e57750859ae5ffb32e925e8d5560fa48ebf","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-11-28T09:27:24Z","title_canon_sha256":"45aacbd5ebecd6b1f2663d1d57dab0403bdb54f798d3ca751e8ad30bb19b986a"},"schema_version":"1.0","source":{"id":"1211.6553","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.6553","created_at":"2026-05-18T01:30:55Z"},{"alias_kind":"arxiv_version","alias_value":"1211.6553v3","created_at":"2026-05-18T01:30:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.6553","created_at":"2026-05-18T01:30:55Z"},{"alias_kind":"pith_short_12","alias_value":"FHMXJNQMPXT4","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"FHMXJNQMPXT4QWIY","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"FHMXJNQM","created_at":"2026-05-18T12:27:06Z"}],"graph_snapshots":[{"event_id":"sha256:3c030c398e6caf4e203936c603ef87531af692e6431dd6757b7c5cddf97e0a17","target":"graph","created_at":"2026-05-18T01:30:55Z","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":"We present a certifying algorithm that tests graphs for 3-edge-connectivity; the algorithm works in linear time. If the input graph is not 3-edge-connected, the algorithm returns a 2-edge-cut. If it is 3-edge-connected, it returns a construction sequence that constructs the input graph from the graph with two vertices and three parallel edges using only operations that (obviously) preserve 3-edge-connectivity. Additionally, we show how compute and certify the 3-edge-connected components and a cactus representation of the 2-cuts in linear time. For 3-vertex-connectivity, we show how to compute ","authors_text":"Adrian Neumann, Jens M. Schmidt, Kurt Mehlhorn","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-11-28T09:27:24Z","title":"Certifying 3-Edge-Connectivity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.6553","kind":"arxiv","version":3},"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:53e3b8f520e412aa70f6b66dbd35d9039fb6d05b3c26e177d95a48936cc82261","target":"record","created_at":"2026-05-18T01:30:55Z","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":"14eec53f901d7443c2f23c1d89da7e57750859ae5ffb32e925e8d5560fa48ebf","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-11-28T09:27:24Z","title_canon_sha256":"45aacbd5ebecd6b1f2663d1d57dab0403bdb54f798d3ca751e8ad30bb19b986a"},"schema_version":"1.0","source":{"id":"1211.6553","kind":"arxiv","version":3}},"canonical_sha256":"29d974b60c7de7c8591849a11545c6fea2bb9d4508759464c0b97e417dcd6d2f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"29d974b60c7de7c8591849a11545c6fea2bb9d4508759464c0b97e417dcd6d2f","first_computed_at":"2026-05-18T01:30:55.730655Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:30:55.730655Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jUA7rte6j6GOGoZlgXs9hsQ1LFNJfuKRrY5IhXT21abfoltuNlyFK2B3zjIINHoGsJcoBk8Q3TTnPTA2BzuWAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:30:55.731113Z","signed_message":"canonical_sha256_bytes"},"source_id":"1211.6553","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:53e3b8f520e412aa70f6b66dbd35d9039fb6d05b3c26e177d95a48936cc82261","sha256:3c030c398e6caf4e203936c603ef87531af692e6431dd6757b7c5cddf97e0a17"],"state_sha256":"6df56a6742b198fdcf1522215858724646a608613928598a6cd84000f5fd2852"}