{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:3SGBGXNYTYLYJBXHCHFBIVVNJN","short_pith_number":"pith:3SGBGXNY","canonical_record":{"source":{"id":"1607.06344","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-07-21T14:38:38Z","cross_cats_sorted":[],"title_canon_sha256":"036b9ba8728f841fe65e8cea15ff1cc42ef2876bdd2ec54870b7a2c4e5ad2a0d","abstract_canon_sha256":"d793956789303bb0325964ddc2e4264523dfdfeb318ba4dfcad816f9f83f2606"},"schema_version":"1.0"},"canonical_sha256":"dc8c135db89e178486e711ca1456ad4b680158c378fa417098ca711ce2905371","source":{"kind":"arxiv","id":"1607.06344","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.06344","created_at":"2026-05-18T00:34:15Z"},{"alias_kind":"arxiv_version","alias_value":"1607.06344v3","created_at":"2026-05-18T00:34:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.06344","created_at":"2026-05-18T00:34:15Z"},{"alias_kind":"pith_short_12","alias_value":"3SGBGXNYTYLY","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"3SGBGXNYTYLYJBXH","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"3SGBGXNY","created_at":"2026-05-18T12:29:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:3SGBGXNYTYLYJBXHCHFBIVVNJN","target":"record","payload":{"canonical_record":{"source":{"id":"1607.06344","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-07-21T14:38:38Z","cross_cats_sorted":[],"title_canon_sha256":"036b9ba8728f841fe65e8cea15ff1cc42ef2876bdd2ec54870b7a2c4e5ad2a0d","abstract_canon_sha256":"d793956789303bb0325964ddc2e4264523dfdfeb318ba4dfcad816f9f83f2606"},"schema_version":"1.0"},"canonical_sha256":"dc8c135db89e178486e711ca1456ad4b680158c378fa417098ca711ce2905371","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:15.862490Z","signature_b64":"282aQKxVi5HVh0jC5I7AYIO2guqoZTZQLKyaUSvcUTdp8VLqeOVuL5MZJhvO1nvZ/1NLzzKQaPpkomg5J/2IAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dc8c135db89e178486e711ca1456ad4b680158c378fa417098ca711ce2905371","last_reissued_at":"2026-05-18T00:34:15.861821Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:15.861821Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.06344","source_version":3,"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:34:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TgvblcePMv6wA0DdkpjSDB2tJhQARh4EEXKb66rtNXgLhpaP45GkeL9PnxKg8+H+GQ+Ds1pQs8YtKMoyJGHrDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T21:06:57.840089Z"},"content_sha256":"5b4f9970300a18a4bfe3c1cdf4a4a5bcee735820b15b7efe89d58ceb79eac852","schema_version":"1.0","event_id":"sha256:5b4f9970300a18a4bfe3c1cdf4a4a5bcee735820b15b7efe89d58ceb79eac852"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:3SGBGXNYTYLYJBXHCHFBIVVNJN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Solving equations and optimization problems with uncertainty","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Hubert Wagner, Marek Kr\\v{c}\\'al, Peter Franek","submitted_at":"2016-07-21T14:38:38Z","abstract_excerpt":"We study the problem of detecting zeros of continuous functions that are known only up to an error bound, extending the earlier theoretical work with explicit algorithms and experiments with an implementation. More formally, the robustness of zero of a continuous map $f: X\\to \\mathbb{R}^n$ is the maximal $r>0$ such that each $g:X\\to\\mathbb{R}^n$ with $\\|f-g\\|_\\infty\\le r$ has a zero. We develop and implement an efficient algorithm approximating the robustness of zero. Further, we show how to use the algorithm for approximating worst-case optima in optimization problems in which the feasible do"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.06344","kind":"arxiv","version":3},"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:34:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yru+92Z1Qr7ncoyPSeG1TRA8Mgvh8EN2aWYBN1xr0TVE/59+wwHxJQ/JPcwvVjRcCQuru3bv4yL4mAe69u6QCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T21:06:57.840751Z"},"content_sha256":"2da6110c216db2f7d17c86b1a8fecfdacfda8898cbbd98e10b4c4f75fb3205b4","schema_version":"1.0","event_id":"sha256:2da6110c216db2f7d17c86b1a8fecfdacfda8898cbbd98e10b4c4f75fb3205b4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3SGBGXNYTYLYJBXHCHFBIVVNJN/bundle.json","state_url":"https://pith.science/pith/3SGBGXNYTYLYJBXHCHFBIVVNJN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3SGBGXNYTYLYJBXHCHFBIVVNJN/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-06T21:06:57Z","links":{"resolver":"https://pith.science/pith/3SGBGXNYTYLYJBXHCHFBIVVNJN","bundle":"https://pith.science/pith/3SGBGXNYTYLYJBXHCHFBIVVNJN/bundle.json","state":"https://pith.science/pith/3SGBGXNYTYLYJBXHCHFBIVVNJN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3SGBGXNYTYLYJBXHCHFBIVVNJN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:3SGBGXNYTYLYJBXHCHFBIVVNJN","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":"d793956789303bb0325964ddc2e4264523dfdfeb318ba4dfcad816f9f83f2606","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-07-21T14:38:38Z","title_canon_sha256":"036b9ba8728f841fe65e8cea15ff1cc42ef2876bdd2ec54870b7a2c4e5ad2a0d"},"schema_version":"1.0","source":{"id":"1607.06344","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.06344","created_at":"2026-05-18T00:34:15Z"},{"alias_kind":"arxiv_version","alias_value":"1607.06344v3","created_at":"2026-05-18T00:34:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.06344","created_at":"2026-05-18T00:34:15Z"},{"alias_kind":"pith_short_12","alias_value":"3SGBGXNYTYLY","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"3SGBGXNYTYLYJBXH","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"3SGBGXNY","created_at":"2026-05-18T12:29:58Z"}],"graph_snapshots":[{"event_id":"sha256:2da6110c216db2f7d17c86b1a8fecfdacfda8898cbbd98e10b4c4f75fb3205b4","target":"graph","created_at":"2026-05-18T00:34:15Z","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 study the problem of detecting zeros of continuous functions that are known only up to an error bound, extending the earlier theoretical work with explicit algorithms and experiments with an implementation. More formally, the robustness of zero of a continuous map $f: X\\to \\mathbb{R}^n$ is the maximal $r>0$ such that each $g:X\\to\\mathbb{R}^n$ with $\\|f-g\\|_\\infty\\le r$ has a zero. We develop and implement an efficient algorithm approximating the robustness of zero. Further, we show how to use the algorithm for approximating worst-case optima in optimization problems in which the feasible do","authors_text":"Hubert Wagner, Marek Kr\\v{c}\\'al, Peter Franek","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-07-21T14:38:38Z","title":"Solving equations and optimization problems with uncertainty"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.06344","kind":"arxiv","version":3},"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:5b4f9970300a18a4bfe3c1cdf4a4a5bcee735820b15b7efe89d58ceb79eac852","target":"record","created_at":"2026-05-18T00:34:15Z","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":"d793956789303bb0325964ddc2e4264523dfdfeb318ba4dfcad816f9f83f2606","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-07-21T14:38:38Z","title_canon_sha256":"036b9ba8728f841fe65e8cea15ff1cc42ef2876bdd2ec54870b7a2c4e5ad2a0d"},"schema_version":"1.0","source":{"id":"1607.06344","kind":"arxiv","version":3}},"canonical_sha256":"dc8c135db89e178486e711ca1456ad4b680158c378fa417098ca711ce2905371","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dc8c135db89e178486e711ca1456ad4b680158c378fa417098ca711ce2905371","first_computed_at":"2026-05-18T00:34:15.861821Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:34:15.861821Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"282aQKxVi5HVh0jC5I7AYIO2guqoZTZQLKyaUSvcUTdp8VLqeOVuL5MZJhvO1nvZ/1NLzzKQaPpkomg5J/2IAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:34:15.862490Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.06344","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5b4f9970300a18a4bfe3c1cdf4a4a5bcee735820b15b7efe89d58ceb79eac852","sha256:2da6110c216db2f7d17c86b1a8fecfdacfda8898cbbd98e10b4c4f75fb3205b4"],"state_sha256":"c01497a90f35411cec16714a5c525b8deb2f462f4b387e2ebb769b0a980ed94c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LzNh7+DU2yXv7lGTmK8whMVOHvCiB0cEGpdRsYdCTXOw0+9gH0QLvPY/VKH61CzvWTxg9KFcH0EF8/hJSkSeCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T21:06:57.844570Z","bundle_sha256":"e94435b800b6922e5aae68bada61413c294eda403cc3617186957fb58e01da1b"}}