{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:D54IMYYD2BLKLM345HYTHDZPEF","short_pith_number":"pith:D54IMYYD","canonical_record":{"source":{"id":"1508.05567","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-08-23T04:00:20Z","cross_cats_sorted":["cs.DM","math.OC"],"title_canon_sha256":"e06295750c5ab04b5fd102336052d061140360f5d8ac2ac6b0deea329c697bd2","abstract_canon_sha256":"a3a6b4c022d4a7f7ebec350aea1cf8fb3fd2211d3c44701437946101fb19639d"},"schema_version":"1.0"},"canonical_sha256":"1f78866303d056a5b37ce9f1338f2f2165f076deace0b22bcc976bc8313b34de","source":{"kind":"arxiv","id":"1508.05567","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:D54IMYYD2BLKLM345HYTHDZPEF","target":"record","payload":{"canonical_record":{"source":{"id":"1508.05567","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-08-23T04:00:20Z","cross_cats_sorted":["cs.DM","math.OC"],"title_canon_sha256":"e06295750c5ab04b5fd102336052d061140360f5d8ac2ac6b0deea329c697bd2","abstract_canon_sha256":"a3a6b4c022d4a7f7ebec350aea1cf8fb3fd2211d3c44701437946101fb19639d"},"schema_version":"1.0"},"canonical_sha256":"1f78866303d056a5b37ce9f1338f2f2165f076deace0b22bcc976bc8313b34de","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:53.095045Z","signature_b64":"Iq0a71kMU/qC3aiyB4mHN1XQ2PQbAOg0B7/ZL4leYndmcaEB+vwkopzDIKIwRF3l6Sfl11Oahza9zk0aJP5kCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1f78866303d056a5b37ce9f1338f2f2165f076deace0b22bcc976bc8313b34de","last_reissued_at":"2026-05-18T00:39:53.094229Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:53.094229Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1508.05567","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:39:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rA+BqR3dNbOBd+7rStDAivwFi3ypOUWblDolqcU+6nxCVT2w/lRJMeiveHLN0wcv33Qq8mbPWEH+9e+iQ6J7Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T10:00:07.533684Z"},"content_sha256":"68e6836ce34308af05a14acb7882b8a3f8ec6ce203c4fae650e634454786e7a9","schema_version":"1.0","event_id":"sha256:68e6836ce34308af05a14acb7882b8a3f8ec6ce203c4fae650e634454786e7a9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:D54IMYYD2BLKLM345HYTHDZPEF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dual-Based Approximation Algorithms for Cut-Based Network Connectivity Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.OC"],"primary_cat":"cs.DS","authors_text":"Benjamin Grimmer","submitted_at":"2015-08-23T04:00:20Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.05567","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:39:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XILFIYwAvIDKIBxFiJXK8OKZPHoY7WZu/X93bXi5NoJU4CpWpBb3WntkV9K88El16TeCwHdCpGjoQIk1uW6vDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T10:00:07.534047Z"},"content_sha256":"63aab17010c1e5fe0eff243395966fa7af04f9b6313c8d3a32048afc4b2bf7e5","schema_version":"1.0","event_id":"sha256:63aab17010c1e5fe0eff243395966fa7af04f9b6313c8d3a32048afc4b2bf7e5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/D54IMYYD2BLKLM345HYTHDZPEF/bundle.json","state_url":"https://pith.science/pith/D54IMYYD2BLKLM345HYTHDZPEF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/D54IMYYD2BLKLM345HYTHDZPEF/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-05T10:00:07Z","links":{"resolver":"https://pith.science/pith/D54IMYYD2BLKLM345HYTHDZPEF","bundle":"https://pith.science/pith/D54IMYYD2BLKLM345HYTHDZPEF/bundle.json","state":"https://pith.science/pith/D54IMYYD2BLKLM345HYTHDZPEF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/D54IMYYD2BLKLM345HYTHDZPEF/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BY8U6ICfJaUPSvhFmKUNge/rS0jvVveXL8e/pRnoymt/pYGAhaNyf0r3eP0mWKB/DKfmsy0CQUrvjdOCAlCHAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T10:00:07.536052Z","bundle_sha256":"108b28f02fab657082c253c0d91fe4329e12515d97f92d8dc2b647eb34ce1e8b"}}