{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:RUBAE4GN77G7M27R3CF2XUPE2R","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":"aeb08e118c269d54754a738784365af2b80d05d0f8c1ced5da3ce722809ddb2c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-17T12:47:39Z","title_canon_sha256":"8c5459c7098f33e3d20859c368887a604c5fdadc400286d95640adaf3417560c"},"schema_version":"1.0","source":{"id":"1707.05123","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.05123","created_at":"2026-05-17T23:45:04Z"},{"alias_kind":"arxiv_version","alias_value":"1707.05123v3","created_at":"2026-05-17T23:45:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.05123","created_at":"2026-05-17T23:45:04Z"},{"alias_kind":"pith_short_12","alias_value":"RUBAE4GN77G7","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"RUBAE4GN77G7M27R","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"RUBAE4GN","created_at":"2026-05-18T12:31:39Z"}],"graph_snapshots":[{"event_id":"sha256:e7394d3cc928f570008230d93d0402866f0e770c6f2c0b0506cb8882fa1aadfd","target":"graph","created_at":"2026-05-17T23:45:04Z","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":"Given a directed graph $G$ on $n$ vertices with a special vertex $s$, the directed minimum degree spanning tree problem requires computing a incoming spanning tree rooted at $s$ whose maximum tree in-degree is the smallest among all such trees. The problem is known to be NP-hard, since it generalizes the Hamiltonian path problem. The best LP-based polynomial time algorithm can achieve an approximation of $\\Delta^*+2$ [Bansal et al, 2009], where $\\Delta^*$ denotes the optimal maximum tree in-degree. As for purely combinatorial algorithms (algorithms that do not use LP), the best approximation i","authors_text":"Ran Duan, Tianyi Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-17T12:47:39Z","title":"Purely Combinatorial Algorithms for Approximate Directed Minimum Degree Spanning Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.05123","kind":"arxiv","version":3},"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:1dc9c1bb78eff20c42d05d1a20e0c46841cb9cf3cd0d3adb27f733ae768164bd","target":"record","created_at":"2026-05-17T23:45:04Z","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":"aeb08e118c269d54754a738784365af2b80d05d0f8c1ced5da3ce722809ddb2c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-17T12:47:39Z","title_canon_sha256":"8c5459c7098f33e3d20859c368887a604c5fdadc400286d95640adaf3417560c"},"schema_version":"1.0","source":{"id":"1707.05123","kind":"arxiv","version":3}},"canonical_sha256":"8d020270cdffcdf66bf1d88babd1e4d4793837a3717203565405e9bcd0ebf6bc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8d020270cdffcdf66bf1d88babd1e4d4793837a3717203565405e9bcd0ebf6bc","first_computed_at":"2026-05-17T23:45:04.898412Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:04.898412Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gfnrV/MNG+9ExBbCSDS8Ly3w0KBNN+XHhMTkapiIJ/6JRfOX0CqVNwFCro3JmR99ntTTD6i6Y/ISDpyMvtbVCg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:04.898926Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.05123","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1dc9c1bb78eff20c42d05d1a20e0c46841cb9cf3cd0d3adb27f733ae768164bd","sha256:e7394d3cc928f570008230d93d0402866f0e770c6f2c0b0506cb8882fa1aadfd"],"state_sha256":"a604f77e4749314011cfd97170dc225197d3dc8410ed49ff8f897b5d9b4604ab"}