{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:4BMZ4C3XRM7XXTGZGVIWT5ZZIJ","short_pith_number":"pith:4BMZ4C3X","schema_version":"1.0","canonical_sha256":"e0599e0b778b3f7bccd9355169f7394250ba9fe10d4ad0cc87ea428a7ad89fb7","source":{"kind":"arxiv","id":"1705.07728","version":3},"attestation_state":"computed","paper":{"title":"Improved method for finding optimal formulae for bilinear maps in a finite field","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM","cs.SC"],"primary_cat":"cs.DS","authors_text":"Svyatoslav Covanov (CARAMBA)","submitted_at":"2017-05-09T06:20:33Z","abstract_excerpt":"In 2012, Barbulescu, Detrey, Estibals and Zimmermann proposed a new framework to exhaustively search for optimal formulae for evaluating bilinear maps, such as Strassen or Karatsuba formulae. The main contribution of this work is a new criterion to aggressively prune useless branches in the exhaustive search, thus leading to the computation of new optimal formulae, in particular for the short product modulo X 5 and the circulant product modulo (X 5 -- 1). Moreover , we are able to prove that there is essentially only one optimal decomposition of the product of 3 x 2 by 2 x 3 matrices up to the"},"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":"1705.07728","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-09T06:20:33Z","cross_cats_sorted":["cs.CC","cs.DM","cs.SC"],"title_canon_sha256":"6e7d1e60ca0370110c78907ad1b8269eea54a517c245a9bae6035bed6fcdf0bd","abstract_canon_sha256":"7b36e8e6baf4dce6d262788f448aa3d8374403d31e02bd797eb7e27929b849cd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:54.756419Z","signature_b64":"fnLHcH4yLQBeSI8wz84Mgpov12zR3ZFwAEVMuK92XzSapBeIFJXSPxda4hPH+ZYKAvB3wEB8wGllVxNm3MxfAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e0599e0b778b3f7bccd9355169f7394250ba9fe10d4ad0cc87ea428a7ad89fb7","last_reissued_at":"2026-05-17T23:58:54.755955Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:54.755955Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved method for finding optimal formulae for bilinear maps in a finite field","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM","cs.SC"],"primary_cat":"cs.DS","authors_text":"Svyatoslav Covanov (CARAMBA)","submitted_at":"2017-05-09T06:20:33Z","abstract_excerpt":"In 2012, Barbulescu, Detrey, Estibals and Zimmermann proposed a new framework to exhaustively search for optimal formulae for evaluating bilinear maps, such as Strassen or Karatsuba formulae. The main contribution of this work is a new criterion to aggressively prune useless branches in the exhaustive search, thus leading to the computation of new optimal formulae, in particular for the short product modulo X 5 and the circulant product modulo (X 5 -- 1). Moreover , we are able to prove that there is essentially only one optimal decomposition of the product of 3 x 2 by 2 x 3 matrices up to the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.07728","kind":"arxiv","version":3},"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":"1705.07728","created_at":"2026-05-17T23:58:54.756030+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.07728v3","created_at":"2026-05-17T23:58:54.756030+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.07728","created_at":"2026-05-17T23:58:54.756030+00:00"},{"alias_kind":"pith_short_12","alias_value":"4BMZ4C3XRM7X","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_16","alias_value":"4BMZ4C3XRM7XXTGZ","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_8","alias_value":"4BMZ4C3X","created_at":"2026-05-18T12:30:58.224056+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/4BMZ4C3XRM7XXTGZGVIWT5ZZIJ","json":"https://pith.science/pith/4BMZ4C3XRM7XXTGZGVIWT5ZZIJ.json","graph_json":"https://pith.science/api/pith-number/4BMZ4C3XRM7XXTGZGVIWT5ZZIJ/graph.json","events_json":"https://pith.science/api/pith-number/4BMZ4C3XRM7XXTGZGVIWT5ZZIJ/events.json","paper":"https://pith.science/paper/4BMZ4C3X"},"agent_actions":{"view_html":"https://pith.science/pith/4BMZ4C3XRM7XXTGZGVIWT5ZZIJ","download_json":"https://pith.science/pith/4BMZ4C3XRM7XXTGZGVIWT5ZZIJ.json","view_paper":"https://pith.science/paper/4BMZ4C3X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.07728&json=true","fetch_graph":"https://pith.science/api/pith-number/4BMZ4C3XRM7XXTGZGVIWT5ZZIJ/graph.json","fetch_events":"https://pith.science/api/pith-number/4BMZ4C3XRM7XXTGZGVIWT5ZZIJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4BMZ4C3XRM7XXTGZGVIWT5ZZIJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4BMZ4C3XRM7XXTGZGVIWT5ZZIJ/action/storage_attestation","attest_author":"https://pith.science/pith/4BMZ4C3XRM7XXTGZGVIWT5ZZIJ/action/author_attestation","sign_citation":"https://pith.science/pith/4BMZ4C3XRM7XXTGZGVIWT5ZZIJ/action/citation_signature","submit_replication":"https://pith.science/pith/4BMZ4C3XRM7XXTGZGVIWT5ZZIJ/action/replication_record"}},"created_at":"2026-05-17T23:58:54.756030+00:00","updated_at":"2026-05-17T23:58:54.756030+00:00"}