{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:Q772XQMNLKOH33ZKPWHPQ6OF7M","short_pith_number":"pith:Q772XQMN","canonical_record":{"source":{"id":"1611.01644","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-05T12:56:15Z","cross_cats_sorted":[],"title_canon_sha256":"ac5dbef26853f0d24b25c25f9fc58cbf3a2808c49258cebcfc1e942d5271bdb4","abstract_canon_sha256":"cd43a407c19b2f3c602cbaff35d53ea7f65933be24fb0271c96e2c3b71096736"},"schema_version":"1.0"},"canonical_sha256":"87ffabc18d5a9c7def2a7d8ef879c5fb3446b6777574ef19ae090d47c11ec7e9","source":{"kind":"arxiv","id":"1611.01644","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.01644","created_at":"2026-05-18T01:00:04Z"},{"alias_kind":"arxiv_version","alias_value":"1611.01644v1","created_at":"2026-05-18T01:00:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.01644","created_at":"2026-05-18T01:00:04Z"},{"alias_kind":"pith_short_12","alias_value":"Q772XQMNLKOH","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"Q772XQMNLKOH33ZK","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"Q772XQMN","created_at":"2026-05-18T12:30:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:Q772XQMNLKOH33ZKPWHPQ6OF7M","target":"record","payload":{"canonical_record":{"source":{"id":"1611.01644","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-05T12:56:15Z","cross_cats_sorted":[],"title_canon_sha256":"ac5dbef26853f0d24b25c25f9fc58cbf3a2808c49258cebcfc1e942d5271bdb4","abstract_canon_sha256":"cd43a407c19b2f3c602cbaff35d53ea7f65933be24fb0271c96e2c3b71096736"},"schema_version":"1.0"},"canonical_sha256":"87ffabc18d5a9c7def2a7d8ef879c5fb3446b6777574ef19ae090d47c11ec7e9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:04.785851Z","signature_b64":"gYYqqlHJqcIfTrajZ+QTa3mo0WpICRTmxhYfzE1PBtjWutEVCdnm2UwvhGYf4+vi3svI6dbmnzSbmHWT+XuKAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"87ffabc18d5a9c7def2a7d8ef879c5fb3446b6777574ef19ae090d47c11ec7e9","last_reissued_at":"2026-05-18T01:00:04.785390Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:04.785390Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.01644","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-18T01:00:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dKwUthjYCgIJ3HV0APR5XJoQ0dVbLk+KWt63E6XmtFbTLSsEkQighpddQh8a80ymZKz9hmpGDQuoFMDWZZ4xCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T01:12:53.811244Z"},"content_sha256":"5eb363fb68becc0d0b378ab352a98d1450563add651d6542ab86d3dcc05b4da0","schema_version":"1.0","event_id":"sha256:5eb363fb68becc0d0b378ab352a98d1450563add651d6542ab86d3dcc05b4da0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:Q772XQMNLKOH33ZKPWHPQ6OF7M","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Surviving in Directed Graphs: A Polylogarithmic Approximation for Two-Connected Directed Steiner Tree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bundit Laekhanukit, Fabrizio Grandoni","submitted_at":"2016-11-05T12:56:15Z","abstract_excerpt":"In this paper, we study a survivable network design problem on directed graphs, 2-Connected Directed Steiner Tree (2-DST): given an $n$-vertex weighted directed graph, a root $r$, and a set of $h$ terminals $S$, find a min-cost subgraph $H$ that has two edge/vertex disjoint paths from $r$ to any $t\\in S$. 2-DST is a natural generalization of the classical Directed Steiner Tree problem (DST), where we have an additional requirement that the network must tolerate one failure. No non-trivial approximation is known for 2-DST. This was left as an open problem by Feldman et al., [SODA'09; JCSS] and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.01644","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-18T01:00:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NdzPERbzepqStuH31p07lu6wKZH86ml+eK31vITqe2gWj4HG0epeWMsRF+WCLU87yFjf7nxWIS9AbXkPMUT2Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T01:12:53.812018Z"},"content_sha256":"5ef5e84cd73545747958cbfe7a56dcafc280cf82166088dc01ccf357b256d487","schema_version":"1.0","event_id":"sha256:5ef5e84cd73545747958cbfe7a56dcafc280cf82166088dc01ccf357b256d487"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Q772XQMNLKOH33ZKPWHPQ6OF7M/bundle.json","state_url":"https://pith.science/pith/Q772XQMNLKOH33ZKPWHPQ6OF7M/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Q772XQMNLKOH33ZKPWHPQ6OF7M/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-25T01:12:53Z","links":{"resolver":"https://pith.science/pith/Q772XQMNLKOH33ZKPWHPQ6OF7M","bundle":"https://pith.science/pith/Q772XQMNLKOH33ZKPWHPQ6OF7M/bundle.json","state":"https://pith.science/pith/Q772XQMNLKOH33ZKPWHPQ6OF7M/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Q772XQMNLKOH33ZKPWHPQ6OF7M/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:Q772XQMNLKOH33ZKPWHPQ6OF7M","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":"cd43a407c19b2f3c602cbaff35d53ea7f65933be24fb0271c96e2c3b71096736","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-05T12:56:15Z","title_canon_sha256":"ac5dbef26853f0d24b25c25f9fc58cbf3a2808c49258cebcfc1e942d5271bdb4"},"schema_version":"1.0","source":{"id":"1611.01644","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.01644","created_at":"2026-05-18T01:00:04Z"},{"alias_kind":"arxiv_version","alias_value":"1611.01644v1","created_at":"2026-05-18T01:00:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.01644","created_at":"2026-05-18T01:00:04Z"},{"alias_kind":"pith_short_12","alias_value":"Q772XQMNLKOH","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"Q772XQMNLKOH33ZK","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"Q772XQMN","created_at":"2026-05-18T12:30:39Z"}],"graph_snapshots":[{"event_id":"sha256:5ef5e84cd73545747958cbfe7a56dcafc280cf82166088dc01ccf357b256d487","target":"graph","created_at":"2026-05-18T01:00:04Z","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 this paper, we study a survivable network design problem on directed graphs, 2-Connected Directed Steiner Tree (2-DST): given an $n$-vertex weighted directed graph, a root $r$, and a set of $h$ terminals $S$, find a min-cost subgraph $H$ that has two edge/vertex disjoint paths from $r$ to any $t\\in S$. 2-DST is a natural generalization of the classical Directed Steiner Tree problem (DST), where we have an additional requirement that the network must tolerate one failure. No non-trivial approximation is known for 2-DST. This was left as an open problem by Feldman et al., [SODA'09; JCSS] and ","authors_text":"Bundit Laekhanukit, Fabrizio Grandoni","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-05T12:56:15Z","title":"Surviving in Directed Graphs: A Polylogarithmic Approximation for Two-Connected Directed Steiner Tree"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.01644","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:5eb363fb68becc0d0b378ab352a98d1450563add651d6542ab86d3dcc05b4da0","target":"record","created_at":"2026-05-18T01:00:04Z","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":"cd43a407c19b2f3c602cbaff35d53ea7f65933be24fb0271c96e2c3b71096736","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-05T12:56:15Z","title_canon_sha256":"ac5dbef26853f0d24b25c25f9fc58cbf3a2808c49258cebcfc1e942d5271bdb4"},"schema_version":"1.0","source":{"id":"1611.01644","kind":"arxiv","version":1}},"canonical_sha256":"87ffabc18d5a9c7def2a7d8ef879c5fb3446b6777574ef19ae090d47c11ec7e9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"87ffabc18d5a9c7def2a7d8ef879c5fb3446b6777574ef19ae090d47c11ec7e9","first_computed_at":"2026-05-18T01:00:04.785390Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:00:04.785390Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gYYqqlHJqcIfTrajZ+QTa3mo0WpICRTmxhYfzE1PBtjWutEVCdnm2UwvhGYf4+vi3svI6dbmnzSbmHWT+XuKAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:00:04.785851Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.01644","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5eb363fb68becc0d0b378ab352a98d1450563add651d6542ab86d3dcc05b4da0","sha256:5ef5e84cd73545747958cbfe7a56dcafc280cf82166088dc01ccf357b256d487"],"state_sha256":"cea40c9029bea57c323df6613dca39f76f678d241b1fb54c91626221ff3922ef"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MolIVn3ciSYbXqWm6jRpaah5i/2Jt8SmpAEvdIa+ABNdt2nf70C/UAGVHfbC5QESFlnK6i5NtQ6Tk4bTPS3oDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T01:12:53.816061Z","bundle_sha256":"a6675c420d0f96bd6790e9180f2d2d6dd052ca491a317a0e2540d66abbb464ce"}}