{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:D54IMYYD2BLKLM345HYTHDZPEF","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":"a3a6b4c022d4a7f7ebec350aea1cf8fb3fd2211d3c44701437946101fb19639d","cross_cats_sorted":["cs.DM","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-08-23T04:00:20Z","title_canon_sha256":"e06295750c5ab04b5fd102336052d061140360f5d8ac2ac6b0deea329c697bd2"},"schema_version":"1.0","source":{"id":"1508.05567","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.05567","created_at":"2026-05-18T00:39:53Z"},{"alias_kind":"arxiv_version","alias_value":"1508.05567v2","created_at":"2026-05-18T00:39:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.05567","created_at":"2026-05-18T00:39:53Z"},{"alias_kind":"pith_short_12","alias_value":"D54IMYYD2BLK","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"D54IMYYD2BLKLM34","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"D54IMYYD","created_at":"2026-05-18T12:29:17Z"}],"graph_snapshots":[{"event_id":"sha256:63aab17010c1e5fe0eff243395966fa7af04f9b6313c8d3a32048afc4b2bf7e5","target":"graph","created_at":"2026-05-18T00:39:53Z","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 consider a variety of NP-Complete network connectivity problems. We introduce a novel dual-based approach to approximating network design problems with cut-based linear programming relaxations. This approach gives a $3/2$-approximation to Minimum 2-Edge-Connected Spanning Subgraph that is equivalent to a previously proposed algorithm. One well-studied branch of network design models ad hoc networks where each node can either operate at high or low power. If we allow unidirectional links, we can formalize this into the problem Dual Power Assignment (DPA). Our dual-based approach gives a $3/2","authors_text":"Benjamin Grimmer","cross_cats":["cs.DM","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-08-23T04:00:20Z","title":"Dual-Based Approximation Algorithms for Cut-Based Network Connectivity Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.05567","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:68e6836ce34308af05a14acb7882b8a3f8ec6ce203c4fae650e634454786e7a9","target":"record","created_at":"2026-05-18T00:39:53Z","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":"a3a6b4c022d4a7f7ebec350aea1cf8fb3fd2211d3c44701437946101fb19639d","cross_cats_sorted":["cs.DM","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-08-23T04:00:20Z","title_canon_sha256":"e06295750c5ab04b5fd102336052d061140360f5d8ac2ac6b0deea329c697bd2"},"schema_version":"1.0","source":{"id":"1508.05567","kind":"arxiv","version":2}},"canonical_sha256":"1f78866303d056a5b37ce9f1338f2f2165f076deace0b22bcc976bc8313b34de","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1f78866303d056a5b37ce9f1338f2f2165f076deace0b22bcc976bc8313b34de","first_computed_at":"2026-05-18T00:39:53.094229Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:39:53.094229Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Iq0a71kMU/qC3aiyB4mHN1XQ2PQbAOg0B7/ZL4leYndmcaEB+vwkopzDIKIwRF3l6Sfl11Oahza9zk0aJP5kCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:39:53.095045Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.05567","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:68e6836ce34308af05a14acb7882b8a3f8ec6ce203c4fae650e634454786e7a9","sha256:63aab17010c1e5fe0eff243395966fa7af04f9b6313c8d3a32048afc4b2bf7e5"],"state_sha256":"d4d9ae410c59bb9dbfcb4b27f0669cb4949a32636ee4785b0058437211eaec90"}