{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:7AZPZIDZXHEC5VHBO6ZFDLQA4U","short_pith_number":"pith:7AZPZIDZ","schema_version":"1.0","canonical_sha256":"f832fca079b9c82ed4e177b251ae00e53e31447a2649a166b082a03b90550865","source":{"kind":"arxiv","id":"1808.10531","version":2},"attestation_state":"computed","paper":{"title":"Randomized Polynomial-Time Root Counting in Prime Power Rings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.SC"],"primary_cat":"math.NT","authors_text":"J. Maurice Rojas, Leann Kopp, Natalie Randall, Yuyu Zhu","submitted_at":"2018-08-30T21:50:17Z","abstract_excerpt":"Suppose $k,p\\!\\in\\!\\mathbb{N}$ with $p$ prime and $f\\!\\in\\!\\mathbb{Z}[x]$ is a univariate polynomial with degree $d$ and all coefficients having absolute value less than $p^k$. We give a Las Vegas randomized algorithm that computes the number of roots of $f$ in $\\mathbb{Z}/\\!\\left(p^k\\right)$ within time $d^3(k\\log p)^{2+o(1)}$. (We in fact prove a more intricate complexity bound that is slightly better.) The best previous general algorithm had (deterministic) complexity exponential in $k$. We also present some experimental data evincing the potential practicality of our algorithm."},"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":"1808.10531","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2018-08-30T21:50:17Z","cross_cats_sorted":["cs.CC","cs.SC"],"title_canon_sha256":"805ac09ccc0f104b156effc19bf54a1357551a999cb41b0266b8ffcbd7c8d7ac","abstract_canon_sha256":"7a86928ced4649c809e763baf634171a7dee9573f9f8634c2efd5d0fff1d6ff8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:57.534399Z","signature_b64":"gQwuWn5ditglW9CaUxQ+xpa3tb2CeY1awklZKyBN57raZ39ZC12nYiUDsIhm+SE1aL5vfFhYF2Pj/uE5yyAOCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f832fca079b9c82ed4e177b251ae00e53e31447a2649a166b082a03b90550865","last_reissued_at":"2026-05-17T23:53:57.533709Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:57.533709Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Randomized Polynomial-Time Root Counting in Prime Power Rings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.SC"],"primary_cat":"math.NT","authors_text":"J. Maurice Rojas, Leann Kopp, Natalie Randall, Yuyu Zhu","submitted_at":"2018-08-30T21:50:17Z","abstract_excerpt":"Suppose $k,p\\!\\in\\!\\mathbb{N}$ with $p$ prime and $f\\!\\in\\!\\mathbb{Z}[x]$ is a univariate polynomial with degree $d$ and all coefficients having absolute value less than $p^k$. We give a Las Vegas randomized algorithm that computes the number of roots of $f$ in $\\mathbb{Z}/\\!\\left(p^k\\right)$ within time $d^3(k\\log p)^{2+o(1)}$. (We in fact prove a more intricate complexity bound that is slightly better.) The best previous general algorithm had (deterministic) complexity exponential in $k$. We also present some experimental data evincing the potential practicality of our algorithm."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.10531","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":"1808.10531","created_at":"2026-05-17T23:53:57.533829+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.10531v2","created_at":"2026-05-17T23:53:57.533829+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.10531","created_at":"2026-05-17T23:53:57.533829+00:00"},{"alias_kind":"pith_short_12","alias_value":"7AZPZIDZXHEC","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_16","alias_value":"7AZPZIDZXHEC5VHB","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_8","alias_value":"7AZPZIDZ","created_at":"2026-05-18T12:32:11.075285+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/7AZPZIDZXHEC5VHBO6ZFDLQA4U","json":"https://pith.science/pith/7AZPZIDZXHEC5VHBO6ZFDLQA4U.json","graph_json":"https://pith.science/api/pith-number/7AZPZIDZXHEC5VHBO6ZFDLQA4U/graph.json","events_json":"https://pith.science/api/pith-number/7AZPZIDZXHEC5VHBO6ZFDLQA4U/events.json","paper":"https://pith.science/paper/7AZPZIDZ"},"agent_actions":{"view_html":"https://pith.science/pith/7AZPZIDZXHEC5VHBO6ZFDLQA4U","download_json":"https://pith.science/pith/7AZPZIDZXHEC5VHBO6ZFDLQA4U.json","view_paper":"https://pith.science/paper/7AZPZIDZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.10531&json=true","fetch_graph":"https://pith.science/api/pith-number/7AZPZIDZXHEC5VHBO6ZFDLQA4U/graph.json","fetch_events":"https://pith.science/api/pith-number/7AZPZIDZXHEC5VHBO6ZFDLQA4U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7AZPZIDZXHEC5VHBO6ZFDLQA4U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7AZPZIDZXHEC5VHBO6ZFDLQA4U/action/storage_attestation","attest_author":"https://pith.science/pith/7AZPZIDZXHEC5VHBO6ZFDLQA4U/action/author_attestation","sign_citation":"https://pith.science/pith/7AZPZIDZXHEC5VHBO6ZFDLQA4U/action/citation_signature","submit_replication":"https://pith.science/pith/7AZPZIDZXHEC5VHBO6ZFDLQA4U/action/replication_record"}},"created_at":"2026-05-17T23:53:57.533829+00:00","updated_at":"2026-05-17T23:53:57.533829+00:00"}