{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:FOEJP5ZHAB5EQG33IRQUZLOJRA","short_pith_number":"pith:FOEJP5ZH","schema_version":"1.0","canonical_sha256":"2b8897f727007a481b7b44614cadc98804f8d0fe36caf9f377a78fb852aab8eb","source":{"kind":"arxiv","id":"1706.00914","version":1},"attestation_state":"computed","paper":{"title":"Sparse Rational Function 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-06-03T09:03:39Z","abstract_excerpt":"In this paper, we give new sparse interpolation algorithms for black box univariate and multivariate rational functions h=f/g whose coefficients are integers with an upper bound. The main idea is as follows: choose a proper integer beta and let h(beta) = a/b with gcd(a,b)=1. Then f and g can be computed by solving the polynomial interpolation problems f(beta)=ka and g(beta)=ka for some integer k. It is shown that the univariate interpolation algorithm is almost optimal and multivariate interpolation algorithm has low complexity in T but the data size is exponential in n."},"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":"1706.00914","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2017-06-03T09:03:39Z","cross_cats_sorted":[],"title_canon_sha256":"d720baa8a1e78196042468cd5f1f92f9a2e222393444d97f4f4218a4783d8ed2","abstract_canon_sha256":"d2be6a7f2b052061646e048407996e88785f0f7aeb0980b4cd7527dd3e473cca"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:07.426423Z","signature_b64":"31zcsBkd3S0BGofMMkKXhjPPe527Qa1v/+fGfAtYQF6/L48ScORcYaTuSUL9CRbqGCPvUaaqUZaYoSywYRJgAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2b8897f727007a481b7b44614cadc98804f8d0fe36caf9f377a78fb852aab8eb","last_reissued_at":"2026-05-18T00:43:07.425739Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:07.425739Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sparse Rational Function 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-06-03T09:03:39Z","abstract_excerpt":"In this paper, we give new sparse interpolation algorithms for black box univariate and multivariate rational functions h=f/g whose coefficients are integers with an upper bound. The main idea is as follows: choose a proper integer beta and let h(beta) = a/b with gcd(a,b)=1. Then f and g can be computed by solving the polynomial interpolation problems f(beta)=ka and g(beta)=ka for some integer k. It is shown that the univariate interpolation algorithm is almost optimal and multivariate interpolation algorithm has low complexity in T but the data size is exponential in n."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.00914","kind":"arxiv","version":1},"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":"1706.00914","created_at":"2026-05-18T00:43:07.425865+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.00914v1","created_at":"2026-05-18T00:43:07.425865+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.00914","created_at":"2026-05-18T00:43:07.425865+00:00"},{"alias_kind":"pith_short_12","alias_value":"FOEJP5ZHAB5E","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_16","alias_value":"FOEJP5ZHAB5EQG33","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_8","alias_value":"FOEJP5ZH","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/FOEJP5ZHAB5EQG33IRQUZLOJRA","json":"https://pith.science/pith/FOEJP5ZHAB5EQG33IRQUZLOJRA.json","graph_json":"https://pith.science/api/pith-number/FOEJP5ZHAB5EQG33IRQUZLOJRA/graph.json","events_json":"https://pith.science/api/pith-number/FOEJP5ZHAB5EQG33IRQUZLOJRA/events.json","paper":"https://pith.science/paper/FOEJP5ZH"},"agent_actions":{"view_html":"https://pith.science/pith/FOEJP5ZHAB5EQG33IRQUZLOJRA","download_json":"https://pith.science/pith/FOEJP5ZHAB5EQG33IRQUZLOJRA.json","view_paper":"https://pith.science/paper/FOEJP5ZH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.00914&json=true","fetch_graph":"https://pith.science/api/pith-number/FOEJP5ZHAB5EQG33IRQUZLOJRA/graph.json","fetch_events":"https://pith.science/api/pith-number/FOEJP5ZHAB5EQG33IRQUZLOJRA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FOEJP5ZHAB5EQG33IRQUZLOJRA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FOEJP5ZHAB5EQG33IRQUZLOJRA/action/storage_attestation","attest_author":"https://pith.science/pith/FOEJP5ZHAB5EQG33IRQUZLOJRA/action/author_attestation","sign_citation":"https://pith.science/pith/FOEJP5ZHAB5EQG33IRQUZLOJRA/action/citation_signature","submit_replication":"https://pith.science/pith/FOEJP5ZHAB5EQG33IRQUZLOJRA/action/replication_record"}},"created_at":"2026-05-18T00:43:07.425865+00:00","updated_at":"2026-05-18T00:43:07.425865+00:00"}