{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:MYF3FRO5J7ZOF6W75WFBCTNS2X","short_pith_number":"pith:MYF3FRO5","canonical_record":{"source":{"id":"1802.01920","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2018-02-06T12:57:47Z","cross_cats_sorted":[],"title_canon_sha256":"707508470b74a864cea1448a2d92dcec1fea6417ece064f8515d7b9ed75b890b","abstract_canon_sha256":"eff9a42666391b9f38c0f636c28ad9bb57f596e2a91eb2c4cf6cc95ee76dcc58"},"schema_version":"1.0"},"canonical_sha256":"660bb2c5dd4ff2e2fadfed8a114db2d5d7b919e384957248902e3a211585304d","source":{"kind":"arxiv","id":"1802.01920","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.01920","created_at":"2026-05-18T00:15:42Z"},{"alias_kind":"arxiv_version","alias_value":"1802.01920v2","created_at":"2026-05-18T00:15:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.01920","created_at":"2026-05-18T00:15:42Z"},{"alias_kind":"pith_short_12","alias_value":"MYF3FRO5J7ZO","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"MYF3FRO5J7ZOF6W7","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"MYF3FRO5","created_at":"2026-05-18T12:32:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:MYF3FRO5J7ZOF6W75WFBCTNS2X","target":"record","payload":{"canonical_record":{"source":{"id":"1802.01920","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2018-02-06T12:57:47Z","cross_cats_sorted":[],"title_canon_sha256":"707508470b74a864cea1448a2d92dcec1fea6417ece064f8515d7b9ed75b890b","abstract_canon_sha256":"eff9a42666391b9f38c0f636c28ad9bb57f596e2a91eb2c4cf6cc95ee76dcc58"},"schema_version":"1.0"},"canonical_sha256":"660bb2c5dd4ff2e2fadfed8a114db2d5d7b919e384957248902e3a211585304d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:42.854972Z","signature_b64":"SN6Cd+mij8aoIEy0M5LPcU6rc4I+5ELe9/8Z362A3bh78QSY0ozCQEoHvh/9PzUvKukhwSxotC8blNtglBE8Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"660bb2c5dd4ff2e2fadfed8a114db2d5d7b919e384957248902e3a211585304d","last_reissued_at":"2026-05-18T00:15:42.854475Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:42.854475Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.01920","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-18T00:15:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O0z68WadIEvEFf0qDXPaJeSBCbJIcgUbHWAok924tY2mjZpmXY0c6CV0jEM/nn97bcxlhlhwHnyJIsYPUGCgBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T19:02:38.480954Z"},"content_sha256":"886feb8958c9e98efd8d78f498a9b180f2674c69669bfca589db0eaa9517cfe6","schema_version":"1.0","event_id":"sha256:886feb8958c9e98efd8d78f498a9b180f2674c69669bfca589db0eaa9517cfe6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:MYF3FRO5J7ZOF6W75WFBCTNS2X","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Certification of minimal approximant bases","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SC","authors_text":"Pascal Giorgi, Vincent Neiger","submitted_at":"2018-02-06T12:57:47Z","abstract_excerpt":"For a given computational problem, a certificate is a piece of data that one (the prover) attaches to the output with the aim of allowing efficient verification (by the verifier) that this output is correct. Here, we consider the minimal approximant basis problem, for which the fastest known algorithms output a polynomial matrix of dimensions $m \\times m$ and average degree $D/m$ using $O\\tilde{~}(m^\\omega \\frac{D}{m})$ field operations. We propose a certificate which, for typical instances of the problem, is computed by the prover using $O(m^\\omega \\frac{D}{m})$ additional field operations an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.01920","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-18T00:15:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aWaksKtpj6BShROPZvuECRDUXxPdGyGXjDPqDuMrWyuYt7Q6tL2kokWoOMHR1OTi1/S9KFFaxfXgWL7ddR6tAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T19:02:38.481293Z"},"content_sha256":"d87eff3bd14eb830fb48b53a6f3d773e05820c39a0d01df0f5ba266c0360501d","schema_version":"1.0","event_id":"sha256:d87eff3bd14eb830fb48b53a6f3d773e05820c39a0d01df0f5ba266c0360501d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MYF3FRO5J7ZOF6W75WFBCTNS2X/bundle.json","state_url":"https://pith.science/pith/MYF3FRO5J7ZOF6W75WFBCTNS2X/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MYF3FRO5J7ZOF6W75WFBCTNS2X/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-01T19:02:38Z","links":{"resolver":"https://pith.science/pith/MYF3FRO5J7ZOF6W75WFBCTNS2X","bundle":"https://pith.science/pith/MYF3FRO5J7ZOF6W75WFBCTNS2X/bundle.json","state":"https://pith.science/pith/MYF3FRO5J7ZOF6W75WFBCTNS2X/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MYF3FRO5J7ZOF6W75WFBCTNS2X/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:MYF3FRO5J7ZOF6W75WFBCTNS2X","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":"eff9a42666391b9f38c0f636c28ad9bb57f596e2a91eb2c4cf6cc95ee76dcc58","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2018-02-06T12:57:47Z","title_canon_sha256":"707508470b74a864cea1448a2d92dcec1fea6417ece064f8515d7b9ed75b890b"},"schema_version":"1.0","source":{"id":"1802.01920","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.01920","created_at":"2026-05-18T00:15:42Z"},{"alias_kind":"arxiv_version","alias_value":"1802.01920v2","created_at":"2026-05-18T00:15:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.01920","created_at":"2026-05-18T00:15:42Z"},{"alias_kind":"pith_short_12","alias_value":"MYF3FRO5J7ZO","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"MYF3FRO5J7ZOF6W7","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"MYF3FRO5","created_at":"2026-05-18T12:32:40Z"}],"graph_snapshots":[{"event_id":"sha256:d87eff3bd14eb830fb48b53a6f3d773e05820c39a0d01df0f5ba266c0360501d","target":"graph","created_at":"2026-05-18T00:15:42Z","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":"For a given computational problem, a certificate is a piece of data that one (the prover) attaches to the output with the aim of allowing efficient verification (by the verifier) that this output is correct. Here, we consider the minimal approximant basis problem, for which the fastest known algorithms output a polynomial matrix of dimensions $m \\times m$ and average degree $D/m$ using $O\\tilde{~}(m^\\omega \\frac{D}{m})$ field operations. We propose a certificate which, for typical instances of the problem, is computed by the prover using $O(m^\\omega \\frac{D}{m})$ additional field operations an","authors_text":"Pascal Giorgi, Vincent Neiger","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2018-02-06T12:57:47Z","title":"Certification of minimal approximant bases"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.01920","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:886feb8958c9e98efd8d78f498a9b180f2674c69669bfca589db0eaa9517cfe6","target":"record","created_at":"2026-05-18T00:15:42Z","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":"eff9a42666391b9f38c0f636c28ad9bb57f596e2a91eb2c4cf6cc95ee76dcc58","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2018-02-06T12:57:47Z","title_canon_sha256":"707508470b74a864cea1448a2d92dcec1fea6417ece064f8515d7b9ed75b890b"},"schema_version":"1.0","source":{"id":"1802.01920","kind":"arxiv","version":2}},"canonical_sha256":"660bb2c5dd4ff2e2fadfed8a114db2d5d7b919e384957248902e3a211585304d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"660bb2c5dd4ff2e2fadfed8a114db2d5d7b919e384957248902e3a211585304d","first_computed_at":"2026-05-18T00:15:42.854475Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:15:42.854475Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SN6Cd+mij8aoIEy0M5LPcU6rc4I+5ELe9/8Z362A3bh78QSY0ozCQEoHvh/9PzUvKukhwSxotC8blNtglBE8Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:15:42.854972Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.01920","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:886feb8958c9e98efd8d78f498a9b180f2674c69669bfca589db0eaa9517cfe6","sha256:d87eff3bd14eb830fb48b53a6f3d773e05820c39a0d01df0f5ba266c0360501d"],"state_sha256":"de77a501447ffd6ed480bbf4e20150c0ffec732130d4bcf0ee9ea6fb3e2f8012"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7/k6q1EapOpf84skgaMxTG4IcYZDeltfnHOlr4QnEFZas753CcYr7lNnM7PKTbSAx5dTypxdlPNI1wKHUbgSAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T19:02:38.483385Z","bundle_sha256":"a5988905f81c00555db028102f5eb74950c1931422881c41a2f06d60492fd479"}}