{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:IKDHLOGKKGD7NCQE3D4Y4CW4RN","short_pith_number":"pith:IKDHLOGK","schema_version":"1.0","canonical_sha256":"428675b8ca5187f68a04d8f98e0adc8b4d20af1e9861b7f8703b8dcc94f536ac","source":{"kind":"arxiv","id":"2006.04423","version":3},"attestation_state":"computed","paper":{"title":"Condition Numbers for the Cube. I: Univariate Polynomials and Hypersurfaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"cs.CG","authors_text":"Elias Tsigaridas, Josu\\'e Tonelli-Cueto","submitted_at":"2020-06-08T09:09:40Z","abstract_excerpt":"The condition-based complexity analysis framework is one of the gems of modern numerical algebraic geometry and theoretical computer science. Among the challenges that it poses is to expand the currently limited range of random polynomials that we can handle. Despite important recent progress, the available tools cannot handle random sparse polynomials and Gaussian polynomials, that is polynomials whose coefficients are i.i.d. Gaussian random variables.\n  We initiate a condition-based complexity framework based on the norm of the cube that is a step in this direction. We present this framework"},"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":"2006.04423","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2020-06-08T09:09:40Z","cross_cats_sorted":["cs.NA","math.NA"],"title_canon_sha256":"9fb84cf5ca1f8d55de024d25bd2809bf270b0395e656c223fe71785b238defe0","abstract_canon_sha256":"3c2fd8ef52fb774d1fbb447fe21f7addb03cf9a09579e7952177fa555a7f23a3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:00:57.998046Z","signature_b64":"ZhXj6oPBHr91VtNnK6RBq995s4BZFe6k6LD/mhDo6iqJM4Hz2rYG+bpmWTWUBHPMejGopxwuoIFvFbx5k8qiAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"428675b8ca5187f68a04d8f98e0adc8b4d20af1e9861b7f8703b8dcc94f536ac","last_reissued_at":"2026-07-05T05:00:57.997704Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:00:57.997704Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Condition Numbers for the Cube. I: Univariate Polynomials and Hypersurfaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"cs.CG","authors_text":"Elias Tsigaridas, Josu\\'e Tonelli-Cueto","submitted_at":"2020-06-08T09:09:40Z","abstract_excerpt":"The condition-based complexity analysis framework is one of the gems of modern numerical algebraic geometry and theoretical computer science. Among the challenges that it poses is to expand the currently limited range of random polynomials that we can handle. Despite important recent progress, the available tools cannot handle random sparse polynomials and Gaussian polynomials, that is polynomials whose coefficients are i.i.d. Gaussian random variables.\n  We initiate a condition-based complexity framework based on the norm of the cube that is a step in this direction. We present this framework"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.04423","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/2006.04423/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":"2006.04423","created_at":"2026-07-05T05:00:57.997759+00:00"},{"alias_kind":"arxiv_version","alias_value":"2006.04423v3","created_at":"2026-07-05T05:00:57.997759+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.04423","created_at":"2026-07-05T05:00:57.997759+00:00"},{"alias_kind":"pith_short_12","alias_value":"IKDHLOGKKGD7","created_at":"2026-07-05T05:00:57.997759+00:00"},{"alias_kind":"pith_short_16","alias_value":"IKDHLOGKKGD7NCQE","created_at":"2026-07-05T05:00:57.997759+00:00"},{"alias_kind":"pith_short_8","alias_value":"IKDHLOGK","created_at":"2026-07-05T05:00:57.997759+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.04436","citing_title":"Beyond Worst-Case Analysis for Symbolic Computation: Root Isolation Algorithms","ref_index":61,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IKDHLOGKKGD7NCQE3D4Y4CW4RN","json":"https://pith.science/pith/IKDHLOGKKGD7NCQE3D4Y4CW4RN.json","graph_json":"https://pith.science/api/pith-number/IKDHLOGKKGD7NCQE3D4Y4CW4RN/graph.json","events_json":"https://pith.science/api/pith-number/IKDHLOGKKGD7NCQE3D4Y4CW4RN/events.json","paper":"https://pith.science/paper/IKDHLOGK"},"agent_actions":{"view_html":"https://pith.science/pith/IKDHLOGKKGD7NCQE3D4Y4CW4RN","download_json":"https://pith.science/pith/IKDHLOGKKGD7NCQE3D4Y4CW4RN.json","view_paper":"https://pith.science/paper/IKDHLOGK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2006.04423&json=true","fetch_graph":"https://pith.science/api/pith-number/IKDHLOGKKGD7NCQE3D4Y4CW4RN/graph.json","fetch_events":"https://pith.science/api/pith-number/IKDHLOGKKGD7NCQE3D4Y4CW4RN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IKDHLOGKKGD7NCQE3D4Y4CW4RN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IKDHLOGKKGD7NCQE3D4Y4CW4RN/action/storage_attestation","attest_author":"https://pith.science/pith/IKDHLOGKKGD7NCQE3D4Y4CW4RN/action/author_attestation","sign_citation":"https://pith.science/pith/IKDHLOGKKGD7NCQE3D4Y4CW4RN/action/citation_signature","submit_replication":"https://pith.science/pith/IKDHLOGKKGD7NCQE3D4Y4CW4RN/action/replication_record"}},"created_at":"2026-07-05T05:00:57.997759+00:00","updated_at":"2026-07-05T05:00:57.997759+00:00"}