{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:QKTKVMYZBCBFC3OSFASTDMQTNY","short_pith_number":"pith:QKTKVMYZ","schema_version":"1.0","canonical_sha256":"82a6aab3190882516dd2282531b2136e212552418cfda71af1676f8414d00217","source":{"kind":"arxiv","id":"2407.18006","version":1},"attestation_state":"computed","paper":{"title":"The Existential Theory of the Reals as a Complexity Class: A Compendium","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CG","cs.DS","cs.FL","cs.LO"],"primary_cat":"cs.CC","authors_text":"Jean Cardinal, Marcus Schaefer, Tillmann Miltzow","submitted_at":"2024-07-25T13:02:06Z","abstract_excerpt":"We survey the complexity class $\\exists \\mathbb{R}$, which captures the complexity of deciding the existential theory of the reals. The class $\\exists \\mathbb{R}$ has roots in two different traditions, one based on the Blum-Shub-Smale model of real computation, and the other following work by Mn\\\"{e}v and Shor on the universality of realization spaces of oriented matroids. Over the years the number of problems for which $\\exists \\mathbb{R}$ rather than NP has turned out to be the proper way of measuring their complexity has grown, particularly in the fields of computational geometry, graph dra"},"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":"2407.18006","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2024-07-25T13:02:06Z","cross_cats_sorted":["cs.CG","cs.DS","cs.FL","cs.LO"],"title_canon_sha256":"a55a514151ab9393321dc9f356709cb36064d87c58ca5af36998f856ea7f2525","abstract_canon_sha256":"e372f51c2fad12e974c2ed09441d3d7e20aa44d6ffc7c2df50efa13e9538b8df"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:48:33.008486Z","signature_b64":"msAM/LGtPgmtCktJXWpannQKnFhkd7dy5FcIDmWVqkM3oxUznEP+0YBL43jO6oDkGcEkjbWveH6sNVu1uT3TDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"82a6aab3190882516dd2282531b2136e212552418cfda71af1676f8414d00217","last_reissued_at":"2026-07-05T08:48:33.008007Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:48:33.008007Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Existential Theory of the Reals as a Complexity Class: A Compendium","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CG","cs.DS","cs.FL","cs.LO"],"primary_cat":"cs.CC","authors_text":"Jean Cardinal, Marcus Schaefer, Tillmann Miltzow","submitted_at":"2024-07-25T13:02:06Z","abstract_excerpt":"We survey the complexity class $\\exists \\mathbb{R}$, which captures the complexity of deciding the existential theory of the reals. The class $\\exists \\mathbb{R}$ has roots in two different traditions, one based on the Blum-Shub-Smale model of real computation, and the other following work by Mn\\\"{e}v and Shor on the universality of realization spaces of oriented matroids. Over the years the number of problems for which $\\exists \\mathbb{R}$ rather than NP has turned out to be the proper way of measuring their complexity has grown, particularly in the fields of computational geometry, graph dra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.18006","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2407.18006/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":"2407.18006","created_at":"2026-07-05T08:48:33.008065+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.18006v1","created_at":"2026-07-05T08:48:33.008065+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.18006","created_at":"2026-07-05T08:48:33.008065+00:00"},{"alias_kind":"pith_short_12","alias_value":"QKTKVMYZBCBF","created_at":"2026-07-05T08:48:33.008065+00:00"},{"alias_kind":"pith_short_16","alias_value":"QKTKVMYZBCBFC3OS","created_at":"2026-07-05T08:48:33.008065+00:00"},{"alias_kind":"pith_short_8","alias_value":"QKTKVMYZ","created_at":"2026-07-05T08:48:33.008065+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2603.07094","citing_title":"Randomise Alone, Reach as a Team","ref_index":36,"is_internal_anchor":false},{"citing_arxiv_id":"2605.00917","citing_title":"Tensor Spectral Threshold is $\\exists\\mathbb{R}$-Hard","ref_index":15,"is_internal_anchor":false},{"citing_arxiv_id":"2604.17061","citing_title":"$\\exists\\mathbb{R}$-Completeness of Tensor Degeneracy and a Derandomization Barrier for Hyperdeterminants","ref_index":6,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QKTKVMYZBCBFC3OSFASTDMQTNY","json":"https://pith.science/pith/QKTKVMYZBCBFC3OSFASTDMQTNY.json","graph_json":"https://pith.science/api/pith-number/QKTKVMYZBCBFC3OSFASTDMQTNY/graph.json","events_json":"https://pith.science/api/pith-number/QKTKVMYZBCBFC3OSFASTDMQTNY/events.json","paper":"https://pith.science/paper/QKTKVMYZ"},"agent_actions":{"view_html":"https://pith.science/pith/QKTKVMYZBCBFC3OSFASTDMQTNY","download_json":"https://pith.science/pith/QKTKVMYZBCBFC3OSFASTDMQTNY.json","view_paper":"https://pith.science/paper/QKTKVMYZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.18006&json=true","fetch_graph":"https://pith.science/api/pith-number/QKTKVMYZBCBFC3OSFASTDMQTNY/graph.json","fetch_events":"https://pith.science/api/pith-number/QKTKVMYZBCBFC3OSFASTDMQTNY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QKTKVMYZBCBFC3OSFASTDMQTNY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QKTKVMYZBCBFC3OSFASTDMQTNY/action/storage_attestation","attest_author":"https://pith.science/pith/QKTKVMYZBCBFC3OSFASTDMQTNY/action/author_attestation","sign_citation":"https://pith.science/pith/QKTKVMYZBCBFC3OSFASTDMQTNY/action/citation_signature","submit_replication":"https://pith.science/pith/QKTKVMYZBCBFC3OSFASTDMQTNY/action/replication_record"}},"created_at":"2026-07-05T08:48:33.008065+00:00","updated_at":"2026-07-05T08:48:33.008065+00:00"}