{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:26TMSH4UFSZ2QGVBHK57UR3XRM","short_pith_number":"pith:26TMSH4U","schema_version":"1.0","canonical_sha256":"d7a6c91f942cb3a81aa13abbfa47778b1d2afa3dfbc4ed3c6fc22a4a87b343e5","source":{"kind":"arxiv","id":"1711.05807","version":2},"attestation_state":"computed","paper":{"title":"Set complexity of construction of a regular polygon","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"math.NT","authors_text":"Eugene Kogan","submitted_at":"2017-11-15T21:06:09Z","abstract_excerpt":"Given a subset of $\\mathbb C$ containing $x,y$, one can add $x + y,\\,x - y,\\,xy$ or (when $y\\ne0$) $x/y$ or any $z$ such that $z^2=x$. Let $p$ be a prime Fermat number. We prove that it is possible to obtain from $\\{1\\}$ a set containing all the $p$-th roots of 1 by $12 p^2$ above operations. This result is different from the standard estimation of complexity of an algorithm computing the $p$-th roots of 1."},"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":"1711.05807","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2017-11-15T21:06:09Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"185ea0be408744a2a3b1126ca683d03a7c30c004db15531a22dfa3f7fe1ae00b","abstract_canon_sha256":"6aa98c68cdd6ee12114d7261dde7d1ec41def90736bd4f5e6c966e61403443ae"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:52.004300Z","signature_b64":"0oyahWdWvXybEz0WYAneqBe2hZAmvEYVmvZH5++8j9TT7wt+WDXs+RA5CcDca7BnLxITA1ar728EuC+0MAgLDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d7a6c91f942cb3a81aa13abbfa47778b1d2afa3dfbc4ed3c6fc22a4a87b343e5","last_reissued_at":"2026-05-18T00:20:52.003757Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:52.003757Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Set complexity of construction of a regular polygon","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"math.NT","authors_text":"Eugene Kogan","submitted_at":"2017-11-15T21:06:09Z","abstract_excerpt":"Given a subset of $\\mathbb C$ containing $x,y$, one can add $x + y,\\,x - y,\\,xy$ or (when $y\\ne0$) $x/y$ or any $z$ such that $z^2=x$. Let $p$ be a prime Fermat number. We prove that it is possible to obtain from $\\{1\\}$ a set containing all the $p$-th roots of 1 by $12 p^2$ above operations. This result is different from the standard estimation of complexity of an algorithm computing the $p$-th roots of 1."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.05807","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":"1711.05807","created_at":"2026-05-18T00:20:52.003829+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.05807v2","created_at":"2026-05-18T00:20:52.003829+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.05807","created_at":"2026-05-18T00:20:52.003829+00:00"},{"alias_kind":"pith_short_12","alias_value":"26TMSH4UFSZ2","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_16","alias_value":"26TMSH4UFSZ2QGVB","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_8","alias_value":"26TMSH4U","created_at":"2026-05-18T12:30:55.937587+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/26TMSH4UFSZ2QGVBHK57UR3XRM","json":"https://pith.science/pith/26TMSH4UFSZ2QGVBHK57UR3XRM.json","graph_json":"https://pith.science/api/pith-number/26TMSH4UFSZ2QGVBHK57UR3XRM/graph.json","events_json":"https://pith.science/api/pith-number/26TMSH4UFSZ2QGVBHK57UR3XRM/events.json","paper":"https://pith.science/paper/26TMSH4U"},"agent_actions":{"view_html":"https://pith.science/pith/26TMSH4UFSZ2QGVBHK57UR3XRM","download_json":"https://pith.science/pith/26TMSH4UFSZ2QGVBHK57UR3XRM.json","view_paper":"https://pith.science/paper/26TMSH4U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.05807&json=true","fetch_graph":"https://pith.science/api/pith-number/26TMSH4UFSZ2QGVBHK57UR3XRM/graph.json","fetch_events":"https://pith.science/api/pith-number/26TMSH4UFSZ2QGVBHK57UR3XRM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/26TMSH4UFSZ2QGVBHK57UR3XRM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/26TMSH4UFSZ2QGVBHK57UR3XRM/action/storage_attestation","attest_author":"https://pith.science/pith/26TMSH4UFSZ2QGVBHK57UR3XRM/action/author_attestation","sign_citation":"https://pith.science/pith/26TMSH4UFSZ2QGVBHK57UR3XRM/action/citation_signature","submit_replication":"https://pith.science/pith/26TMSH4UFSZ2QGVBHK57UR3XRM/action/replication_record"}},"created_at":"2026-05-18T00:20:52.003829+00:00","updated_at":"2026-05-18T00:20:52.003829+00:00"}