{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:HSASOHQHTSJVBJHTL2DNIFXHCI","short_pith_number":"pith:HSASOHQH","canonical_record":{"source":{"id":"1806.06704","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-15T06:58:20Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"8e5291dd73e079a89e54c88a9f19a4c4f0f49832cd28752803aa783b2d177d24","abstract_canon_sha256":"8b9dde2303ca984d33d1ccde808c2abd0ba093da751ebf8f89893c84727bf1a2"},"schema_version":"1.0"},"canonical_sha256":"3c81271e079c9350a4f35e86d416e7121a3acf68c686a04d6fb0f6b3476c4242","source":{"kind":"arxiv","id":"1806.06704","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.06704","created_at":"2026-05-18T00:12:59Z"},{"alias_kind":"arxiv_version","alias_value":"1806.06704v1","created_at":"2026-05-18T00:12:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.06704","created_at":"2026-05-18T00:12:59Z"},{"alias_kind":"pith_short_12","alias_value":"HSASOHQHTSJV","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"HSASOHQHTSJVBJHT","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"HSASOHQH","created_at":"2026-05-18T12:32:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:HSASOHQHTSJVBJHTL2DNIFXHCI","target":"record","payload":{"canonical_record":{"source":{"id":"1806.06704","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-15T06:58:20Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"8e5291dd73e079a89e54c88a9f19a4c4f0f49832cd28752803aa783b2d177d24","abstract_canon_sha256":"8b9dde2303ca984d33d1ccde808c2abd0ba093da751ebf8f89893c84727bf1a2"},"schema_version":"1.0"},"canonical_sha256":"3c81271e079c9350a4f35e86d416e7121a3acf68c686a04d6fb0f6b3476c4242","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:59.404755Z","signature_b64":"pOmpuFLTIYay7y/eTHYQ2sgOB8MXPMih8KVdnTjqT1x5B/e04h8BLCViih4pwmQLB4Qgu44nrXZkMrjXanPbDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3c81271e079c9350a4f35e86d416e7121a3acf68c686a04d6fb0f6b3476c4242","last_reissued_at":"2026-05-18T00:12:59.404089Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:59.404089Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.06704","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-05-18T00:12:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"avLcVYL+WG838+iz8bRjaBiry3xcBhE8l+O4z4DMCwBu7udQDEzxF7uOXRo5sIiQmP9fuUHm2W68au/3V7liBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T13:22:31.430487Z"},"content_sha256":"ed496270a7459c3a76af626c816a375a72830eb178b40e01d84d4f6c913920eb","schema_version":"1.0","event_id":"sha256:ed496270a7459c3a76af626c816a375a72830eb178b40e01d84d4f6c913920eb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:HSASOHQHTSJVBJHTL2DNIFXHCI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Formulations for designing robust networks. An application to wind power collection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"C\\'edric Bentz (CEDRIC), Marie-Christine Costa (CEDRIC, OC), Pierre-Louis Poirion (CEDRIC, Thomas Ridremont (CEDRIC","submitted_at":"2018-06-15T06:58:20Z","abstract_excerpt":"We are interested in the design of survivable capacitated rooted Steiner networks. Given a graph G = (V, E), capacity and cost functions on E, a root r, a subset T of V of terminals and an integer k, we search for a minimum cost subset E $\\subset$ E, covering T and r, such that the network induced by E is k-survivable: after the removal of any k edges, there still exists a feasible flow from r to T. We also consider the possibility of protecting a given number of edges. We propose three different formulations: a cut-set, a flow and a bi-level formulation where the second-level is a min-max pro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.06704","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":""},"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:12:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mbua1/crC9tB1gjnohyGy29RD9ZEXyyoV2LcCL5bKmVC8ZEqbdolUcWv5Ku0lLoSFVFX7HOIGtN+r2PUlH6TAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T13:22:31.430826Z"},"content_sha256":"2121183010a7507716dbca2311dea7284bae265e1a7ee024e08352143b634058","schema_version":"1.0","event_id":"sha256:2121183010a7507716dbca2311dea7284bae265e1a7ee024e08352143b634058"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HSASOHQHTSJVBJHTL2DNIFXHCI/bundle.json","state_url":"https://pith.science/pith/HSASOHQHTSJVBJHTL2DNIFXHCI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HSASOHQHTSJVBJHTL2DNIFXHCI/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-24T13:22:31Z","links":{"resolver":"https://pith.science/pith/HSASOHQHTSJVBJHTL2DNIFXHCI","bundle":"https://pith.science/pith/HSASOHQHTSJVBJHTL2DNIFXHCI/bundle.json","state":"https://pith.science/pith/HSASOHQHTSJVBJHTL2DNIFXHCI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HSASOHQHTSJVBJHTL2DNIFXHCI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:HSASOHQHTSJVBJHTL2DNIFXHCI","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":"8b9dde2303ca984d33d1ccde808c2abd0ba093da751ebf8f89893c84727bf1a2","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-15T06:58:20Z","title_canon_sha256":"8e5291dd73e079a89e54c88a9f19a4c4f0f49832cd28752803aa783b2d177d24"},"schema_version":"1.0","source":{"id":"1806.06704","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.06704","created_at":"2026-05-18T00:12:59Z"},{"alias_kind":"arxiv_version","alias_value":"1806.06704v1","created_at":"2026-05-18T00:12:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.06704","created_at":"2026-05-18T00:12:59Z"},{"alias_kind":"pith_short_12","alias_value":"HSASOHQHTSJV","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"HSASOHQHTSJVBJHT","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"HSASOHQH","created_at":"2026-05-18T12:32:28Z"}],"graph_snapshots":[{"event_id":"sha256:2121183010a7507716dbca2311dea7284bae265e1a7ee024e08352143b634058","target":"graph","created_at":"2026-05-18T00:12:59Z","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 are interested in the design of survivable capacitated rooted Steiner networks. Given a graph G = (V, E), capacity and cost functions on E, a root r, a subset T of V of terminals and an integer k, we search for a minimum cost subset E $\\subset$ E, covering T and r, such that the network induced by E is k-survivable: after the removal of any k edges, there still exists a feasible flow from r to T. We also consider the possibility of protecting a given number of edges. We propose three different formulations: a cut-set, a flow and a bi-level formulation where the second-level is a min-max pro","authors_text":"C\\'edric Bentz (CEDRIC), Marie-Christine Costa (CEDRIC, OC), Pierre-Louis Poirion (CEDRIC, Thomas Ridremont (CEDRIC","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-15T06:58:20Z","title":"Formulations for designing robust networks. An application to wind power collection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.06704","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:ed496270a7459c3a76af626c816a375a72830eb178b40e01d84d4f6c913920eb","target":"record","created_at":"2026-05-18T00:12:59Z","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":"8b9dde2303ca984d33d1ccde808c2abd0ba093da751ebf8f89893c84727bf1a2","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-15T06:58:20Z","title_canon_sha256":"8e5291dd73e079a89e54c88a9f19a4c4f0f49832cd28752803aa783b2d177d24"},"schema_version":"1.0","source":{"id":"1806.06704","kind":"arxiv","version":1}},"canonical_sha256":"3c81271e079c9350a4f35e86d416e7121a3acf68c686a04d6fb0f6b3476c4242","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3c81271e079c9350a4f35e86d416e7121a3acf68c686a04d6fb0f6b3476c4242","first_computed_at":"2026-05-18T00:12:59.404089Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:12:59.404089Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pOmpuFLTIYay7y/eTHYQ2sgOB8MXPMih8KVdnTjqT1x5B/e04h8BLCViih4pwmQLB4Qgu44nrXZkMrjXanPbDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:12:59.404755Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.06704","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ed496270a7459c3a76af626c816a375a72830eb178b40e01d84d4f6c913920eb","sha256:2121183010a7507716dbca2311dea7284bae265e1a7ee024e08352143b634058"],"state_sha256":"66b9672b29feb68d94cc16430fed26467c906748e796830699ae0f331813d497"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"18u7SaXA632W36QBDW1B3XXGvntQoDjYUYLgxVKJWudxxuDBhACGDLB3Bg/4wdUQUDrVdBb7Zi2XCAD1mNTUCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T13:22:31.432674Z","bundle_sha256":"3339baf05d003c4ee09839960d79f9a165ce43242bb14c86fcb8117bac4bb5dc"}}