{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:4DW235ARKGVCF5S7OKTO2FRHGM","short_pith_number":"pith:4DW235AR","canonical_record":{"source":{"id":"1907.11404","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-26T07:11:36Z","cross_cats_sorted":[],"title_canon_sha256":"316b12a9a3726b9453ea7202dd459c65c84ba699155ad9bd8ff889c19f5b7bd5","abstract_canon_sha256":"388febbecd3c89d925fd3d3a1b30c608bb2d8a29fd9587413ae1af7d737474b6"},"schema_version":"1.0"},"canonical_sha256":"e0edadf41151aa22f65f72a6ed16273311152eb17b49a67aff200f24f35c6ff3","source":{"kind":"arxiv","id":"1907.11404","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.11404","created_at":"2026-07-05T00:58:23Z"},{"alias_kind":"arxiv_version","alias_value":"1907.11404v2","created_at":"2026-07-05T00:58:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.11404","created_at":"2026-07-05T00:58:23Z"},{"alias_kind":"pith_short_12","alias_value":"4DW235ARKGVC","created_at":"2026-07-05T00:58:23Z"},{"alias_kind":"pith_short_16","alias_value":"4DW235ARKGVCF5S7","created_at":"2026-07-05T00:58:23Z"},{"alias_kind":"pith_short_8","alias_value":"4DW235AR","created_at":"2026-07-05T00:58:23Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:4DW235ARKGVCF5S7OKTO2FRHGM","target":"record","payload":{"canonical_record":{"source":{"id":"1907.11404","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-26T07:11:36Z","cross_cats_sorted":[],"title_canon_sha256":"316b12a9a3726b9453ea7202dd459c65c84ba699155ad9bd8ff889c19f5b7bd5","abstract_canon_sha256":"388febbecd3c89d925fd3d3a1b30c608bb2d8a29fd9587413ae1af7d737474b6"},"schema_version":"1.0"},"canonical_sha256":"e0edadf41151aa22f65f72a6ed16273311152eb17b49a67aff200f24f35c6ff3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:58:23.957170Z","signature_b64":"+H8eMQpmuM5BKzj182UkIxpw1xU2/F1S6y/0eqBYLGGgrcctUgU/cbYhyd1PhKBDl3p4o7z5lNoDe+w0a0hRDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e0edadf41151aa22f65f72a6ed16273311152eb17b49a67aff200f24f35c6ff3","last_reissued_at":"2026-07-05T00:58:23.956792Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:58:23.956792Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.11404","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-07-05T00:58:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vL+gn3c9wBo2Flw5lp+2MwPmknUqWIhSW7fdjGkUGOh44IBvlHAqhvBiV3w3sEZdxYFXTUllLFRsjKtqeG31Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T08:34:51.148145Z"},"content_sha256":"ad1e98a59eaa8ce6436a507120c9e41636d361ff918cd59d98be060b3f4a0f6e","schema_version":"1.0","event_id":"sha256:ad1e98a59eaa8ce6436a507120c9e41636d361ff918cd59d98be060b3f4a0f6e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:4DW235ARKGVCF5S7OKTO2FRHGM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Approximating Degree-Bounded Network Design Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bundit Laekhanukit, Daniel Vaz, Guy Kortsarz, Jiayi Xian, Shi Li, Xiangyu Guo","submitted_at":"2019-07-26T07:11:36Z","abstract_excerpt":"Directed Steiner Tree (DST) is a central problem in combinatorial optimization and theoretical computer science: Given a directed graph $G=(V, E)$ with edge costs $c \\in \\mathbb{R}_{\\geq 0}^E$, a root $r \\in V$ and $k$ terminals $K\\subseteq V$, we need to output the minimum-cost arborescence in $G$ that contains an $r$\\textrightarrow $t$ path for every $t \\in K$. Recently, Grandoni, Laekhanukit and Li, and independently Ghuge and Nagarajan, gave quasi-polynomial time $O(\\log^2k/\\log \\log k)$-approximation algorithms for the problem, which are tight under popular complexity assumptions.\n  In th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.11404","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1907.11404/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T00:58:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JV0/jk63iVpBX60DOkwArph2bCLLObFAt+I/IjyfO05uD7Jh4iNEQtIy1M0a9kzfdJTApphezrBtuG/EuST9Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T08:34:51.149072Z"},"content_sha256":"f03911d348cdfd938c02b395777ee64c6db3882ee966fdae8cd49019133daf63","schema_version":"1.0","event_id":"sha256:f03911d348cdfd938c02b395777ee64c6db3882ee966fdae8cd49019133daf63"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4DW235ARKGVCF5S7OKTO2FRHGM/bundle.json","state_url":"https://pith.science/pith/4DW235ARKGVCF5S7OKTO2FRHGM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4DW235ARKGVCF5S7OKTO2FRHGM/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-08-05T08:34:51Z","links":{"resolver":"https://pith.science/pith/4DW235ARKGVCF5S7OKTO2FRHGM","bundle":"https://pith.science/pith/4DW235ARKGVCF5S7OKTO2FRHGM/bundle.json","state":"https://pith.science/pith/4DW235ARKGVCF5S7OKTO2FRHGM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4DW235ARKGVCF5S7OKTO2FRHGM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:4DW235ARKGVCF5S7OKTO2FRHGM","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":"388febbecd3c89d925fd3d3a1b30c608bb2d8a29fd9587413ae1af7d737474b6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-26T07:11:36Z","title_canon_sha256":"316b12a9a3726b9453ea7202dd459c65c84ba699155ad9bd8ff889c19f5b7bd5"},"schema_version":"1.0","source":{"id":"1907.11404","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.11404","created_at":"2026-07-05T00:58:23Z"},{"alias_kind":"arxiv_version","alias_value":"1907.11404v2","created_at":"2026-07-05T00:58:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.11404","created_at":"2026-07-05T00:58:23Z"},{"alias_kind":"pith_short_12","alias_value":"4DW235ARKGVC","created_at":"2026-07-05T00:58:23Z"},{"alias_kind":"pith_short_16","alias_value":"4DW235ARKGVCF5S7","created_at":"2026-07-05T00:58:23Z"},{"alias_kind":"pith_short_8","alias_value":"4DW235AR","created_at":"2026-07-05T00:58:23Z"}],"graph_snapshots":[{"event_id":"sha256:f03911d348cdfd938c02b395777ee64c6db3882ee966fdae8cd49019133daf63","target":"graph","created_at":"2026-07-05T00:58:23Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1907.11404/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Directed Steiner Tree (DST) is a central problem in combinatorial optimization and theoretical computer science: Given a directed graph $G=(V, E)$ with edge costs $c \\in \\mathbb{R}_{\\geq 0}^E$, a root $r \\in V$ and $k$ terminals $K\\subseteq V$, we need to output the minimum-cost arborescence in $G$ that contains an $r$\\textrightarrow $t$ path for every $t \\in K$. Recently, Grandoni, Laekhanukit and Li, and independently Ghuge and Nagarajan, gave quasi-polynomial time $O(\\log^2k/\\log \\log k)$-approximation algorithms for the problem, which are tight under popular complexity assumptions.\n  In th","authors_text":"Bundit Laekhanukit, Daniel Vaz, Guy Kortsarz, Jiayi Xian, Shi Li, Xiangyu Guo","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-26T07:11:36Z","title":"On Approximating Degree-Bounded Network Design Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.11404","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:ad1e98a59eaa8ce6436a507120c9e41636d361ff918cd59d98be060b3f4a0f6e","target":"record","created_at":"2026-07-05T00:58:23Z","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":"388febbecd3c89d925fd3d3a1b30c608bb2d8a29fd9587413ae1af7d737474b6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-26T07:11:36Z","title_canon_sha256":"316b12a9a3726b9453ea7202dd459c65c84ba699155ad9bd8ff889c19f5b7bd5"},"schema_version":"1.0","source":{"id":"1907.11404","kind":"arxiv","version":2}},"canonical_sha256":"e0edadf41151aa22f65f72a6ed16273311152eb17b49a67aff200f24f35c6ff3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e0edadf41151aa22f65f72a6ed16273311152eb17b49a67aff200f24f35c6ff3","first_computed_at":"2026-07-05T00:58:23.956792Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:58:23.956792Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+H8eMQpmuM5BKzj182UkIxpw1xU2/F1S6y/0eqBYLGGgrcctUgU/cbYhyd1PhKBDl3p4o7z5lNoDe+w0a0hRDw==","signature_status":"signed_v1","signed_at":"2026-07-05T00:58:23.957170Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.11404","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ad1e98a59eaa8ce6436a507120c9e41636d361ff918cd59d98be060b3f4a0f6e","sha256:f03911d348cdfd938c02b395777ee64c6db3882ee966fdae8cd49019133daf63"],"state_sha256":"054a09fc1be3f5b1b26285e1d9f5b0e052be4116de8b1156fd20d40c4f55b555"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6j5aYNAt//qfqMlQSXwrcgX0lHC7e1P6WRtJlQha0+VX2ynEl6W63Up/khS+6NWehwpb7Eo1kzqKD7mL+U3NCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T08:34:51.230101Z","bundle_sha256":"e6a00510c35c87d381b7bd34367865c9daa425125799157ded09a987702097c1"}}