{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:JGODIXZ6YI6Z26XX3EZM667JQI","short_pith_number":"pith:JGODIXZ6","schema_version":"1.0","canonical_sha256":"499c345f3ec23d9d7af7d932cf7be982268bd872bfc6ea85d983845c56146035","source":{"kind":"arxiv","id":"0810.5685","version":6},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"0810.5685","created_at":"2026-05-18T04:34:10.247355+00:00"},{"alias_kind":"arxiv_version","alias_value":"0810.5685v6","created_at":"2026-05-18T04:34:10.247355+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0810.5685","created_at":"2026-05-18T04:34:10.247355+00:00"},{"alias_kind":"pith_short_12","alias_value":"JGODIXZ6YI6Z","created_at":"2026-05-18T12:25:57.157939+00:00"},{"alias_kind":"pith_short_16","alias_value":"JGODIXZ6YI6Z26XX","created_at":"2026-05-18T12:25:57.157939+00:00"},{"alias_kind":"pith_short_8","alias_value":"JGODIXZ6","created_at":"2026-05-18T12:25:57.157939+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JGODIXZ6YI6Z26XX3EZM667JQI","json":"https://pith.science/pith/JGODIXZ6YI6Z26XX3EZM667JQI.json","graph_json":"https://pith.science/api/pith-number/JGODIXZ6YI6Z26XX3EZM667JQI/graph.json","events_json":"https://pith.science/api/pith-number/JGODIXZ6YI6Z26XX3EZM667JQI/events.json","paper":"https://pith.science/paper/JGODIXZ6"},"agent_actions":{"view_html":"https://pith.science/pith/JGODIXZ6YI6Z26XX3EZM667JQI","download_json":"https://pith.science/pith/JGODIXZ6YI6Z26XX3EZM667JQI.json","view_paper":"https://pith.science/paper/JGODIXZ6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0810.5685&json=true","fetch_graph":"https://pith.science/api/pith-number/JGODIXZ6YI6Z26XX3EZM667JQI/graph.json","fetch_events":"https://pith.science/api/pith-number/JGODIXZ6YI6Z26XX3EZM667JQI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JGODIXZ6YI6Z26XX3EZM667JQI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JGODIXZ6YI6Z26XX3EZM667JQI/action/storage_attestation","attest_author":"https://pith.science/pith/JGODIXZ6YI6Z26XX3EZM667JQI/action/author_attestation","sign_citation":"https://pith.science/pith/JGODIXZ6YI6Z26XX3EZM667JQI/action/citation_signature","submit_replication":"https://pith.science/pith/JGODIXZ6YI6Z26XX3EZM667JQI/action/replication_record"}},"created_at":"2026-05-18T04:34:10.247355+00:00","updated_at":"2026-05-18T04:34:10.247355+00:00"}