{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:SIXFMW2IA44JPPLDQOAGWFUMZD","short_pith_number":"pith:SIXFMW2I","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"},"canonical_sha256":"922e565b48073897bd6383806b168cc8daaedff06954d6889617d0dad98e6e85","source":{"kind":"arxiv","id":"1707.01487","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.01487","created_at":"2026-05-18T00:40:34Z"},{"alias_kind":"arxiv_version","alias_value":"1707.01487v2","created_at":"2026-05-18T00:40:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.01487","created_at":"2026-05-18T00:40:34Z"},{"alias_kind":"pith_short_12","alias_value":"SIXFMW2IA44J","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SIXFMW2IA44JPPLD","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SIXFMW2I","created_at":"2026-05-18T12:31:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:SIXFMW2IA44JPPLDQOAGWFUMZD","target":"record","payload":{"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"},"canonical_sha256":"922e565b48073897bd6383806b168cc8daaedff06954d6889617d0dad98e6e85","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"},"source_kind":"arxiv","source_id":"1707.01487","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-05-18T00:40:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NDHQuflWZhM1+h/YzSgpJOiayyD/zQ5QWgzqQ0ZhYRvz9WOtbYtEYq13/HlP1UwsQ/4wksJ7F1FSVVH6/JZRAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T10:23:15.863839Z"},"content_sha256":"462b18c2c9322c7e6afc2a78e6286d43faf12c796e5b05264bd79265d42c61ba","schema_version":"1.0","event_id":"sha256:462b18c2c9322c7e6afc2a78e6286d43faf12c796e5b05264bd79265d42c61ba"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:SIXFMW2IA44JPPLDQOAGWFUMZD","target":"graph","payload":{"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"},"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-18T00:40:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gbZxRCTGl57RRlPXqvA2gLxjetj6GWj91n937ZSDjfb+jeyvSIAAfrsi0+4Cu5CvPM1OwH3OHqnHaqXs+SNOCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T10:23:15.864244Z"},"content_sha256":"663cd57b508d247d858955ffaee1544ef94d4a4a414740c1a1d2cf34f4ad5668","schema_version":"1.0","event_id":"sha256:663cd57b508d247d858955ffaee1544ef94d4a4a414740c1a1d2cf34f4ad5668"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SIXFMW2IA44JPPLDQOAGWFUMZD/bundle.json","state_url":"https://pith.science/pith/SIXFMW2IA44JPPLDQOAGWFUMZD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SIXFMW2IA44JPPLDQOAGWFUMZD/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-25T10:23:15Z","links":{"resolver":"https://pith.science/pith/SIXFMW2IA44JPPLDQOAGWFUMZD","bundle":"https://pith.science/pith/SIXFMW2IA44JPPLDQOAGWFUMZD/bundle.json","state":"https://pith.science/pith/SIXFMW2IA44JPPLDQOAGWFUMZD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SIXFMW2IA44JPPLDQOAGWFUMZD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:SIXFMW2IA44JPPLDQOAGWFUMZD","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":"b0aaa6ac9c73d224b53229594c1b9821955810882e4d1b911b347efca0840867","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-05T17:36:38Z","title_canon_sha256":"54a694bfde02b3f7e3578fd84c6a57ac2109621678bee33b08543c9676d0e9f9"},"schema_version":"1.0","source":{"id":"1707.01487","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.01487","created_at":"2026-05-18T00:40:34Z"},{"alias_kind":"arxiv_version","alias_value":"1707.01487v2","created_at":"2026-05-18T00:40:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.01487","created_at":"2026-05-18T00:40:34Z"},{"alias_kind":"pith_short_12","alias_value":"SIXFMW2IA44J","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SIXFMW2IA44JPPLD","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SIXFMW2I","created_at":"2026-05-18T12:31:43Z"}],"graph_snapshots":[{"event_id":"sha256:663cd57b508d247d858955ffaee1544ef94d4a4a414740c1a1d2cf34f4ad5668","target":"graph","created_at":"2026-05-18T00:40:34Z","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":"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","authors_text":"Guru Guruganesh, Jennifer Iglesias, Laura Sanit\\`a, R. Ravi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-05T17:36:38Z","title":"Single-sink Fractionally Subadditive Network Design"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.01487","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:462b18c2c9322c7e6afc2a78e6286d43faf12c796e5b05264bd79265d42c61ba","target":"record","created_at":"2026-05-18T00:40:34Z","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":"b0aaa6ac9c73d224b53229594c1b9821955810882e4d1b911b347efca0840867","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-05T17:36:38Z","title_canon_sha256":"54a694bfde02b3f7e3578fd84c6a57ac2109621678bee33b08543c9676d0e9f9"},"schema_version":"1.0","source":{"id":"1707.01487","kind":"arxiv","version":2}},"canonical_sha256":"922e565b48073897bd6383806b168cc8daaedff06954d6889617d0dad98e6e85","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"922e565b48073897bd6383806b168cc8daaedff06954d6889617d0dad98e6e85","first_computed_at":"2026-05-18T00:40:34.699662Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:40:34.699662Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"A7DkB8zuuS5PKupc3O9nvo0wMfwwrH8WvJ1A+qaiLNKxfz3Wz1tAt2rug+1DcqoMbvRIGgRKlTZPCw1p/orMAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:40:34.700981Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.01487","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:462b18c2c9322c7e6afc2a78e6286d43faf12c796e5b05264bd79265d42c61ba","sha256:663cd57b508d247d858955ffaee1544ef94d4a4a414740c1a1d2cf34f4ad5668"],"state_sha256":"84584dc6a6c8569add93c0bcdd2e121453bcc55af4574dec3168838b0b9b78aa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fIa2pyIVmiQucjComRfevxIqSmTS9bfCOsHGUpg/4MkVXVXSPffpX2m8GdM0aZcXd20XLnLUzRMmYyQvcxJfAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T10:23:15.867763Z","bundle_sha256":"fdaccafe869ba301774b1937dbabf3155a739f572dfedaffcd9be9a5369d7ac5"}}