{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2002:5BRZLVAFMD7N5XG2DICZLUNFY4","short_pith_number":"pith:5BRZLVAF","schema_version":"1.0","canonical_sha256":"e86395d40560fededcda1a0595d1a5c73b409a895d156e094a0c7b41e737c96f","source":{"kind":"arxiv","id":"cs/0205050","version":1},"attestation_state":"computed","paper":{"title":"A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees","license":"","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"B. Raghavachari, M. Klemmstein, Neal E. Young, S. Fekete, S. Khuller","submitted_at":"2002-05-18T19:25:25Z","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"},"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/0205050","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.DS","submitted_at":"2002-05-18T19:25:25Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"9ceae86f5b6af93bba61e23af3167159e26deafaf3832403049445d8efa5d807","abstract_canon_sha256":"42288febf3becfefab7bf697de4309d2bc1f299aa2bf2a4d6ad078f06c732d01"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:59:53.884503Z","signature_b64":"u+nFwCL8ChB6oCIF2VrOPakM3mgJA7tYbwQyksdJt2HRROKFkWkiMz3GfhvW3A1ta6YgX3uxoRcBSIGPAGyLDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e86395d40560fededcda1a0595d1a5c73b409a895d156e094a0c7b41e737c96f","last_reissued_at":"2026-05-18T01:59:53.883858Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:59:53.883858Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees","license":"","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"B. Raghavachari, M. Klemmstein, Neal E. Young, S. Fekete, S. Khuller","submitted_at":"2002-05-18T19:25:25Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0205050","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/0205050","created_at":"2026-05-18T01:59:53.883961+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/0205050v1","created_at":"2026-05-18T01:59:53.883961+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0205050","created_at":"2026-05-18T01:59:53.883961+00:00"},{"alias_kind":"pith_short_12","alias_value":"5BRZLVAFMD7N","created_at":"2026-05-18T12:25:50.845339+00:00"},{"alias_kind":"pith_short_16","alias_value":"5BRZLVAFMD7N5XG2","created_at":"2026-05-18T12:25:50.845339+00:00"},{"alias_kind":"pith_short_8","alias_value":"5BRZLVAF","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/5BRZLVAFMD7N5XG2DICZLUNFY4","json":"https://pith.science/pith/5BRZLVAFMD7N5XG2DICZLUNFY4.json","graph_json":"https://pith.science/api/pith-number/5BRZLVAFMD7N5XG2DICZLUNFY4/graph.json","events_json":"https://pith.science/api/pith-number/5BRZLVAFMD7N5XG2DICZLUNFY4/events.json","paper":"https://pith.science/paper/5BRZLVAF"},"agent_actions":{"view_html":"https://pith.science/pith/5BRZLVAFMD7N5XG2DICZLUNFY4","download_json":"https://pith.science/pith/5BRZLVAFMD7N5XG2DICZLUNFY4.json","view_paper":"https://pith.science/paper/5BRZLVAF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/0205050&json=true","fetch_graph":"https://pith.science/api/pith-number/5BRZLVAFMD7N5XG2DICZLUNFY4/graph.json","fetch_events":"https://pith.science/api/pith-number/5BRZLVAFMD7N5XG2DICZLUNFY4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5BRZLVAFMD7N5XG2DICZLUNFY4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5BRZLVAFMD7N5XG2DICZLUNFY4/action/storage_attestation","attest_author":"https://pith.science/pith/5BRZLVAFMD7N5XG2DICZLUNFY4/action/author_attestation","sign_citation":"https://pith.science/pith/5BRZLVAFMD7N5XG2DICZLUNFY4/action/citation_signature","submit_replication":"https://pith.science/pith/5BRZLVAFMD7N5XG2DICZLUNFY4/action/replication_record"}},"created_at":"2026-05-18T01:59:53.883961+00:00","updated_at":"2026-05-18T01:59:53.883961+00:00"}