{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:TYVPMTMKESGF7OD3FOMPI52FDQ","short_pith_number":"pith:TYVPMTMK","schema_version":"1.0","canonical_sha256":"9e2af64d8a248c5fb87b2b98f477451c04ea579993964ed1542cd3b5ff80b97b","source":{"kind":"arxiv","id":"1812.01768","version":2},"attestation_state":"computed","paper":{"title":"Quasi-Polynomial Algorithms for Submodular Tree Orienteering and Other Directed Network Design Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Rohan Ghuge, Viswanath Nagarajan","submitted_at":"2018-12-05T01:07:31Z","abstract_excerpt":"We consider the following general network design problem on directed graphs. The input is an asymmetric metric $(V,c)$, root $r^{*}\\in V$, monotone submodular function $f:2^V\\rightarrow \\mathbb{R}_+$ and budget $B$. The goal is to find an $r^{*}$-rooted arborescence $T$ of cost at most $B$ that maximizes $f(T)$. Our main result is a simple quasi-polynomial time $O(\\frac{\\log k}{\\log\\log k})$-approximation algorithm for this problem, where $k\\le |V|$ is the number of vertices in an optimal solution. To the best of our knowledge, this is the first non-trivial approximation ratio for this problem"},"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":"1812.01768","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-12-05T01:07:31Z","cross_cats_sorted":[],"title_canon_sha256":"1b050b0ad5011e5d663943debaab158fab80432eff521b4753f5b88db3aadf70","abstract_canon_sha256":"cd057fe7192840321843082d58c84ead1f446a0a19239ab3034dc37e46905f29"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:49:40.227171Z","signature_b64":"NNwBMHEKx0WMELaI/Vc2IBfOYAVNPtIGQBjAyyX5OMpyR8H+dHSFdXZvpqNKyYF+m/g8VfNmxxDpUVdgn1RABw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9e2af64d8a248c5fb87b2b98f477451c04ea579993964ed1542cd3b5ff80b97b","last_reissued_at":"2026-05-17T23:49:40.226538Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:49:40.226538Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quasi-Polynomial Algorithms for Submodular Tree Orienteering and Other Directed Network Design Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Rohan Ghuge, Viswanath Nagarajan","submitted_at":"2018-12-05T01:07:31Z","abstract_excerpt":"We consider the following general network design problem on directed graphs. The input is an asymmetric metric $(V,c)$, root $r^{*}\\in V$, monotone submodular function $f:2^V\\rightarrow \\mathbb{R}_+$ and budget $B$. The goal is to find an $r^{*}$-rooted arborescence $T$ of cost at most $B$ that maximizes $f(T)$. Our main result is a simple quasi-polynomial time $O(\\frac{\\log k}{\\log\\log k})$-approximation algorithm for this problem, where $k\\le |V|$ is the number of vertices in an optimal solution. To the best of our knowledge, this is the first non-trivial approximation ratio for this problem"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.01768","kind":"arxiv","version":2},"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":"1812.01768","created_at":"2026-05-17T23:49:40.226661+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.01768v2","created_at":"2026-05-17T23:49:40.226661+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.01768","created_at":"2026-05-17T23:49:40.226661+00:00"},{"alias_kind":"pith_short_12","alias_value":"TYVPMTMKESGF","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_16","alias_value":"TYVPMTMKESGF7OD3","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_8","alias_value":"TYVPMTMK","created_at":"2026-05-18T12:32:56.356000+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/TYVPMTMKESGF7OD3FOMPI52FDQ","json":"https://pith.science/pith/TYVPMTMKESGF7OD3FOMPI52FDQ.json","graph_json":"https://pith.science/api/pith-number/TYVPMTMKESGF7OD3FOMPI52FDQ/graph.json","events_json":"https://pith.science/api/pith-number/TYVPMTMKESGF7OD3FOMPI52FDQ/events.json","paper":"https://pith.science/paper/TYVPMTMK"},"agent_actions":{"view_html":"https://pith.science/pith/TYVPMTMKESGF7OD3FOMPI52FDQ","download_json":"https://pith.science/pith/TYVPMTMKESGF7OD3FOMPI52FDQ.json","view_paper":"https://pith.science/paper/TYVPMTMK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.01768&json=true","fetch_graph":"https://pith.science/api/pith-number/TYVPMTMKESGF7OD3FOMPI52FDQ/graph.json","fetch_events":"https://pith.science/api/pith-number/TYVPMTMKESGF7OD3FOMPI52FDQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TYVPMTMKESGF7OD3FOMPI52FDQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TYVPMTMKESGF7OD3FOMPI52FDQ/action/storage_attestation","attest_author":"https://pith.science/pith/TYVPMTMKESGF7OD3FOMPI52FDQ/action/author_attestation","sign_citation":"https://pith.science/pith/TYVPMTMKESGF7OD3FOMPI52FDQ/action/citation_signature","submit_replication":"https://pith.science/pith/TYVPMTMKESGF7OD3FOMPI52FDQ/action/replication_record"}},"created_at":"2026-05-17T23:49:40.226661+00:00","updated_at":"2026-05-17T23:49:40.226661+00:00"}