{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:276CL2O5C7KAASVVS3YJDGOKQU","short_pith_number":"pith:276CL2O5","canonical_record":{"source":{"id":"1504.05009","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-04-20T10:53:45Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"9c1f07c713cb74206fc2f664043380b8912fff431852bb06131f71a31a1ac407","abstract_canon_sha256":"a4377b0894df3b5afad76568ecd2d3bee43e7ff9e6739abddf68a858ee6cd860"},"schema_version":"1.0"},"canonical_sha256":"d7fc25e9dd17d4004ab596f09199ca851257fe16877cc5be9d7c189bdd80c39d","source":{"kind":"arxiv","id":"1504.05009","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.05009","created_at":"2026-05-18T02:18:22Z"},{"alias_kind":"arxiv_version","alias_value":"1504.05009v1","created_at":"2026-05-18T02:18:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.05009","created_at":"2026-05-18T02:18:22Z"},{"alias_kind":"pith_short_12","alias_value":"276CL2O5C7KA","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"276CL2O5C7KAASVV","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"276CL2O5","created_at":"2026-05-18T12:28:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:276CL2O5C7KAASVVS3YJDGOKQU","target":"record","payload":{"canonical_record":{"source":{"id":"1504.05009","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-04-20T10:53:45Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"9c1f07c713cb74206fc2f664043380b8912fff431852bb06131f71a31a1ac407","abstract_canon_sha256":"a4377b0894df3b5afad76568ecd2d3bee43e7ff9e6739abddf68a858ee6cd860"},"schema_version":"1.0"},"canonical_sha256":"d7fc25e9dd17d4004ab596f09199ca851257fe16877cc5be9d7c189bdd80c39d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:18:22.919716Z","signature_b64":"MhXlq6hQb5Y84h8SBPP6a0Zhrm6z5F8xCVtImM6cGwM1TU+oUU+OeXYAfRzRh237FdCQygnEP43VfYPl0i4dAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d7fc25e9dd17d4004ab596f09199ca851257fe16877cc5be9d7c189bdd80c39d","last_reissued_at":"2026-05-18T02:18:22.919061Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:18:22.919061Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1504.05009","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-18T02:18:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q6w5idQWPDK8EQ9omky+diRBQltLAMoRezsZFqRmVdAWqQJp0jng6KZYcXuHZcgmJu54OQQWdAxrybXby8JlAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T23:07:45.147632Z"},"content_sha256":"5b16ad8b7b65d94b00bd89acf19ffea77ca9ff8657dacf7eb3ab4710612b7f40","schema_version":"1.0","event_id":"sha256:5b16ad8b7b65d94b00bd89acf19ffea77ca9ff8657dacf7eb3ab4710612b7f40"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:276CL2O5C7KAASVVS3YJDGOKQU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Non-Uniform Robust Network Design in Planar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.OC","authors_text":"David Adjiashvili","submitted_at":"2015-04-20T10:53:45Z","abstract_excerpt":"Robust optimization is concerned with constructing solutions that remain feasible also when a limited number of resources is removed from the solution. Most studies of robust combinatorial optimization to date made the assumption that every resource is equally vulnerable, and that the set of scenarios is implicitly given by a single budget constraint. This paper studies a robustness model of a different kind. We focus on \\textbf{bulk-robustness}, a model recently introduced~\\cite{bulk} for addressing the need to model non-uniform failure patterns in systems.\n  We significantly extend the techn"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.05009","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-18T02:18:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YQgpaLF6cFTyX7CCN7QbUNE0pbjT0phK/3azrVwf29ZKOd/mFQjKLU6NdsEHxIdzG4p3ThgJ4/IMyjpLCXyUCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T23:07:45.147984Z"},"content_sha256":"ba97f40036cec5698776ef227db9bcfbb9406e4d793071cc2681ff59e00999ad","schema_version":"1.0","event_id":"sha256:ba97f40036cec5698776ef227db9bcfbb9406e4d793071cc2681ff59e00999ad"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/276CL2O5C7KAASVVS3YJDGOKQU/bundle.json","state_url":"https://pith.science/pith/276CL2O5C7KAASVVS3YJDGOKQU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/276CL2O5C7KAASVVS3YJDGOKQU/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-21T23:07:45Z","links":{"resolver":"https://pith.science/pith/276CL2O5C7KAASVVS3YJDGOKQU","bundle":"https://pith.science/pith/276CL2O5C7KAASVVS3YJDGOKQU/bundle.json","state":"https://pith.science/pith/276CL2O5C7KAASVVS3YJDGOKQU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/276CL2O5C7KAASVVS3YJDGOKQU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:276CL2O5C7KAASVVS3YJDGOKQU","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":"a4377b0894df3b5afad76568ecd2d3bee43e7ff9e6739abddf68a858ee6cd860","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-04-20T10:53:45Z","title_canon_sha256":"9c1f07c713cb74206fc2f664043380b8912fff431852bb06131f71a31a1ac407"},"schema_version":"1.0","source":{"id":"1504.05009","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.05009","created_at":"2026-05-18T02:18:22Z"},{"alias_kind":"arxiv_version","alias_value":"1504.05009v1","created_at":"2026-05-18T02:18:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.05009","created_at":"2026-05-18T02:18:22Z"},{"alias_kind":"pith_short_12","alias_value":"276CL2O5C7KA","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"276CL2O5C7KAASVV","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"276CL2O5","created_at":"2026-05-18T12:28:59Z"}],"graph_snapshots":[{"event_id":"sha256:ba97f40036cec5698776ef227db9bcfbb9406e4d793071cc2681ff59e00999ad","target":"graph","created_at":"2026-05-18T02:18:22Z","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":"Robust optimization is concerned with constructing solutions that remain feasible also when a limited number of resources is removed from the solution. Most studies of robust combinatorial optimization to date made the assumption that every resource is equally vulnerable, and that the set of scenarios is implicitly given by a single budget constraint. This paper studies a robustness model of a different kind. We focus on \\textbf{bulk-robustness}, a model recently introduced~\\cite{bulk} for addressing the need to model non-uniform failure patterns in systems.\n  We significantly extend the techn","authors_text":"David Adjiashvili","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-04-20T10:53:45Z","title":"Non-Uniform Robust Network Design in Planar Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.05009","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:5b16ad8b7b65d94b00bd89acf19ffea77ca9ff8657dacf7eb3ab4710612b7f40","target":"record","created_at":"2026-05-18T02:18:22Z","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":"a4377b0894df3b5afad76568ecd2d3bee43e7ff9e6739abddf68a858ee6cd860","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-04-20T10:53:45Z","title_canon_sha256":"9c1f07c713cb74206fc2f664043380b8912fff431852bb06131f71a31a1ac407"},"schema_version":"1.0","source":{"id":"1504.05009","kind":"arxiv","version":1}},"canonical_sha256":"d7fc25e9dd17d4004ab596f09199ca851257fe16877cc5be9d7c189bdd80c39d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d7fc25e9dd17d4004ab596f09199ca851257fe16877cc5be9d7c189bdd80c39d","first_computed_at":"2026-05-18T02:18:22.919061Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:18:22.919061Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MhXlq6hQb5Y84h8SBPP6a0Zhrm6z5F8xCVtImM6cGwM1TU+oUU+OeXYAfRzRh237FdCQygnEP43VfYPl0i4dAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:18:22.919716Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.05009","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5b16ad8b7b65d94b00bd89acf19ffea77ca9ff8657dacf7eb3ab4710612b7f40","sha256:ba97f40036cec5698776ef227db9bcfbb9406e4d793071cc2681ff59e00999ad"],"state_sha256":"dd108362f6980ab68a08e29d479d8c75562cfd0727ce5280f779d784501e5727"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e+LAi0Rb6t+pjG9/dKhjpcyfHVBJ5Fm3dQOBPeN+Nu6LkUGH2x3IRHdYUp9V86Gk3zkO5i8oJvBKJCek48ciCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T23:07:45.149933Z","bundle_sha256":"4bcfea936a6974570606e9c1ad3d82c229c3b4c849304f61e83dff03bc63a247"}}