{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:MYF3FRO5J7ZOF6W75WFBCTNS2X","short_pith_number":"pith:MYF3FRO5","schema_version":"1.0","canonical_sha256":"660bb2c5dd4ff2e2fadfed8a114db2d5d7b919e384957248902e3a211585304d","source":{"kind":"arxiv","id":"1802.01920","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1802.01920","created_at":"2026-05-18T00:15:42.854554+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.01920v2","created_at":"2026-05-18T00:15:42.854554+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.01920","created_at":"2026-05-18T00:15:42.854554+00:00"},{"alias_kind":"pith_short_12","alias_value":"MYF3FRO5J7ZO","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_16","alias_value":"MYF3FRO5J7ZOF6W7","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_8","alias_value":"MYF3FRO5","created_at":"2026-05-18T12:32:40.477152+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MYF3FRO5J7ZOF6W75WFBCTNS2X","json":"https://pith.science/pith/MYF3FRO5J7ZOF6W75WFBCTNS2X.json","graph_json":"https://pith.science/api/pith-number/MYF3FRO5J7ZOF6W75WFBCTNS2X/graph.json","events_json":"https://pith.science/api/pith-number/MYF3FRO5J7ZOF6W75WFBCTNS2X/events.json","paper":"https://pith.science/paper/MYF3FRO5"},"agent_actions":{"view_html":"https://pith.science/pith/MYF3FRO5J7ZOF6W75WFBCTNS2X","download_json":"https://pith.science/pith/MYF3FRO5J7ZOF6W75WFBCTNS2X.json","view_paper":"https://pith.science/paper/MYF3FRO5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.01920&json=true","fetch_graph":"https://pith.science/api/pith-number/MYF3FRO5J7ZOF6W75WFBCTNS2X/graph.json","fetch_events":"https://pith.science/api/pith-number/MYF3FRO5J7ZOF6W75WFBCTNS2X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MYF3FRO5J7ZOF6W75WFBCTNS2X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MYF3FRO5J7ZOF6W75WFBCTNS2X/action/storage_attestation","attest_author":"https://pith.science/pith/MYF3FRO5J7ZOF6W75WFBCTNS2X/action/author_attestation","sign_citation":"https://pith.science/pith/MYF3FRO5J7ZOF6W75WFBCTNS2X/action/citation_signature","submit_replication":"https://pith.science/pith/MYF3FRO5J7ZOF6W75WFBCTNS2X/action/replication_record"}},"created_at":"2026-05-18T00:15:42.854554+00:00","updated_at":"2026-05-18T00:15:42.854554+00:00"}