{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:A3DWQDIRDWZL6TFINJMXYWYMN5","short_pith_number":"pith:A3DWQDIR","schema_version":"1.0","canonical_sha256":"06c7680d111db2bf4ca86a597c5b0c6f53f845739ae59fa85eca15d1f16e2192","source":{"kind":"arxiv","id":"1704.04359","version":2},"attestation_state":"computed","paper":{"title":"Sparse Polynomial Interpolation with Finitely Many Values for the Coefficients","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SC","authors_text":"Qiao-Long Huang, Xiao-Shan Gao","submitted_at":"2017-04-14T06:04:44Z","abstract_excerpt":"In this paper, we give new sparse interpolation algorithms for black box polynomial f whose coefficients are from a finite set. In the univariate case, we recover f from one evaluation of f(a) for a sufficiently large number a. In the multivariate case, we introduce the modified Kronecker substitution to reduce the interpolation of a multivariate polynomial to the univariate case. Both algorithms have polynomial bit-size complexity."},"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":"1704.04359","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2017-04-14T06:04:44Z","cross_cats_sorted":[],"title_canon_sha256":"726256f7bf259e75041b220bfa72699f0a29019cbd639746fcd7b371e7b6cc08","abstract_canon_sha256":"55139ac91ecf8dea68175ca82968a6a04b0e8a3f9a45776baeda2591229df94a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:52.993583Z","signature_b64":"UCxMme7vHKDIZ8NKynR6tfpkgKxrwF5i5zwb5fr8MGK3136Jzwqzm/Z31SN/84Zp2WlmNbO6poPZ8NKQM5CDBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"06c7680d111db2bf4ca86a597c5b0c6f53f845739ae59fa85eca15d1f16e2192","last_reissued_at":"2026-05-18T00:41:52.993127Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:52.993127Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sparse Polynomial Interpolation with Finitely Many Values for the Coefficients","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SC","authors_text":"Qiao-Long Huang, Xiao-Shan Gao","submitted_at":"2017-04-14T06:04:44Z","abstract_excerpt":"In this paper, we give new sparse interpolation algorithms for black box polynomial f whose coefficients are from a finite set. In the univariate case, we recover f from one evaluation of f(a) for a sufficiently large number a. In the multivariate case, we introduce the modified Kronecker substitution to reduce the interpolation of a multivariate polynomial to the univariate case. Both algorithms have polynomial bit-size complexity."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.04359","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1704.04359","created_at":"2026-05-18T00:41:52.993198+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.04359v2","created_at":"2026-05-18T00:41:52.993198+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.04359","created_at":"2026-05-18T00:41:52.993198+00:00"},{"alias_kind":"pith_short_12","alias_value":"A3DWQDIRDWZL","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_16","alias_value":"A3DWQDIRDWZL6TFI","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_8","alias_value":"A3DWQDIR","created_at":"2026-05-18T12:31:05.417338+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/A3DWQDIRDWZL6TFINJMXYWYMN5","json":"https://pith.science/pith/A3DWQDIRDWZL6TFINJMXYWYMN5.json","graph_json":"https://pith.science/api/pith-number/A3DWQDIRDWZL6TFINJMXYWYMN5/graph.json","events_json":"https://pith.science/api/pith-number/A3DWQDIRDWZL6TFINJMXYWYMN5/events.json","paper":"https://pith.science/paper/A3DWQDIR"},"agent_actions":{"view_html":"https://pith.science/pith/A3DWQDIRDWZL6TFINJMXYWYMN5","download_json":"https://pith.science/pith/A3DWQDIRDWZL6TFINJMXYWYMN5.json","view_paper":"https://pith.science/paper/A3DWQDIR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.04359&json=true","fetch_graph":"https://pith.science/api/pith-number/A3DWQDIRDWZL6TFINJMXYWYMN5/graph.json","fetch_events":"https://pith.science/api/pith-number/A3DWQDIRDWZL6TFINJMXYWYMN5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A3DWQDIRDWZL6TFINJMXYWYMN5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A3DWQDIRDWZL6TFINJMXYWYMN5/action/storage_attestation","attest_author":"https://pith.science/pith/A3DWQDIRDWZL6TFINJMXYWYMN5/action/author_attestation","sign_citation":"https://pith.science/pith/A3DWQDIRDWZL6TFINJMXYWYMN5/action/citation_signature","submit_replication":"https://pith.science/pith/A3DWQDIRDWZL6TFINJMXYWYMN5/action/replication_record"}},"created_at":"2026-05-18T00:41:52.993198+00:00","updated_at":"2026-05-18T00:41:52.993198+00:00"}