{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:GCLO55YQENZYOKWMC2GQISRWIK","short_pith_number":"pith:GCLO55YQ","canonical_record":{"source":{"id":"1403.6241","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-03-25T06:37:55Z","cross_cats_sorted":["math.NA"],"title_canon_sha256":"2c9e5f2a606b1ba50e98ae6ccf80455d7764116a42467d66ad89af5969df404a","abstract_canon_sha256":"f67c90338c4bb83cccb6b1fe02432511fb8a1d89a70c784c10f79912072d75d8"},"schema_version":"1.0"},"canonical_sha256":"3096eef7102373872acc168d044a3642ac119f73700ad45588b9d32db5f73520","source":{"kind":"arxiv","id":"1403.6241","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.6241","created_at":"2026-05-18T02:50:22Z"},{"alias_kind":"arxiv_version","alias_value":"1403.6241v5","created_at":"2026-05-18T02:50:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.6241","created_at":"2026-05-18T02:50:22Z"},{"alias_kind":"pith_short_12","alias_value":"GCLO55YQENZY","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"GCLO55YQENZYOKWM","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"GCLO55YQ","created_at":"2026-05-18T12:28:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:GCLO55YQENZYOKWMC2GQISRWIK","target":"record","payload":{"canonical_record":{"source":{"id":"1403.6241","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-03-25T06:37:55Z","cross_cats_sorted":["math.NA"],"title_canon_sha256":"2c9e5f2a606b1ba50e98ae6ccf80455d7764116a42467d66ad89af5969df404a","abstract_canon_sha256":"f67c90338c4bb83cccb6b1fe02432511fb8a1d89a70c784c10f79912072d75d8"},"schema_version":"1.0"},"canonical_sha256":"3096eef7102373872acc168d044a3642ac119f73700ad45588b9d32db5f73520","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:50:22.634224Z","signature_b64":"54+ky64ADkeMKAeTcOUF73eb5J0iZEkLYaqCTLJqYkAfDhN3uxwJnKhfly2IEEBZKamwiT/kDw0DHS4Kup9yDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3096eef7102373872acc168d044a3642ac119f73700ad45588b9d32db5f73520","last_reissued_at":"2026-05-18T02:50:22.633637Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:50:22.633637Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1403.6241","source_version":5,"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:50:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B6Kb0mgPZv1qopyeTFlcd92+/Qv1RNlPzWxTPUnYLM+A8vMnIH2cGNIIciDtZVFyYd+0c0rab+p4HS9sNefhDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T21:57:41.303559Z"},"content_sha256":"157c9832011fec6f7727ee42315d3c88ef6a97586620b809cf7982c24d34b25b","schema_version":"1.0","event_id":"sha256:157c9832011fec6f7727ee42315d3c88ef6a97586620b809cf7982c24d34b25b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:GCLO55YQENZYOKWMC2GQISRWIK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Theory of Complexity, Condition and Roundoff","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NA"],"primary_cat":"cs.CC","authors_text":"Felipe Cucker","submitted_at":"2014-03-25T06:37:55Z","abstract_excerpt":"We develop a theory of complexity for numerical computations that takes into account the condition of the input data and allows for roundoff in the computations. We follow the lines of the theory developed by Blum, Shub, and Smale for computations over R (which in turn followed those of the classical, discrete, complexity theory as laid down by Cook, Karp, and Levin among others). In particular, we focus on complexity classes of decision problems and paramount among them, on appropriate versions of the classes P, NP and EXP of polynomial, nondeterministic polynomial, and exponential time, resp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.6241","kind":"arxiv","version":5},"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:50:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X7+L+5F/nYFFME1i2VCz7B4nYbGX4JMaW+4Ip7gQ82v+SZ5fiDJT8kJpaDrzo6WVNsujDkwtmlDYKXwsehvfDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T21:57:41.303910Z"},"content_sha256":"0a48166f8ac9b8b5b00e979dc32b458c6a3c6d6aa6e14d4cabfe270f334c5193","schema_version":"1.0","event_id":"sha256:0a48166f8ac9b8b5b00e979dc32b458c6a3c6d6aa6e14d4cabfe270f334c5193"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GCLO55YQENZYOKWMC2GQISRWIK/bundle.json","state_url":"https://pith.science/pith/GCLO55YQENZYOKWMC2GQISRWIK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GCLO55YQENZYOKWMC2GQISRWIK/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-01T21:57:41Z","links":{"resolver":"https://pith.science/pith/GCLO55YQENZYOKWMC2GQISRWIK","bundle":"https://pith.science/pith/GCLO55YQENZYOKWMC2GQISRWIK/bundle.json","state":"https://pith.science/pith/GCLO55YQENZYOKWMC2GQISRWIK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GCLO55YQENZYOKWMC2GQISRWIK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:GCLO55YQENZYOKWMC2GQISRWIK","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":"f67c90338c4bb83cccb6b1fe02432511fb8a1d89a70c784c10f79912072d75d8","cross_cats_sorted":["math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-03-25T06:37:55Z","title_canon_sha256":"2c9e5f2a606b1ba50e98ae6ccf80455d7764116a42467d66ad89af5969df404a"},"schema_version":"1.0","source":{"id":"1403.6241","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.6241","created_at":"2026-05-18T02:50:22Z"},{"alias_kind":"arxiv_version","alias_value":"1403.6241v5","created_at":"2026-05-18T02:50:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.6241","created_at":"2026-05-18T02:50:22Z"},{"alias_kind":"pith_short_12","alias_value":"GCLO55YQENZY","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"GCLO55YQENZYOKWM","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"GCLO55YQ","created_at":"2026-05-18T12:28:30Z"}],"graph_snapshots":[{"event_id":"sha256:0a48166f8ac9b8b5b00e979dc32b458c6a3c6d6aa6e14d4cabfe270f334c5193","target":"graph","created_at":"2026-05-18T02:50: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":"We develop a theory of complexity for numerical computations that takes into account the condition of the input data and allows for roundoff in the computations. We follow the lines of the theory developed by Blum, Shub, and Smale for computations over R (which in turn followed those of the classical, discrete, complexity theory as laid down by Cook, Karp, and Levin among others). In particular, we focus on complexity classes of decision problems and paramount among them, on appropriate versions of the classes P, NP and EXP of polynomial, nondeterministic polynomial, and exponential time, resp","authors_text":"Felipe Cucker","cross_cats":["math.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-03-25T06:37:55Z","title":"A Theory of Complexity, Condition and Roundoff"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.6241","kind":"arxiv","version":5},"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:157c9832011fec6f7727ee42315d3c88ef6a97586620b809cf7982c24d34b25b","target":"record","created_at":"2026-05-18T02:50: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":"f67c90338c4bb83cccb6b1fe02432511fb8a1d89a70c784c10f79912072d75d8","cross_cats_sorted":["math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-03-25T06:37:55Z","title_canon_sha256":"2c9e5f2a606b1ba50e98ae6ccf80455d7764116a42467d66ad89af5969df404a"},"schema_version":"1.0","source":{"id":"1403.6241","kind":"arxiv","version":5}},"canonical_sha256":"3096eef7102373872acc168d044a3642ac119f73700ad45588b9d32db5f73520","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3096eef7102373872acc168d044a3642ac119f73700ad45588b9d32db5f73520","first_computed_at":"2026-05-18T02:50:22.633637Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:50:22.633637Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"54+ky64ADkeMKAeTcOUF73eb5J0iZEkLYaqCTLJqYkAfDhN3uxwJnKhfly2IEEBZKamwiT/kDw0DHS4Kup9yDA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:50:22.634224Z","signed_message":"canonical_sha256_bytes"},"source_id":"1403.6241","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:157c9832011fec6f7727ee42315d3c88ef6a97586620b809cf7982c24d34b25b","sha256:0a48166f8ac9b8b5b00e979dc32b458c6a3c6d6aa6e14d4cabfe270f334c5193"],"state_sha256":"d61b9a189398368d6ac46b09ea7d6db21dd91e1d66e120a35c250129d87a87e0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IhTj48VrX2gjX3PmYMeIhVhlJVfiP/JyANCmv5GvWwtg3fZssnb3rYqv4OqCaiRg+EY7s37ed3v0IRnR6JeeDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T21:57:41.305835Z","bundle_sha256":"04ee63483880d35a6f92607c8890c5266c694ab56ddadb6e9efe5321594a1f60"}}