{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:BMETGPP33VP2NY42E7EF27Y5F7","short_pith_number":"pith:BMETGPP3","canonical_record":{"source":{"id":"1901.06628","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-01-20T06:40:43Z","cross_cats_sorted":["cs.DS","cs.SC","math.NT"],"title_canon_sha256":"2fd2269ab2029515157e2f89c708f527e6854faa826333e9284d925f118bde61","abstract_canon_sha256":"9b05a96b3b31e792bce01d9a0b24647cd157d060639d73bac92c333a5f49ed12"},"schema_version":"1.0"},"canonical_sha256":"0b09333dfbdd5fa6e39a27c85d7f1d2fd463a767ade70eb7cbc606ecd6401117","source":{"kind":"arxiv","id":"1901.06628","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.06628","created_at":"2026-05-17T23:52:38Z"},{"alias_kind":"arxiv_version","alias_value":"1901.06628v1","created_at":"2026-05-17T23:52:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.06628","created_at":"2026-05-17T23:52:38Z"},{"alias_kind":"pith_short_12","alias_value":"BMETGPP33VP2","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"BMETGPP33VP2NY42","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"BMETGPP3","created_at":"2026-05-18T12:33:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:BMETGPP33VP2NY42E7EF27Y5F7","target":"record","payload":{"canonical_record":{"source":{"id":"1901.06628","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-01-20T06:40:43Z","cross_cats_sorted":["cs.DS","cs.SC","math.NT"],"title_canon_sha256":"2fd2269ab2029515157e2f89c708f527e6854faa826333e9284d925f118bde61","abstract_canon_sha256":"9b05a96b3b31e792bce01d9a0b24647cd157d060639d73bac92c333a5f49ed12"},"schema_version":"1.0"},"canonical_sha256":"0b09333dfbdd5fa6e39a27c85d7f1d2fd463a767ade70eb7cbc606ecd6401117","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:38.352003Z","signature_b64":"UjWVLm6m2BgQf6L6dWDt2dJLP9i0vG0BTNholXhs1EQTifvJ4N/W41UsXkfmrrBYPdwQ5PGQSmpLE0KyCQ0fCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0b09333dfbdd5fa6e39a27c85d7f1d2fd463a767ade70eb7cbc606ecd6401117","last_reissued_at":"2026-05-17T23:52:38.351252Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:38.351252Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.06628","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:52:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"012Kg0KE0pRo+4vpGpRrTC5dIE4RQEKuYXPl+hL/wii5irWNU5B81J8gWAxHTsJOTdqybQcaHP1X2P7255CTAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T23:32:34.259300Z"},"content_sha256":"dfb67a7f05e93407cbc68ed05654d35e122941a4eb5d6f779eff714853eceddb","schema_version":"1.0","event_id":"sha256:dfb67a7f05e93407cbc68ed05654d35e122941a4eb5d6f779eff714853eceddb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:BMETGPP33VP2NY42E7EF27Y5F7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficiently factoring polynomials modulo $p^4$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.SC","math.NT"],"primary_cat":"cs.CC","authors_text":"Ashish Dwivedi, Nitin Saxena, Rajat Mittal","submitted_at":"2019-01-20T06:40:43Z","abstract_excerpt":"Polynomial factoring has famous practical algorithms over fields-- finite, rational \\& $p$-adic. However, modulo prime powers it gets hard as there is non-unique factorization and a combinatorial blowup ensues. For example, $x^2+p \\bmod p^2$ is irreducible, but $x^2+px \\bmod p^2$ has exponentially many factors! We present the first randomized poly(deg $f, \\log p$) time algorithm to factor a given univariate integral $f(x)$ modulo $p^k$, for a prime $p$ and $k \\leq 4$. Thus, we solve the open question of factoring modulo $p^3$ posed in (Sircana, ISSAC'17).\n  Our method reduces the general probl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.06628","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:52:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L7syzBAyVNErlTXuw93BpR7CulHN8qCUv9WlfLjpG2exaAckXV2YAlyqKOo9IypY0EgDhuvzdTzcnIVGyVouAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T23:32:34.259673Z"},"content_sha256":"01fbd9e45d1cabae82eea3ff14d3c245b4dcbbb00b40735253b3fd9de8a16ade","schema_version":"1.0","event_id":"sha256:01fbd9e45d1cabae82eea3ff14d3c245b4dcbbb00b40735253b3fd9de8a16ade"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BMETGPP33VP2NY42E7EF27Y5F7/bundle.json","state_url":"https://pith.science/pith/BMETGPP33VP2NY42E7EF27Y5F7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BMETGPP33VP2NY42E7EF27Y5F7/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-02T23:32:34Z","links":{"resolver":"https://pith.science/pith/BMETGPP33VP2NY42E7EF27Y5F7","bundle":"https://pith.science/pith/BMETGPP33VP2NY42E7EF27Y5F7/bundle.json","state":"https://pith.science/pith/BMETGPP33VP2NY42E7EF27Y5F7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BMETGPP33VP2NY42E7EF27Y5F7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:BMETGPP33VP2NY42E7EF27Y5F7","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":"9b05a96b3b31e792bce01d9a0b24647cd157d060639d73bac92c333a5f49ed12","cross_cats_sorted":["cs.DS","cs.SC","math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-01-20T06:40:43Z","title_canon_sha256":"2fd2269ab2029515157e2f89c708f527e6854faa826333e9284d925f118bde61"},"schema_version":"1.0","source":{"id":"1901.06628","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.06628","created_at":"2026-05-17T23:52:38Z"},{"alias_kind":"arxiv_version","alias_value":"1901.06628v1","created_at":"2026-05-17T23:52:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.06628","created_at":"2026-05-17T23:52:38Z"},{"alias_kind":"pith_short_12","alias_value":"BMETGPP33VP2","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"BMETGPP33VP2NY42","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"BMETGPP3","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:01fbd9e45d1cabae82eea3ff14d3c245b4dcbbb00b40735253b3fd9de8a16ade","target":"graph","created_at":"2026-05-17T23:52:38Z","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":"Polynomial factoring has famous practical algorithms over fields-- finite, rational \\& $p$-adic. However, modulo prime powers it gets hard as there is non-unique factorization and a combinatorial blowup ensues. For example, $x^2+p \\bmod p^2$ is irreducible, but $x^2+px \\bmod p^2$ has exponentially many factors! We present the first randomized poly(deg $f, \\log p$) time algorithm to factor a given univariate integral $f(x)$ modulo $p^k$, for a prime $p$ and $k \\leq 4$. Thus, we solve the open question of factoring modulo $p^3$ posed in (Sircana, ISSAC'17).\n  Our method reduces the general probl","authors_text":"Ashish Dwivedi, Nitin Saxena, Rajat Mittal","cross_cats":["cs.DS","cs.SC","math.NT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-01-20T06:40:43Z","title":"Efficiently factoring polynomials modulo $p^4$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.06628","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:dfb67a7f05e93407cbc68ed05654d35e122941a4eb5d6f779eff714853eceddb","target":"record","created_at":"2026-05-17T23:52:38Z","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":"9b05a96b3b31e792bce01d9a0b24647cd157d060639d73bac92c333a5f49ed12","cross_cats_sorted":["cs.DS","cs.SC","math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-01-20T06:40:43Z","title_canon_sha256":"2fd2269ab2029515157e2f89c708f527e6854faa826333e9284d925f118bde61"},"schema_version":"1.0","source":{"id":"1901.06628","kind":"arxiv","version":1}},"canonical_sha256":"0b09333dfbdd5fa6e39a27c85d7f1d2fd463a767ade70eb7cbc606ecd6401117","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0b09333dfbdd5fa6e39a27c85d7f1d2fd463a767ade70eb7cbc606ecd6401117","first_computed_at":"2026-05-17T23:52:38.351252Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:52:38.351252Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UjWVLm6m2BgQf6L6dWDt2dJLP9i0vG0BTNholXhs1EQTifvJ4N/W41UsXkfmrrBYPdwQ5PGQSmpLE0KyCQ0fCg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:52:38.352003Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.06628","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dfb67a7f05e93407cbc68ed05654d35e122941a4eb5d6f779eff714853eceddb","sha256:01fbd9e45d1cabae82eea3ff14d3c245b4dcbbb00b40735253b3fd9de8a16ade"],"state_sha256":"8b07dbbe6df8723f0ec4c175a1c2cf2f626cf70eff062301b4f52c334f1e1cc0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6Gl8o83LUxhzLwBQGK9j531cZTr9zMEc+T4kSLn2GZ8hXavXzVPBOEXwnXYMKGvUQrMuzo66Un0WI4TsykC7BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T23:32:34.261871Z","bundle_sha256":"ae8f8ceebedc9a8cf07f90cd2812fb675dacaa2bc4a50065dd70042b5d592f50"}}