{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:4JB47VUHOIJ2WTTLBG7TOFVPR2","short_pith_number":"pith:4JB47VUH","schema_version":"1.0","canonical_sha256":"e243cfd6877213ab4e6b09bf3716af8e9fdfd8147f88afa48faa454299f1ae9c","source":{"kind":"arxiv","id":"2501.04540","version":1},"attestation_state":"computed","paper":{"title":"Protecting the Connectivity of a Graph Under Non-Uniform Edge Failures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Felix Hommelsheim, Guochuan Zhang, Nicole Megow, Zhenwei Liu","submitted_at":"2025-01-08T14:40:00Z","abstract_excerpt":"We study the problem of guaranteeing the connectivity of a given graph by protecting or strengthening edges. Herein, a protected edge is assumed to be robust and will not fail, which features a non-uniform failure model. We introduce the $(p,q)$-Steiner-Connectivity Preservation problem where we protect a minimum-cost set of edges such that the underlying graph maintains $p$-edge-connectivity between given terminal pairs against edge failures, assuming at most $q$ unprotected edges can fail. We design polynomial-time exact algorithms for the cases where $p$ and $q$ are small and approximation "},"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":"2501.04540","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-01-08T14:40:00Z","cross_cats_sorted":[],"title_canon_sha256":"587cccfcfacdbbc28c8f4656514a0fad8121cae674b47a4648ae9688a6ca2922","abstract_canon_sha256":"7a51b5847e8ab4e88f9fca5039238870662f2e1a6130db3d115eb71764b2a95a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:58:37.023151Z","signature_b64":"EqFW2jOqn5WTOmIYq75w431bCFBnI1ERfyajWLDwr+iJrxRODKifz1RrqV1eE12EVpQsjkp6WCAfIkNW87KiAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e243cfd6877213ab4e6b09bf3716af8e9fdfd8147f88afa48faa454299f1ae9c","last_reissued_at":"2026-07-05T09:58:37.022720Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:58:37.022720Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Protecting the Connectivity of a Graph Under Non-Uniform Edge Failures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Felix Hommelsheim, Guochuan Zhang, Nicole Megow, Zhenwei Liu","submitted_at":"2025-01-08T14:40:00Z","abstract_excerpt":"We study the problem of guaranteeing the connectivity of a given graph by protecting or strengthening edges. Herein, a protected edge is assumed to be robust and will not fail, which features a non-uniform failure model. We introduce the $(p,q)$-Steiner-Connectivity Preservation problem where we protect a minimum-cost set of edges such that the underlying graph maintains $p$-edge-connectivity between given terminal pairs against edge failures, assuming at most $q$ unprotected edges can fail. We design polynomial-time exact algorithms for the cases where $p$ and $q$ are small and approximation "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.04540","kind":"arxiv","version":1},"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/2501.04540/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":"2501.04540","created_at":"2026-07-05T09:58:37.022776+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.04540v1","created_at":"2026-07-05T09:58:37.022776+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.04540","created_at":"2026-07-05T09:58:37.022776+00:00"},{"alias_kind":"pith_short_12","alias_value":"4JB47VUHOIJ2","created_at":"2026-07-05T09:58:37.022776+00:00"},{"alias_kind":"pith_short_16","alias_value":"4JB47VUHOIJ2WTTL","created_at":"2026-07-05T09:58:37.022776+00:00"},{"alias_kind":"pith_short_8","alias_value":"4JB47VUH","created_at":"2026-07-05T09:58:37.022776+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/4JB47VUHOIJ2WTTLBG7TOFVPR2","json":"https://pith.science/pith/4JB47VUHOIJ2WTTLBG7TOFVPR2.json","graph_json":"https://pith.science/api/pith-number/4JB47VUHOIJ2WTTLBG7TOFVPR2/graph.json","events_json":"https://pith.science/api/pith-number/4JB47VUHOIJ2WTTLBG7TOFVPR2/events.json","paper":"https://pith.science/paper/4JB47VUH"},"agent_actions":{"view_html":"https://pith.science/pith/4JB47VUHOIJ2WTTLBG7TOFVPR2","download_json":"https://pith.science/pith/4JB47VUHOIJ2WTTLBG7TOFVPR2.json","view_paper":"https://pith.science/paper/4JB47VUH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.04540&json=true","fetch_graph":"https://pith.science/api/pith-number/4JB47VUHOIJ2WTTLBG7TOFVPR2/graph.json","fetch_events":"https://pith.science/api/pith-number/4JB47VUHOIJ2WTTLBG7TOFVPR2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4JB47VUHOIJ2WTTLBG7TOFVPR2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4JB47VUHOIJ2WTTLBG7TOFVPR2/action/storage_attestation","attest_author":"https://pith.science/pith/4JB47VUHOIJ2WTTLBG7TOFVPR2/action/author_attestation","sign_citation":"https://pith.science/pith/4JB47VUHOIJ2WTTLBG7TOFVPR2/action/citation_signature","submit_replication":"https://pith.science/pith/4JB47VUHOIJ2WTTLBG7TOFVPR2/action/replication_record"}},"created_at":"2026-07-05T09:58:37.022776+00:00","updated_at":"2026-07-05T09:58:37.022776+00:00"}