{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:CTWTQWGKWQBBLCMOYUI7GQS7O2","short_pith_number":"pith:CTWTQWGK","schema_version":"1.0","canonical_sha256":"14ed3858cab40215898ec511f3425f76bfade9d099fbb4e08930e634a664158a","source":{"kind":"arxiv","id":"1507.05485","version":3},"attestation_state":"computed","paper":{"title":"A deterministic algorithm to compute approximate roots of polynomial systems in polynomial average time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.NA"],"primary_cat":"math.NA","authors_text":"Pierre Lairez","submitted_at":"2015-07-20T13:20:10Z","abstract_excerpt":"We describe a deterministic algorithm that computes an approximate root of n complex polynomial equations in n unknowns in average polynomial time with respect to the size of the input, in the Blum-Shub-Smale model with square root. It rests upon a derandomization of an algorithm of Beltr\\'an and Pardo and gives a deterministic affirmative answer to Smale's 17th problem. The main idea is to make use of the randomness contained in the input itself."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1507.05485","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-07-20T13:20:10Z","cross_cats_sorted":["cs.CC","cs.NA"],"title_canon_sha256":"ac0c760dc96ab5e3c3dd689ba21f5dc97eccdc43d646ce11adad5a3bd6e3b75b","abstract_canon_sha256":"b44ae6b2182d45f94331c6f7b01c9d6f7dfb4ed063325e0e45e327e3e3b82890"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-04T17:09:24.885334Z","signature_b64":"OaXyYBWMkh+YUK522F4WCDULH3/NNHNwgDg2tESaj7wCOZ7sJqL6tqEDHfwhfj6wFB3vGWhsfrjuw0qnyzoNDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"14ed3858cab40215898ec511f3425f76bfade9d099fbb4e08930e634a664158a","last_reissued_at":"2026-06-04T17:09:24.884771Z","signature_status":"signed_v1","first_computed_at":"2026-06-04T17:09:24.884771Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A deterministic algorithm to compute approximate roots of polynomial systems in polynomial average time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.NA"],"primary_cat":"math.NA","authors_text":"Pierre Lairez","submitted_at":"2015-07-20T13:20:10Z","abstract_excerpt":"We describe a deterministic algorithm that computes an approximate root of n complex polynomial equations in n unknowns in average polynomial time with respect to the size of the input, in the Blum-Shub-Smale model with square root. It rests upon a derandomization of an algorithm of Beltr\\'an and Pardo and gives a deterministic affirmative answer to Smale's 17th problem. The main idea is to make use of the randomness contained in the input itself."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.05485","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1507.05485/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1507.05485","created_at":"2026-06-04T17:09:24.884828+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.05485v3","created_at":"2026-06-04T17:09:24.884828+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.05485","created_at":"2026-06-04T17:09:24.884828+00:00"},{"alias_kind":"pith_short_12","alias_value":"CTWTQWGKWQBB","created_at":"2026-06-04T17:09:24.884828+00:00"},{"alias_kind":"pith_short_16","alias_value":"CTWTQWGKWQBBLCMO","created_at":"2026-06-04T17:09:24.884828+00:00"},{"alias_kind":"pith_short_8","alias_value":"CTWTQWGK","created_at":"2026-06-04T17:09:24.884828+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CTWTQWGKWQBBLCMOYUI7GQS7O2","json":"https://pith.science/pith/CTWTQWGKWQBBLCMOYUI7GQS7O2.json","graph_json":"https://pith.science/api/pith-number/CTWTQWGKWQBBLCMOYUI7GQS7O2/graph.json","events_json":"https://pith.science/api/pith-number/CTWTQWGKWQBBLCMOYUI7GQS7O2/events.json","paper":"https://pith.science/paper/CTWTQWGK"},"agent_actions":{"view_html":"https://pith.science/pith/CTWTQWGKWQBBLCMOYUI7GQS7O2","download_json":"https://pith.science/pith/CTWTQWGKWQBBLCMOYUI7GQS7O2.json","view_paper":"https://pith.science/paper/CTWTQWGK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.05485&json=true","fetch_graph":"https://pith.science/api/pith-number/CTWTQWGKWQBBLCMOYUI7GQS7O2/graph.json","fetch_events":"https://pith.science/api/pith-number/CTWTQWGKWQBBLCMOYUI7GQS7O2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CTWTQWGKWQBBLCMOYUI7GQS7O2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CTWTQWGKWQBBLCMOYUI7GQS7O2/action/storage_attestation","attest_author":"https://pith.science/pith/CTWTQWGKWQBBLCMOYUI7GQS7O2/action/author_attestation","sign_citation":"https://pith.science/pith/CTWTQWGKWQBBLCMOYUI7GQS7O2/action/citation_signature","submit_replication":"https://pith.science/pith/CTWTQWGKWQBBLCMOYUI7GQS7O2/action/replication_record"}},"created_at":"2026-06-04T17:09:24.884828+00:00","updated_at":"2026-06-04T17:09:24.884828+00:00"}