{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2008:JGODIXZ6YI6Z26XX3EZM667JQI","short_pith_number":"pith:JGODIXZ6","canonical_record":{"source":{"id":"0810.5685","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2008-10-31T13:35:08Z","cross_cats_sorted":["cs.DS","cs.MS"],"title_canon_sha256":"c8ef1adcfe31017e46d2c535da32b5f9a2bd4cc134b7c1422439c4a6ab41ed18","abstract_canon_sha256":"35de5546d5745bbc9b7f531c616e72ef498a91602ff1722d37cd3477b9dd3b8a"},"schema_version":"1.0"},"canonical_sha256":"499c345f3ec23d9d7af7d932cf7be982268bd872bfc6ea85d983845c56146035","source":{"kind":"arxiv","id":"0810.5685","version":6},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0810.5685","created_at":"2026-05-18T04:34:10Z"},{"alias_kind":"arxiv_version","alias_value":"0810.5685v6","created_at":"2026-05-18T04:34:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0810.5685","created_at":"2026-05-18T04:34:10Z"},{"alias_kind":"pith_short_12","alias_value":"JGODIXZ6YI6Z","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_16","alias_value":"JGODIXZ6YI6Z26XX","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_8","alias_value":"JGODIXZ6","created_at":"2026-05-18T12:25:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2008:JGODIXZ6YI6Z26XX3EZM667JQI","target":"record","payload":{"canonical_record":{"source":{"id":"0810.5685","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2008-10-31T13:35:08Z","cross_cats_sorted":["cs.DS","cs.MS"],"title_canon_sha256":"c8ef1adcfe31017e46d2c535da32b5f9a2bd4cc134b7c1422439c4a6ab41ed18","abstract_canon_sha256":"35de5546d5745bbc9b7f531c616e72ef498a91602ff1722d37cd3477b9dd3b8a"},"schema_version":"1.0"},"canonical_sha256":"499c345f3ec23d9d7af7d932cf7be982268bd872bfc6ea85d983845c56146035","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:34:10.247655Z","signature_b64":"t8hXWiJ5n4HOioD+jUvip1UXqMbinPbWiPvTAAt6T7+EdKr+1bSI9yBb1m2xKC8fb0p4Np0zoWTJKxJkEJGlCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"499c345f3ec23d9d7af7d932cf7be982268bd872bfc6ea85d983845c56146035","last_reissued_at":"2026-05-18T04:34:10.247299Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:34:10.247299Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0810.5685","source_version":6,"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:34:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xy3nPWGq/LUIYQcbYCr+vU030vjaEGxHg39oW+VUutHxqR28w+T+NKdxikAblRysw8y239FUJRdkBvYHiS5bAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T23:36:11.422591Z"},"content_sha256":"34ff74d8d7fed689c4bbb2c3a5e04d0d27c1931c5a0dd5a859f7b73c6cd7412c","schema_version":"1.0","event_id":"sha256:34ff74d8d7fed689c4bbb2c3a5e04d0d27c1931c5a0dd5a859f7b73c6cd7412c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2008:JGODIXZ6YI6Z26XX3EZM667JQI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Interpolation of Shifted-Lacunary Polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.MS"],"primary_cat":"cs.SC","authors_text":"Daniel S. Roche, Mark Giesbrecht","submitted_at":"2008-10-31T13:35:08Z","abstract_excerpt":"Given a \"black box\" function to evaluate an unknown rational polynomial f in Q[x] at points modulo a prime p, we exhibit algorithms to compute the representation of the polynomial in the sparsest shifted power basis. That is, we determine the sparsity t, the shift s (a rational), the exponents 0 <= e1 < e2 < ... < et, and the coefficients c1,...,ct in Q\\{0} such that f(x) = c1(x-s)^e1+c2(x-s)^e2+...+ct(x-s)^et. The computed sparsity t is absolutely minimal over any shifted power basis. The novelty of our algorithm is that the complexity is polynomial in the (sparse) representation size, and in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0810.5685","kind":"arxiv","version":6},"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:34:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7u4KOMd462jTq3xt5WitsKpz2rxnFGn1dIFKbN0LJRwcOiWS1GCtnCzk7o0meXYkzk3/U6mD+v0FJZSrVKHBBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T23:36:11.423063Z"},"content_sha256":"b05eaf22b311cac5471f0b2878b55f62f2deab003eee3985289364b4dcb17bd2","schema_version":"1.0","event_id":"sha256:b05eaf22b311cac5471f0b2878b55f62f2deab003eee3985289364b4dcb17bd2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JGODIXZ6YI6Z26XX3EZM667JQI/bundle.json","state_url":"https://pith.science/pith/JGODIXZ6YI6Z26XX3EZM667JQI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JGODIXZ6YI6Z26XX3EZM667JQI/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-24T23:36:11Z","links":{"resolver":"https://pith.science/pith/JGODIXZ6YI6Z26XX3EZM667JQI","bundle":"https://pith.science/pith/JGODIXZ6YI6Z26XX3EZM667JQI/bundle.json","state":"https://pith.science/pith/JGODIXZ6YI6Z26XX3EZM667JQI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JGODIXZ6YI6Z26XX3EZM667JQI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2008:JGODIXZ6YI6Z26XX3EZM667JQI","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":"35de5546d5745bbc9b7f531c616e72ef498a91602ff1722d37cd3477b9dd3b8a","cross_cats_sorted":["cs.DS","cs.MS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2008-10-31T13:35:08Z","title_canon_sha256":"c8ef1adcfe31017e46d2c535da32b5f9a2bd4cc134b7c1422439c4a6ab41ed18"},"schema_version":"1.0","source":{"id":"0810.5685","kind":"arxiv","version":6}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0810.5685","created_at":"2026-05-18T04:34:10Z"},{"alias_kind":"arxiv_version","alias_value":"0810.5685v6","created_at":"2026-05-18T04:34:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0810.5685","created_at":"2026-05-18T04:34:10Z"},{"alias_kind":"pith_short_12","alias_value":"JGODIXZ6YI6Z","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_16","alias_value":"JGODIXZ6YI6Z26XX","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_8","alias_value":"JGODIXZ6","created_at":"2026-05-18T12:25:57Z"}],"graph_snapshots":[{"event_id":"sha256:b05eaf22b311cac5471f0b2878b55f62f2deab003eee3985289364b4dcb17bd2","target":"graph","created_at":"2026-05-18T04:34:10Z","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":"Given a \"black box\" function to evaluate an unknown rational polynomial f in Q[x] at points modulo a prime p, we exhibit algorithms to compute the representation of the polynomial in the sparsest shifted power basis. That is, we determine the sparsity t, the shift s (a rational), the exponents 0 <= e1 < e2 < ... < et, and the coefficients c1,...,ct in Q\\{0} such that f(x) = c1(x-s)^e1+c2(x-s)^e2+...+ct(x-s)^et. The computed sparsity t is absolutely minimal over any shifted power basis. The novelty of our algorithm is that the complexity is polynomial in the (sparse) representation size, and in","authors_text":"Daniel S. Roche, Mark Giesbrecht","cross_cats":["cs.DS","cs.MS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2008-10-31T13:35:08Z","title":"Interpolation of Shifted-Lacunary Polynomials"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0810.5685","kind":"arxiv","version":6},"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:34ff74d8d7fed689c4bbb2c3a5e04d0d27c1931c5a0dd5a859f7b73c6cd7412c","target":"record","created_at":"2026-05-18T04:34:10Z","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":"35de5546d5745bbc9b7f531c616e72ef498a91602ff1722d37cd3477b9dd3b8a","cross_cats_sorted":["cs.DS","cs.MS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2008-10-31T13:35:08Z","title_canon_sha256":"c8ef1adcfe31017e46d2c535da32b5f9a2bd4cc134b7c1422439c4a6ab41ed18"},"schema_version":"1.0","source":{"id":"0810.5685","kind":"arxiv","version":6}},"canonical_sha256":"499c345f3ec23d9d7af7d932cf7be982268bd872bfc6ea85d983845c56146035","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"499c345f3ec23d9d7af7d932cf7be982268bd872bfc6ea85d983845c56146035","first_computed_at":"2026-05-18T04:34:10.247299Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:34:10.247299Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"t8hXWiJ5n4HOioD+jUvip1UXqMbinPbWiPvTAAt6T7+EdKr+1bSI9yBb1m2xKC8fb0p4Np0zoWTJKxJkEJGlCw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:34:10.247655Z","signed_message":"canonical_sha256_bytes"},"source_id":"0810.5685","source_kind":"arxiv","source_version":6}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:34ff74d8d7fed689c4bbb2c3a5e04d0d27c1931c5a0dd5a859f7b73c6cd7412c","sha256:b05eaf22b311cac5471f0b2878b55f62f2deab003eee3985289364b4dcb17bd2"],"state_sha256":"e531e8c1a3dffd8bbecaab7c24fb1ed9903f1c61c4dd1f17c90d0c985d90be95"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zeT59sWXMSzBh3aANVyFC6efwCnFwrRWXN00UAV/CeNrSABiNvRsWctBag5lDkpoKIAvAZM8IKI3tIcZ1Q4EBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T23:36:11.426004Z","bundle_sha256":"0db0426610126047f5e44f6890044a8d4e87edf63f4fb0406fd1136dbceea819"}}