{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:PS4YDYQL4RKVBN3HRWHT4VDF7O","short_pith_number":"pith:PS4YDYQL","canonical_record":{"source":{"id":"1612.04790","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-12-14T20:07:40Z","cross_cats_sorted":[],"title_canon_sha256":"0e58e78c300704247c98b7018f498acbe8510610343543cbe87b9022e694c8b0","abstract_canon_sha256":"f3493e04cb4ec2f42e53c99b57a4d3f7aadeb57cd7f1e392434d7f8c37ccf9c7"},"schema_version":"1.0"},"canonical_sha256":"7cb981e20be45550b7678d8f3e5465fb94eba2b0385bc900770371349cf64121","source":{"kind":"arxiv","id":"1612.04790","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.04790","created_at":"2026-05-18T00:52:37Z"},{"alias_kind":"arxiv_version","alias_value":"1612.04790v2","created_at":"2026-05-18T00:52:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.04790","created_at":"2026-05-18T00:52:37Z"},{"alias_kind":"pith_short_12","alias_value":"PS4YDYQL4RKV","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"PS4YDYQL4RKVBN3H","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"PS4YDYQL","created_at":"2026-05-18T12:30:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:PS4YDYQL4RKVBN3HRWHT4VDF7O","target":"record","payload":{"canonical_record":{"source":{"id":"1612.04790","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-12-14T20:07:40Z","cross_cats_sorted":[],"title_canon_sha256":"0e58e78c300704247c98b7018f498acbe8510610343543cbe87b9022e694c8b0","abstract_canon_sha256":"f3493e04cb4ec2f42e53c99b57a4d3f7aadeb57cd7f1e392434d7f8c37ccf9c7"},"schema_version":"1.0"},"canonical_sha256":"7cb981e20be45550b7678d8f3e5465fb94eba2b0385bc900770371349cf64121","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:37.221481Z","signature_b64":"oZJWG51S2T1BrH3x4EQ+eIXR3zTle7XS/jRPg+mbe2TU7mczBCVn2/AM90FsIFOkLNDhyCxO6FH+QQAq4Q09DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7cb981e20be45550b7678d8f3e5465fb94eba2b0385bc900770371349cf64121","last_reissued_at":"2026-05-18T00:52:37.221002Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:37.221002Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1612.04790","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:52:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sJ7s1wFQJwBWRJ4N+PAofyLVDJS9o5vX1T93NVf1yOSWZuExLKN28+vL63Xl+0GxDxknKEAXjNajt8qE11/gCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T08:51:00.059800Z"},"content_sha256":"a416b6c007018f1a84400128593ecbd6fdf96c594b09b175e2f21af93cd07477","schema_version":"1.0","event_id":"sha256:a416b6c007018f1a84400128593ecbd6fdf96c594b09b175e2f21af93cd07477"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:PS4YDYQL4RKVBN3HRWHT4VDF7O","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A 17/12-Approximation Algorithm for 2-Vertex-Connected Spanning Subgraphs on Graphs with Minimum Degree At Least 3","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Vishnu V. Narayan","submitted_at":"2016-12-14T20:07:40Z","abstract_excerpt":"We obtain a polynomial-time 17/12-approximation algorithm for the minimum-cost 2-vertex-connected spanning subgraph problem, restricted to graphs of minimum degree at least 3. Our algorithm uses the framework of ear-decompositions for approximating connectivity problems, which was previously used in algorithms for finding the smallest 2-edge-connected spanning subgraph by Cheriyan, Seb\\H{o} and Szigeti (SIAM J.Discrete Math. 2001) who gave a 17/12-approximation algorithm for this problem, and by Seb\\H{o} and Vygen (Combinatorica 2014), who improved the approximation ratio to 4/3."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.04790","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:52:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"23U28pLfKzaKkHH5IXudbUsSqHEvK5TTHLYbXtVe9ZS7elCufS+9dTNnZjGIPGoh12imwTTbgU9WTXGQPt+aBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T08:51:00.060441Z"},"content_sha256":"5770e61a66fd0d1188553a9e5a664576b1e70cfd3283806c8a13bb8e458804ea","schema_version":"1.0","event_id":"sha256:5770e61a66fd0d1188553a9e5a664576b1e70cfd3283806c8a13bb8e458804ea"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PS4YDYQL4RKVBN3HRWHT4VDF7O/bundle.json","state_url":"https://pith.science/pith/PS4YDYQL4RKVBN3HRWHT4VDF7O/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PS4YDYQL4RKVBN3HRWHT4VDF7O/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-25T08:51:00Z","links":{"resolver":"https://pith.science/pith/PS4YDYQL4RKVBN3HRWHT4VDF7O","bundle":"https://pith.science/pith/PS4YDYQL4RKVBN3HRWHT4VDF7O/bundle.json","state":"https://pith.science/pith/PS4YDYQL4RKVBN3HRWHT4VDF7O/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PS4YDYQL4RKVBN3HRWHT4VDF7O/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:PS4YDYQL4RKVBN3HRWHT4VDF7O","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":"f3493e04cb4ec2f42e53c99b57a4d3f7aadeb57cd7f1e392434d7f8c37ccf9c7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-12-14T20:07:40Z","title_canon_sha256":"0e58e78c300704247c98b7018f498acbe8510610343543cbe87b9022e694c8b0"},"schema_version":"1.0","source":{"id":"1612.04790","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.04790","created_at":"2026-05-18T00:52:37Z"},{"alias_kind":"arxiv_version","alias_value":"1612.04790v2","created_at":"2026-05-18T00:52:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.04790","created_at":"2026-05-18T00:52:37Z"},{"alias_kind":"pith_short_12","alias_value":"PS4YDYQL4RKV","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"PS4YDYQL4RKVBN3H","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"PS4YDYQL","created_at":"2026-05-18T12:30:39Z"}],"graph_snapshots":[{"event_id":"sha256:5770e61a66fd0d1188553a9e5a664576b1e70cfd3283806c8a13bb8e458804ea","target":"graph","created_at":"2026-05-18T00:52:37Z","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 obtain a polynomial-time 17/12-approximation algorithm for the minimum-cost 2-vertex-connected spanning subgraph problem, restricted to graphs of minimum degree at least 3. Our algorithm uses the framework of ear-decompositions for approximating connectivity problems, which was previously used in algorithms for finding the smallest 2-edge-connected spanning subgraph by Cheriyan, Seb\\H{o} and Szigeti (SIAM J.Discrete Math. 2001) who gave a 17/12-approximation algorithm for this problem, and by Seb\\H{o} and Vygen (Combinatorica 2014), who improved the approximation ratio to 4/3.","authors_text":"Vishnu V. Narayan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-12-14T20:07:40Z","title":"A 17/12-Approximation Algorithm for 2-Vertex-Connected Spanning Subgraphs on Graphs with Minimum Degree At Least 3"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.04790","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:a416b6c007018f1a84400128593ecbd6fdf96c594b09b175e2f21af93cd07477","target":"record","created_at":"2026-05-18T00:52:37Z","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":"f3493e04cb4ec2f42e53c99b57a4d3f7aadeb57cd7f1e392434d7f8c37ccf9c7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-12-14T20:07:40Z","title_canon_sha256":"0e58e78c300704247c98b7018f498acbe8510610343543cbe87b9022e694c8b0"},"schema_version":"1.0","source":{"id":"1612.04790","kind":"arxiv","version":2}},"canonical_sha256":"7cb981e20be45550b7678d8f3e5465fb94eba2b0385bc900770371349cf64121","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7cb981e20be45550b7678d8f3e5465fb94eba2b0385bc900770371349cf64121","first_computed_at":"2026-05-18T00:52:37.221002Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:52:37.221002Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oZJWG51S2T1BrH3x4EQ+eIXR3zTle7XS/jRPg+mbe2TU7mczBCVn2/AM90FsIFOkLNDhyCxO6FH+QQAq4Q09DA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:52:37.221481Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.04790","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a416b6c007018f1a84400128593ecbd6fdf96c594b09b175e2f21af93cd07477","sha256:5770e61a66fd0d1188553a9e5a664576b1e70cfd3283806c8a13bb8e458804ea"],"state_sha256":"e6413e10549eb83f85839c885e4d16baf2c12669f9ae9e277c472a9d24609f7b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W15WBOF163pqsuu/ltBytA8uSiJOhoV9kgV3y2MGNFTTCuYviDWWonZlnd9h3fVY444dqDXtU4ZNX44g8clBCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T08:51:00.063556Z","bundle_sha256":"a795bddf6ea54eac4a9b9ae72f40b23bd5d2d409b2d22b21098ab304ab98ab56"}}