{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:57IIDYZ4SKIV5WQUYPSL3VXRR6","short_pith_number":"pith:57IIDYZ4","canonical_record":{"source":{"id":"1811.03020","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-07T17:12:46Z","cross_cats_sorted":[],"title_canon_sha256":"ceb8afd0569bf6ff7ec41598897ff57fb6f5baab5e2f88a7309134160d900faf","abstract_canon_sha256":"9c957a0f1263f74fbd737ac734d6fe0af8e2e4120e88a5ed5789252d61f2a350"},"schema_version":"1.0"},"canonical_sha256":"efd081e33c92915eda14c3e4bdd6f18fb62dcc7e97b26020953178b492e20b34","source":{"kind":"arxiv","id":"1811.03020","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.03020","created_at":"2026-05-18T00:01:20Z"},{"alias_kind":"arxiv_version","alias_value":"1811.03020v1","created_at":"2026-05-18T00:01:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.03020","created_at":"2026-05-18T00:01:20Z"},{"alias_kind":"pith_short_12","alias_value":"57IIDYZ4SKIV","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"57IIDYZ4SKIV5WQU","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"57IIDYZ4","created_at":"2026-05-18T12:32:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:57IIDYZ4SKIV5WQUYPSL3VXRR6","target":"record","payload":{"canonical_record":{"source":{"id":"1811.03020","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-07T17:12:46Z","cross_cats_sorted":[],"title_canon_sha256":"ceb8afd0569bf6ff7ec41598897ff57fb6f5baab5e2f88a7309134160d900faf","abstract_canon_sha256":"9c957a0f1263f74fbd737ac734d6fe0af8e2e4120e88a5ed5789252d61f2a350"},"schema_version":"1.0"},"canonical_sha256":"efd081e33c92915eda14c3e4bdd6f18fb62dcc7e97b26020953178b492e20b34","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:20.127930Z","signature_b64":"bBPF83oih0SZD2ARIMTMhKnk2q1FtJVLiUm5oe53CFcoXZ/T8hk9hihZZKInFILfnUOT80KJq5hVAClvKmWkBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"efd081e33c92915eda14c3e4bdd6f18fb62dcc7e97b26020953178b492e20b34","last_reissued_at":"2026-05-18T00:01:20.127328Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:20.127328Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.03020","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-18T00:01:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cRT+0XPqi4mXwdqI56Uzlq8SsSCpROrKHIko7U/SAn+UIDeu5rpLr/7tAMGm3s0JlocyMbxb8zo9hsNTQ7C+AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T20:49:19.020255Z"},"content_sha256":"959d6b6a5f70ddf74e5025e58d95a4c0da2ace9b77902c11581d3ac0e27c20bd","schema_version":"1.0","event_id":"sha256:959d6b6a5f70ddf74e5025e58d95a4c0da2ace9b77902c11581d3ac0e27c20bd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:57IIDYZ4SKIV5WQUYPSL3VXRR6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"$O(\\log^2k/\\log\\log{k})$-Approximation Algorithm for Directed Steiner Tree: A Tight Quasi-Polynomial-Time Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bundit Laekhanukit, Fabrizio Grandoni, Shi Li","submitted_at":"2018-11-07T17:12:46Z","abstract_excerpt":"In the Directed Steiner Tree (DST) problem we are given an $n$-vertex directed edge-weighted graph, a root $r$, and a collection of $k$ terminal nodes. Our goal is to find a minimum-cost arborescence that contains a directed path from $r$ to every terminal. We present an $O(\\log^2 k/\\log\\log{k})$-approximation algorithm for DST that runs in quasi-polynomial-time. By adjusting the parameters in the hardness result of Halperin and Krauthgamer, we show the matching lower bound of $\\Omega(\\log^2{k}/\\log\\log{k})$ for the class of quasi-polynomial-time algorithms. This is the first improvement on th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.03020","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-18T00:01:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6swA1UKm6Tq9Gi0C5Wr5vVw0OwnpmaLmjnl6HJsjj/JY5eBl6bsW2SRNd+TFrK0IHS84FfWdqYOxZP7lTQOjBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T20:49:19.021009Z"},"content_sha256":"bae8f605249a3fb1260ac2f08e2393ace4d3f84beb290ce8ed53ce8827a006b7","schema_version":"1.0","event_id":"sha256:bae8f605249a3fb1260ac2f08e2393ace4d3f84beb290ce8ed53ce8827a006b7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/57IIDYZ4SKIV5WQUYPSL3VXRR6/bundle.json","state_url":"https://pith.science/pith/57IIDYZ4SKIV5WQUYPSL3VXRR6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/57IIDYZ4SKIV5WQUYPSL3VXRR6/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-24T20:49:19Z","links":{"resolver":"https://pith.science/pith/57IIDYZ4SKIV5WQUYPSL3VXRR6","bundle":"https://pith.science/pith/57IIDYZ4SKIV5WQUYPSL3VXRR6/bundle.json","state":"https://pith.science/pith/57IIDYZ4SKIV5WQUYPSL3VXRR6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/57IIDYZ4SKIV5WQUYPSL3VXRR6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:57IIDYZ4SKIV5WQUYPSL3VXRR6","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":"9c957a0f1263f74fbd737ac734d6fe0af8e2e4120e88a5ed5789252d61f2a350","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-07T17:12:46Z","title_canon_sha256":"ceb8afd0569bf6ff7ec41598897ff57fb6f5baab5e2f88a7309134160d900faf"},"schema_version":"1.0","source":{"id":"1811.03020","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.03020","created_at":"2026-05-18T00:01:20Z"},{"alias_kind":"arxiv_version","alias_value":"1811.03020v1","created_at":"2026-05-18T00:01:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.03020","created_at":"2026-05-18T00:01:20Z"},{"alias_kind":"pith_short_12","alias_value":"57IIDYZ4SKIV","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"57IIDYZ4SKIV5WQU","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"57IIDYZ4","created_at":"2026-05-18T12:32:08Z"}],"graph_snapshots":[{"event_id":"sha256:bae8f605249a3fb1260ac2f08e2393ace4d3f84beb290ce8ed53ce8827a006b7","target":"graph","created_at":"2026-05-18T00:01:20Z","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":"In the Directed Steiner Tree (DST) problem we are given an $n$-vertex directed edge-weighted graph, a root $r$, and a collection of $k$ terminal nodes. Our goal is to find a minimum-cost arborescence that contains a directed path from $r$ to every terminal. We present an $O(\\log^2 k/\\log\\log{k})$-approximation algorithm for DST that runs in quasi-polynomial-time. By adjusting the parameters in the hardness result of Halperin and Krauthgamer, we show the matching lower bound of $\\Omega(\\log^2{k}/\\log\\log{k})$ for the class of quasi-polynomial-time algorithms. This is the first improvement on th","authors_text":"Bundit Laekhanukit, Fabrizio Grandoni, Shi Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-07T17:12:46Z","title":"$O(\\log^2k/\\log\\log{k})$-Approximation Algorithm for Directed Steiner Tree: A Tight Quasi-Polynomial-Time Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.03020","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:959d6b6a5f70ddf74e5025e58d95a4c0da2ace9b77902c11581d3ac0e27c20bd","target":"record","created_at":"2026-05-18T00:01:20Z","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":"9c957a0f1263f74fbd737ac734d6fe0af8e2e4120e88a5ed5789252d61f2a350","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-07T17:12:46Z","title_canon_sha256":"ceb8afd0569bf6ff7ec41598897ff57fb6f5baab5e2f88a7309134160d900faf"},"schema_version":"1.0","source":{"id":"1811.03020","kind":"arxiv","version":1}},"canonical_sha256":"efd081e33c92915eda14c3e4bdd6f18fb62dcc7e97b26020953178b492e20b34","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"efd081e33c92915eda14c3e4bdd6f18fb62dcc7e97b26020953178b492e20b34","first_computed_at":"2026-05-18T00:01:20.127328Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:20.127328Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bBPF83oih0SZD2ARIMTMhKnk2q1FtJVLiUm5oe53CFcoXZ/T8hk9hihZZKInFILfnUOT80KJq5hVAClvKmWkBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:20.127930Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.03020","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:959d6b6a5f70ddf74e5025e58d95a4c0da2ace9b77902c11581d3ac0e27c20bd","sha256:bae8f605249a3fb1260ac2f08e2393ace4d3f84beb290ce8ed53ce8827a006b7"],"state_sha256":"11def63712a4a58c4c13aa45890c632a0daae1f0e9d7cf96520bdb75a03c56d4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ah7rpSXg83xSRvVGaY/zjroKT4UKGSSjS93hqaqJm/6g0r/95d8T44lv7OaIu809usDYCcrvvR03TZ4j1b5eAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T20:49:19.024906Z","bundle_sha256":"a2cea036599f660b39638e6130327a5b51e271f7b89972a6bfe4e252a234cf59"}}