{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:S4DZVRBMIQA3PM4BQT7TN2DWWU","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":"1e2c68078cbb821c39a1049c44b7185bff7ea3b9d1c50b2e93f563fa11bd75e8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-08-04T19:34:38Z","title_canon_sha256":"4c0fbf6cf23d019f60bd9251d47f3e5fe69c2012fee29d6d91caa37a5f27dbf4"},"schema_version":"1.0","source":{"id":"1108.1176","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.1176","created_at":"2026-05-18T02:21:42Z"},{"alias_kind":"arxiv_version","alias_value":"1108.1176v1","created_at":"2026-05-18T02:21:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.1176","created_at":"2026-05-18T02:21:42Z"},{"alias_kind":"pith_short_12","alias_value":"S4DZVRBMIQA3","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_16","alias_value":"S4DZVRBMIQA3PM4B","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_8","alias_value":"S4DZVRBM","created_at":"2026-05-18T12:26:41Z"}],"graph_snapshots":[{"event_id":"sha256:2d156d438d372d86dc980926c962855b416b0ef1fb1940876c3b0280053799b3","target":"graph","created_at":"2026-05-18T02:21:42Z","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 focus on designing combinatorial algorithms for the Capacitated Network Design problem (Cap-SNDP). The Cap-SNDP is the problem of satisfying connectivity requirements when edges have costs and hard capacities. We begin by showing that the Group Steiner tree problem (GST) is a special case of Cap-SNDP even when there is connectivity requirement between only one source-sink pair. This implies the first poly-logarithmic lower bound for the Cap-SNDP. We next provide combinatorial algorithms for several special cases of this problem. The Cap-SNDP is equivalent to its special case when every edge","authors_text":"Guy Kortsarz, MohammadTaghi Hajiaghayi, Rohit Khandekar, Zeev Nutov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-08-04T19:34:38Z","title":"Combinatorial Algorithms for Capacitated Network Design"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.1176","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:27946b0af23ddfe29ec8c10cde9d8c822f74db0f6eae2369c699f46c6583d266","target":"record","created_at":"2026-05-18T02:21:42Z","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":"1e2c68078cbb821c39a1049c44b7185bff7ea3b9d1c50b2e93f563fa11bd75e8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-08-04T19:34:38Z","title_canon_sha256":"4c0fbf6cf23d019f60bd9251d47f3e5fe69c2012fee29d6d91caa37a5f27dbf4"},"schema_version":"1.0","source":{"id":"1108.1176","kind":"arxiv","version":1}},"canonical_sha256":"97079ac42c4401b7b38184ff36e876b53ae4998aa06aa4c88f4576ffd9675ef5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"97079ac42c4401b7b38184ff36e876b53ae4998aa06aa4c88f4576ffd9675ef5","first_computed_at":"2026-05-18T02:21:42.442698Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:21:42.442698Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"utpmCWs+QcePEjXej94gC2m4sF/2duzq6xf9FZ8AMVv3uZvhBr9nabhCFNmo1phubTP3S3PwCFaIculLO4RCAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:21:42.443264Z","signed_message":"canonical_sha256_bytes"},"source_id":"1108.1176","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:27946b0af23ddfe29ec8c10cde9d8c822f74db0f6eae2369c699f46c6583d266","sha256:2d156d438d372d86dc980926c962855b416b0ef1fb1940876c3b0280053799b3"],"state_sha256":"938e0554ec6986493af3957eeb92130351b242a071b9a75e0cd4b8e6b415c75c"}