{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:FND4RTSPNQSY3TNSSHS6LXT2MA","short_pith_number":"pith:FND4RTSP","schema_version":"1.0","canonical_sha256":"2b47c8ce4f6c258dcdb291e5e5de7a602c1de936907856ee308867071da1a756","source":{"kind":"arxiv","id":"1506.03760","version":2},"attestation_state":"computed","paper":{"title":"A Tight Algorithm for Strongly Connected Steiner Subgraph On Two Terminals With Demands","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM"],"primary_cat":"cs.DS","authors_text":"Guy Kortsarz, Hossein Esfandiari, MohammadTaghi Hajiaghayi, Rajesh Chitnis, Rohit Khandekar, Saeed Seddighin","submitted_at":"2015-06-11T18:06:42Z","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1506.03760","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-11T18:06:42Z","cross_cats_sorted":["cs.CC","cs.DM"],"title_canon_sha256":"54c584dfa4e98280cbad6c22ad8f26cbed2367bc51d01d78dc4c09aee3ad0e62","abstract_canon_sha256":"0d7745db232d890bd39c4cdb93212918168a2c9dde3827ab7886d03e2d08cf89"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:37.466655Z","signature_b64":"eXBlhlGVvN0OiOMZfwtw+cFpPKhVS34FLIDD0LNujpwBXlIFHVkhtFmeBk5/22Q483zEwKeFpzzLi/k73XJpCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2b47c8ce4f6c258dcdb291e5e5de7a602c1de936907856ee308867071da1a756","last_reissued_at":"2026-05-18T01:17:37.465609Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:37.465609Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Tight Algorithm for Strongly Connected Steiner Subgraph On Two Terminals With Demands","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM"],"primary_cat":"cs.DS","authors_text":"Guy Kortsarz, Hossein Esfandiari, MohammadTaghi Hajiaghayi, Rajesh Chitnis, Rohit Khandekar, Saeed Seddighin","submitted_at":"2015-06-11T18:06:42Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.03760","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1506.03760","created_at":"2026-05-18T01:17:37.466002+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.03760v2","created_at":"2026-05-18T01:17:37.466002+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.03760","created_at":"2026-05-18T01:17:37.466002+00:00"},{"alias_kind":"pith_short_12","alias_value":"FND4RTSPNQSY","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_16","alias_value":"FND4RTSPNQSY3TNS","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_8","alias_value":"FND4RTSP","created_at":"2026-05-18T12:29:19.899920+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FND4RTSPNQSY3TNSSHS6LXT2MA","json":"https://pith.science/pith/FND4RTSPNQSY3TNSSHS6LXT2MA.json","graph_json":"https://pith.science/api/pith-number/FND4RTSPNQSY3TNSSHS6LXT2MA/graph.json","events_json":"https://pith.science/api/pith-number/FND4RTSPNQSY3TNSSHS6LXT2MA/events.json","paper":"https://pith.science/paper/FND4RTSP"},"agent_actions":{"view_html":"https://pith.science/pith/FND4RTSPNQSY3TNSSHS6LXT2MA","download_json":"https://pith.science/pith/FND4RTSPNQSY3TNSSHS6LXT2MA.json","view_paper":"https://pith.science/paper/FND4RTSP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.03760&json=true","fetch_graph":"https://pith.science/api/pith-number/FND4RTSPNQSY3TNSSHS6LXT2MA/graph.json","fetch_events":"https://pith.science/api/pith-number/FND4RTSPNQSY3TNSSHS6LXT2MA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FND4RTSPNQSY3TNSSHS6LXT2MA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FND4RTSPNQSY3TNSSHS6LXT2MA/action/storage_attestation","attest_author":"https://pith.science/pith/FND4RTSPNQSY3TNSSHS6LXT2MA/action/author_attestation","sign_citation":"https://pith.science/pith/FND4RTSPNQSY3TNSSHS6LXT2MA/action/citation_signature","submit_replication":"https://pith.science/pith/FND4RTSPNQSY3TNSSHS6LXT2MA/action/replication_record"}},"created_at":"2026-05-18T01:17:37.466002+00:00","updated_at":"2026-05-18T01:17:37.466002+00:00"}