{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2002:5BRZLVAFMD7N5XG2DICZLUNFY4","short_pith_number":"pith:5BRZLVAF","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"},"canonical_sha256":"e86395d40560fededcda1a0595d1a5c73b409a895d156e094a0c7b41e737c96f","source":{"kind":"arxiv","id":"cs/0205050","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2002:5BRZLVAFMD7N5XG2DICZLUNFY4","target":"record","payload":{"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"},"canonical_sha256":"e86395d40560fededcda1a0595d1a5c73b409a895d156e094a0c7b41e737c96f","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"},"source_kind":"arxiv","source_id":"cs/0205050","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":"1u/qx22tLzSX9+cQZEgFMiRh7Fa5p6gsDmg3mgUle6VFsDYydGR8k4puMFi5SQoxTyUKnlSAIlLYEET171srBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T14:07:49.641165Z"},"content_sha256":"032e5cf50620cff11d678f31238bbd363d85a9a3403489591f28230ce6922494","schema_version":"1.0","event_id":"sha256:032e5cf50620cff11d678f31238bbd363d85a9a3403489591f28230ce6922494"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2002:5BRZLVAFMD7N5XG2DICZLUNFY4","target":"graph","payload":{"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"},"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":"2r8ycYIbwe/Pk0f9OGvjbUIWqtqFStx2wK3D+1LZbC9Dt7RUJTyARKJioYZrB0qpEWdWYdaedoa3cJY9jywxAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T14:07:49.641572Z"},"content_sha256":"3000f15359848ade7c7c397d0dca7a304c2034c10380136f215975f2b551b750","schema_version":"1.0","event_id":"sha256:3000f15359848ade7c7c397d0dca7a304c2034c10380136f215975f2b551b750"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5BRZLVAFMD7N5XG2DICZLUNFY4/bundle.json","state_url":"https://pith.science/pith/5BRZLVAFMD7N5XG2DICZLUNFY4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5BRZLVAFMD7N5XG2DICZLUNFY4/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-27T14:07:49Z","links":{"resolver":"https://pith.science/pith/5BRZLVAFMD7N5XG2DICZLUNFY4","bundle":"https://pith.science/pith/5BRZLVAFMD7N5XG2DICZLUNFY4/bundle.json","state":"https://pith.science/pith/5BRZLVAFMD7N5XG2DICZLUNFY4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5BRZLVAFMD7N5XG2DICZLUNFY4/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IGtw4VEpakHnv6Oqu+Ro3d9BN3pNYMvJ3aCI0PH/TiTFzB3yAGFu1G/g8mwSA/ZEBfRzLpNbg/eKpEHmsmEVDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T14:07:49.644212Z","bundle_sha256":"3c3dfa80f75b8452fe32b58e7c283b5dc05350a26352057c686799694023200e"}}