{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:FOEJP5ZHAB5EQG33IRQUZLOJRA","short_pith_number":"pith:FOEJP5ZH","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"},"canonical_sha256":"2b8897f727007a481b7b44614cadc98804f8d0fe36caf9f377a78fb852aab8eb","source":{"kind":"arxiv","id":"1706.00914","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.00914","created_at":"2026-05-18T00:43:07Z"},{"alias_kind":"arxiv_version","alias_value":"1706.00914v1","created_at":"2026-05-18T00:43:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.00914","created_at":"2026-05-18T00:43:07Z"},{"alias_kind":"pith_short_12","alias_value":"FOEJP5ZHAB5E","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FOEJP5ZHAB5EQG33","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FOEJP5ZH","created_at":"2026-05-18T12:31:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:FOEJP5ZHAB5EQG33IRQUZLOJRA","target":"record","payload":{"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"},"canonical_sha256":"2b8897f727007a481b7b44614cadc98804f8d0fe36caf9f377a78fb852aab8eb","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"},"source_kind":"arxiv","source_id":"1706.00914","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:43:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R6JojD5gugATsy136gu62hiUtQ4n9g6yt9Px5V7l5G00c6t09psRS3qDU5OLnQGFOxNuETwVFswcKx4SsBQ5Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T17:12:01.607134Z"},"content_sha256":"aa5e8c76f9d196307f11d553ec21f3ea0cd7f69bdc14c8323f6a10b148b47f7c","schema_version":"1.0","event_id":"sha256:aa5e8c76f9d196307f11d553ec21f3ea0cd7f69bdc14c8323f6a10b148b47f7c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:FOEJP5ZHAB5EQG33IRQUZLOJRA","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:43:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IJ2kkfBkve4dR6Yp5PYejuhPgrH8VTRGcycSAWTLiWVaIixP8Apg93E79/6sMwZrL16AH3JeUBrIb8psiLt+CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T17:12:01.607485Z"},"content_sha256":"0fd5b9f49811e57d0f02aadc207b6e288d99ae1c84cea4e906e0829da5d30d99","schema_version":"1.0","event_id":"sha256:0fd5b9f49811e57d0f02aadc207b6e288d99ae1c84cea4e906e0829da5d30d99"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FOEJP5ZHAB5EQG33IRQUZLOJRA/bundle.json","state_url":"https://pith.science/pith/FOEJP5ZHAB5EQG33IRQUZLOJRA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FOEJP5ZHAB5EQG33IRQUZLOJRA/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-28T17:12:01Z","links":{"resolver":"https://pith.science/pith/FOEJP5ZHAB5EQG33IRQUZLOJRA","bundle":"https://pith.science/pith/FOEJP5ZHAB5EQG33IRQUZLOJRA/bundle.json","state":"https://pith.science/pith/FOEJP5ZHAB5EQG33IRQUZLOJRA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FOEJP5ZHAB5EQG33IRQUZLOJRA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:FOEJP5ZHAB5EQG33IRQUZLOJRA","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"d2be6a7f2b052061646e048407996e88785f0f7aeb0980b4cd7527dd3e473cca","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2017-06-03T09:03:39Z","title_canon_sha256":"d720baa8a1e78196042468cd5f1f92f9a2e222393444d97f4f4218a4783d8ed2"},"schema_version":"1.0","source":{"id":"1706.00914","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.00914","created_at":"2026-05-18T00:43:07Z"},{"alias_kind":"arxiv_version","alias_value":"1706.00914v1","created_at":"2026-05-18T00:43:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.00914","created_at":"2026-05-18T00:43:07Z"},{"alias_kind":"pith_short_12","alias_value":"FOEJP5ZHAB5E","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FOEJP5ZHAB5EQG33","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FOEJP5ZH","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:0fd5b9f49811e57d0f02aadc207b6e288d99ae1c84cea4e906e0829da5d30d99","target":"graph","created_at":"2026-05-18T00:43:07Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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.","authors_text":"Qiao-Long Huang, Xiao-Shan Gao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2017-06-03T09:03:39Z","title":"Sparse Rational Function Interpolation with Finitely Many Values for the Coefficients"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.00914","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:aa5e8c76f9d196307f11d553ec21f3ea0cd7f69bdc14c8323f6a10b148b47f7c","target":"record","created_at":"2026-05-18T00:43:07Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"d2be6a7f2b052061646e048407996e88785f0f7aeb0980b4cd7527dd3e473cca","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2017-06-03T09:03:39Z","title_canon_sha256":"d720baa8a1e78196042468cd5f1f92f9a2e222393444d97f4f4218a4783d8ed2"},"schema_version":"1.0","source":{"id":"1706.00914","kind":"arxiv","version":1}},"canonical_sha256":"2b8897f727007a481b7b44614cadc98804f8d0fe36caf9f377a78fb852aab8eb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2b8897f727007a481b7b44614cadc98804f8d0fe36caf9f377a78fb852aab8eb","first_computed_at":"2026-05-18T00:43:07.425739Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:43:07.425739Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"31zcsBkd3S0BGofMMkKXhjPPe527Qa1v/+fGfAtYQF6/L48ScORcYaTuSUL9CRbqGCPvUaaqUZaYoSywYRJgAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:43:07.426423Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.00914","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aa5e8c76f9d196307f11d553ec21f3ea0cd7f69bdc14c8323f6a10b148b47f7c","sha256:0fd5b9f49811e57d0f02aadc207b6e288d99ae1c84cea4e906e0829da5d30d99"],"state_sha256":"0bd72e6de48f0e859e16518c5cab52fa4f779dd8a58cf944c563ad813ebab3da"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ey14qniKDS0PaM919m/zV5aCI/nNvBG5BHay/trQFdKH1SfpS+sRnnqezI/DRBE0U2NaSxRWIa90Rn54yf++BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T17:12:01.610676Z","bundle_sha256":"2c843b68740eddfaddece377785e4551f447b817cf9406005b54c52624a743a8"}}