{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:FND4RTSPNQSY3TNSSHS6LXT2MA","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":"0d7745db232d890bd39c4cdb93212918168a2c9dde3827ab7886d03e2d08cf89","cross_cats_sorted":["cs.CC","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-11T18:06:42Z","title_canon_sha256":"54c584dfa4e98280cbad6c22ad8f26cbed2367bc51d01d78dc4c09aee3ad0e62"},"schema_version":"1.0","source":{"id":"1506.03760","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.03760","created_at":"2026-05-18T01:17:37Z"},{"alias_kind":"arxiv_version","alias_value":"1506.03760v2","created_at":"2026-05-18T01:17:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.03760","created_at":"2026-05-18T01:17:37Z"},{"alias_kind":"pith_short_12","alias_value":"FND4RTSPNQSY","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"FND4RTSPNQSY3TNS","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"FND4RTSP","created_at":"2026-05-18T12:29:19Z"}],"graph_snapshots":[{"event_id":"sha256:ec88dba38b8a12565fed83307a96e74cfecefa18f72e05619ed470a62bbc992a","target":"graph","created_at":"2026-05-18T01:17:37Z","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":"Given an edge-weighted directed graph $G=(V,E)$ on $n$ vertices and a set $T=\\{t_1, t_2, \\ldots, t_p\\}$ of $p$ terminals, the objective of the \\scss ($p$-SCSS) problem is to find an edge set $H\\subseteq E$ of minimum weight such that $G[H]$ contains an $t_{i}\\rightarrow t_j$ path for each $1\\leq i\\neq j\\leq p$. In this paper, we investigate the computational complexity of a variant of $2$-SCSS where we have demands for the number of paths between each terminal pair. Formally, the \\sharinggeneral problem is defined as follows: given an edge-weighted directed graph $G=(V,E)$ with weight function","authors_text":"Guy Kortsarz, Hossein Esfandiari, MohammadTaghi Hajiaghayi, Rajesh Chitnis, Rohit Khandekar, Saeed Seddighin","cross_cats":["cs.CC","cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-11T18:06:42Z","title":"A Tight Algorithm for Strongly Connected Steiner Subgraph On Two Terminals With Demands"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.03760","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:ff18dea5b9cafc367fb6a2b78f6669907c2dc2bd643cefc06b754bd1aa094130","target":"record","created_at":"2026-05-18T01:17:37Z","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":"0d7745db232d890bd39c4cdb93212918168a2c9dde3827ab7886d03e2d08cf89","cross_cats_sorted":["cs.CC","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-11T18:06:42Z","title_canon_sha256":"54c584dfa4e98280cbad6c22ad8f26cbed2367bc51d01d78dc4c09aee3ad0e62"},"schema_version":"1.0","source":{"id":"1506.03760","kind":"arxiv","version":2}},"canonical_sha256":"2b47c8ce4f6c258dcdb291e5e5de7a602c1de936907856ee308867071da1a756","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2b47c8ce4f6c258dcdb291e5e5de7a602c1de936907856ee308867071da1a756","first_computed_at":"2026-05-18T01:17:37.465609Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:17:37.465609Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eXBlhlGVvN0OiOMZfwtw+cFpPKhVS34FLIDD0LNujpwBXlIFHVkhtFmeBk5/22Q483zEwKeFpzzLi/k73XJpCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:17:37.466655Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.03760","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ff18dea5b9cafc367fb6a2b78f6669907c2dc2bd643cefc06b754bd1aa094130","sha256:ec88dba38b8a12565fed83307a96e74cfecefa18f72e05619ed470a62bbc992a"],"state_sha256":"5bc03524b7d81bad072b6ba953cef3ec4aad7ee12c4826739403814f8485e144"}