{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:G5JZ7JWMVW6OH3FRZL7DWFKB3I","short_pith_number":"pith:G5JZ7JWM","schema_version":"1.0","canonical_sha256":"37539fa6ccadbce3ecb1cafe3b1541da2f5127e35126c270c6dd88c47403bf76","source":{"kind":"arxiv","id":"1710.01301","version":2},"attestation_state":"computed","paper":{"title":"Deterministic Interpolation of Sparse Black-box Multivariate Polynomials using Kronecker Type Substitutions","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-10-03T11:38:08Z","abstract_excerpt":"In this paper, we propose two new deterministic interpolation algorithms for a sparse multivariate polynomial given as a standard black-box by introducing new Kronecker type substitutions. Let $f\\in \\RB[x_1,\\dots,x_n]$ be a sparse black-box polynomial with a degree bound $D$. When $\\RB=\\C$ or a finite field, our algorithms either have better bit complexity or better bit complexity in $D$ than existing deterministic algorithms. In particular, in the case of deterministic algorithms for standard black-box models, our second algorithm has the current best complexity in $D$ which is the dominant f"},"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":"1710.01301","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2017-10-03T11:38:08Z","cross_cats_sorted":[],"title_canon_sha256":"358558174ce4391ec2679f15e347ac76298ba846a8e78f31adea6a0375d38d96","abstract_canon_sha256":"b3a4ce53692b142ff29da57da4eb90a52267347baf356fbc6bc7a39faab0f994"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:36.359180Z","signature_b64":"OkxGwFi4kdm7wdYmCBPRoNEKohDO2BYR8ZquxX8AKNqQ7WZZJDHhciTolAPKzcpdHrTkjllyGxHV8BgJvbroCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"37539fa6ccadbce3ecb1cafe3b1541da2f5127e35126c270c6dd88c47403bf76","last_reissued_at":"2026-05-18T00:08:36.358477Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:36.358477Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deterministic Interpolation of Sparse Black-box Multivariate Polynomials using Kronecker Type Substitutions","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-10-03T11:38:08Z","abstract_excerpt":"In this paper, we propose two new deterministic interpolation algorithms for a sparse multivariate polynomial given as a standard black-box by introducing new Kronecker type substitutions. Let $f\\in \\RB[x_1,\\dots,x_n]$ be a sparse black-box polynomial with a degree bound $D$. When $\\RB=\\C$ or a finite field, our algorithms either have better bit complexity or better bit complexity in $D$ than existing deterministic algorithms. In particular, in the case of deterministic algorithms for standard black-box models, our second algorithm has the current best complexity in $D$ which is the dominant f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.01301","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":"1710.01301","created_at":"2026-05-18T00:08:36.358588+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.01301v2","created_at":"2026-05-18T00:08:36.358588+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.01301","created_at":"2026-05-18T00:08:36.358588+00:00"},{"alias_kind":"pith_short_12","alias_value":"G5JZ7JWMVW6O","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_16","alias_value":"G5JZ7JWMVW6OH3FR","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_8","alias_value":"G5JZ7JWM","created_at":"2026-05-18T12:31:15.632608+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/G5JZ7JWMVW6OH3FRZL7DWFKB3I","json":"https://pith.science/pith/G5JZ7JWMVW6OH3FRZL7DWFKB3I.json","graph_json":"https://pith.science/api/pith-number/G5JZ7JWMVW6OH3FRZL7DWFKB3I/graph.json","events_json":"https://pith.science/api/pith-number/G5JZ7JWMVW6OH3FRZL7DWFKB3I/events.json","paper":"https://pith.science/paper/G5JZ7JWM"},"agent_actions":{"view_html":"https://pith.science/pith/G5JZ7JWMVW6OH3FRZL7DWFKB3I","download_json":"https://pith.science/pith/G5JZ7JWMVW6OH3FRZL7DWFKB3I.json","view_paper":"https://pith.science/paper/G5JZ7JWM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.01301&json=true","fetch_graph":"https://pith.science/api/pith-number/G5JZ7JWMVW6OH3FRZL7DWFKB3I/graph.json","fetch_events":"https://pith.science/api/pith-number/G5JZ7JWMVW6OH3FRZL7DWFKB3I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G5JZ7JWMVW6OH3FRZL7DWFKB3I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G5JZ7JWMVW6OH3FRZL7DWFKB3I/action/storage_attestation","attest_author":"https://pith.science/pith/G5JZ7JWMVW6OH3FRZL7DWFKB3I/action/author_attestation","sign_citation":"https://pith.science/pith/G5JZ7JWMVW6OH3FRZL7DWFKB3I/action/citation_signature","submit_replication":"https://pith.science/pith/G5JZ7JWMVW6OH3FRZL7DWFKB3I/action/replication_record"}},"created_at":"2026-05-18T00:08:36.358588+00:00","updated_at":"2026-05-18T00:08:36.358588+00:00"}