{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:4676ORGEAUH7LRVWHKFKNNIAQR","short_pith_number":"pith:4676ORGE","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"},"canonical_sha256":"e7bfe744c4050ff5c6b63a8aa6b500846a7ab82533c8d08bfb44b5f729b72d30","source":{"kind":"arxiv","id":"1709.08979","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.08979","created_at":"2026-05-18T00:10:39Z"},{"alias_kind":"arxiv_version","alias_value":"1709.08979v4","created_at":"2026-05-18T00:10:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.08979","created_at":"2026-05-18T00:10:39Z"},{"alias_kind":"pith_short_12","alias_value":"4676ORGEAUH7","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"4676ORGEAUH7LRVW","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"4676ORGE","created_at":"2026-05-18T12:30:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:4676ORGEAUH7LRVWHKFKNNIAQR","target":"record","payload":{"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"},"canonical_sha256":"e7bfe744c4050ff5c6b63a8aa6b500846a7ab82533c8d08bfb44b5f729b72d30","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"},"source_kind":"arxiv","source_id":"1709.08979","source_version":4,"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:10:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Obh6jtVaGntkA1Ye0/blYXGmuMuJm3R03luPnFBCyqfLnpjkfWmgxy2j2IgT/zSUd2+fOGCJWnGEwQ9wy0spDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T20:30:55.880606Z"},"content_sha256":"e53f31e83e8a8868d46c1e9cff241f4605552a6f1802c55e8324bce60a550e4e","schema_version":"1.0","event_id":"sha256:e53f31e83e8a8868d46c1e9cff241f4605552a6f1802c55e8324bce60a550e4e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:4676ORGEAUH7LRVWHKFKNNIAQR","target":"graph","payload":{"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"},"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:10:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QnUXYoi8xNZBwTFTbTjwS3nGq3cfXOH21GvVWIjkeMUhOvkjpzQvMxXDh26v6w+crKq4CYFqsIhu6s1X6jbkBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T20:30:55.880938Z"},"content_sha256":"8a889bfb8cce98740c1aed084920f44de5ef3d9e40a49b9b0e70e8eee837e9e1","schema_version":"1.0","event_id":"sha256:8a889bfb8cce98740c1aed084920f44de5ef3d9e40a49b9b0e70e8eee837e9e1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4676ORGEAUH7LRVWHKFKNNIAQR/bundle.json","state_url":"https://pith.science/pith/4676ORGEAUH7LRVWHKFKNNIAQR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4676ORGEAUH7LRVWHKFKNNIAQR/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-28T20:30:55Z","links":{"resolver":"https://pith.science/pith/4676ORGEAUH7LRVWHKFKNNIAQR","bundle":"https://pith.science/pith/4676ORGEAUH7LRVWHKFKNNIAQR/bundle.json","state":"https://pith.science/pith/4676ORGEAUH7LRVWHKFKNNIAQR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4676ORGEAUH7LRVWHKFKNNIAQR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:4676ORGEAUH7LRVWHKFKNNIAQR","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":"e03f38ae6ec6ef507cc70701bd33597b967d3667342acb243d5ee422dabc3b9f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2017-09-26T12:40:09Z","title_canon_sha256":"ef4bee21364bcb5556006997f4c35e3b19fc19044c674172c788b7869556f07d"},"schema_version":"1.0","source":{"id":"1709.08979","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.08979","created_at":"2026-05-18T00:10:39Z"},{"alias_kind":"arxiv_version","alias_value":"1709.08979v4","created_at":"2026-05-18T00:10:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.08979","created_at":"2026-05-18T00:10:39Z"},{"alias_kind":"pith_short_12","alias_value":"4676ORGEAUH7","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"4676ORGEAUH7LRVW","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"4676ORGE","created_at":"2026-05-18T12:30:58Z"}],"graph_snapshots":[{"event_id":"sha256:8a889bfb8cce98740c1aed084920f44de5ef3d9e40a49b9b0e70e8eee837e9e1","target":"graph","created_at":"2026-05-18T00:10:39Z","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 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","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-09-26T12:40:09Z","title":"Faster Interpolation Algorithms for Sparse Multivariate Polynomials Given by Straight-Line Programs\\"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.08979","kind":"arxiv","version":4},"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:e53f31e83e8a8868d46c1e9cff241f4605552a6f1802c55e8324bce60a550e4e","target":"record","created_at":"2026-05-18T00:10:39Z","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":"e03f38ae6ec6ef507cc70701bd33597b967d3667342acb243d5ee422dabc3b9f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2017-09-26T12:40:09Z","title_canon_sha256":"ef4bee21364bcb5556006997f4c35e3b19fc19044c674172c788b7869556f07d"},"schema_version":"1.0","source":{"id":"1709.08979","kind":"arxiv","version":4}},"canonical_sha256":"e7bfe744c4050ff5c6b63a8aa6b500846a7ab82533c8d08bfb44b5f729b72d30","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e7bfe744c4050ff5c6b63a8aa6b500846a7ab82533c8d08bfb44b5f729b72d30","first_computed_at":"2026-05-18T00:10:39.103164Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:10:39.103164Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4cs0S1ldcxWv5eQFXp199TFn/Bwi44b6esMkUE5Z5z7qH2WdL+0h7yGuDaNbcGTPalAiNe4SbTbdRdQhGBJMDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:10:39.103756Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.08979","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e53f31e83e8a8868d46c1e9cff241f4605552a6f1802c55e8324bce60a550e4e","sha256:8a889bfb8cce98740c1aed084920f44de5ef3d9e40a49b9b0e70e8eee837e9e1"],"state_sha256":"eff7379ed3d937b4a313591ea33763cc88a7b6396b8d5c4dc208a1c9d68c3f05"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AZfLxWoHHeJQHMcBW8d6JSKtfjVpvKlDfB/DO6+K+RnUqzl+5hYSreHcPsSikqPpGKOVJj3tYPTuYSoYPktjBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T20:30:55.883000Z","bundle_sha256":"bd7828e0a5f9df5e832830c9496d1eab133bb4f08e6e280dd3acde956997f205"}}