{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:F56YXL52ONCSQGZ3IVMP32WVYW","short_pith_number":"pith:F56YXL52","canonical_record":{"source":{"id":"1401.4744","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/publicdomain/","primary_cat":"cs.SC","submitted_at":"2014-01-19T21:51:32Z","cross_cats_sorted":[],"title_canon_sha256":"cae4f42dc770b424d15f91d84696b231ed18ea0e938e524d07be6f42faa4d383","abstract_canon_sha256":"de570b9d810040bceccbde7460c15118376e519e004ef2ce58e53562d8743690"},"schema_version":"1.0"},"canonical_sha256":"2f7d8bafba7345281b3b4558fdead5c5a92d10ebe51af3997d28227285847d68","source":{"kind":"arxiv","id":"1401.4744","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.4744","created_at":"2026-05-18T02:52:47Z"},{"alias_kind":"arxiv_version","alias_value":"1401.4744v2","created_at":"2026-05-18T02:52:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.4744","created_at":"2026-05-18T02:52:47Z"},{"alias_kind":"pith_short_12","alias_value":"F56YXL52ONCS","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"F56YXL52ONCSQGZ3","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"F56YXL52","created_at":"2026-05-18T12:28:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:F56YXL52ONCSQGZ3IVMP32WVYW","target":"record","payload":{"canonical_record":{"source":{"id":"1401.4744","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/publicdomain/","primary_cat":"cs.SC","submitted_at":"2014-01-19T21:51:32Z","cross_cats_sorted":[],"title_canon_sha256":"cae4f42dc770b424d15f91d84696b231ed18ea0e938e524d07be6f42faa4d383","abstract_canon_sha256":"de570b9d810040bceccbde7460c15118376e519e004ef2ce58e53562d8743690"},"schema_version":"1.0"},"canonical_sha256":"2f7d8bafba7345281b3b4558fdead5c5a92d10ebe51af3997d28227285847d68","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:52:47.837557Z","signature_b64":"Hb+izxcx6hi+iq9XensLWD7E8PgbLcasZqWd+wdJcGFTPDeHUlucPVvlAHB8nrCEd3KYocoGzS6+SX2zIP+cAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2f7d8bafba7345281b3b4558fdead5c5a92d10ebe51af3997d28227285847d68","last_reissued_at":"2026-05-18T02:52:47.837026Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:52:47.837026Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.4744","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-18T02:52:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o1EZvqXOR9JWzEJwe+eHRr9HIZsyXRkh4y9EJWE7SJ/2X0UNSV4kHJAYCx2NtIBzau8P+Rhx2o95a29bDq+FBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T05:05:36.638250Z"},"content_sha256":"96add2c65a8dafcfcc1670f6382acea5f852c489e19dd64eab2c54cd0504689c","schema_version":"1.0","event_id":"sha256:96add2c65a8dafcfcc1670f6382acea5f852c489e19dd64eab2c54cd0504689c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:F56YXL52ONCSQGZ3IVMP32WVYW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sparse interpolation over finite fields via low-order roots of unity","license":"http://creativecommons.org/licenses/publicdomain/","headline":"","cross_cats":[],"primary_cat":"cs.SC","authors_text":"Andrew Arnold, Daniel S. Roche, Mark Giesbrecht","submitted_at":"2014-01-19T21:51:32Z","abstract_excerpt":"We present a new Monte Carlo algorithm for the interpolation of a straight-line program as a sparse polynomial $f$ over an arbitrary finite field of size $q$. We assume a priori bounds $D$ and $T$ are given on the degree and number of terms of $f$. The approach presented in this paper is a hybrid of the diversified and recursive interpolation algorithms, the two previous fastest known probabilistic methods for this problem. By making effective use of the information contained in the coefficients themselves, this new algorithm improves on the bit complexity of previous methods by a \"soft-Oh\" fa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.4744","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-18T02:52:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D+ZjHPygocv1G29gObIyWbB5cD5xVNKew0nQrE78wv2oOVaCS1nvaYvbgCwyNHNv/geMB9/7J7W9Av6P4YKEAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T05:05:36.638767Z"},"content_sha256":"b8ccf72c2bfa47af9495281148ad5a726ce9a628b910d2c7a766e4ae6d667cff","schema_version":"1.0","event_id":"sha256:b8ccf72c2bfa47af9495281148ad5a726ce9a628b910d2c7a766e4ae6d667cff"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/F56YXL52ONCSQGZ3IVMP32WVYW/bundle.json","state_url":"https://pith.science/pith/F56YXL52ONCSQGZ3IVMP32WVYW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/F56YXL52ONCSQGZ3IVMP32WVYW/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-31T05:05:36Z","links":{"resolver":"https://pith.science/pith/F56YXL52ONCSQGZ3IVMP32WVYW","bundle":"https://pith.science/pith/F56YXL52ONCSQGZ3IVMP32WVYW/bundle.json","state":"https://pith.science/pith/F56YXL52ONCSQGZ3IVMP32WVYW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/F56YXL52ONCSQGZ3IVMP32WVYW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:F56YXL52ONCSQGZ3IVMP32WVYW","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":"de570b9d810040bceccbde7460c15118376e519e004ef2ce58e53562d8743690","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/publicdomain/","primary_cat":"cs.SC","submitted_at":"2014-01-19T21:51:32Z","title_canon_sha256":"cae4f42dc770b424d15f91d84696b231ed18ea0e938e524d07be6f42faa4d383"},"schema_version":"1.0","source":{"id":"1401.4744","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.4744","created_at":"2026-05-18T02:52:47Z"},{"alias_kind":"arxiv_version","alias_value":"1401.4744v2","created_at":"2026-05-18T02:52:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.4744","created_at":"2026-05-18T02:52:47Z"},{"alias_kind":"pith_short_12","alias_value":"F56YXL52ONCS","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"F56YXL52ONCSQGZ3","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"F56YXL52","created_at":"2026-05-18T12:28:28Z"}],"graph_snapshots":[{"event_id":"sha256:b8ccf72c2bfa47af9495281148ad5a726ce9a628b910d2c7a766e4ae6d667cff","target":"graph","created_at":"2026-05-18T02:52:47Z","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 Monte Carlo algorithm for the interpolation of a straight-line program as a sparse polynomial $f$ over an arbitrary finite field of size $q$. We assume a priori bounds $D$ and $T$ are given on the degree and number of terms of $f$. The approach presented in this paper is a hybrid of the diversified and recursive interpolation algorithms, the two previous fastest known probabilistic methods for this problem. By making effective use of the information contained in the coefficients themselves, this new algorithm improves on the bit complexity of previous methods by a \"soft-Oh\" fa","authors_text":"Andrew Arnold, Daniel S. Roche, Mark Giesbrecht","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/publicdomain/","primary_cat":"cs.SC","submitted_at":"2014-01-19T21:51:32Z","title":"Sparse interpolation over finite fields via low-order roots of unity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.4744","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:96add2c65a8dafcfcc1670f6382acea5f852c489e19dd64eab2c54cd0504689c","target":"record","created_at":"2026-05-18T02:52:47Z","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":"de570b9d810040bceccbde7460c15118376e519e004ef2ce58e53562d8743690","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/publicdomain/","primary_cat":"cs.SC","submitted_at":"2014-01-19T21:51:32Z","title_canon_sha256":"cae4f42dc770b424d15f91d84696b231ed18ea0e938e524d07be6f42faa4d383"},"schema_version":"1.0","source":{"id":"1401.4744","kind":"arxiv","version":2}},"canonical_sha256":"2f7d8bafba7345281b3b4558fdead5c5a92d10ebe51af3997d28227285847d68","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2f7d8bafba7345281b3b4558fdead5c5a92d10ebe51af3997d28227285847d68","first_computed_at":"2026-05-18T02:52:47.837026Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:52:47.837026Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Hb+izxcx6hi+iq9XensLWD7E8PgbLcasZqWd+wdJcGFTPDeHUlucPVvlAHB8nrCEd3KYocoGzS6+SX2zIP+cAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:52:47.837557Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.4744","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:96add2c65a8dafcfcc1670f6382acea5f852c489e19dd64eab2c54cd0504689c","sha256:b8ccf72c2bfa47af9495281148ad5a726ce9a628b910d2c7a766e4ae6d667cff"],"state_sha256":"8b06b7fd003116a16b34ec5579e2832036c5a9802d0fab398cbd8a1cbf197545"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JaEPJSkLE/kNZDBhPYBnACvL1w6Il4vFSlQZzMqRSrc68QxcI1Un6xFH17GR6lverNOJ2CFgLxt3dxHbb1CMCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T05:05:36.641723Z","bundle_sha256":"5cfce9f5522acfbc947ddea5dd7376870db5f6095023eb21ffd2f680157b3faf"}}