{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:7LLL7FVSEGH7ZRFNB3CR3FSKZP","short_pith_number":"pith:7LLL7FVS","schema_version":"1.0","canonical_sha256":"fad6bf96b2218ffcc4ad0ec51d964acbda860732059fe5dfe2c55cac81a197e0","source":{"kind":"arxiv","id":"0901.3393","version":5},"attestation_state":"computed","paper":{"title":"Ultrametric Root Counting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"math.AG","authors_text":"Ashraf Ibrahim, Martin Avendano","submitted_at":"2009-01-22T02:32:56Z","abstract_excerpt":"Let $K$ be a complete non-archimedean field with a discrete valuation, $f\\in K[X]$ a polynomial with non-vanishing discriminant, $A$ the valuation ring of $K$, and $\\M$ the maximal ideal of $A$. The first main result of this paper is a reformulation of Hensel's lemma that connects the number of roots of $f$ with the number of roots of its reduction modulo a power of $\\M$. We then define a condition --- {\\em regularity} --- that yields a simple method to compute the exact number of roots of $f$ in $K$. In particular, we show that regularity implies that the number of roots of $f$ equals the sum"},"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":"0901.3393","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AG","submitted_at":"2009-01-22T02:32:56Z","cross_cats_sorted":["math.NT"],"title_canon_sha256":"472387b4a789f1d3c51f4ca32d25b666d1addc0608ddb5a2f85e4cea045f6e03","abstract_canon_sha256":"f3a0b4914d72190b26c3f2b2b2d0815fb7eb0dbaed408408582e6f01ff330ed7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:41:35.100728Z","signature_b64":"VOSb83DecUwt6l5bDMNwqXDExDO4kvs5M+vI8VPusTZZS91oT9sjWv6+z89kUKmCUyRqspMf4PrKkxENB1UoCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fad6bf96b2218ffcc4ad0ec51d964acbda860732059fe5dfe2c55cac81a197e0","last_reissued_at":"2026-05-18T04:41:35.100040Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:41:35.100040Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Ultrametric Root Counting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"math.AG","authors_text":"Ashraf Ibrahim, Martin Avendano","submitted_at":"2009-01-22T02:32:56Z","abstract_excerpt":"Let $K$ be a complete non-archimedean field with a discrete valuation, $f\\in K[X]$ a polynomial with non-vanishing discriminant, $A$ the valuation ring of $K$, and $\\M$ the maximal ideal of $A$. The first main result of this paper is a reformulation of Hensel's lemma that connects the number of roots of $f$ with the number of roots of its reduction modulo a power of $\\M$. We then define a condition --- {\\em regularity} --- that yields a simple method to compute the exact number of roots of $f$ in $K$. In particular, we show that regularity implies that the number of roots of $f$ equals the sum"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0901.3393","kind":"arxiv","version":5},"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":"0901.3393","created_at":"2026-05-18T04:41:35.100138+00:00"},{"alias_kind":"arxiv_version","alias_value":"0901.3393v5","created_at":"2026-05-18T04:41:35.100138+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0901.3393","created_at":"2026-05-18T04:41:35.100138+00:00"},{"alias_kind":"pith_short_12","alias_value":"7LLL7FVSEGH7","created_at":"2026-05-18T12:25:58.837520+00:00"},{"alias_kind":"pith_short_16","alias_value":"7LLL7FVSEGH7ZRFN","created_at":"2026-05-18T12:25:58.837520+00:00"},{"alias_kind":"pith_short_8","alias_value":"7LLL7FVS","created_at":"2026-05-18T12:25:58.837520+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/7LLL7FVSEGH7ZRFNB3CR3FSKZP","json":"https://pith.science/pith/7LLL7FVSEGH7ZRFNB3CR3FSKZP.json","graph_json":"https://pith.science/api/pith-number/7LLL7FVSEGH7ZRFNB3CR3FSKZP/graph.json","events_json":"https://pith.science/api/pith-number/7LLL7FVSEGH7ZRFNB3CR3FSKZP/events.json","paper":"https://pith.science/paper/7LLL7FVS"},"agent_actions":{"view_html":"https://pith.science/pith/7LLL7FVSEGH7ZRFNB3CR3FSKZP","download_json":"https://pith.science/pith/7LLL7FVSEGH7ZRFNB3CR3FSKZP.json","view_paper":"https://pith.science/paper/7LLL7FVS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0901.3393&json=true","fetch_graph":"https://pith.science/api/pith-number/7LLL7FVSEGH7ZRFNB3CR3FSKZP/graph.json","fetch_events":"https://pith.science/api/pith-number/7LLL7FVSEGH7ZRFNB3CR3FSKZP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7LLL7FVSEGH7ZRFNB3CR3FSKZP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7LLL7FVSEGH7ZRFNB3CR3FSKZP/action/storage_attestation","attest_author":"https://pith.science/pith/7LLL7FVSEGH7ZRFNB3CR3FSKZP/action/author_attestation","sign_citation":"https://pith.science/pith/7LLL7FVSEGH7ZRFNB3CR3FSKZP/action/citation_signature","submit_replication":"https://pith.science/pith/7LLL7FVSEGH7ZRFNB3CR3FSKZP/action/replication_record"}},"created_at":"2026-05-18T04:41:35.100138+00:00","updated_at":"2026-05-18T04:41:35.100138+00:00"}