{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:EQI7V3T5UP4TPEMGGG4YQYZGTR","short_pith_number":"pith:EQI7V3T5","schema_version":"1.0","canonical_sha256":"2411faee7da3f937918631b98863269c406d345a2f5fbcdd62b0fcdd20d00bc9","source":{"kind":"arxiv","id":"1710.06502","version":2},"attestation_state":"computed","paper":{"title":"Cup length as a bound on topological complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.AT","authors_text":"parth sarin","submitted_at":"2017-10-17T21:04:04Z","abstract_excerpt":"Polynomial solving algorithms are essential to applied mathematics and the sciences. As such, reduction of their complexity has become an incredibly important field of topological research. We present a topological approach to constructing a lower bound for the complexity of a polynomial-solving algorithm, and give a concrete algorithm to do this in the case that $\\mathrm{deg}(f) = 2,3,4$."},"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":"1710.06502","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AT","submitted_at":"2017-10-17T21:04:04Z","cross_cats_sorted":[],"title_canon_sha256":"34a0808bb28f4747e60702eddeb20d2370a1eee4bd7df936884fed09309c3ed8","abstract_canon_sha256":"360bc8753ef6bbcd2894e53d4ea5b6dbd0947ae750a354420589af247e986775"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:32:20.018873Z","signature_b64":"KqoULgDwOvMXJ6JoO/jo/OiEg0rsa7opBVWsY6eesjj3a417hAdpBG8cvxbAmVOEOX85ptjIAVe/4xFQtfclBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2411faee7da3f937918631b98863269c406d345a2f5fbcdd62b0fcdd20d00bc9","last_reissued_at":"2026-05-18T00:32:20.018340Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:32:20.018340Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cup length as a bound on topological complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.AT","authors_text":"parth sarin","submitted_at":"2017-10-17T21:04:04Z","abstract_excerpt":"Polynomial solving algorithms are essential to applied mathematics and the sciences. As such, reduction of their complexity has become an incredibly important field of topological research. We present a topological approach to constructing a lower bound for the complexity of a polynomial-solving algorithm, and give a concrete algorithm to do this in the case that $\\mathrm{deg}(f) = 2,3,4$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.06502","kind":"arxiv","version":2},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1710.06502","created_at":"2026-05-18T00:32:20.018426+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.06502v2","created_at":"2026-05-18T00:32:20.018426+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.06502","created_at":"2026-05-18T00:32:20.018426+00:00"},{"alias_kind":"pith_short_12","alias_value":"EQI7V3T5UP4T","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_16","alias_value":"EQI7V3T5UP4TPEMG","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_8","alias_value":"EQI7V3T5","created_at":"2026-05-18T12:31:12.930513+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/EQI7V3T5UP4TPEMGGG4YQYZGTR","json":"https://pith.science/pith/EQI7V3T5UP4TPEMGGG4YQYZGTR.json","graph_json":"https://pith.science/api/pith-number/EQI7V3T5UP4TPEMGGG4YQYZGTR/graph.json","events_json":"https://pith.science/api/pith-number/EQI7V3T5UP4TPEMGGG4YQYZGTR/events.json","paper":"https://pith.science/paper/EQI7V3T5"},"agent_actions":{"view_html":"https://pith.science/pith/EQI7V3T5UP4TPEMGGG4YQYZGTR","download_json":"https://pith.science/pith/EQI7V3T5UP4TPEMGGG4YQYZGTR.json","view_paper":"https://pith.science/paper/EQI7V3T5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.06502&json=true","fetch_graph":"https://pith.science/api/pith-number/EQI7V3T5UP4TPEMGGG4YQYZGTR/graph.json","fetch_events":"https://pith.science/api/pith-number/EQI7V3T5UP4TPEMGGG4YQYZGTR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EQI7V3T5UP4TPEMGGG4YQYZGTR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EQI7V3T5UP4TPEMGGG4YQYZGTR/action/storage_attestation","attest_author":"https://pith.science/pith/EQI7V3T5UP4TPEMGGG4YQYZGTR/action/author_attestation","sign_citation":"https://pith.science/pith/EQI7V3T5UP4TPEMGGG4YQYZGTR/action/citation_signature","submit_replication":"https://pith.science/pith/EQI7V3T5UP4TPEMGGG4YQYZGTR/action/replication_record"}},"created_at":"2026-05-18T00:32:20.018426+00:00","updated_at":"2026-05-18T00:32:20.018426+00:00"}