{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:NKDKPRAMMMPHIUNYTUH4UYUEI4","short_pith_number":"pith:NKDKPRAM","schema_version":"1.0","canonical_sha256":"6a86a7c40c631e7451b89d0fca6284473daacfde31a35a453c00e68ca838f32b","source":{"kind":"arxiv","id":"1901.00607","version":1},"attestation_state":"computed","paper":{"title":"Some Observations on Khovanskii's Matrix Methods for extracting Roots of Polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"B. Sury, James Mc Laughlin","submitted_at":"2019-01-03T04:40:17Z","abstract_excerpt":"In this article we apply a formula for the $n$-th power of a $3\\times 3$ matrix (found previously by the authors) to investigate a procedure of Khovanskii's for finding the cube root of a positive integer. We show, for each positive integer $\\alpha$, how to construct certain families of integer sequences such that a certain rational expression, involving the ratio of successive terms in each family, tends to $\\alpha^{1/3}$. We also show how to choose the optimal value of a free parameter to get maximum speed of convergence. We apply a similar method, also due to Khovanskii, to a more general c"},"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":"1901.00607","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2019-01-03T04:40:17Z","cross_cats_sorted":[],"title_canon_sha256":"fbea48bee4f6f3391e4d45fffb43ba53de30c00f935da90c4daca09f4fdb09ac","abstract_canon_sha256":"41303c876106346b66aeaa24eae99394c349e6ddcd214904abebd06087c2709b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:01.937412Z","signature_b64":"xpXgdKRN/9+hjlhMM18lqelP528SD9LHzsyyi/VsLewytjtIhrC3y/CH5qsrg7RXroV9ejMHHjKhLtyh15vqDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6a86a7c40c631e7451b89d0fca6284473daacfde31a35a453c00e68ca838f32b","last_reissued_at":"2026-05-17T23:57:01.936904Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:01.936904Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Some Observations on Khovanskii's Matrix Methods for extracting Roots of Polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"B. Sury, James Mc Laughlin","submitted_at":"2019-01-03T04:40:17Z","abstract_excerpt":"In this article we apply a formula for the $n$-th power of a $3\\times 3$ matrix (found previously by the authors) to investigate a procedure of Khovanskii's for finding the cube root of a positive integer. We show, for each positive integer $\\alpha$, how to construct certain families of integer sequences such that a certain rational expression, involving the ratio of successive terms in each family, tends to $\\alpha^{1/3}$. We also show how to choose the optimal value of a free parameter to get maximum speed of convergence. We apply a similar method, also due to Khovanskii, to a more general c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.00607","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":""},"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":"1901.00607","created_at":"2026-05-17T23:57:01.936986+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.00607v1","created_at":"2026-05-17T23:57:01.936986+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.00607","created_at":"2026-05-17T23:57:01.936986+00:00"},{"alias_kind":"pith_short_12","alias_value":"NKDKPRAMMMPH","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_16","alias_value":"NKDKPRAMMMPHIUNY","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_8","alias_value":"NKDKPRAM","created_at":"2026-05-18T12:33:24.271573+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/NKDKPRAMMMPHIUNYTUH4UYUEI4","json":"https://pith.science/pith/NKDKPRAMMMPHIUNYTUH4UYUEI4.json","graph_json":"https://pith.science/api/pith-number/NKDKPRAMMMPHIUNYTUH4UYUEI4/graph.json","events_json":"https://pith.science/api/pith-number/NKDKPRAMMMPHIUNYTUH4UYUEI4/events.json","paper":"https://pith.science/paper/NKDKPRAM"},"agent_actions":{"view_html":"https://pith.science/pith/NKDKPRAMMMPHIUNYTUH4UYUEI4","download_json":"https://pith.science/pith/NKDKPRAMMMPHIUNYTUH4UYUEI4.json","view_paper":"https://pith.science/paper/NKDKPRAM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.00607&json=true","fetch_graph":"https://pith.science/api/pith-number/NKDKPRAMMMPHIUNYTUH4UYUEI4/graph.json","fetch_events":"https://pith.science/api/pith-number/NKDKPRAMMMPHIUNYTUH4UYUEI4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NKDKPRAMMMPHIUNYTUH4UYUEI4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NKDKPRAMMMPHIUNYTUH4UYUEI4/action/storage_attestation","attest_author":"https://pith.science/pith/NKDKPRAMMMPHIUNYTUH4UYUEI4/action/author_attestation","sign_citation":"https://pith.science/pith/NKDKPRAMMMPHIUNYTUH4UYUEI4/action/citation_signature","submit_replication":"https://pith.science/pith/NKDKPRAMMMPHIUNYTUH4UYUEI4/action/replication_record"}},"created_at":"2026-05-17T23:57:01.936986+00:00","updated_at":"2026-05-17T23:57:01.936986+00:00"}