{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:TJ7KDFHUVCW7TSIXGPCOUXGGUY","short_pith_number":"pith:TJ7KDFHU","canonical_record":{"source":{"id":"1112.4014","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2011-12-17T03:14:52Z","cross_cats_sorted":[],"title_canon_sha256":"02b05f041544695b6e0fd06398feb1044fd4d63bccb70430f9f0d16e51e17fa2","abstract_canon_sha256":"8bf6afdd7c01170a886221cc2c1e680d453afb93a336bcbb705ea8ea91231bcf"},"schema_version":"1.0"},"canonical_sha256":"9a7ea194f4a8adf9c91733c4ea5cc6a609fa312be313939b073cfa0a740ffa5e","source":{"kind":"arxiv","id":"1112.4014","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.4014","created_at":"2026-05-18T04:06:07Z"},{"alias_kind":"arxiv_version","alias_value":"1112.4014v1","created_at":"2026-05-18T04:06:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.4014","created_at":"2026-05-18T04:06:07Z"},{"alias_kind":"pith_short_12","alias_value":"TJ7KDFHUVCW7","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"TJ7KDFHUVCW7TSIX","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"TJ7KDFHU","created_at":"2026-05-18T12:26:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:TJ7KDFHUVCW7TSIXGPCOUXGGUY","target":"record","payload":{"canonical_record":{"source":{"id":"1112.4014","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2011-12-17T03:14:52Z","cross_cats_sorted":[],"title_canon_sha256":"02b05f041544695b6e0fd06398feb1044fd4d63bccb70430f9f0d16e51e17fa2","abstract_canon_sha256":"8bf6afdd7c01170a886221cc2c1e680d453afb93a336bcbb705ea8ea91231bcf"},"schema_version":"1.0"},"canonical_sha256":"9a7ea194f4a8adf9c91733c4ea5cc6a609fa312be313939b073cfa0a740ffa5e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:06:07.207545Z","signature_b64":"H5svVZr3UsYWvdwaZWhuVT9aeJM3f+QAI5TwZL/Hso5C1ZST/tB1bOlyffxY5L+UBNpsbg5UOCsq5Ts89qoeBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9a7ea194f4a8adf9c91733c4ea5cc6a609fa312be313939b073cfa0a740ffa5e","last_reissued_at":"2026-05-18T04:06:07.207112Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:06:07.207112Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1112.4014","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-18T04:06:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"woAds/7eaIQcF8/oUFPHnbBL0nsC/fspxvtF621cJBX5gss8JsbGAx+f7Z9N5T3QfFgXN7uZPuCKEP1MF0aWBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T10:00:10.766683Z"},"content_sha256":"8d93c56e80f2e2ccaab6740ad300af28c05be6bca3815322c19ab070cabf8318","schema_version":"1.0","event_id":"sha256:8d93c56e80f2e2ccaab6740ad300af28c05be6bca3815322c19ab070cabf8318"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:TJ7KDFHUVCW7TSIXGPCOUXGGUY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Note on fast division algorithm for polynomials using Newton iteration","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SC","authors_text":"Hanyue Cao, Zhengjun Cao","submitted_at":"2011-12-17T03:14:52Z","abstract_excerpt":"The classical division algorithm for polynomials requires $O(n^2)$ operations for inputs of size $n$. Using reversal technique and Newton iteration, it can be improved to $O({M}(n))$, where ${M}$ is a multiplication time. But the method requires that the degree of the modulo, $x^l$, should be the power of 2. If $l$ is not a power of 2 and $f(0)=1$, Gathen and Gerhard suggest to compute the inverse,$f^{-1}$, modulo $x^{\\lceil l/2^r\\rceil}, x^{\\lceil l/2^{r-1}\\rceil},..., x^{\\lceil l/2\\rceil}, x^l$, separately. But they did not specify the iterative step. In this note, we show that the original "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.4014","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-18T04:06:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lBn6FGn4APkFW9FirGDU0jhT1JFmapvvw4KKCKrt8HWoO3SZILyVI3a6pAqrZQCetYYYOyKVajP+xaGoGYUrDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T10:00:10.767020Z"},"content_sha256":"17e0f02054c87ae484a82877a9ee5178e604deb5f2e22abc86e333aeb392a5f1","schema_version":"1.0","event_id":"sha256:17e0f02054c87ae484a82877a9ee5178e604deb5f2e22abc86e333aeb392a5f1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TJ7KDFHUVCW7TSIXGPCOUXGGUY/bundle.json","state_url":"https://pith.science/pith/TJ7KDFHUVCW7TSIXGPCOUXGGUY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TJ7KDFHUVCW7TSIXGPCOUXGGUY/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-02T10:00:10Z","links":{"resolver":"https://pith.science/pith/TJ7KDFHUVCW7TSIXGPCOUXGGUY","bundle":"https://pith.science/pith/TJ7KDFHUVCW7TSIXGPCOUXGGUY/bundle.json","state":"https://pith.science/pith/TJ7KDFHUVCW7TSIXGPCOUXGGUY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TJ7KDFHUVCW7TSIXGPCOUXGGUY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:TJ7KDFHUVCW7TSIXGPCOUXGGUY","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":"8bf6afdd7c01170a886221cc2c1e680d453afb93a336bcbb705ea8ea91231bcf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2011-12-17T03:14:52Z","title_canon_sha256":"02b05f041544695b6e0fd06398feb1044fd4d63bccb70430f9f0d16e51e17fa2"},"schema_version":"1.0","source":{"id":"1112.4014","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.4014","created_at":"2026-05-18T04:06:07Z"},{"alias_kind":"arxiv_version","alias_value":"1112.4014v1","created_at":"2026-05-18T04:06:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.4014","created_at":"2026-05-18T04:06:07Z"},{"alias_kind":"pith_short_12","alias_value":"TJ7KDFHUVCW7","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"TJ7KDFHUVCW7TSIX","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"TJ7KDFHU","created_at":"2026-05-18T12:26:42Z"}],"graph_snapshots":[{"event_id":"sha256:17e0f02054c87ae484a82877a9ee5178e604deb5f2e22abc86e333aeb392a5f1","target":"graph","created_at":"2026-05-18T04:06:07Z","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":"The classical division algorithm for polynomials requires $O(n^2)$ operations for inputs of size $n$. Using reversal technique and Newton iteration, it can be improved to $O({M}(n))$, where ${M}$ is a multiplication time. But the method requires that the degree of the modulo, $x^l$, should be the power of 2. If $l$ is not a power of 2 and $f(0)=1$, Gathen and Gerhard suggest to compute the inverse,$f^{-1}$, modulo $x^{\\lceil l/2^r\\rceil}, x^{\\lceil l/2^{r-1}\\rceil},..., x^{\\lceil l/2\\rceil}, x^l$, separately. But they did not specify the iterative step. In this note, we show that the original ","authors_text":"Hanyue Cao, Zhengjun Cao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2011-12-17T03:14:52Z","title":"Note on fast division algorithm for polynomials using Newton iteration"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.4014","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:8d93c56e80f2e2ccaab6740ad300af28c05be6bca3815322c19ab070cabf8318","target":"record","created_at":"2026-05-18T04:06:07Z","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":"8bf6afdd7c01170a886221cc2c1e680d453afb93a336bcbb705ea8ea91231bcf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2011-12-17T03:14:52Z","title_canon_sha256":"02b05f041544695b6e0fd06398feb1044fd4d63bccb70430f9f0d16e51e17fa2"},"schema_version":"1.0","source":{"id":"1112.4014","kind":"arxiv","version":1}},"canonical_sha256":"9a7ea194f4a8adf9c91733c4ea5cc6a609fa312be313939b073cfa0a740ffa5e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9a7ea194f4a8adf9c91733c4ea5cc6a609fa312be313939b073cfa0a740ffa5e","first_computed_at":"2026-05-18T04:06:07.207112Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:06:07.207112Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"H5svVZr3UsYWvdwaZWhuVT9aeJM3f+QAI5TwZL/Hso5C1ZST/tB1bOlyffxY5L+UBNpsbg5UOCsq5Ts89qoeBw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:06:07.207545Z","signed_message":"canonical_sha256_bytes"},"source_id":"1112.4014","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8d93c56e80f2e2ccaab6740ad300af28c05be6bca3815322c19ab070cabf8318","sha256:17e0f02054c87ae484a82877a9ee5178e604deb5f2e22abc86e333aeb392a5f1"],"state_sha256":"08505e59591c9c0d633c0299c0ff64607bc1d1c353c7e81258ac8f94886c2d49"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MjwuTBbrTE8C2m90JWHhqD5mWeyeMycES/A8HR73Dk0b6vYmZtiwruAGfbuvx5o45Ky7uWFC7umKmri1+JRqDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T10:00:10.769153Z","bundle_sha256":"ddd0ea9ba32e2fde3ea63372272587360a138363f2942fc5c73e68f42e2e3a5a"}}