{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:ZH3CXTY4H6G65BPWQ3NUCRLRAR","short_pith_number":"pith:ZH3CXTY4","schema_version":"1.0","canonical_sha256":"c9f62bcf1c3f8dee85f686db414571047d99850e3e4e088c04ec7a78bd6dabbb","source":{"kind":"arxiv","id":"1708.04713","version":2},"attestation_state":"computed","paper":{"title":"Counting Roots of Polynomials over $\\mathbb{Z}/p^2\\mathbb{Z}$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.SC","math.AC"],"primary_cat":"math.NT","authors_text":"Angela Patini, Jeremy Johnson, Robert M. Walker, Trajan Hammonds","submitted_at":"2017-08-15T22:58:59Z","abstract_excerpt":"Until recently, the only known method of finding the roots of polynomials over prime power rings, other than fields, was brute force. One reason for this is the lack of a division algorithm, obstructing the use of greatest common divisors. Fix a prime $p \\in \\mathbb{Z}$ and $f \\in ( \\mathbb{Z}/p^n \\mathbb{Z} ) [x]$ any nonzero polynomial of degree $d$ whose coefficients are not all divisible by $p$. For the case $n=2$, we prove a new efficient algorithm to count the roots of $f$ in $\\mathbb{Z}/p^2\\mathbb{Z}$ within time polynomial in $(d+\\operatorname{size}(f)+\\log{p})$, and record a concise f"},"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":"1708.04713","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2017-08-15T22:58:59Z","cross_cats_sorted":["cs.CC","cs.SC","math.AC"],"title_canon_sha256":"5636d140516cc3fd3f16e4f2b1c4de78107e8f6cd47d5e02a15a182055ae9541","abstract_canon_sha256":"a0e5d36944edbedd17c115952d9098f50df6d87d20392d28d7ac7ecfda819436"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:09.158189Z","signature_b64":"xg2Swsw0vV2YsG5Pu8sNuywDNj+/Tcga35ZPuzVUB2/zk7+QcriRs1kKde4FTS0X4eckQMeSm2lTSSq8OO+dCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c9f62bcf1c3f8dee85f686db414571047d99850e3e4e088c04ec7a78bd6dabbb","last_reissued_at":"2026-05-18T00:00:09.157656Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:09.157656Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Counting Roots of Polynomials over $\\mathbb{Z}/p^2\\mathbb{Z}$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.SC","math.AC"],"primary_cat":"math.NT","authors_text":"Angela Patini, Jeremy Johnson, Robert M. Walker, Trajan Hammonds","submitted_at":"2017-08-15T22:58:59Z","abstract_excerpt":"Until recently, the only known method of finding the roots of polynomials over prime power rings, other than fields, was brute force. One reason for this is the lack of a division algorithm, obstructing the use of greatest common divisors. Fix a prime $p \\in \\mathbb{Z}$ and $f \\in ( \\mathbb{Z}/p^n \\mathbb{Z} ) [x]$ any nonzero polynomial of degree $d$ whose coefficients are not all divisible by $p$. For the case $n=2$, we prove a new efficient algorithm to count the roots of $f$ in $\\mathbb{Z}/p^2\\mathbb{Z}$ within time polynomial in $(d+\\operatorname{size}(f)+\\log{p})$, and record a concise f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.04713","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":"1708.04713","created_at":"2026-05-18T00:00:09.157746+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.04713v2","created_at":"2026-05-18T00:00:09.157746+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.04713","created_at":"2026-05-18T00:00:09.157746+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZH3CXTY4H6G6","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZH3CXTY4H6G65BPW","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZH3CXTY4","created_at":"2026-05-18T12:31:59.375834+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/ZH3CXTY4H6G65BPWQ3NUCRLRAR","json":"https://pith.science/pith/ZH3CXTY4H6G65BPWQ3NUCRLRAR.json","graph_json":"https://pith.science/api/pith-number/ZH3CXTY4H6G65BPWQ3NUCRLRAR/graph.json","events_json":"https://pith.science/api/pith-number/ZH3CXTY4H6G65BPWQ3NUCRLRAR/events.json","paper":"https://pith.science/paper/ZH3CXTY4"},"agent_actions":{"view_html":"https://pith.science/pith/ZH3CXTY4H6G65BPWQ3NUCRLRAR","download_json":"https://pith.science/pith/ZH3CXTY4H6G65BPWQ3NUCRLRAR.json","view_paper":"https://pith.science/paper/ZH3CXTY4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.04713&json=true","fetch_graph":"https://pith.science/api/pith-number/ZH3CXTY4H6G65BPWQ3NUCRLRAR/graph.json","fetch_events":"https://pith.science/api/pith-number/ZH3CXTY4H6G65BPWQ3NUCRLRAR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZH3CXTY4H6G65BPWQ3NUCRLRAR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZH3CXTY4H6G65BPWQ3NUCRLRAR/action/storage_attestation","attest_author":"https://pith.science/pith/ZH3CXTY4H6G65BPWQ3NUCRLRAR/action/author_attestation","sign_citation":"https://pith.science/pith/ZH3CXTY4H6G65BPWQ3NUCRLRAR/action/citation_signature","submit_replication":"https://pith.science/pith/ZH3CXTY4H6G65BPWQ3NUCRLRAR/action/replication_record"}},"created_at":"2026-05-18T00:00:09.157746+00:00","updated_at":"2026-05-18T00:00:09.157746+00:00"}