{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:Q3RAOGZSDAGUMDYGHZLBJZWSFI","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":"d466df58efa611b50fd774d26228fb60c9d5c0070454014c37ee89aa73ceb3e7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-10-09T08:23:13Z","title_canon_sha256":"16e47e369ce766f385704e67bc511bb9960f1231be010e39bbfe0bdf0a7b9107"},"schema_version":"1.0","source":{"id":"1310.2387","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.2387","created_at":"2026-05-18T03:10:56Z"},{"alias_kind":"arxiv_version","alias_value":"1310.2387v1","created_at":"2026-05-18T03:10:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.2387","created_at":"2026-05-18T03:10:56Z"},{"alias_kind":"pith_short_12","alias_value":"Q3RAOGZSDAGU","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"Q3RAOGZSDAGUMDYG","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"Q3RAOGZS","created_at":"2026-05-18T12:27:57Z"}],"graph_snapshots":[{"event_id":"sha256:a36c958fb50b45a6bc42bbf4be35ae74dcd53f46c75e7c10014f5112e5c5f287","target":"graph","created_at":"2026-05-18T03:10:56Z","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":"Finding a d-regular spanning subgraph (or d-factor) of a graph is easy by Tutte's reduction to the matching problem. By the same reduction, it is easy to find a minimal or maximal d-factor of a graph. However, if we require that the d-factor is connected, these problems become NP-hard - finding a minimal connected 2-factor is just the traveling salesman problem (TSP).\n  Given a complete graph with edge weights that satisfy the triangle inequality, we consider the problem of finding a minimal connected $d$-factor. We give a 3-approximation for all $d$ and improve this to an (r+1)-approximation ","authors_text":"Bodo Manthey, C. S. Rahul, Kamiel Cornelissen, N. S. Narayanaswamy, Ruben Hoeksma","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-10-09T08:23:13Z","title":"Approximability of Connected Factors"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.2387","kind":"arxiv","version":1},"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:2cb1bd514cf3a92a9cd91e41025b5d2d96dc67b2de1644a453473aca746c43bd","target":"record","created_at":"2026-05-18T03:10:56Z","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":"d466df58efa611b50fd774d26228fb60c9d5c0070454014c37ee89aa73ceb3e7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-10-09T08:23:13Z","title_canon_sha256":"16e47e369ce766f385704e67bc511bb9960f1231be010e39bbfe0bdf0a7b9107"},"schema_version":"1.0","source":{"id":"1310.2387","kind":"arxiv","version":1}},"canonical_sha256":"86e2071b32180d460f063e5614e6d22a048ae87b94fc35bb765aeebb5f58908b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"86e2071b32180d460f063e5614e6d22a048ae87b94fc35bb765aeebb5f58908b","first_computed_at":"2026-05-18T03:10:56.995670Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:10:56.995670Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jDkKMqLshd12/glbH0OyDE6GMicdSM/++v7lzq1PqZbQ4bNT5J59CQnTsmKKWbrb3X/eTMk6V2QwLAzQcenGAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:10:56.996335Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.2387","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2cb1bd514cf3a92a9cd91e41025b5d2d96dc67b2de1644a453473aca746c43bd","sha256:a36c958fb50b45a6bc42bbf4be35ae74dcd53f46c75e7c10014f5112e5c5f287"],"state_sha256":"6157540997a3269dddb48cc644779c205da3b354183298fff5ab7629a34d50d8"}