{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:AKRVE2XF67LSIX5VB57KKELMZC","short_pith_number":"pith:AKRVE2XF","schema_version":"1.0","canonical_sha256":"02a3526ae5f7d7245fb50f7ea5116cc89c6e403ccdd38b1ada798e0828d37836","source":{"kind":"arxiv","id":"2304.06656","version":2},"attestation_state":"computed","paper":{"title":"Improved Approximations for Relative Survivable Network Design","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Ama Koranteng, Guy Kortsarz, Michael Dinitz, Zeev Nutov","submitted_at":"2023-04-13T16:38:28Z","abstract_excerpt":"One of the most important and well-studied settings for network design is edge-connectivity requirements. This encompasses uniform demands such as the Minimum $k$-Edge-Connected Spanning Subgraph problem as well as nonuniform demands such as the Survivable Network Design problem (SND). In a recent paper by [Dinitz, Koranteng, Kortsarz APPROX '22] , the authors observed that a weakness of these formulations is that it does not enable one to consider fault-tolerance in graphs that have just a few small cuts. To remedy this, they introduced new variants of these problems under the notion \"relativ"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2304.06656","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-04-13T16:38:28Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"b40f5bed988ecb89b7e41751ef0973bcc6623054d20c275a7b5400fce4b7bcf1","abstract_canon_sha256":"98aeef8d2ea8d974e5f1189b4a417781898a18f1ba1bba93405c8399e539ca03"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:56:32.591005Z","signature_b64":"hl9HXo/uPRb7/ui1571HLpgRBeycqRIWcuXNUb5bvYdLSEUkUBgpQ85ru29XGHbidDCrjMr63QuBb6OyJHCuCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"02a3526ae5f7d7245fb50f7ea5116cc89c6e403ccdd38b1ada798e0828d37836","last_reissued_at":"2026-07-05T06:56:32.590432Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:56:32.590432Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved Approximations for Relative Survivable Network Design","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Ama Koranteng, Guy Kortsarz, Michael Dinitz, Zeev Nutov","submitted_at":"2023-04-13T16:38:28Z","abstract_excerpt":"One of the most important and well-studied settings for network design is edge-connectivity requirements. This encompasses uniform demands such as the Minimum $k$-Edge-Connected Spanning Subgraph problem as well as nonuniform demands such as the Survivable Network Design problem (SND). In a recent paper by [Dinitz, Koranteng, Kortsarz APPROX '22] , the authors observed that a weakness of these formulations is that it does not enable one to consider fault-tolerance in graphs that have just a few small cuts. To remedy this, they introduced new variants of these problems under the notion \"relativ"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2304.06656","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2304.06656/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2304.06656","created_at":"2026-07-05T06:56:32.590503+00:00"},{"alias_kind":"arxiv_version","alias_value":"2304.06656v2","created_at":"2026-07-05T06:56:32.590503+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2304.06656","created_at":"2026-07-05T06:56:32.590503+00:00"},{"alias_kind":"pith_short_12","alias_value":"AKRVE2XF67LS","created_at":"2026-07-05T06:56:32.590503+00:00"},{"alias_kind":"pith_short_16","alias_value":"AKRVE2XF67LSIX5V","created_at":"2026-07-05T06:56:32.590503+00:00"},{"alias_kind":"pith_short_8","alias_value":"AKRVE2XF","created_at":"2026-07-05T06:56:32.590503+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AKRVE2XF67LSIX5VB57KKELMZC","json":"https://pith.science/pith/AKRVE2XF67LSIX5VB57KKELMZC.json","graph_json":"https://pith.science/api/pith-number/AKRVE2XF67LSIX5VB57KKELMZC/graph.json","events_json":"https://pith.science/api/pith-number/AKRVE2XF67LSIX5VB57KKELMZC/events.json","paper":"https://pith.science/paper/AKRVE2XF"},"agent_actions":{"view_html":"https://pith.science/pith/AKRVE2XF67LSIX5VB57KKELMZC","download_json":"https://pith.science/pith/AKRVE2XF67LSIX5VB57KKELMZC.json","view_paper":"https://pith.science/paper/AKRVE2XF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2304.06656&json=true","fetch_graph":"https://pith.science/api/pith-number/AKRVE2XF67LSIX5VB57KKELMZC/graph.json","fetch_events":"https://pith.science/api/pith-number/AKRVE2XF67LSIX5VB57KKELMZC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AKRVE2XF67LSIX5VB57KKELMZC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AKRVE2XF67LSIX5VB57KKELMZC/action/storage_attestation","attest_author":"https://pith.science/pith/AKRVE2XF67LSIX5VB57KKELMZC/action/author_attestation","sign_citation":"https://pith.science/pith/AKRVE2XF67LSIX5VB57KKELMZC/action/citation_signature","submit_replication":"https://pith.science/pith/AKRVE2XF67LSIX5VB57KKELMZC/action/replication_record"}},"created_at":"2026-07-05T06:56:32.590503+00:00","updated_at":"2026-07-05T06:56:32.590503+00:00"}