{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:SIXFMW2IA44JPPLDQOAGWFUMZD","short_pith_number":"pith:SIXFMW2I","schema_version":"1.0","canonical_sha256":"922e565b48073897bd6383806b168cc8daaedff06954d6889617d0dad98e6e85","source":{"kind":"arxiv","id":"1707.01487","version":2},"attestation_state":"computed","paper":{"title":"Single-sink Fractionally Subadditive Network Design","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Guru Guruganesh, Jennifer Iglesias, Laura Sanit\\`a, R. Ravi","submitted_at":"2017-07-05T17:36:38Z","abstract_excerpt":"We study a generalization of the Steiner tree problem, where we are given a weighted network $G$ together with a collection of $k$ subsets of its vertices and a root $r$. We wish to construct a minimum cost network such that the network supports one unit of flow to the root from every node in a subset simultaneously. The network constructed does not need to support flows from all the subsets simultaneously.\n  We settle an open question regarding the complexity of this problem for $k=2$, and give a $\\frac{3}{2}$-approximation algorithm that improves over a (trivial) known 2-approximation. Furth"},"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":"1707.01487","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-05T17:36:38Z","cross_cats_sorted":[],"title_canon_sha256":"54a694bfde02b3f7e3578fd84c6a57ac2109621678bee33b08543c9676d0e9f9","abstract_canon_sha256":"b0aaa6ac9c73d224b53229594c1b9821955810882e4d1b911b347efca0840867"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:34.700981Z","signature_b64":"A7DkB8zuuS5PKupc3O9nvo0wMfwwrH8WvJ1A+qaiLNKxfz3Wz1tAt2rug+1DcqoMbvRIGgRKlTZPCw1p/orMAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"922e565b48073897bd6383806b168cc8daaedff06954d6889617d0dad98e6e85","last_reissued_at":"2026-05-18T00:40:34.699662Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:34.699662Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Single-sink Fractionally Subadditive Network Design","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Guru Guruganesh, Jennifer Iglesias, Laura Sanit\\`a, R. Ravi","submitted_at":"2017-07-05T17:36:38Z","abstract_excerpt":"We study a generalization of the Steiner tree problem, where we are given a weighted network $G$ together with a collection of $k$ subsets of its vertices and a root $r$. We wish to construct a minimum cost network such that the network supports one unit of flow to the root from every node in a subset simultaneously. The network constructed does not need to support flows from all the subsets simultaneously.\n  We settle an open question regarding the complexity of this problem for $k=2$, and give a $\\frac{3}{2}$-approximation algorithm that improves over a (trivial) known 2-approximation. Furth"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.01487","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":"1707.01487","created_at":"2026-05-18T00:40:34.699800+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.01487v2","created_at":"2026-05-18T00:40:34.699800+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.01487","created_at":"2026-05-18T00:40:34.699800+00:00"},{"alias_kind":"pith_short_12","alias_value":"SIXFMW2IA44J","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_16","alias_value":"SIXFMW2IA44JPPLD","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_8","alias_value":"SIXFMW2I","created_at":"2026-05-18T12:31:43.269735+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/SIXFMW2IA44JPPLDQOAGWFUMZD","json":"https://pith.science/pith/SIXFMW2IA44JPPLDQOAGWFUMZD.json","graph_json":"https://pith.science/api/pith-number/SIXFMW2IA44JPPLDQOAGWFUMZD/graph.json","events_json":"https://pith.science/api/pith-number/SIXFMW2IA44JPPLDQOAGWFUMZD/events.json","paper":"https://pith.science/paper/SIXFMW2I"},"agent_actions":{"view_html":"https://pith.science/pith/SIXFMW2IA44JPPLDQOAGWFUMZD","download_json":"https://pith.science/pith/SIXFMW2IA44JPPLDQOAGWFUMZD.json","view_paper":"https://pith.science/paper/SIXFMW2I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.01487&json=true","fetch_graph":"https://pith.science/api/pith-number/SIXFMW2IA44JPPLDQOAGWFUMZD/graph.json","fetch_events":"https://pith.science/api/pith-number/SIXFMW2IA44JPPLDQOAGWFUMZD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SIXFMW2IA44JPPLDQOAGWFUMZD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SIXFMW2IA44JPPLDQOAGWFUMZD/action/storage_attestation","attest_author":"https://pith.science/pith/SIXFMW2IA44JPPLDQOAGWFUMZD/action/author_attestation","sign_citation":"https://pith.science/pith/SIXFMW2IA44JPPLDQOAGWFUMZD/action/citation_signature","submit_replication":"https://pith.science/pith/SIXFMW2IA44JPPLDQOAGWFUMZD/action/replication_record"}},"created_at":"2026-05-18T00:40:34.699800+00:00","updated_at":"2026-05-18T00:40:34.699800+00:00"}