{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:PHHQPG5BSKEETFYBLIKY3PJEWM","short_pith_number":"pith:PHHQPG5B","canonical_record":{"source":{"id":"1705.10658","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2017-05-30T14:12:31Z","cross_cats_sorted":[],"title_canon_sha256":"a84ad3cc0168cfb9b9e3324655c41f32a032c18cd8703369fcf3bc07e3571265","abstract_canon_sha256":"5e22d560380327448f58af2ce59a7879b5f4cf6a17abd648059b3f3268d5618d"},"schema_version":"1.0"},"canonical_sha256":"79cf079ba192884997015a158dbd24b32d4fb65498bcdb7c7003ffcf159efe91","source":{"kind":"arxiv","id":"1705.10658","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.10658","created_at":"2026-05-18T00:43:23Z"},{"alias_kind":"arxiv_version","alias_value":"1705.10658v1","created_at":"2026-05-18T00:43:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.10658","created_at":"2026-05-18T00:43:23Z"},{"alias_kind":"pith_short_12","alias_value":"PHHQPG5BSKEE","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"PHHQPG5BSKEETFYB","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"PHHQPG5B","created_at":"2026-05-18T12:31:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:PHHQPG5BSKEETFYBLIKY3PJEWM","target":"record","payload":{"canonical_record":{"source":{"id":"1705.10658","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2017-05-30T14:12:31Z","cross_cats_sorted":[],"title_canon_sha256":"a84ad3cc0168cfb9b9e3324655c41f32a032c18cd8703369fcf3bc07e3571265","abstract_canon_sha256":"5e22d560380327448f58af2ce59a7879b5f4cf6a17abd648059b3f3268d5618d"},"schema_version":"1.0"},"canonical_sha256":"79cf079ba192884997015a158dbd24b32d4fb65498bcdb7c7003ffcf159efe91","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:23.882061Z","signature_b64":"3ut+Tj8fq8shdtwRF9M4POODKQc/gYgU222sTmrx8KY713uA2ZtbKSTEwJJ1oouH21zPfPQwajXveFkAQ4llAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"79cf079ba192884997015a158dbd24b32d4fb65498bcdb7c7003ffcf159efe91","last_reissued_at":"2026-05-18T00:43:23.881233Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:23.881233Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.10658","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-18T00:43:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ob/fqz8wDk+ay4y3dGRVW0hdEJoRjYaJDLTRCwZJUN2XQis3JuFAKdcQNpXOL/deoaBBDaTq4UmyA3dN7KiZCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T12:34:35.171531Z"},"content_sha256":"911a33927080dda15990b76a664db30e9635018e90a2ea8bc6a12b48078b5d10","schema_version":"1.0","event_id":"sha256:911a33927080dda15990b76a664db30e9635018e90a2ea8bc6a12b48078b5d10"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:PHHQPG5BSKEETFYBLIKY3PJEWM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast Computation of the Roots of Polynomials Over the Ring of Power Series","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SC","authors_text":"Eric Schost, Johan Rosenkilde, Vincent Neiger","submitted_at":"2017-05-30T14:12:31Z","abstract_excerpt":"We give an algorithm for computing all roots of polynomials over a univariate power series ring over an exact field $\\mathbb{K}$. More precisely, given a precision $d$, and a polynomial $Q$ whose coefficients are power series in $x$, the algorithm computes a representation of all power series $f(x)$ such that $Q(f(x)) = 0 \\bmod x^d$. The algorithm works unconditionally, in particular also with multiple roots, where Newton iteration fails. Our main motivation comes from coding theory where instances of this problem arise and multiple roots must be handled.\n  The cost bound for our algorithm mat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.10658","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-18T00:43:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bOcRNXab48gypd0MKH/lmq+ORJoSg3n3BaiFV3nvuOlSt/sI8ipAvWBA72A+fVNCpHJ9Zk6lmVGFCbAi5viYAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T12:34:35.171871Z"},"content_sha256":"d4805da385b2179f1f36b97c8eb5f1ce58049e1415ff9e593e3ea8e19b025e41","schema_version":"1.0","event_id":"sha256:d4805da385b2179f1f36b97c8eb5f1ce58049e1415ff9e593e3ea8e19b025e41"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PHHQPG5BSKEETFYBLIKY3PJEWM/bundle.json","state_url":"https://pith.science/pith/PHHQPG5BSKEETFYBLIKY3PJEWM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PHHQPG5BSKEETFYBLIKY3PJEWM/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-01T12:34:35Z","links":{"resolver":"https://pith.science/pith/PHHQPG5BSKEETFYBLIKY3PJEWM","bundle":"https://pith.science/pith/PHHQPG5BSKEETFYBLIKY3PJEWM/bundle.json","state":"https://pith.science/pith/PHHQPG5BSKEETFYBLIKY3PJEWM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PHHQPG5BSKEETFYBLIKY3PJEWM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:PHHQPG5BSKEETFYBLIKY3PJEWM","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":"5e22d560380327448f58af2ce59a7879b5f4cf6a17abd648059b3f3268d5618d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2017-05-30T14:12:31Z","title_canon_sha256":"a84ad3cc0168cfb9b9e3324655c41f32a032c18cd8703369fcf3bc07e3571265"},"schema_version":"1.0","source":{"id":"1705.10658","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.10658","created_at":"2026-05-18T00:43:23Z"},{"alias_kind":"arxiv_version","alias_value":"1705.10658v1","created_at":"2026-05-18T00:43:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.10658","created_at":"2026-05-18T00:43:23Z"},{"alias_kind":"pith_short_12","alias_value":"PHHQPG5BSKEE","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"PHHQPG5BSKEETFYB","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"PHHQPG5B","created_at":"2026-05-18T12:31:37Z"}],"graph_snapshots":[{"event_id":"sha256:d4805da385b2179f1f36b97c8eb5f1ce58049e1415ff9e593e3ea8e19b025e41","target":"graph","created_at":"2026-05-18T00:43:23Z","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":"We give an algorithm for computing all roots of polynomials over a univariate power series ring over an exact field $\\mathbb{K}$. More precisely, given a precision $d$, and a polynomial $Q$ whose coefficients are power series in $x$, the algorithm computes a representation of all power series $f(x)$ such that $Q(f(x)) = 0 \\bmod x^d$. The algorithm works unconditionally, in particular also with multiple roots, where Newton iteration fails. Our main motivation comes from coding theory where instances of this problem arise and multiple roots must be handled.\n  The cost bound for our algorithm mat","authors_text":"Eric Schost, Johan Rosenkilde, Vincent Neiger","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2017-05-30T14:12:31Z","title":"Fast Computation of the Roots of Polynomials Over the Ring of Power Series"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.10658","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:911a33927080dda15990b76a664db30e9635018e90a2ea8bc6a12b48078b5d10","target":"record","created_at":"2026-05-18T00:43:23Z","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":"5e22d560380327448f58af2ce59a7879b5f4cf6a17abd648059b3f3268d5618d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2017-05-30T14:12:31Z","title_canon_sha256":"a84ad3cc0168cfb9b9e3324655c41f32a032c18cd8703369fcf3bc07e3571265"},"schema_version":"1.0","source":{"id":"1705.10658","kind":"arxiv","version":1}},"canonical_sha256":"79cf079ba192884997015a158dbd24b32d4fb65498bcdb7c7003ffcf159efe91","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"79cf079ba192884997015a158dbd24b32d4fb65498bcdb7c7003ffcf159efe91","first_computed_at":"2026-05-18T00:43:23.881233Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:43:23.881233Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3ut+Tj8fq8shdtwRF9M4POODKQc/gYgU222sTmrx8KY713uA2ZtbKSTEwJJ1oouH21zPfPQwajXveFkAQ4llAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:43:23.882061Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.10658","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:911a33927080dda15990b76a664db30e9635018e90a2ea8bc6a12b48078b5d10","sha256:d4805da385b2179f1f36b97c8eb5f1ce58049e1415ff9e593e3ea8e19b025e41"],"state_sha256":"271cbaf496e32684f3cdb2ff028e4eeb180b25f1741f1477a82201f6231bad2d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NL9U2QrMA3sZBio+PMnEpR0h3NCFkvOROolrkzoE9buH+wlgi3h7uvKGj+UR9sx4RH3t/KYmjdjcom+jDXl0Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T12:34:35.173838Z","bundle_sha256":"340d754a5b4eac0dc35b8b8a54ae7a6532ea1588a065ba81a16f5de34f27416b"}}