{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:EWGPDZGOTWCHNSLMV34K55AQDO","short_pith_number":"pith:EWGPDZGO","canonical_record":{"source":{"id":"1110.4350","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-10-19T18:33:28Z","cross_cats_sorted":[],"title_canon_sha256":"cb90d8cb048be29e159d3845f20a2cda777919a03d6ab66666702837f7438924","abstract_canon_sha256":"9bf7735c72b622905110c0f04b3fc9a188b5f87ae6e8ac160da0ed54b87935b2"},"schema_version":"1.0"},"canonical_sha256":"258cf1e4ce9d8476c96caef8aef4101b8ac069214b518de2415aaf48aa981284","source":{"kind":"arxiv","id":"1110.4350","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.4350","created_at":"2026-05-18T04:10:37Z"},{"alias_kind":"arxiv_version","alias_value":"1110.4350v1","created_at":"2026-05-18T04:10:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.4350","created_at":"2026-05-18T04:10:37Z"},{"alias_kind":"pith_short_12","alias_value":"EWGPDZGOTWCH","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"EWGPDZGOTWCHNSLM","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"EWGPDZGO","created_at":"2026-05-18T12:26:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:EWGPDZGOTWCHNSLMV34K55AQDO","target":"record","payload":{"canonical_record":{"source":{"id":"1110.4350","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-10-19T18:33:28Z","cross_cats_sorted":[],"title_canon_sha256":"cb90d8cb048be29e159d3845f20a2cda777919a03d6ab66666702837f7438924","abstract_canon_sha256":"9bf7735c72b622905110c0f04b3fc9a188b5f87ae6e8ac160da0ed54b87935b2"},"schema_version":"1.0"},"canonical_sha256":"258cf1e4ce9d8476c96caef8aef4101b8ac069214b518de2415aaf48aa981284","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:10:37.537659Z","signature_b64":"jsmiNex1DczaqUnqyI8vJqXnLBZQ3rp7sioBTV4+uI2+VMu5i9JeFH5VJs0aA3l9Ljum7eWT2Z5Cspr62SdUDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"258cf1e4ce9d8476c96caef8aef4101b8ac069214b518de2415aaf48aa981284","last_reissued_at":"2026-05-18T04:10:37.536990Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:10:37.536990Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1110.4350","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:10:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eAD83aYungs1w5gf+u4k+cbfqsf5bByOwQwEBASxq3Wk/SvFDGcEJuNiGdv+tAb//X4sR1gy74yPCARSPgYmDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T20:26:45.867299Z"},"content_sha256":"72b8c9995ebc1edb0bc3de42f0bbdc3d65337f9c2bb5521acd1b22a7ef9ea630","schema_version":"1.0","event_id":"sha256:72b8c9995ebc1edb0bc3de42f0bbdc3d65337f9c2bb5521acd1b22a7ef9ea630"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:EWGPDZGOTWCHNSLMV34K55AQDO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Taking Roots over High Extensions of Finite Fields","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Eric Schost, Javad Doliskani","submitted_at":"2011-10-19T18:33:28Z","abstract_excerpt":"We present a new algorithm for computing $m$-th roots over the finite field $\\F_q$, where $q = p^n$, with $p$ a prime, and $m$ any positive integer. In the particular case $m=2$, the cost of the new algorithm is an expected $O(\\M(n)\\log (p) + \\CC(n)\\log(n))$ operations in $\\F_p$, where $\\M(n)$ and $\\CC(n)$ are bounds for the cost of polynomial multiplication and modular polynomial composition. Known results give $\\M(n) = O(n\\log (n) \\log\\log (n))$ and $\\CC(n) = O(n^{1.67})$, so our algorithm is subquadratic in $n$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.4350","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:10:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IuDTApeV/K20GoMh6aQqG16lS5lGIgnGna+vyZLgmyWa7pzMy1ObJFxa3NshsYXizwRjFyluw2rZG92mP1LcBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T20:26:45.867663Z"},"content_sha256":"4263f396ecbc74603f46952cbf3e5d24a56308188f557110f310f91dea2d812c","schema_version":"1.0","event_id":"sha256:4263f396ecbc74603f46952cbf3e5d24a56308188f557110f310f91dea2d812c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EWGPDZGOTWCHNSLMV34K55AQDO/bundle.json","state_url":"https://pith.science/pith/EWGPDZGOTWCHNSLMV34K55AQDO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EWGPDZGOTWCHNSLMV34K55AQDO/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-04T20:26:45Z","links":{"resolver":"https://pith.science/pith/EWGPDZGOTWCHNSLMV34K55AQDO","bundle":"https://pith.science/pith/EWGPDZGOTWCHNSLMV34K55AQDO/bundle.json","state":"https://pith.science/pith/EWGPDZGOTWCHNSLMV34K55AQDO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EWGPDZGOTWCHNSLMV34K55AQDO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:EWGPDZGOTWCHNSLMV34K55AQDO","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":"9bf7735c72b622905110c0f04b3fc9a188b5f87ae6e8ac160da0ed54b87935b2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-10-19T18:33:28Z","title_canon_sha256":"cb90d8cb048be29e159d3845f20a2cda777919a03d6ab66666702837f7438924"},"schema_version":"1.0","source":{"id":"1110.4350","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.4350","created_at":"2026-05-18T04:10:37Z"},{"alias_kind":"arxiv_version","alias_value":"1110.4350v1","created_at":"2026-05-18T04:10:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.4350","created_at":"2026-05-18T04:10:37Z"},{"alias_kind":"pith_short_12","alias_value":"EWGPDZGOTWCH","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"EWGPDZGOTWCHNSLM","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"EWGPDZGO","created_at":"2026-05-18T12:26:28Z"}],"graph_snapshots":[{"event_id":"sha256:4263f396ecbc74603f46952cbf3e5d24a56308188f557110f310f91dea2d812c","target":"graph","created_at":"2026-05-18T04:10:37Z","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 present a new algorithm for computing $m$-th roots over the finite field $\\F_q$, where $q = p^n$, with $p$ a prime, and $m$ any positive integer. In the particular case $m=2$, the cost of the new algorithm is an expected $O(\\M(n)\\log (p) + \\CC(n)\\log(n))$ operations in $\\F_p$, where $\\M(n)$ and $\\CC(n)$ are bounds for the cost of polynomial multiplication and modular polynomial composition. Known results give $\\M(n) = O(n\\log (n) \\log\\log (n))$ and $\\CC(n) = O(n^{1.67})$, so our algorithm is subquadratic in $n$.","authors_text":"Eric Schost, Javad Doliskani","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-10-19T18:33:28Z","title":"Taking Roots over High Extensions of Finite Fields"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.4350","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:72b8c9995ebc1edb0bc3de42f0bbdc3d65337f9c2bb5521acd1b22a7ef9ea630","target":"record","created_at":"2026-05-18T04:10:37Z","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":"9bf7735c72b622905110c0f04b3fc9a188b5f87ae6e8ac160da0ed54b87935b2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-10-19T18:33:28Z","title_canon_sha256":"cb90d8cb048be29e159d3845f20a2cda777919a03d6ab66666702837f7438924"},"schema_version":"1.0","source":{"id":"1110.4350","kind":"arxiv","version":1}},"canonical_sha256":"258cf1e4ce9d8476c96caef8aef4101b8ac069214b518de2415aaf48aa981284","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"258cf1e4ce9d8476c96caef8aef4101b8ac069214b518de2415aaf48aa981284","first_computed_at":"2026-05-18T04:10:37.536990Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:10:37.536990Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jsmiNex1DczaqUnqyI8vJqXnLBZQ3rp7sioBTV4+uI2+VMu5i9JeFH5VJs0aA3l9Ljum7eWT2Z5Cspr62SdUDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:10:37.537659Z","signed_message":"canonical_sha256_bytes"},"source_id":"1110.4350","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:72b8c9995ebc1edb0bc3de42f0bbdc3d65337f9c2bb5521acd1b22a7ef9ea630","sha256:4263f396ecbc74603f46952cbf3e5d24a56308188f557110f310f91dea2d812c"],"state_sha256":"4e894ffa2ec69d0a0963508962fd1b305b1bd4f3e11cf63cdf7c07258ca798a8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9fT5m6gtLh1czS6V+trszHVuQBngvR0Vm/2T5YSV6qei9cLUyHfYJ8GXsdcAxoQWUfLx2fZRNLklj4Pl7+e0BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T20:26:45.869709Z","bundle_sha256":"beb07392881882c48d3b1cfe4af98275c38c171f0bca281d984b591c80509ced"}}