{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:4676ORGEAUH7LRVWHKFKNNIAQR","short_pith_number":"pith:4676ORGE","schema_version":"1.0","canonical_sha256":"e7bfe744c4050ff5c6b63a8aa6b500846a7ab82533c8d08bfb44b5f729b72d30","source":{"kind":"arxiv","id":"1709.08979","version":4},"attestation_state":"computed","paper":{"title":"Faster Interpolation Algorithms for Sparse Multivariate Polynomials Given by Straight-Line Programs\\","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-09-26T12:40:09Z","abstract_excerpt":"In this paper, we propose new deterministic and Monte Carlo interpolation algorithms for sparse multivariate polynomials represented by straight-line programs. Let $f$ be an $n$-variate polynomial given by a straight-line program, which has a degree bound $D$ and a term bound $T$. Our deterministic algorithm is quadratic in $n,T$ and cubic in $\\log D$ in the Soft-Oh sense, which has better complexities than existing deterministic interpolation algorithms in most cases. Our Monte Carlo interpolation algorithms have better complexities than existing Monte Carlo interpolation algorithms and are t"},"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":"1709.08979","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2017-09-26T12:40:09Z","cross_cats_sorted":[],"title_canon_sha256":"ef4bee21364bcb5556006997f4c35e3b19fc19044c674172c788b7869556f07d","abstract_canon_sha256":"e03f38ae6ec6ef507cc70701bd33597b967d3667342acb243d5ee422dabc3b9f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:39.103756Z","signature_b64":"4cs0S1ldcxWv5eQFXp199TFn/Bwi44b6esMkUE5Z5z7qH2WdL+0h7yGuDaNbcGTPalAiNe4SbTbdRdQhGBJMDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e7bfe744c4050ff5c6b63a8aa6b500846a7ab82533c8d08bfb44b5f729b72d30","last_reissued_at":"2026-05-18T00:10:39.103164Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:39.103164Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Faster Interpolation Algorithms for Sparse Multivariate Polynomials Given by Straight-Line Programs\\","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-09-26T12:40:09Z","abstract_excerpt":"In this paper, we propose new deterministic and Monte Carlo interpolation algorithms for sparse multivariate polynomials represented by straight-line programs. Let $f$ be an $n$-variate polynomial given by a straight-line program, which has a degree bound $D$ and a term bound $T$. Our deterministic algorithm is quadratic in $n,T$ and cubic in $\\log D$ in the Soft-Oh sense, which has better complexities than existing deterministic interpolation algorithms in most cases. Our Monte Carlo interpolation algorithms have better complexities than existing Monte Carlo interpolation algorithms and are t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.08979","kind":"arxiv","version":4},"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":"1709.08979","created_at":"2026-05-18T00:10:39.103249+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.08979v4","created_at":"2026-05-18T00:10:39.103249+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.08979","created_at":"2026-05-18T00:10:39.103249+00:00"},{"alias_kind":"pith_short_12","alias_value":"4676ORGEAUH7","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_16","alias_value":"4676ORGEAUH7LRVW","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_8","alias_value":"4676ORGE","created_at":"2026-05-18T12:30:58.224056+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/4676ORGEAUH7LRVWHKFKNNIAQR","json":"https://pith.science/pith/4676ORGEAUH7LRVWHKFKNNIAQR.json","graph_json":"https://pith.science/api/pith-number/4676ORGEAUH7LRVWHKFKNNIAQR/graph.json","events_json":"https://pith.science/api/pith-number/4676ORGEAUH7LRVWHKFKNNIAQR/events.json","paper":"https://pith.science/paper/4676ORGE"},"agent_actions":{"view_html":"https://pith.science/pith/4676ORGEAUH7LRVWHKFKNNIAQR","download_json":"https://pith.science/pith/4676ORGEAUH7LRVWHKFKNNIAQR.json","view_paper":"https://pith.science/paper/4676ORGE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.08979&json=true","fetch_graph":"https://pith.science/api/pith-number/4676ORGEAUH7LRVWHKFKNNIAQR/graph.json","fetch_events":"https://pith.science/api/pith-number/4676ORGEAUH7LRVWHKFKNNIAQR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4676ORGEAUH7LRVWHKFKNNIAQR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4676ORGEAUH7LRVWHKFKNNIAQR/action/storage_attestation","attest_author":"https://pith.science/pith/4676ORGEAUH7LRVWHKFKNNIAQR/action/author_attestation","sign_citation":"https://pith.science/pith/4676ORGEAUH7LRVWHKFKNNIAQR/action/citation_signature","submit_replication":"https://pith.science/pith/4676ORGEAUH7LRVWHKFKNNIAQR/action/replication_record"}},"created_at":"2026-05-18T00:10:39.103249+00:00","updated_at":"2026-05-18T00:10:39.103249+00:00"}