{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2002:I3V4IWHG7NPPKK3BHXNN4YMR6L","short_pith_number":"pith:I3V4IWHG","schema_version":"1.0","canonical_sha256":"46ebc458e6fb5ef52b613ddade6191f2cc3c7183a6583938c46843b7d5fc100c","source":{"kind":"arxiv","id":"cs/0205043","version":1},"attestation_state":"computed","paper":{"title":"Low-Degree Spanning Trees of Small Weight","license":"","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Balaji Raghavachari, Neal E. Young, Samir Khuller","submitted_at":"2002-05-18T16:37:28Z","abstract_excerpt":"The degree-d spanning tree problem asks for a minimum-weight spanning tree in which the degree of each vertex is at most d. When d=2 the problem is TSP, and in this case, the well-known Christofides algorithm provides a 1.5-approximation algorithm (assuming the edge weights satisfy the triangle inequality).\n  In 1984, Christos Papadimitriou and Umesh Vazirani posed the challenge of finding an algorithm with performance guarantee less than 2 for Euclidean graphs (points in R^n) and d > 2. This paper gives the first answer to that challenge, presenting an algorithm to compute a degree-3 spanning"},"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":"cs/0205043","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.DS","submitted_at":"2002-05-18T16:37:28Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"4cd777e9f0365c4fbffaf89653808b8ffb388f3057e808d56a00e4d311d38280","abstract_canon_sha256":"958285cccea17c573544a5f49a9a6ab46737b51baf1e3e08948b46a1d61cde0b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:59:53.928827Z","signature_b64":"nOVO8mspgaesqE6NzCYyypNn78ReBMGs942mpGq8XMaSQMmvZX43RxfuyTpfPqeq8h7oxaXJycwL69Fp0Y9XCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"46ebc458e6fb5ef52b613ddade6191f2cc3c7183a6583938c46843b7d5fc100c","last_reissued_at":"2026-05-18T01:59:53.928234Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:59:53.928234Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Low-Degree Spanning Trees of Small Weight","license":"","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Balaji Raghavachari, Neal E. Young, Samir Khuller","submitted_at":"2002-05-18T16:37:28Z","abstract_excerpt":"The degree-d spanning tree problem asks for a minimum-weight spanning tree in which the degree of each vertex is at most d. When d=2 the problem is TSP, and in this case, the well-known Christofides algorithm provides a 1.5-approximation algorithm (assuming the edge weights satisfy the triangle inequality).\n  In 1984, Christos Papadimitriou and Umesh Vazirani posed the challenge of finding an algorithm with performance guarantee less than 2 for Euclidean graphs (points in R^n) and d > 2. This paper gives the first answer to that challenge, presenting an algorithm to compute a degree-3 spanning"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0205043","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":"cs/0205043","created_at":"2026-05-18T01:59:53.928341+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/0205043v1","created_at":"2026-05-18T01:59:53.928341+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0205043","created_at":"2026-05-18T01:59:53.928341+00:00"},{"alias_kind":"pith_short_12","alias_value":"I3V4IWHG7NPP","created_at":"2026-05-18T12:25:50.845339+00:00"},{"alias_kind":"pith_short_16","alias_value":"I3V4IWHG7NPPKK3B","created_at":"2026-05-18T12:25:50.845339+00:00"},{"alias_kind":"pith_short_8","alias_value":"I3V4IWHG","created_at":"2026-05-18T12:25:50.845339+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/I3V4IWHG7NPPKK3BHXNN4YMR6L","json":"https://pith.science/pith/I3V4IWHG7NPPKK3BHXNN4YMR6L.json","graph_json":"https://pith.science/api/pith-number/I3V4IWHG7NPPKK3BHXNN4YMR6L/graph.json","events_json":"https://pith.science/api/pith-number/I3V4IWHG7NPPKK3BHXNN4YMR6L/events.json","paper":"https://pith.science/paper/I3V4IWHG"},"agent_actions":{"view_html":"https://pith.science/pith/I3V4IWHG7NPPKK3BHXNN4YMR6L","download_json":"https://pith.science/pith/I3V4IWHG7NPPKK3BHXNN4YMR6L.json","view_paper":"https://pith.science/paper/I3V4IWHG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/0205043&json=true","fetch_graph":"https://pith.science/api/pith-number/I3V4IWHG7NPPKK3BHXNN4YMR6L/graph.json","fetch_events":"https://pith.science/api/pith-number/I3V4IWHG7NPPKK3BHXNN4YMR6L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I3V4IWHG7NPPKK3BHXNN4YMR6L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I3V4IWHG7NPPKK3BHXNN4YMR6L/action/storage_attestation","attest_author":"https://pith.science/pith/I3V4IWHG7NPPKK3BHXNN4YMR6L/action/author_attestation","sign_citation":"https://pith.science/pith/I3V4IWHG7NPPKK3BHXNN4YMR6L/action/citation_signature","submit_replication":"https://pith.science/pith/I3V4IWHG7NPPKK3BHXNN4YMR6L/action/replication_record"}},"created_at":"2026-05-18T01:59:53.928341+00:00","updated_at":"2026-05-18T01:59:53.928341+00:00"}