{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:2A7KQDTB7W5ZJYOFEIGUT6SBYF","short_pith_number":"pith:2A7KQDTB","canonical_record":{"source":{"id":"1502.06631","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2015-02-23T21:12:46Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"5cac42634c27d9e9102f66c5e85a60f2e8efc8e6224f085e70f3df5d50a9d8a9","abstract_canon_sha256":"a4f7e045d75f62cb467dbe6cfbacf12f06b8ed1a73aa078b7001013a9c544e10"},"schema_version":"1.0"},"canonical_sha256":"d03ea80e61fdbb94e1c5220d49fa41c176142d00eacd7c508d05c38427287c04","source":{"kind":"arxiv","id":"1502.06631","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.06631","created_at":"2026-05-18T02:26:29Z"},{"alias_kind":"arxiv_version","alias_value":"1502.06631v1","created_at":"2026-05-18T02:26:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.06631","created_at":"2026-05-18T02:26:29Z"},{"alias_kind":"pith_short_12","alias_value":"2A7KQDTB7W5Z","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"2A7KQDTB7W5ZJYOF","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"2A7KQDTB","created_at":"2026-05-18T12:28:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:2A7KQDTB7W5ZJYOFEIGUT6SBYF","target":"record","payload":{"canonical_record":{"source":{"id":"1502.06631","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2015-02-23T21:12:46Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"5cac42634c27d9e9102f66c5e85a60f2e8efc8e6224f085e70f3df5d50a9d8a9","abstract_canon_sha256":"a4f7e045d75f62cb467dbe6cfbacf12f06b8ed1a73aa078b7001013a9c544e10"},"schema_version":"1.0"},"canonical_sha256":"d03ea80e61fdbb94e1c5220d49fa41c176142d00eacd7c508d05c38427287c04","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:26:29.573520Z","signature_b64":"BnVUgQXSe6RYpMp1N7JVAhWOleUDWuJROw9vfivlp6K4dIVQQHuHu0iCYstjREGfxv54Eu0doqpuswCskconCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d03ea80e61fdbb94e1c5220d49fa41c176142d00eacd7c508d05c38427287c04","last_reissued_at":"2026-05-18T02:26:29.572909Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:26:29.572909Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1502.06631","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-18T02:26:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CfmdDRvW0GdRXH3wdIkJeejVh+jVVcsBkFQSZ/f0I+eXykoc1klOEoM68DaXsUQXQ0VGKWa75FSdHsu165/ADg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T22:37:14.337353Z"},"content_sha256":"b93473492c3d59224bd90a651c60697d1879060d8efcfe525bad32adc1ffecd2","schema_version":"1.0","event_id":"sha256:b93473492c3d59224bd90a651c60697d1879060d8efcfe525bad32adc1ffecd2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:2A7KQDTB7W5ZJYOFEIGUT6SBYF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Polynomial Interpolation and Identity Testing from High Powers over Finite Fields","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.NT","authors_text":"Gabor Ivanyos, Igor Shparlinski, Marek Karpinski, Miklos Santha, Nitin Saxena","submitted_at":"2015-02-23T21:12:46Z","abstract_excerpt":"We consider the problem of recovering (that is, interpolating) and identity testing of a \"hidden\" monic polynomial $f$, given an oracle access to $f(x)^e$ for $x\\in{\\mathbb F_q}$ (extension fields access is not permitted). The naive interpolation algorithm needs $O(e\\, \\mathrm{deg}\\, f)$ queries and thus requires $e\\, \\mathrm{deg}\\, f<q$. We design algorithms that are asymptotically better in certain cases; requiring only $e^{o(1)}$ queries to the oracle. In the randomized (and quantum) setting, we give a substantially better interpolation algorithm, that requires only $O(\\mathrm{deg}\\, f \\log"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.06631","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-18T02:26:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z0KRHmFG0pux9v6SSR4nktgTZzXFOZEY4r6eGuAg4SIVJ6Fv9xfgvbbeHVxzs/xc3barhlzIFOTBohizhHvnDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T22:37:14.337736Z"},"content_sha256":"abdd751ac124ae7155b4b792fa49d4610fdf5df787f855e1eccec35cd9e5f211","schema_version":"1.0","event_id":"sha256:abdd751ac124ae7155b4b792fa49d4610fdf5df787f855e1eccec35cd9e5f211"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2A7KQDTB7W5ZJYOFEIGUT6SBYF/bundle.json","state_url":"https://pith.science/pith/2A7KQDTB7W5ZJYOFEIGUT6SBYF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2A7KQDTB7W5ZJYOFEIGUT6SBYF/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-05-28T22:37:14Z","links":{"resolver":"https://pith.science/pith/2A7KQDTB7W5ZJYOFEIGUT6SBYF","bundle":"https://pith.science/pith/2A7KQDTB7W5ZJYOFEIGUT6SBYF/bundle.json","state":"https://pith.science/pith/2A7KQDTB7W5ZJYOFEIGUT6SBYF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2A7KQDTB7W5ZJYOFEIGUT6SBYF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:2A7KQDTB7W5ZJYOFEIGUT6SBYF","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":"a4f7e045d75f62cb467dbe6cfbacf12f06b8ed1a73aa078b7001013a9c544e10","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2015-02-23T21:12:46Z","title_canon_sha256":"5cac42634c27d9e9102f66c5e85a60f2e8efc8e6224f085e70f3df5d50a9d8a9"},"schema_version":"1.0","source":{"id":"1502.06631","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.06631","created_at":"2026-05-18T02:26:29Z"},{"alias_kind":"arxiv_version","alias_value":"1502.06631v1","created_at":"2026-05-18T02:26:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.06631","created_at":"2026-05-18T02:26:29Z"},{"alias_kind":"pith_short_12","alias_value":"2A7KQDTB7W5Z","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"2A7KQDTB7W5ZJYOF","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"2A7KQDTB","created_at":"2026-05-18T12:28:59Z"}],"graph_snapshots":[{"event_id":"sha256:abdd751ac124ae7155b4b792fa49d4610fdf5df787f855e1eccec35cd9e5f211","target":"graph","created_at":"2026-05-18T02:26:29Z","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 consider the problem of recovering (that is, interpolating) and identity testing of a \"hidden\" monic polynomial $f$, given an oracle access to $f(x)^e$ for $x\\in{\\mathbb F_q}$ (extension fields access is not permitted). The naive interpolation algorithm needs $O(e\\, \\mathrm{deg}\\, f)$ queries and thus requires $e\\, \\mathrm{deg}\\, f<q$. We design algorithms that are asymptotically better in certain cases; requiring only $e^{o(1)}$ queries to the oracle. In the randomized (and quantum) setting, we give a substantially better interpolation algorithm, that requires only $O(\\mathrm{deg}\\, f \\log","authors_text":"Gabor Ivanyos, Igor Shparlinski, Marek Karpinski, Miklos Santha, Nitin Saxena","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2015-02-23T21:12:46Z","title":"Polynomial Interpolation and Identity Testing from High Powers over Finite Fields"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.06631","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:b93473492c3d59224bd90a651c60697d1879060d8efcfe525bad32adc1ffecd2","target":"record","created_at":"2026-05-18T02:26:29Z","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":"a4f7e045d75f62cb467dbe6cfbacf12f06b8ed1a73aa078b7001013a9c544e10","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2015-02-23T21:12:46Z","title_canon_sha256":"5cac42634c27d9e9102f66c5e85a60f2e8efc8e6224f085e70f3df5d50a9d8a9"},"schema_version":"1.0","source":{"id":"1502.06631","kind":"arxiv","version":1}},"canonical_sha256":"d03ea80e61fdbb94e1c5220d49fa41c176142d00eacd7c508d05c38427287c04","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d03ea80e61fdbb94e1c5220d49fa41c176142d00eacd7c508d05c38427287c04","first_computed_at":"2026-05-18T02:26:29.572909Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:26:29.572909Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BnVUgQXSe6RYpMp1N7JVAhWOleUDWuJROw9vfivlp6K4dIVQQHuHu0iCYstjREGfxv54Eu0doqpuswCskconCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:26:29.573520Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.06631","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b93473492c3d59224bd90a651c60697d1879060d8efcfe525bad32adc1ffecd2","sha256:abdd751ac124ae7155b4b792fa49d4610fdf5df787f855e1eccec35cd9e5f211"],"state_sha256":"9a19e6a96a4020944869e5f4d8b955301fd2924c7222014b20707cf40e3a7537"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ck2NmOtN6XbU1i5aFBuPdH7mov9IO1Q5AnRtj/38/QORp9T0tDvCctJG0+waG234g6yAwnqRri9QK5I3q9rdAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T22:37:14.340216Z","bundle_sha256":"1a9de789128bbce48c0b0be6c37956fb32c0c1f35c5d5e20ae3ffc3125e53634"}}