{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2002:5BRZLVAFMD7N5XG2DICZLUNFY4","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":"42288febf3becfefab7bf697de4309d2bc1f299aa2bf2a4d6ad078f06c732d01","cross_cats_sorted":["cs.DM"],"license":"","primary_cat":"cs.DS","submitted_at":"2002-05-18T19:25:25Z","title_canon_sha256":"9ceae86f5b6af93bba61e23af3167159e26deafaf3832403049445d8efa5d807"},"schema_version":"1.0","source":{"id":"cs/0205050","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0205050","created_at":"2026-05-18T01:59:53Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0205050v1","created_at":"2026-05-18T01:59:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0205050","created_at":"2026-05-18T01:59:53Z"},{"alias_kind":"pith_short_12","alias_value":"5BRZLVAFMD7N","created_at":"2026-05-18T12:25:50Z"},{"alias_kind":"pith_short_16","alias_value":"5BRZLVAFMD7N5XG2","created_at":"2026-05-18T12:25:50Z"},{"alias_kind":"pith_short_8","alias_value":"5BRZLVAF","created_at":"2026-05-18T12:25:50Z"}],"graph_snapshots":[{"event_id":"sha256:3000f15359848ade7c7c397d0dca7a304c2034c10380136f215975f2b551b750","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 problem considered is the following. Given a graph with edge weights satisfying the triangle inequality, and a degree bound for each vertex, compute a low-weight spanning tree such that the degree of each vertex is at most its specified bound. The problem is NP-hard (it generalizes Traveling Salesman (TSP)). This paper describes a network-flow heuristic for modifying a given tree T to meet the constraints. Choosing T to be a minimum spanning tree (MST) yields approximation algorithms with performance guarantee less than 2 for the problem on geometric graphs with L_p-norms. The paper also d","authors_text":"B. Raghavachari, M. Klemmstein, Neal E. Young, S. Fekete, S. Khuller","cross_cats":["cs.DM"],"headline":"","license":"","primary_cat":"cs.DS","submitted_at":"2002-05-18T19:25:25Z","title":"A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0205050","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:032e5cf50620cff11d678f31238bbd363d85a9a3403489591f28230ce6922494","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":"42288febf3becfefab7bf697de4309d2bc1f299aa2bf2a4d6ad078f06c732d01","cross_cats_sorted":["cs.DM"],"license":"","primary_cat":"cs.DS","submitted_at":"2002-05-18T19:25:25Z","title_canon_sha256":"9ceae86f5b6af93bba61e23af3167159e26deafaf3832403049445d8efa5d807"},"schema_version":"1.0","source":{"id":"cs/0205050","kind":"arxiv","version":1}},"canonical_sha256":"e86395d40560fededcda1a0595d1a5c73b409a895d156e094a0c7b41e737c96f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e86395d40560fededcda1a0595d1a5c73b409a895d156e094a0c7b41e737c96f","first_computed_at":"2026-05-18T01:59:53.883858Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:59:53.883858Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"u+nFwCL8ChB6oCIF2VrOPakM3mgJA7tYbwQyksdJt2HRROKFkWkiMz3GfhvW3A1ta6YgX3uxoRcBSIGPAGyLDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:59:53.884503Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/0205050","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:032e5cf50620cff11d678f31238bbd363d85a9a3403489591f28230ce6922494","sha256:3000f15359848ade7c7c397d0dca7a304c2034c10380136f215975f2b551b750"],"state_sha256":"e72f53289eaa3d7a5527e81fbca38b9e99c696ebdbf0c2f1e04ecad6596a7d15"}