{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:4SNU6UT25Y43CQ2FFJQVWG4LLG","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":"a1d96bb64c7775ad7bc067f37080048ffdfc03d56f2d489f70acd2a6da034530","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-16T05:08:27Z","title_canon_sha256":"050864ac115d837e5d9861277045ce9b1616d042b85e8b73b11b4726cfb4326a"},"schema_version":"1.0","source":{"id":"1307.4164","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.4164","created_at":"2026-05-18T00:30:29Z"},{"alias_kind":"arxiv_version","alias_value":"1307.4164v2","created_at":"2026-05-18T00:30:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.4164","created_at":"2026-05-18T00:30:29Z"},{"alias_kind":"pith_short_12","alias_value":"4SNU6UT25Y43","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"4SNU6UT25Y43CQ2F","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"4SNU6UT2","created_at":"2026-05-18T12:27:34Z"}],"graph_snapshots":[{"event_id":"sha256:3ac798f56986af6c1281d1c362b0b2b934df4eb240b3d01d563cae22e594884f","target":"graph","created_at":"2026-05-18T00:30:29Z","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 investigate problems addressing combined connectivity augmentation and orientations settings. We give a polynomial-time 6-approximation algorithm for finding a minimum cost subgraph of an undirected graph $G$ that admits an orientation covering a nonnegative crossing $G$-supermodular demand function, as defined by Frank. An important example is $(k,\\ell)$-edge-connectivity, a common generalization of global and rooted edge-connectivity.\n  Our algorithm is based on a non-standard application of the iterative rounding method. We observe that the standard linear program with cut constraints is","authors_text":"L\\'aszl\\'o A. V\\'egh, Mohit Singh","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-16T05:08:27Z","title":"Approximating Minimum Cost Connectivity Orientation and Augmentation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.4164","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:cfc9dd8c063882a35c4f5a9b5a3b3e8ceeddfc3f80ac156ef5ce861aaa2c9677","target":"record","created_at":"2026-05-18T00:30:29Z","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":"a1d96bb64c7775ad7bc067f37080048ffdfc03d56f2d489f70acd2a6da034530","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-16T05:08:27Z","title_canon_sha256":"050864ac115d837e5d9861277045ce9b1616d042b85e8b73b11b4726cfb4326a"},"schema_version":"1.0","source":{"id":"1307.4164","kind":"arxiv","version":2}},"canonical_sha256":"e49b4f527aee39b143452a615b1b8b59bf83de4a2f50193f2cf60192c27b5680","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e49b4f527aee39b143452a615b1b8b59bf83de4a2f50193f2cf60192c27b5680","first_computed_at":"2026-05-18T00:30:29.059611Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:30:29.059611Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qH86Apijt6m6r8iPTqgWIzj2/s/gdV4jKq55wZRXk9UO75DSNseWeHzpzt+BANoQ8yNdqVxh3w2SL/CgDvqdDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:30:29.060222Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.4164","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cfc9dd8c063882a35c4f5a9b5a3b3e8ceeddfc3f80ac156ef5ce861aaa2c9677","sha256:3ac798f56986af6c1281d1c362b0b2b934df4eb240b3d01d563cae22e594884f"],"state_sha256":"9015317f008f63286b2c9e92bc016ca09c5e64612a65842ea6f3f54bffe0e90d"}