{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:4SNU6UT25Y43CQ2FFJQVWG4LLG","short_pith_number":"pith:4SNU6UT2","canonical_record":{"source":{"id":"1307.4164","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-16T05:08:27Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"050864ac115d837e5d9861277045ce9b1616d042b85e8b73b11b4726cfb4326a","abstract_canon_sha256":"a1d96bb64c7775ad7bc067f37080048ffdfc03d56f2d489f70acd2a6da034530"},"schema_version":"1.0"},"canonical_sha256":"e49b4f527aee39b143452a615b1b8b59bf83de4a2f50193f2cf60192c27b5680","source":{"kind":"arxiv","id":"1307.4164","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:4SNU6UT25Y43CQ2FFJQVWG4LLG","target":"record","payload":{"canonical_record":{"source":{"id":"1307.4164","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-16T05:08:27Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"050864ac115d837e5d9861277045ce9b1616d042b85e8b73b11b4726cfb4326a","abstract_canon_sha256":"a1d96bb64c7775ad7bc067f37080048ffdfc03d56f2d489f70acd2a6da034530"},"schema_version":"1.0"},"canonical_sha256":"e49b4f527aee39b143452a615b1b8b59bf83de4a2f50193f2cf60192c27b5680","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:29.060222Z","signature_b64":"qH86Apijt6m6r8iPTqgWIzj2/s/gdV4jKq55wZRXk9UO75DSNseWeHzpzt+BANoQ8yNdqVxh3w2SL/CgDvqdDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e49b4f527aee39b143452a615b1b8b59bf83de4a2f50193f2cf60192c27b5680","last_reissued_at":"2026-05-18T00:30:29.059611Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:29.059611Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1307.4164","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:30:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l1zKzRkqvvsBKoz9rMgQ9ySScC5JBwfpvoNigermMyiwa72ZS2APmTijTM5JK3+mE4S7Y9P0OnBZCqrE5T4KCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T02:04:20.494067Z"},"content_sha256":"cfc9dd8c063882a35c4f5a9b5a3b3e8ceeddfc3f80ac156ef5ce861aaa2c9677","schema_version":"1.0","event_id":"sha256:cfc9dd8c063882a35c4f5a9b5a3b3e8ceeddfc3f80ac156ef5ce861aaa2c9677"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:4SNU6UT25Y43CQ2FFJQVWG4LLG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximating Minimum Cost Connectivity Orientation and Augmentation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"L\\'aszl\\'o A. V\\'egh, Mohit Singh","submitted_at":"2013-07-16T05:08:27Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.4164","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:30:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ADvjPOyMhb9oaZPEW20mz/VBKSkirbePh7ikK14BcFtV/AGxRPlsnecd5gM+r2BzAMjFl+pxyCpuZUT+MRntAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T02:04:20.494423Z"},"content_sha256":"3ac798f56986af6c1281d1c362b0b2b934df4eb240b3d01d563cae22e594884f","schema_version":"1.0","event_id":"sha256:3ac798f56986af6c1281d1c362b0b2b934df4eb240b3d01d563cae22e594884f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4SNU6UT25Y43CQ2FFJQVWG4LLG/bundle.json","state_url":"https://pith.science/pith/4SNU6UT25Y43CQ2FFJQVWG4LLG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4SNU6UT25Y43CQ2FFJQVWG4LLG/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-06-20T02:04:20Z","links":{"resolver":"https://pith.science/pith/4SNU6UT25Y43CQ2FFJQVWG4LLG","bundle":"https://pith.science/pith/4SNU6UT25Y43CQ2FFJQVWG4LLG/bundle.json","state":"https://pith.science/pith/4SNU6UT25Y43CQ2FFJQVWG4LLG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4SNU6UT25Y43CQ2FFJQVWG4LLG/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c9uuGDSdMQHlPO5yptUcOK4JfMSXHmjryWmrkHi7vCnbrgffFx5vH8FGVP0IaeiGNRWakhDUYG5Q1tshskwUAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T02:04:20.496306Z","bundle_sha256":"5bd97da9c0f761174dcc1bee419d976ad1eaa539917454ac860ca6ce82367276"}}