{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:4JB47VUHOIJ2WTTLBG7TOFVPR2","short_pith_number":"pith:4JB47VUH","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"},"canonical_sha256":"e243cfd6877213ab4e6b09bf3716af8e9fdfd8147f88afa48faa454299f1ae9c","source":{"kind":"arxiv","id":"2501.04540","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.04540","created_at":"2026-07-05T09:58:37Z"},{"alias_kind":"arxiv_version","alias_value":"2501.04540v1","created_at":"2026-07-05T09:58:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.04540","created_at":"2026-07-05T09:58:37Z"},{"alias_kind":"pith_short_12","alias_value":"4JB47VUHOIJ2","created_at":"2026-07-05T09:58:37Z"},{"alias_kind":"pith_short_16","alias_value":"4JB47VUHOIJ2WTTL","created_at":"2026-07-05T09:58:37Z"},{"alias_kind":"pith_short_8","alias_value":"4JB47VUH","created_at":"2026-07-05T09:58:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:4JB47VUHOIJ2WTTLBG7TOFVPR2","target":"record","payload":{"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"},"canonical_sha256":"e243cfd6877213ab4e6b09bf3716af8e9fdfd8147f88afa48faa454299f1ae9c","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"},"source_kind":"arxiv","source_id":"2501.04540","source_version":1,"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-07-05T09:58:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CMyxJrHMHJyDjeFAiboZFr4rEqTD3ynt3WUjwkCGjQfYE64fISGXSXp2q4CCO5lgLUfLfZTQeWU/i+M9dBMxBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-10T08:35:05.250902Z"},"content_sha256":"80ae50820b692b09eb4bf6b3f2cb89ab77f1063d67b054e8fc58b3d7c65ec785","schema_version":"1.0","event_id":"sha256:80ae50820b692b09eb4bf6b3f2cb89ab77f1063d67b054e8fc58b3d7c65ec785"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:4JB47VUHOIJ2WTTLBG7TOFVPR2","target":"graph","payload":{"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"},"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-07-05T09:58:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M2n36lqUyj0OSyHV2SK5TijY+jVnh+W3CuGjwbRDGvM23h7aGnAbLZ10Zu5F0rx/UbXWnlCoTyCeTzs2MnvQDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-10T08:35:05.251273Z"},"content_sha256":"1e7d52c4b08b49724548b1de9c7da686ddb6af360e2f24c9f1165ce7d8ac7c69","schema_version":"1.0","event_id":"sha256:1e7d52c4b08b49724548b1de9c7da686ddb6af360e2f24c9f1165ce7d8ac7c69"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4JB47VUHOIJ2WTTLBG7TOFVPR2/bundle.json","state_url":"https://pith.science/pith/4JB47VUHOIJ2WTTLBG7TOFVPR2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4JB47VUHOIJ2WTTLBG7TOFVPR2/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-07-10T08:35:05Z","links":{"resolver":"https://pith.science/pith/4JB47VUHOIJ2WTTLBG7TOFVPR2","bundle":"https://pith.science/pith/4JB47VUHOIJ2WTTLBG7TOFVPR2/bundle.json","state":"https://pith.science/pith/4JB47VUHOIJ2WTTLBG7TOFVPR2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4JB47VUHOIJ2WTTLBG7TOFVPR2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:4JB47VUHOIJ2WTTLBG7TOFVPR2","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":"7a51b5847e8ab4e88f9fca5039238870662f2e1a6130db3d115eb71764b2a95a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-01-08T14:40:00Z","title_canon_sha256":"587cccfcfacdbbc28c8f4656514a0fad8121cae674b47a4648ae9688a6ca2922"},"schema_version":"1.0","source":{"id":"2501.04540","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.04540","created_at":"2026-07-05T09:58:37Z"},{"alias_kind":"arxiv_version","alias_value":"2501.04540v1","created_at":"2026-07-05T09:58:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.04540","created_at":"2026-07-05T09:58:37Z"},{"alias_kind":"pith_short_12","alias_value":"4JB47VUHOIJ2","created_at":"2026-07-05T09:58:37Z"},{"alias_kind":"pith_short_16","alias_value":"4JB47VUHOIJ2WTTL","created_at":"2026-07-05T09:58:37Z"},{"alias_kind":"pith_short_8","alias_value":"4JB47VUH","created_at":"2026-07-05T09:58:37Z"}],"graph_snapshots":[{"event_id":"sha256:1e7d52c4b08b49724548b1de9c7da686ddb6af360e2f24c9f1165ce7d8ac7c69","target":"graph","created_at":"2026-07-05T09:58:37Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2501.04540/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Felix Hommelsheim, Guochuan Zhang, Nicole Megow, Zhenwei Liu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-01-08T14:40:00Z","title":"Protecting the Connectivity of a Graph Under Non-Uniform Edge Failures"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.04540","kind":"arxiv","version":1},"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:80ae50820b692b09eb4bf6b3f2cb89ab77f1063d67b054e8fc58b3d7c65ec785","target":"record","created_at":"2026-07-05T09:58:37Z","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":"7a51b5847e8ab4e88f9fca5039238870662f2e1a6130db3d115eb71764b2a95a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-01-08T14:40:00Z","title_canon_sha256":"587cccfcfacdbbc28c8f4656514a0fad8121cae674b47a4648ae9688a6ca2922"},"schema_version":"1.0","source":{"id":"2501.04540","kind":"arxiv","version":1}},"canonical_sha256":"e243cfd6877213ab4e6b09bf3716af8e9fdfd8147f88afa48faa454299f1ae9c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e243cfd6877213ab4e6b09bf3716af8e9fdfd8147f88afa48faa454299f1ae9c","first_computed_at":"2026-07-05T09:58:37.022720Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:58:37.022720Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EqFW2jOqn5WTOmIYq75w431bCFBnI1ERfyajWLDwr+iJrxRODKifz1RrqV1eE12EVpQsjkp6WCAfIkNW87KiAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T09:58:37.023151Z","signed_message":"canonical_sha256_bytes"},"source_id":"2501.04540","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:80ae50820b692b09eb4bf6b3f2cb89ab77f1063d67b054e8fc58b3d7c65ec785","sha256:1e7d52c4b08b49724548b1de9c7da686ddb6af360e2f24c9f1165ce7d8ac7c69"],"state_sha256":"30a612e9f69080328d1037690740924be96354cd166dfce259991a35fd0b4882"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3hxdKenI8aHO1YnR0TORxuhSN5wbBWqBj9IjJlfPPXhr27fdhUhpzoDMlJwNZyXVbJqSppDk6spHx9C85JoeCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-10T08:35:05.253178Z","bundle_sha256":"db038d8bc63844eab3477b766d902390703fb70eebaaa24173d2345cb60f97cf"}}