{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:Q3RAOGZSDAGUMDYGHZLBJZWSFI","short_pith_number":"pith:Q3RAOGZS","schema_version":"1.0","canonical_sha256":"86e2071b32180d460f063e5614e6d22a048ae87b94fc35bb765aeebb5f58908b","source":{"kind":"arxiv","id":"1310.2387","version":1},"attestation_state":"computed","paper":{"title":"Approximability of Connected Factors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bodo Manthey, C. S. Rahul, Kamiel Cornelissen, N. S. Narayanaswamy, Ruben Hoeksma","submitted_at":"2013-10-09T08:23:13Z","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 "},"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":"1310.2387","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-10-09T08:23:13Z","cross_cats_sorted":[],"title_canon_sha256":"16e47e369ce766f385704e67bc511bb9960f1231be010e39bbfe0bdf0a7b9107","abstract_canon_sha256":"d466df58efa611b50fd774d26228fb60c9d5c0070454014c37ee89aa73ceb3e7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:10:56.996335Z","signature_b64":"jDkKMqLshd12/glbH0OyDE6GMicdSM/++v7lzq1PqZbQ4bNT5J59CQnTsmKKWbrb3X/eTMk6V2QwLAzQcenGAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"86e2071b32180d460f063e5614e6d22a048ae87b94fc35bb765aeebb5f58908b","last_reissued_at":"2026-05-18T03:10:56.995670Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:10:56.995670Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximability of Connected Factors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bodo Manthey, C. S. Rahul, Kamiel Cornelissen, N. S. Narayanaswamy, Ruben Hoeksma","submitted_at":"2013-10-09T08:23:13Z","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 "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.2387","kind":"arxiv","version":1},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1310.2387","created_at":"2026-05-18T03:10:56.995762+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.2387v1","created_at":"2026-05-18T03:10:56.995762+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.2387","created_at":"2026-05-18T03:10:56.995762+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q3RAOGZSDAGU","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q3RAOGZSDAGUMDYG","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q3RAOGZS","created_at":"2026-05-18T12:27:57.521954+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Q3RAOGZSDAGUMDYGHZLBJZWSFI","json":"https://pith.science/pith/Q3RAOGZSDAGUMDYGHZLBJZWSFI.json","graph_json":"https://pith.science/api/pith-number/Q3RAOGZSDAGUMDYGHZLBJZWSFI/graph.json","events_json":"https://pith.science/api/pith-number/Q3RAOGZSDAGUMDYGHZLBJZWSFI/events.json","paper":"https://pith.science/paper/Q3RAOGZS"},"agent_actions":{"view_html":"https://pith.science/pith/Q3RAOGZSDAGUMDYGHZLBJZWSFI","download_json":"https://pith.science/pith/Q3RAOGZSDAGUMDYGHZLBJZWSFI.json","view_paper":"https://pith.science/paper/Q3RAOGZS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.2387&json=true","fetch_graph":"https://pith.science/api/pith-number/Q3RAOGZSDAGUMDYGHZLBJZWSFI/graph.json","fetch_events":"https://pith.science/api/pith-number/Q3RAOGZSDAGUMDYGHZLBJZWSFI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q3RAOGZSDAGUMDYGHZLBJZWSFI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q3RAOGZSDAGUMDYGHZLBJZWSFI/action/storage_attestation","attest_author":"https://pith.science/pith/Q3RAOGZSDAGUMDYGHZLBJZWSFI/action/author_attestation","sign_citation":"https://pith.science/pith/Q3RAOGZSDAGUMDYGHZLBJZWSFI/action/citation_signature","submit_replication":"https://pith.science/pith/Q3RAOGZSDAGUMDYGHZLBJZWSFI/action/replication_record"}},"created_at":"2026-05-18T03:10:56.995762+00:00","updated_at":"2026-05-18T03:10:56.995762+00:00"}