{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:ZH3CXTY4H6G65BPWQ3NUCRLRAR","short_pith_number":"pith:ZH3CXTY4","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"},"canonical_sha256":"c9f62bcf1c3f8dee85f686db414571047d99850e3e4e088c04ec7a78bd6dabbb","source":{"kind":"arxiv","id":"1708.04713","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.04713","created_at":"2026-05-18T00:00:09Z"},{"alias_kind":"arxiv_version","alias_value":"1708.04713v2","created_at":"2026-05-18T00:00:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.04713","created_at":"2026-05-18T00:00:09Z"},{"alias_kind":"pith_short_12","alias_value":"ZH3CXTY4H6G6","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZH3CXTY4H6G65BPW","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZH3CXTY4","created_at":"2026-05-18T12:31:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:ZH3CXTY4H6G65BPWQ3NUCRLRAR","target":"record","payload":{"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"},"canonical_sha256":"c9f62bcf1c3f8dee85f686db414571047d99850e3e4e088c04ec7a78bd6dabbb","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"},"source_kind":"arxiv","source_id":"1708.04713","source_version":2,"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-18T00:00:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y0PWj+1mzX+tdCWuDp2iTQGHR+xFzLzXUa3H6kT9lhmg0T+cDo0kJhpE4gXXTeScDu0qFjlWvfF8VaKctJ96Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T02:21:53.641152Z"},"content_sha256":"5300e39627d906b6d356f35c80198929b00728f549c982a6e3fb9023d90c3d19","schema_version":"1.0","event_id":"sha256:5300e39627d906b6d356f35c80198929b00728f549c982a6e3fb9023d90c3d19"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:ZH3CXTY4H6G65BPWQ3NUCRLRAR","target":"graph","payload":{"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"},"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-18T00:00:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eQ/KYu9UGv76adxC35ynv/JNGTFHEA/RZ4Bi6npcVpuArenfGRcSeD8PhigKq4/IDawhKx8sZN+U7kgvU+DzBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T02:21:53.641523Z"},"content_sha256":"1d95bb293da583005cf04d5daf4f32f5e0d5c01e8719e6178787a68ec75f3617","schema_version":"1.0","event_id":"sha256:1d95bb293da583005cf04d5daf4f32f5e0d5c01e8719e6178787a68ec75f3617"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZH3CXTY4H6G65BPWQ3NUCRLRAR/bundle.json","state_url":"https://pith.science/pith/ZH3CXTY4H6G65BPWQ3NUCRLRAR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZH3CXTY4H6G65BPWQ3NUCRLRAR/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-23T02:21:53Z","links":{"resolver":"https://pith.science/pith/ZH3CXTY4H6G65BPWQ3NUCRLRAR","bundle":"https://pith.science/pith/ZH3CXTY4H6G65BPWQ3NUCRLRAR/bundle.json","state":"https://pith.science/pith/ZH3CXTY4H6G65BPWQ3NUCRLRAR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZH3CXTY4H6G65BPWQ3NUCRLRAR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:ZH3CXTY4H6G65BPWQ3NUCRLRAR","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":"a0e5d36944edbedd17c115952d9098f50df6d87d20392d28d7ac7ecfda819436","cross_cats_sorted":["cs.CC","cs.SC","math.AC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2017-08-15T22:58:59Z","title_canon_sha256":"5636d140516cc3fd3f16e4f2b1c4de78107e8f6cd47d5e02a15a182055ae9541"},"schema_version":"1.0","source":{"id":"1708.04713","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.04713","created_at":"2026-05-18T00:00:09Z"},{"alias_kind":"arxiv_version","alias_value":"1708.04713v2","created_at":"2026-05-18T00:00:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.04713","created_at":"2026-05-18T00:00:09Z"},{"alias_kind":"pith_short_12","alias_value":"ZH3CXTY4H6G6","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZH3CXTY4H6G65BPW","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZH3CXTY4","created_at":"2026-05-18T12:31:59Z"}],"graph_snapshots":[{"event_id":"sha256:1d95bb293da583005cf04d5daf4f32f5e0d5c01e8719e6178787a68ec75f3617","target":"graph","created_at":"2026-05-18T00:00:09Z","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":"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","authors_text":"Angela Patini, Jeremy Johnson, Robert M. Walker, Trajan Hammonds","cross_cats":["cs.CC","cs.SC","math.AC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2017-08-15T22:58:59Z","title":"Counting Roots of Polynomials over $\\mathbb{Z}/p^2\\mathbb{Z}$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.04713","kind":"arxiv","version":2},"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:5300e39627d906b6d356f35c80198929b00728f549c982a6e3fb9023d90c3d19","target":"record","created_at":"2026-05-18T00:00:09Z","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":"a0e5d36944edbedd17c115952d9098f50df6d87d20392d28d7ac7ecfda819436","cross_cats_sorted":["cs.CC","cs.SC","math.AC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2017-08-15T22:58:59Z","title_canon_sha256":"5636d140516cc3fd3f16e4f2b1c4de78107e8f6cd47d5e02a15a182055ae9541"},"schema_version":"1.0","source":{"id":"1708.04713","kind":"arxiv","version":2}},"canonical_sha256":"c9f62bcf1c3f8dee85f686db414571047d99850e3e4e088c04ec7a78bd6dabbb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c9f62bcf1c3f8dee85f686db414571047d99850e3e4e088c04ec7a78bd6dabbb","first_computed_at":"2026-05-18T00:00:09.157656Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:00:09.157656Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xg2Swsw0vV2YsG5Pu8sNuywDNj+/Tcga35ZPuzVUB2/zk7+QcriRs1kKde4FTS0X4eckQMeSm2lTSSq8OO+dCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:00:09.158189Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.04713","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5300e39627d906b6d356f35c80198929b00728f549c982a6e3fb9023d90c3d19","sha256:1d95bb293da583005cf04d5daf4f32f5e0d5c01e8719e6178787a68ec75f3617"],"state_sha256":"68ee0786c278c52ffe095ae21eb29ada55d73eff54eef5b34e43fa5fe9db08d3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bUv+0vJml3+n7/dklZDwqrFQJkoHRUbuZiPSKjVfdIuqlbf6AXMiHoDEr0X/qiNGsMw3Et5koC8WqW5jU1SKDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T02:21:53.643538Z","bundle_sha256":"f09e56f46985671cdc6958da1000540e78de91c408fb95c3b7106d1c5ae2722d"}}