{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:TLGLGFK42BIPYWTPYTX4ZS4PKX","short_pith_number":"pith:TLGLGFK4","canonical_record":{"source":{"id":"1402.0643","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-02-04T07:23:14Z","cross_cats_sorted":["cs.SC","math.IT"],"title_canon_sha256":"d52948213792b09ad9f0c41c87185e76e0c46b68b90e271b457b5641edc7f65b","abstract_canon_sha256":"cbe258ff8671a1e3563ed0d46b1d0528a637544a0fc006b404e78c49204d68af"},"schema_version":"1.0"},"canonical_sha256":"9accb3155cd050fc5a6fc4efcccb8f55ef9bc4affb1f6ade1be1cd62ef2e983d","source":{"kind":"arxiv","id":"1402.0643","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.0643","created_at":"2026-05-18T02:27:08Z"},{"alias_kind":"arxiv_version","alias_value":"1402.0643v2","created_at":"2026-05-18T02:27:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.0643","created_at":"2026-05-18T02:27:08Z"},{"alias_kind":"pith_short_12","alias_value":"TLGLGFK42BIP","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"TLGLGFK42BIPYWTP","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"TLGLGFK4","created_at":"2026-05-18T12:28:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:TLGLGFK42BIPYWTPYTX4ZS4PKX","target":"record","payload":{"canonical_record":{"source":{"id":"1402.0643","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-02-04T07:23:14Z","cross_cats_sorted":["cs.SC","math.IT"],"title_canon_sha256":"d52948213792b09ad9f0c41c87185e76e0c46b68b90e271b457b5641edc7f65b","abstract_canon_sha256":"cbe258ff8671a1e3563ed0d46b1d0528a637544a0fc006b404e78c49204d68af"},"schema_version":"1.0"},"canonical_sha256":"9accb3155cd050fc5a6fc4efcccb8f55ef9bc4affb1f6ade1be1cd62ef2e983d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:27:08.064956Z","signature_b64":"F2YjLyHadAp5egmJnVKiQOIP6gSn5WifJHS/96SRJQI1iGW61O6RmEyJnmoB07a/lf58oFjf1pEhSJytR3omBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9accb3155cd050fc5a6fc4efcccb8f55ef9bc4affb1f6ade1be1cd62ef2e983d","last_reissued_at":"2026-05-18T02:27:08.064093Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:27:08.064093Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1402.0643","source_version":2,"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-18T02:27:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PI0k9VRYX4PkBpTZ0dwAlfF78bUistbgy8me3ElJBr8sG6jE/spHVglIjKKdiGfm88FnuJJD3P96bjsVDrrDAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T09:23:51.521836Z"},"content_sha256":"3f7120087ab91d9c29458e9678a0740b3a8d60255abf7cdff4420d526ef3181d","schema_version":"1.0","event_id":"sha256:3f7120087ab91d9c29458e9678a0740b3a8d60255abf7cdff4420d526ef3181d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:TLGLGFK42BIPYWTPYTX4ZS4PKX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Faster Algorithms for Multivariate Interpolation with Multiplicities and Simultaneous Polynomial Approximations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SC","math.IT"],"primary_cat":"cs.IT","authors_text":"Claude-Pierre Jeannerod (LIP, Eric Schost (ORCCA), Gilles Villard (LIP, INRIA Grenoble Rh\\^one-Alpes / LIP Laboratoire de l'Informatique du Parall\\'elisme), LIP, Muhammad F. I. Chowdhury (ORCCA), Vincent Neiger (ORCCA","submitted_at":"2014-02-04T07:23:14Z","abstract_excerpt":"The interpolation step in the Guruswami-Sudan algorithm is a bivariate interpolation problem with multiplicities commonly solved in the literature using either structured linear algebra or basis reduction of polynomial lattices. This problem has been extended to three or more variables; for this generalization, all fast algorithms proposed so far rely on the lattice approach. In this paper, we reduce this multivariate interpolation problem to a problem of simultaneous polynomial approximations, which we solve using fast structured linear algebra. This improves the best known complexity bounds "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.0643","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"},"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-18T02:27:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0cQ+h8GLYtXI+MhURTZ1PDS96365Z9IYHfWSySfHmVsbX22my60LGS3i+o1Z3ZIDSO3lmoTim3cSLinRNkTmDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T09:23:51.522188Z"},"content_sha256":"b8bb7694b5575c5e64b6c30b36bfa1d31eb19c8c2f064cbeef7866524ece807d","schema_version":"1.0","event_id":"sha256:b8bb7694b5575c5e64b6c30b36bfa1d31eb19c8c2f064cbeef7866524ece807d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TLGLGFK42BIPYWTPYTX4ZS4PKX/bundle.json","state_url":"https://pith.science/pith/TLGLGFK42BIPYWTPYTX4ZS4PKX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TLGLGFK42BIPYWTPYTX4ZS4PKX/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-01T09:23:51Z","links":{"resolver":"https://pith.science/pith/TLGLGFK42BIPYWTPYTX4ZS4PKX","bundle":"https://pith.science/pith/TLGLGFK42BIPYWTPYTX4ZS4PKX/bundle.json","state":"https://pith.science/pith/TLGLGFK42BIPYWTPYTX4ZS4PKX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TLGLGFK42BIPYWTPYTX4ZS4PKX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:TLGLGFK42BIPYWTPYTX4ZS4PKX","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":"cbe258ff8671a1e3563ed0d46b1d0528a637544a0fc006b404e78c49204d68af","cross_cats_sorted":["cs.SC","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-02-04T07:23:14Z","title_canon_sha256":"d52948213792b09ad9f0c41c87185e76e0c46b68b90e271b457b5641edc7f65b"},"schema_version":"1.0","source":{"id":"1402.0643","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.0643","created_at":"2026-05-18T02:27:08Z"},{"alias_kind":"arxiv_version","alias_value":"1402.0643v2","created_at":"2026-05-18T02:27:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.0643","created_at":"2026-05-18T02:27:08Z"},{"alias_kind":"pith_short_12","alias_value":"TLGLGFK42BIP","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"TLGLGFK42BIPYWTP","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"TLGLGFK4","created_at":"2026-05-18T12:28:49Z"}],"graph_snapshots":[{"event_id":"sha256:b8bb7694b5575c5e64b6c30b36bfa1d31eb19c8c2f064cbeef7866524ece807d","target":"graph","created_at":"2026-05-18T02:27:08Z","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":"The interpolation step in the Guruswami-Sudan algorithm is a bivariate interpolation problem with multiplicities commonly solved in the literature using either structured linear algebra or basis reduction of polynomial lattices. This problem has been extended to three or more variables; for this generalization, all fast algorithms proposed so far rely on the lattice approach. In this paper, we reduce this multivariate interpolation problem to a problem of simultaneous polynomial approximations, which we solve using fast structured linear algebra. This improves the best known complexity bounds ","authors_text":"Claude-Pierre Jeannerod (LIP, Eric Schost (ORCCA), Gilles Villard (LIP, INRIA Grenoble Rh\\^one-Alpes / LIP Laboratoire de l'Informatique du Parall\\'elisme), LIP, Muhammad F. I. Chowdhury (ORCCA), Vincent Neiger (ORCCA","cross_cats":["cs.SC","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-02-04T07:23:14Z","title":"Faster Algorithms for Multivariate Interpolation with Multiplicities and Simultaneous Polynomial Approximations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.0643","kind":"arxiv","version":2},"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:3f7120087ab91d9c29458e9678a0740b3a8d60255abf7cdff4420d526ef3181d","target":"record","created_at":"2026-05-18T02:27:08Z","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":"cbe258ff8671a1e3563ed0d46b1d0528a637544a0fc006b404e78c49204d68af","cross_cats_sorted":["cs.SC","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-02-04T07:23:14Z","title_canon_sha256":"d52948213792b09ad9f0c41c87185e76e0c46b68b90e271b457b5641edc7f65b"},"schema_version":"1.0","source":{"id":"1402.0643","kind":"arxiv","version":2}},"canonical_sha256":"9accb3155cd050fc5a6fc4efcccb8f55ef9bc4affb1f6ade1be1cd62ef2e983d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9accb3155cd050fc5a6fc4efcccb8f55ef9bc4affb1f6ade1be1cd62ef2e983d","first_computed_at":"2026-05-18T02:27:08.064093Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:27:08.064093Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"F2YjLyHadAp5egmJnVKiQOIP6gSn5WifJHS/96SRJQI1iGW61O6RmEyJnmoB07a/lf58oFjf1pEhSJytR3omBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:27:08.064956Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.0643","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3f7120087ab91d9c29458e9678a0740b3a8d60255abf7cdff4420d526ef3181d","sha256:b8bb7694b5575c5e64b6c30b36bfa1d31eb19c8c2f064cbeef7866524ece807d"],"state_sha256":"8fa1e20cb51be37881e346481b6c197e666054cef3afc148c639a952e8eee16c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9OIpJFKsFZ8zf/RT9EAs13YCrhI+uCbVFj/4oIMCs9VXwS2TGaHjhFW1cN/Ffcxfmatq8ipsPmc4Jg5kMNgMAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T09:23:51.524187Z","bundle_sha256":"8e5fd3d5e2db8708b504f96e2a528732cbb604f1ba84a081604c83935d7d8069"}}