{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2002:I3V4IWHG7NPPKK3BHXNN4YMR6L","short_pith_number":"pith:I3V4IWHG","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"},"canonical_sha256":"46ebc458e6fb5ef52b613ddade6191f2cc3c7183a6583938c46843b7d5fc100c","source":{"kind":"arxiv","id":"cs/0205043","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0205043","created_at":"2026-05-18T01:59:53Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0205043v1","created_at":"2026-05-18T01:59:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0205043","created_at":"2026-05-18T01:59:53Z"},{"alias_kind":"pith_short_12","alias_value":"I3V4IWHG7NPP","created_at":"2026-05-18T12:25:50Z"},{"alias_kind":"pith_short_16","alias_value":"I3V4IWHG7NPPKK3B","created_at":"2026-05-18T12:25:50Z"},{"alias_kind":"pith_short_8","alias_value":"I3V4IWHG","created_at":"2026-05-18T12:25:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2002:I3V4IWHG7NPPKK3BHXNN4YMR6L","target":"record","payload":{"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"},"canonical_sha256":"46ebc458e6fb5ef52b613ddade6191f2cc3c7183a6583938c46843b7d5fc100c","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"},"source_kind":"arxiv","source_id":"cs/0205043","source_version":1,"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-18T01:59:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SGghDH81vEvU1QhafwxdfnNCChVey2NmY4D9qAj8U0uiw0IhUF9oNhmKyHvd0Cx8rcoe/gklpCI5D/kBTgdSBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T18:00:52.696263Z"},"content_sha256":"22fe37f47cabc429291ee19bcb4188c6f0d8bc57c20fc439cfcd642a25b63fdf","schema_version":"1.0","event_id":"sha256:22fe37f47cabc429291ee19bcb4188c6f0d8bc57c20fc439cfcd642a25b63fdf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2002:I3V4IWHG7NPPKK3BHXNN4YMR6L","target":"graph","payload":{"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"},"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-18T01:59:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"23JaF7qhwf/+yTOpzneCTE4Pd+Tk6OtWmzurfMFd1ZPTJfzltSiU53PJUfC9krVLA3UKCoxcofoIGtriAWHdAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T18:00:52.696648Z"},"content_sha256":"ca0064aab3971a88e75ac913d834c85326e36cca7dc74ec1c4dd74c84dc6e1fe","schema_version":"1.0","event_id":"sha256:ca0064aab3971a88e75ac913d834c85326e36cca7dc74ec1c4dd74c84dc6e1fe"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/I3V4IWHG7NPPKK3BHXNN4YMR6L/bundle.json","state_url":"https://pith.science/pith/I3V4IWHG7NPPKK3BHXNN4YMR6L/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/I3V4IWHG7NPPKK3BHXNN4YMR6L/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-31T18:00:52Z","links":{"resolver":"https://pith.science/pith/I3V4IWHG7NPPKK3BHXNN4YMR6L","bundle":"https://pith.science/pith/I3V4IWHG7NPPKK3BHXNN4YMR6L/bundle.json","state":"https://pith.science/pith/I3V4IWHG7NPPKK3BHXNN4YMR6L/state.json","well_known_bundle":"https://pith.science/.well-known/pith/I3V4IWHG7NPPKK3BHXNN4YMR6L/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2002:I3V4IWHG7NPPKK3BHXNN4YMR6L","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":"958285cccea17c573544a5f49a9a6ab46737b51baf1e3e08948b46a1d61cde0b","cross_cats_sorted":["cs.DM"],"license":"","primary_cat":"cs.DS","submitted_at":"2002-05-18T16:37:28Z","title_canon_sha256":"4cd777e9f0365c4fbffaf89653808b8ffb388f3057e808d56a00e4d311d38280"},"schema_version":"1.0","source":{"id":"cs/0205043","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0205043","created_at":"2026-05-18T01:59:53Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0205043v1","created_at":"2026-05-18T01:59:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0205043","created_at":"2026-05-18T01:59:53Z"},{"alias_kind":"pith_short_12","alias_value":"I3V4IWHG7NPP","created_at":"2026-05-18T12:25:50Z"},{"alias_kind":"pith_short_16","alias_value":"I3V4IWHG7NPPKK3B","created_at":"2026-05-18T12:25:50Z"},{"alias_kind":"pith_short_8","alias_value":"I3V4IWHG","created_at":"2026-05-18T12:25:50Z"}],"graph_snapshots":[{"event_id":"sha256:ca0064aab3971a88e75ac913d834c85326e36cca7dc74ec1c4dd74c84dc6e1fe","target":"graph","created_at":"2026-05-18T01:59:53Z","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":"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","authors_text":"Balaji Raghavachari, Neal E. Young, Samir Khuller","cross_cats":["cs.DM"],"headline":"","license":"","primary_cat":"cs.DS","submitted_at":"2002-05-18T16:37:28Z","title":"Low-Degree Spanning Trees of Small Weight"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0205043","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:22fe37f47cabc429291ee19bcb4188c6f0d8bc57c20fc439cfcd642a25b63fdf","target":"record","created_at":"2026-05-18T01:59:53Z","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":"958285cccea17c573544a5f49a9a6ab46737b51baf1e3e08948b46a1d61cde0b","cross_cats_sorted":["cs.DM"],"license":"","primary_cat":"cs.DS","submitted_at":"2002-05-18T16:37:28Z","title_canon_sha256":"4cd777e9f0365c4fbffaf89653808b8ffb388f3057e808d56a00e4d311d38280"},"schema_version":"1.0","source":{"id":"cs/0205043","kind":"arxiv","version":1}},"canonical_sha256":"46ebc458e6fb5ef52b613ddade6191f2cc3c7183a6583938c46843b7d5fc100c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"46ebc458e6fb5ef52b613ddade6191f2cc3c7183a6583938c46843b7d5fc100c","first_computed_at":"2026-05-18T01:59:53.928234Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:59:53.928234Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nOVO8mspgaesqE6NzCYyypNn78ReBMGs942mpGq8XMaSQMmvZX43RxfuyTpfPqeq8h7oxaXJycwL69Fp0Y9XCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:59:53.928827Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/0205043","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:22fe37f47cabc429291ee19bcb4188c6f0d8bc57c20fc439cfcd642a25b63fdf","sha256:ca0064aab3971a88e75ac913d834c85326e36cca7dc74ec1c4dd74c84dc6e1fe"],"state_sha256":"ae7b0ec26bd0ca97908b6c133194c0c0dff64481f1c1683f1e0a05df995c04db"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"46q90oiX47jLjzjBAF1DnSlGnrjbuBr2TIjng/L40JMvdeVRS1mEESfdQg8KMkO4AuKI0p8+yd3Xgx+kaM5cAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T18:00:52.699146Z","bundle_sha256":"305f0f9f0ae380dd6488a33b2cf46e399bd52f6ee528193366645bceea90a61d"}}