{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:3QWSXAATDXFLKCL43YMGBFPHOW","short_pith_number":"pith:3QWSXAAT","canonical_record":{"source":{"id":"1801.04553","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2018-01-14T13:14:41Z","cross_cats_sorted":[],"title_canon_sha256":"b79c2a3ae506b94de20cbc589658e1e3cd722d893bffb1934b69683fac8b0c6d","abstract_canon_sha256":"0fac088efbd2a51bd7328b6d23087bdd5ad08447d993d792f741aa198b718c5c"},"schema_version":"1.0"},"canonical_sha256":"dc2d2b80131dcab5097cde186095e7758ba6e92306f0779ed030be5783bddf65","source":{"kind":"arxiv","id":"1801.04553","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.04553","created_at":"2026-05-17T23:49:17Z"},{"alias_kind":"arxiv_version","alias_value":"1801.04553v2","created_at":"2026-05-17T23:49:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.04553","created_at":"2026-05-17T23:49:17Z"},{"alias_kind":"pith_short_12","alias_value":"3QWSXAATDXFL","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"3QWSXAATDXFLKCL4","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"3QWSXAAT","created_at":"2026-05-18T12:32:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:3QWSXAATDXFLKCL43YMGBFPHOW","target":"record","payload":{"canonical_record":{"source":{"id":"1801.04553","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2018-01-14T13:14:41Z","cross_cats_sorted":[],"title_canon_sha256":"b79c2a3ae506b94de20cbc589658e1e3cd722d893bffb1934b69683fac8b0c6d","abstract_canon_sha256":"0fac088efbd2a51bd7328b6d23087bdd5ad08447d993d792f741aa198b718c5c"},"schema_version":"1.0"},"canonical_sha256":"dc2d2b80131dcab5097cde186095e7758ba6e92306f0779ed030be5783bddf65","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:49:17.828431Z","signature_b64":"2oEx4VQxVaCXZH2wa+JEBkCTHGdsF95Y+Vf1YmTMqy7vwqatLUc11/WLY1bxs5xgbtiLKLOFzQjrnJV67N6dBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dc2d2b80131dcab5097cde186095e7758ba6e92306f0779ed030be5783bddf65","last_reissued_at":"2026-05-17T23:49:17.827870Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:49:17.827870Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.04553","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-17T23:49:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/zScii40kIp6mogkvYfPXn64DgpACA/PaHCO2N7sBXoMdxbpjN++fmpq0d/i9CA0OijovLX5oPhgJg8JUe7vCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T06:58:33.930516Z"},"content_sha256":"4159f674c80af6fe294f5247cee3645457b4ef20436daee3f2c9232e6e95758b","schema_version":"1.0","event_id":"sha256:4159f674c80af6fe294f5247cee3645457b4ef20436daee3f2c9232e6e95758b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:3QWSXAATDXFLKCL43YMGBFPHOW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast computation of approximant bases in canonical form","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SC","authors_text":"Claude-Pierre Jeannerod, Gilles Villard, Vincent Neiger","submitted_at":"2018-01-14T13:14:41Z","abstract_excerpt":"In this article, we design fast algorithms for the computation of approximant bases in shifted Popov normal form. We first recall the algorithm known as PM-Basis, which will be our second fundamental engine after polynomial matrix multiplication: most other fast approximant basis algorithms basically aim at efficiently reducing the input instance to instances for which PM-Basis is fast. Such reductions usually involve partial linearization techniques due to Storjohann, which have the effect of balancing the degrees and dimensions in the manipulated matrices.\n  Following these ideas, Zhou and L"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.04553","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-17T23:49:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PYoFTdd2e09+6gNOTN06F1Bl6PxxIVi21gQ4UIahCtCP1EoJ5TNWuwWJikLzf1hUmi7F9RiTRKdb8ADg9Kj/CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T06:58:33.930874Z"},"content_sha256":"71afc5209c52ea43c5781c451a440b1f1ec3e447dcb7d99c880d91ebcced1097","schema_version":"1.0","event_id":"sha256:71afc5209c52ea43c5781c451a440b1f1ec3e447dcb7d99c880d91ebcced1097"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3QWSXAATDXFLKCL43YMGBFPHOW/bundle.json","state_url":"https://pith.science/pith/3QWSXAATDXFLKCL43YMGBFPHOW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3QWSXAATDXFLKCL43YMGBFPHOW/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-05-20T06:58:33Z","links":{"resolver":"https://pith.science/pith/3QWSXAATDXFLKCL43YMGBFPHOW","bundle":"https://pith.science/pith/3QWSXAATDXFLKCL43YMGBFPHOW/bundle.json","state":"https://pith.science/pith/3QWSXAATDXFLKCL43YMGBFPHOW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3QWSXAATDXFLKCL43YMGBFPHOW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:3QWSXAATDXFLKCL43YMGBFPHOW","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":"0fac088efbd2a51bd7328b6d23087bdd5ad08447d993d792f741aa198b718c5c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2018-01-14T13:14:41Z","title_canon_sha256":"b79c2a3ae506b94de20cbc589658e1e3cd722d893bffb1934b69683fac8b0c6d"},"schema_version":"1.0","source":{"id":"1801.04553","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.04553","created_at":"2026-05-17T23:49:17Z"},{"alias_kind":"arxiv_version","alias_value":"1801.04553v2","created_at":"2026-05-17T23:49:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.04553","created_at":"2026-05-17T23:49:17Z"},{"alias_kind":"pith_short_12","alias_value":"3QWSXAATDXFL","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"3QWSXAATDXFLKCL4","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"3QWSXAAT","created_at":"2026-05-18T12:32:02Z"}],"graph_snapshots":[{"event_id":"sha256:71afc5209c52ea43c5781c451a440b1f1ec3e447dcb7d99c880d91ebcced1097","target":"graph","created_at":"2026-05-17T23:49:17Z","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 article, we design fast algorithms for the computation of approximant bases in shifted Popov normal form. We first recall the algorithm known as PM-Basis, which will be our second fundamental engine after polynomial matrix multiplication: most other fast approximant basis algorithms basically aim at efficiently reducing the input instance to instances for which PM-Basis is fast. Such reductions usually involve partial linearization techniques due to Storjohann, which have the effect of balancing the degrees and dimensions in the manipulated matrices.\n  Following these ideas, Zhou and L","authors_text":"Claude-Pierre Jeannerod, Gilles Villard, Vincent Neiger","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2018-01-14T13:14:41Z","title":"Fast computation of approximant bases in canonical form"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.04553","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:4159f674c80af6fe294f5247cee3645457b4ef20436daee3f2c9232e6e95758b","target":"record","created_at":"2026-05-17T23:49:17Z","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":"0fac088efbd2a51bd7328b6d23087bdd5ad08447d993d792f741aa198b718c5c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2018-01-14T13:14:41Z","title_canon_sha256":"b79c2a3ae506b94de20cbc589658e1e3cd722d893bffb1934b69683fac8b0c6d"},"schema_version":"1.0","source":{"id":"1801.04553","kind":"arxiv","version":2}},"canonical_sha256":"dc2d2b80131dcab5097cde186095e7758ba6e92306f0779ed030be5783bddf65","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dc2d2b80131dcab5097cde186095e7758ba6e92306f0779ed030be5783bddf65","first_computed_at":"2026-05-17T23:49:17.827870Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:49:17.827870Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2oEx4VQxVaCXZH2wa+JEBkCTHGdsF95Y+Vf1YmTMqy7vwqatLUc11/WLY1bxs5xgbtiLKLOFzQjrnJV67N6dBA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:49:17.828431Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.04553","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4159f674c80af6fe294f5247cee3645457b4ef20436daee3f2c9232e6e95758b","sha256:71afc5209c52ea43c5781c451a440b1f1ec3e447dcb7d99c880d91ebcced1097"],"state_sha256":"6ab8fb3d45a1c10c344e4d14aa94142074e5c29a9eeee2aeda505700c316e3d6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SgGb+RgXkFEey7KuOAUSBRClUcNknbN75ZgrDGHj6TMfFnTD15w7hBA1z0hsbgqiltOWIPpur90+d7NWBlPqCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T06:58:33.932924Z","bundle_sha256":"67150680c8b4efd4b9ff636581575b0e9f51588226f18b7b1a075c2bd8f93fb5"}}