{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:PI62IFLXAP6YNN2RTUISKYCLYQ","short_pith_number":"pith:PI62IFLX","schema_version":"1.0","canonical_sha256":"7a3da4157703fd86b7519d1125604bc41c45db7e179d8ac1606e7c2d607bbe66","source":{"kind":"arxiv","id":"1111.2985","version":1},"attestation_state":"computed","paper":{"title":"A method for recursively generating sequential rational approximations to $\\sqrt[n]{k}$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.DS","authors_text":"Joe Nance","submitted_at":"2011-11-13T03:23:33Z","abstract_excerpt":"The goal of this paper is to derive a simple recursion that generates a sequence of fractions approximating $\\sqrt[n]{k}$ with increasing accuracy. The recursion is defined in terms of a series of first-order non-linear difference equations and then analyzed as a discrete dynamical system. Convergence behavior is then discussed in the language of initial trajectories and eigenvectors, effectively proving convergence without notions from standard analysis of infinitesimals."},"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":"1111.2985","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2011-11-13T03:23:33Z","cross_cats_sorted":[],"title_canon_sha256":"59d8e8643fa955d0becf88bc14ffc538c48145f581632f403cea7fdaea21d278","abstract_canon_sha256":"5eea16029ea2fb556c55742388eaeb37fb8d536e6fb21399206e9f6f1caed0d2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:08:23.340854Z","signature_b64":"GC19LnRivVj0lc28Hu1E6rHGq4hOeDfj7hZs9sJ7tQRl41DGFKoAtRnrBkl9GuyUTKiYjFrdZRZUf0R+tCkwBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7a3da4157703fd86b7519d1125604bc41c45db7e179d8ac1606e7c2d607bbe66","last_reissued_at":"2026-05-18T04:08:23.340323Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:08:23.340323Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A method for recursively generating sequential rational approximations to $\\sqrt[n]{k}$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.DS","authors_text":"Joe Nance","submitted_at":"2011-11-13T03:23:33Z","abstract_excerpt":"The goal of this paper is to derive a simple recursion that generates a sequence of fractions approximating $\\sqrt[n]{k}$ with increasing accuracy. The recursion is defined in terms of a series of first-order non-linear difference equations and then analyzed as a discrete dynamical system. Convergence behavior is then discussed in the language of initial trajectories and eigenvectors, effectively proving convergence without notions from standard analysis of infinitesimals."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.2985","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":"1111.2985","created_at":"2026-05-18T04:08:23.340404+00:00"},{"alias_kind":"arxiv_version","alias_value":"1111.2985v1","created_at":"2026-05-18T04:08:23.340404+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.2985","created_at":"2026-05-18T04:08:23.340404+00:00"},{"alias_kind":"pith_short_12","alias_value":"PI62IFLXAP6Y","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_16","alias_value":"PI62IFLXAP6YNN2R","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_8","alias_value":"PI62IFLX","created_at":"2026-05-18T12:26:39.201973+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/PI62IFLXAP6YNN2RTUISKYCLYQ","json":"https://pith.science/pith/PI62IFLXAP6YNN2RTUISKYCLYQ.json","graph_json":"https://pith.science/api/pith-number/PI62IFLXAP6YNN2RTUISKYCLYQ/graph.json","events_json":"https://pith.science/api/pith-number/PI62IFLXAP6YNN2RTUISKYCLYQ/events.json","paper":"https://pith.science/paper/PI62IFLX"},"agent_actions":{"view_html":"https://pith.science/pith/PI62IFLXAP6YNN2RTUISKYCLYQ","download_json":"https://pith.science/pith/PI62IFLXAP6YNN2RTUISKYCLYQ.json","view_paper":"https://pith.science/paper/PI62IFLX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1111.2985&json=true","fetch_graph":"https://pith.science/api/pith-number/PI62IFLXAP6YNN2RTUISKYCLYQ/graph.json","fetch_events":"https://pith.science/api/pith-number/PI62IFLXAP6YNN2RTUISKYCLYQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PI62IFLXAP6YNN2RTUISKYCLYQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PI62IFLXAP6YNN2RTUISKYCLYQ/action/storage_attestation","attest_author":"https://pith.science/pith/PI62IFLXAP6YNN2RTUISKYCLYQ/action/author_attestation","sign_citation":"https://pith.science/pith/PI62IFLXAP6YNN2RTUISKYCLYQ/action/citation_signature","submit_replication":"https://pith.science/pith/PI62IFLXAP6YNN2RTUISKYCLYQ/action/replication_record"}},"created_at":"2026-05-18T04:08:23.340404+00:00","updated_at":"2026-05-18T04:08:23.340404+00:00"}