{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:345DFJTPPHMVPZCIQNXCQXZ6SP","short_pith_number":"pith:345DFJTP","canonical_record":{"source":{"id":"1507.03896","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-07-14T15:42:16Z","cross_cats_sorted":[],"title_canon_sha256":"05df285b9d036c713ad2d7a6f43d111d23f9d7b0c35f3fe5e40db1c1732232e2","abstract_canon_sha256":"fa8b26875319a2968282b86273a5257ad67611c9ff8468c92b8f8ec8a7b49a35"},"schema_version":"1.0"},"canonical_sha256":"df3a32a66f79d957e448836e285f3e93d3994618a2fb90ce8a390b2ce66519a8","source":{"kind":"arxiv","id":"1507.03896","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.03896","created_at":"2026-05-18T01:36:52Z"},{"alias_kind":"arxiv_version","alias_value":"1507.03896v1","created_at":"2026-05-18T01:36:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.03896","created_at":"2026-05-18T01:36:52Z"},{"alias_kind":"pith_short_12","alias_value":"345DFJTPPHMV","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"345DFJTPPHMVPZCI","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"345DFJTP","created_at":"2026-05-18T12:29:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:345DFJTPPHMVPZCIQNXCQXZ6SP","target":"record","payload":{"canonical_record":{"source":{"id":"1507.03896","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-07-14T15:42:16Z","cross_cats_sorted":[],"title_canon_sha256":"05df285b9d036c713ad2d7a6f43d111d23f9d7b0c35f3fe5e40db1c1732232e2","abstract_canon_sha256":"fa8b26875319a2968282b86273a5257ad67611c9ff8468c92b8f8ec8a7b49a35"},"schema_version":"1.0"},"canonical_sha256":"df3a32a66f79d957e448836e285f3e93d3994618a2fb90ce8a390b2ce66519a8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:52.274894Z","signature_b64":"xDcg/kkhsUVSmPY9559IC2QNhKeUQHjd/uXq5zhF6UMZJNUzHOpgJW46Y0E2EEGtX9P0+CEHf2ohvRylm1bgAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"df3a32a66f79d957e448836e285f3e93d3994618a2fb90ce8a390b2ce66519a8","last_reissued_at":"2026-05-18T01:36:52.274189Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:52.274189Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.03896","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-18T01:36:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WFsdt2Vj9Z3C5rWYHeG0HL+OlJ0xR+RdlJ0U8fEXZvWrREBTa+KK+aHgmM2Gky831BqVnRo9wqketTwrK5DPBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T14:27:16.406654Z"},"content_sha256":"9d6908af02f50f3a9cf12da44cc7cc273ae1e2bafdc8bc726215783d6cb66297","schema_version":"1.0","event_id":"sha256:9d6908af02f50f3a9cf12da44cc7cc273ae1e2bafdc8bc726215783d6cb66297"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:345DFJTPPHMVPZCIQNXCQXZ6SP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Condition length and complexity for the solution of polynomial systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Carlos Beltr\\'an, Diego Armentano, Felipe Cucker, Michael Shub, Peter B\\\"urgisser","submitted_at":"2015-07-14T15:42:16Z","abstract_excerpt":"Smale's 17th problem asks for an algorithm which finds an approximate zero of polynomial systems in average polynomial time (see Smale 2000). The main progress on Smale's problem is Beltr\\'an-Pardo (2011) and B\\\"urgisser-Cucker (2010). In this paper we will improve on both approaches and we prove an important intermediate result. Our main results are Theorem 1 on the complexity of a randomized algorithm which improves the result of Beltr\\'an-Pardo (2011), Theorem 2 on the average of the condition number of polynomial systems which improves the estimate found in B\\\"urgisser-Cucker (2010), and T"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.03896","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-18T01:36:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JoBQrbKQ/J1vdIT+n5IgBCGieJ54PG6HqNZiyC6eThbQpWvOvPSAbGVovaVkOuW1kFaKmwF+RFO+6UAD0DnVBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T14:27:16.407484Z"},"content_sha256":"0ad45c7b85d5d7954906e1b6a63949ba681385d6a6dc831023004568dd6726f6","schema_version":"1.0","event_id":"sha256:0ad45c7b85d5d7954906e1b6a63949ba681385d6a6dc831023004568dd6726f6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/345DFJTPPHMVPZCIQNXCQXZ6SP/bundle.json","state_url":"https://pith.science/pith/345DFJTPPHMVPZCIQNXCQXZ6SP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/345DFJTPPHMVPZCIQNXCQXZ6SP/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-05-31T14:27:16Z","links":{"resolver":"https://pith.science/pith/345DFJTPPHMVPZCIQNXCQXZ6SP","bundle":"https://pith.science/pith/345DFJTPPHMVPZCIQNXCQXZ6SP/bundle.json","state":"https://pith.science/pith/345DFJTPPHMVPZCIQNXCQXZ6SP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/345DFJTPPHMVPZCIQNXCQXZ6SP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:345DFJTPPHMVPZCIQNXCQXZ6SP","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":"fa8b26875319a2968282b86273a5257ad67611c9ff8468c92b8f8ec8a7b49a35","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-07-14T15:42:16Z","title_canon_sha256":"05df285b9d036c713ad2d7a6f43d111d23f9d7b0c35f3fe5e40db1c1732232e2"},"schema_version":"1.0","source":{"id":"1507.03896","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.03896","created_at":"2026-05-18T01:36:52Z"},{"alias_kind":"arxiv_version","alias_value":"1507.03896v1","created_at":"2026-05-18T01:36:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.03896","created_at":"2026-05-18T01:36:52Z"},{"alias_kind":"pith_short_12","alias_value":"345DFJTPPHMV","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"345DFJTPPHMVPZCI","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"345DFJTP","created_at":"2026-05-18T12:29:02Z"}],"graph_snapshots":[{"event_id":"sha256:0ad45c7b85d5d7954906e1b6a63949ba681385d6a6dc831023004568dd6726f6","target":"graph","created_at":"2026-05-18T01:36:52Z","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":"Smale's 17th problem asks for an algorithm which finds an approximate zero of polynomial systems in average polynomial time (see Smale 2000). The main progress on Smale's problem is Beltr\\'an-Pardo (2011) and B\\\"urgisser-Cucker (2010). In this paper we will improve on both approaches and we prove an important intermediate result. Our main results are Theorem 1 on the complexity of a randomized algorithm which improves the result of Beltr\\'an-Pardo (2011), Theorem 2 on the average of the condition number of polynomial systems which improves the estimate found in B\\\"urgisser-Cucker (2010), and T","authors_text":"Carlos Beltr\\'an, Diego Armentano, Felipe Cucker, Michael Shub, Peter B\\\"urgisser","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-07-14T15:42:16Z","title":"Condition length and complexity for the solution of polynomial systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.03896","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:9d6908af02f50f3a9cf12da44cc7cc273ae1e2bafdc8bc726215783d6cb66297","target":"record","created_at":"2026-05-18T01:36:52Z","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":"fa8b26875319a2968282b86273a5257ad67611c9ff8468c92b8f8ec8a7b49a35","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-07-14T15:42:16Z","title_canon_sha256":"05df285b9d036c713ad2d7a6f43d111d23f9d7b0c35f3fe5e40db1c1732232e2"},"schema_version":"1.0","source":{"id":"1507.03896","kind":"arxiv","version":1}},"canonical_sha256":"df3a32a66f79d957e448836e285f3e93d3994618a2fb90ce8a390b2ce66519a8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"df3a32a66f79d957e448836e285f3e93d3994618a2fb90ce8a390b2ce66519a8","first_computed_at":"2026-05-18T01:36:52.274189Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:36:52.274189Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xDcg/kkhsUVSmPY9559IC2QNhKeUQHjd/uXq5zhF6UMZJNUzHOpgJW46Y0E2EEGtX9P0+CEHf2ohvRylm1bgAA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:36:52.274894Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.03896","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9d6908af02f50f3a9cf12da44cc7cc273ae1e2bafdc8bc726215783d6cb66297","sha256:0ad45c7b85d5d7954906e1b6a63949ba681385d6a6dc831023004568dd6726f6"],"state_sha256":"945a6949506724848003d0df48b261823b18507ba8d60381636d5c4afb00f371"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OKPHuDs4YSDrkWz5sFSkTpZrskxJkjBfmTosJq+YSDs+5zZO63hkDIv6nEkBD3axE7v2d/livKIJWIwokDduAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T14:27:16.412441Z","bundle_sha256":"0c32bb29d332df33ac28934a81683036b33ac55965e74f99e39e925d068eaa85"}}