{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:RUBAE4GN77G7M27R3CF2XUPE2R","short_pith_number":"pith:RUBAE4GN","schema_version":"1.0","canonical_sha256":"8d020270cdffcdf66bf1d88babd1e4d4793837a3717203565405e9bcd0ebf6bc","source":{"kind":"arxiv","id":"1707.05123","version":3},"attestation_state":"computed","paper":{"title":"Purely Combinatorial Algorithms for Approximate Directed Minimum Degree Spanning Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ran Duan, Tianyi Zhang","submitted_at":"2017-07-17T12:47:39Z","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"},"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":"1707.05123","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-17T12:47:39Z","cross_cats_sorted":[],"title_canon_sha256":"8c5459c7098f33e3d20859c368887a604c5fdadc400286d95640adaf3417560c","abstract_canon_sha256":"aeb08e118c269d54754a738784365af2b80d05d0f8c1ced5da3ce722809ddb2c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:04.898926Z","signature_b64":"gfnrV/MNG+9ExBbCSDS8Ly3w0KBNN+XHhMTkapiIJ/6JRfOX0CqVNwFCro3JmR99ntTTD6i6Y/ISDpyMvtbVCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8d020270cdffcdf66bf1d88babd1e4d4793837a3717203565405e9bcd0ebf6bc","last_reissued_at":"2026-05-17T23:45:04.898412Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:04.898412Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Purely Combinatorial Algorithms for Approximate Directed Minimum Degree Spanning Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ran Duan, Tianyi Zhang","submitted_at":"2017-07-17T12:47:39Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.05123","kind":"arxiv","version":3},"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":"1707.05123","created_at":"2026-05-17T23:45:04.898497+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.05123v3","created_at":"2026-05-17T23:45:04.898497+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.05123","created_at":"2026-05-17T23:45:04.898497+00:00"},{"alias_kind":"pith_short_12","alias_value":"RUBAE4GN77G7","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_16","alias_value":"RUBAE4GN77G7M27R","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_8","alias_value":"RUBAE4GN","created_at":"2026-05-18T12:31:39.905425+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/RUBAE4GN77G7M27R3CF2XUPE2R","json":"https://pith.science/pith/RUBAE4GN77G7M27R3CF2XUPE2R.json","graph_json":"https://pith.science/api/pith-number/RUBAE4GN77G7M27R3CF2XUPE2R/graph.json","events_json":"https://pith.science/api/pith-number/RUBAE4GN77G7M27R3CF2XUPE2R/events.json","paper":"https://pith.science/paper/RUBAE4GN"},"agent_actions":{"view_html":"https://pith.science/pith/RUBAE4GN77G7M27R3CF2XUPE2R","download_json":"https://pith.science/pith/RUBAE4GN77G7M27R3CF2XUPE2R.json","view_paper":"https://pith.science/paper/RUBAE4GN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.05123&json=true","fetch_graph":"https://pith.science/api/pith-number/RUBAE4GN77G7M27R3CF2XUPE2R/graph.json","fetch_events":"https://pith.science/api/pith-number/RUBAE4GN77G7M27R3CF2XUPE2R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RUBAE4GN77G7M27R3CF2XUPE2R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RUBAE4GN77G7M27R3CF2XUPE2R/action/storage_attestation","attest_author":"https://pith.science/pith/RUBAE4GN77G7M27R3CF2XUPE2R/action/author_attestation","sign_citation":"https://pith.science/pith/RUBAE4GN77G7M27R3CF2XUPE2R/action/citation_signature","submit_replication":"https://pith.science/pith/RUBAE4GN77G7M27R3CF2XUPE2R/action/replication_record"}},"created_at":"2026-05-17T23:45:04.898497+00:00","updated_at":"2026-05-17T23:45:04.898497+00:00"}