{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:TYVPMTMKESGF7OD3FOMPI52FDQ","short_pith_number":"pith:TYVPMTMK","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"},"canonical_sha256":"9e2af64d8a248c5fb87b2b98f477451c04ea579993964ed1542cd3b5ff80b97b","source":{"kind":"arxiv","id":"1812.01768","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.01768","created_at":"2026-05-17T23:49:40Z"},{"alias_kind":"arxiv_version","alias_value":"1812.01768v2","created_at":"2026-05-17T23:49:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.01768","created_at":"2026-05-17T23:49:40Z"},{"alias_kind":"pith_short_12","alias_value":"TYVPMTMKESGF","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"TYVPMTMKESGF7OD3","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"TYVPMTMK","created_at":"2026-05-18T12:32:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:TYVPMTMKESGF7OD3FOMPI52FDQ","target":"record","payload":{"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"},"canonical_sha256":"9e2af64d8a248c5fb87b2b98f477451c04ea579993964ed1542cd3b5ff80b97b","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"},"source_kind":"arxiv","source_id":"1812.01768","source_version":2,"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-17T23:49:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7f8s3rtdJCpu4qln4eaPbqFCfq97aZ5nDk7EdERnbUXPKVpZW60fWvb1yX8zwg7x0FjzzuuQRzdwJwApSITqDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T02:15:54.276786Z"},"content_sha256":"4d37d203536106aba219d9bb88b1a5814f83ddfce7e2fd24f1c84c526b3cf8ab","schema_version":"1.0","event_id":"sha256:4d37d203536106aba219d9bb88b1a5814f83ddfce7e2fd24f1c84c526b3cf8ab"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:TYVPMTMKESGF7OD3FOMPI52FDQ","target":"graph","payload":{"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"},"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-17T23:49:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5QtsMDl08HhIWHjKB+HU7VqM4IUEXl1iZxiEKeU+vwniD0pxu1b6nan96AwO+/QzKP/cNO5H9ED3+dAlbm3eAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T02:15:54.277601Z"},"content_sha256":"004b5b2c3dde89bb00fe071a79ff7c37598fd3b3cecefdb550ecb0fb16746a7a","schema_version":"1.0","event_id":"sha256:004b5b2c3dde89bb00fe071a79ff7c37598fd3b3cecefdb550ecb0fb16746a7a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TYVPMTMKESGF7OD3FOMPI52FDQ/bundle.json","state_url":"https://pith.science/pith/TYVPMTMKESGF7OD3FOMPI52FDQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TYVPMTMKESGF7OD3FOMPI52FDQ/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-06-12T02:15:54Z","links":{"resolver":"https://pith.science/pith/TYVPMTMKESGF7OD3FOMPI52FDQ","bundle":"https://pith.science/pith/TYVPMTMKESGF7OD3FOMPI52FDQ/bundle.json","state":"https://pith.science/pith/TYVPMTMKESGF7OD3FOMPI52FDQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TYVPMTMKESGF7OD3FOMPI52FDQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:TYVPMTMKESGF7OD3FOMPI52FDQ","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":"cd057fe7192840321843082d58c84ead1f446a0a19239ab3034dc37e46905f29","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-12-05T01:07:31Z","title_canon_sha256":"1b050b0ad5011e5d663943debaab158fab80432eff521b4753f5b88db3aadf70"},"schema_version":"1.0","source":{"id":"1812.01768","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.01768","created_at":"2026-05-17T23:49:40Z"},{"alias_kind":"arxiv_version","alias_value":"1812.01768v2","created_at":"2026-05-17T23:49:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.01768","created_at":"2026-05-17T23:49:40Z"},{"alias_kind":"pith_short_12","alias_value":"TYVPMTMKESGF","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"TYVPMTMKESGF7OD3","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"TYVPMTMK","created_at":"2026-05-18T12:32:56Z"}],"graph_snapshots":[{"event_id":"sha256:004b5b2c3dde89bb00fe071a79ff7c37598fd3b3cecefdb550ecb0fb16746a7a","target":"graph","created_at":"2026-05-17T23:49:40Z","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":"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","authors_text":"Rohan Ghuge, Viswanath Nagarajan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-12-05T01:07:31Z","title":"Quasi-Polynomial Algorithms for Submodular Tree Orienteering and Other Directed Network Design Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.01768","kind":"arxiv","version":2},"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:4d37d203536106aba219d9bb88b1a5814f83ddfce7e2fd24f1c84c526b3cf8ab","target":"record","created_at":"2026-05-17T23:49:40Z","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":"cd057fe7192840321843082d58c84ead1f446a0a19239ab3034dc37e46905f29","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-12-05T01:07:31Z","title_canon_sha256":"1b050b0ad5011e5d663943debaab158fab80432eff521b4753f5b88db3aadf70"},"schema_version":"1.0","source":{"id":"1812.01768","kind":"arxiv","version":2}},"canonical_sha256":"9e2af64d8a248c5fb87b2b98f477451c04ea579993964ed1542cd3b5ff80b97b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9e2af64d8a248c5fb87b2b98f477451c04ea579993964ed1542cd3b5ff80b97b","first_computed_at":"2026-05-17T23:49:40.226538Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:49:40.226538Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NNwBMHEKx0WMELaI/Vc2IBfOYAVNPtIGQBjAyyX5OMpyR8H+dHSFdXZvpqNKyYF+m/g8VfNmxxDpUVdgn1RABw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:49:40.227171Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.01768","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4d37d203536106aba219d9bb88b1a5814f83ddfce7e2fd24f1c84c526b3cf8ab","sha256:004b5b2c3dde89bb00fe071a79ff7c37598fd3b3cecefdb550ecb0fb16746a7a"],"state_sha256":"97a874b30b1c860a1c64503e5a00d47f69a98501724995189f4b1edb918cbb84"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N4DFrNgSgKjyzqAWe8MBDanJT+PM5m7Mne4aELhlXf/aBmm0MuWJZdpjKl6XVLRbcx6YIDAQeWqxDgSFJjIUAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T02:15:54.282743Z","bundle_sha256":"1a7a65bef0b8797f0dd05e6cafe7a1bd4e3c104ee42ab6cc662f5034e7eebf22"}}