{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:EFLVDDOCTTBI55ZMS5GPA5JDIX","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"5d25e3e4d3c8f7a8327c0abdd01f916c78c030f9405ab935a7d717a90fe875a9","cross_cats_sorted":["cs.CC","cs.DS","math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2019-02-20T21:33:43Z","title_canon_sha256":"7dfa4d5646534d9eb1eed68503f69bdd06c5f94debe2b68b0f8f515ae543cd10"},"schema_version":"1.0","source":{"id":"1902.07785","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.07785","created_at":"2026-05-17T23:52:35Z"},{"alias_kind":"arxiv_version","alias_value":"1902.07785v1","created_at":"2026-05-17T23:52:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.07785","created_at":"2026-05-17T23:52:35Z"},{"alias_kind":"pith_short_12","alias_value":"EFLVDDOCTTBI","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"EFLVDDOCTTBI55ZM","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"EFLVDDOC","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:ac6091d115b2fbf8d5aeefe8668e3cbd73e0259d6af753f26186ab32ceed7323","target":"graph","created_at":"2026-05-17T23:52:35Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Finding an irreducible factor, of a polynomial $f(x)$ modulo a prime $p$, is not known to be in deterministic polynomial time. Though there is such a classical algorithm that {\\em counts} the number of irreducible factors of $f\\bmod p$. We can ask the same question modulo prime-powers $p^k$. The irreducible factors of $f\\bmod p^k$ blow up exponentially in number; making it hard to describe them. Can we count those irreducible factors $\\bmod~p^k$ that remain irreducible mod $p$? These are called {\\em basic-irreducible}. A simple example is in $f=x^2+px \\bmod p^2$; it has $p$ many basic-irreduci","authors_text":"Ashish Dwivedi, Nitin Saxena, Rajat Mittal","cross_cats":["cs.CC","cs.DS","math.NT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2019-02-20T21:33:43Z","title":"Counting basic-irreducible factors mod $p^k$ in deterministic poly-time and $p$-adic applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.07785","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:1265979d7fc5984e7aa7a5fc5686ecf90b5492fb46d8868dced87436bc30cd22","target":"record","created_at":"2026-05-17T23:52:35Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"5d25e3e4d3c8f7a8327c0abdd01f916c78c030f9405ab935a7d717a90fe875a9","cross_cats_sorted":["cs.CC","cs.DS","math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2019-02-20T21:33:43Z","title_canon_sha256":"7dfa4d5646534d9eb1eed68503f69bdd06c5f94debe2b68b0f8f515ae543cd10"},"schema_version":"1.0","source":{"id":"1902.07785","kind":"arxiv","version":1}},"canonical_sha256":"2157518dc29cc28ef72c974cf0752345f3171db976363624cd9cda84390a44f4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2157518dc29cc28ef72c974cf0752345f3171db976363624cd9cda84390a44f4","first_computed_at":"2026-05-17T23:52:35.795536Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:52:35.795536Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OJr1kSKq08rIeAgzcQQA+l1vxG5Fbz2FhpTC7daT5NAPvfF/55pbmG1OoBQTeOBNZybcVa4f79Kb+LJ+G1txBw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:52:35.796029Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.07785","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1265979d7fc5984e7aa7a5fc5686ecf90b5492fb46d8868dced87436bc30cd22","sha256:ac6091d115b2fbf8d5aeefe8668e3cbd73e0259d6af753f26186ab32ceed7323"],"state_sha256":"e3fedcca75eba96751a87f8afbce465ed8d49438754c0fd389ae7887322cd3c6"}