{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:FA4DDW6AVBERIE4XM4MEOVPNYF","short_pith_number":"pith:FA4DDW6A","schema_version":"1.0","canonical_sha256":"283831dbc0a84914139767184755edc1612862362ad800143dc441eb166b9ebb","source":{"kind":"arxiv","id":"1803.05252","version":2},"attestation_state":"computed","paper":{"title":"Algebraic Machine Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM","math.AC","math.RA"],"primary_cat":"cs.LG","authors_text":"Fernando Martin-Maroto, Gonzalo G. de Polavieja","submitted_at":"2018-03-14T13:09:35Z","abstract_excerpt":"Machine learning algorithms use error function minimization to fit a large set of parameters in a preexisting model. However, error minimization eventually leads to a memorization of the training dataset, losing the ability to generalize to other datasets. To achieve generalization something else is needed, for example a regularization method or stopping the training when error in a validation dataset is minimal. Here we propose a different approach to learning and generalization that is parameter-free, fully discrete and that does not use function minimization. We use the training data to fin"},"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":"1803.05252","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2018-03-14T13:09:35Z","cross_cats_sorted":["cs.DM","math.AC","math.RA"],"title_canon_sha256":"11fc50a7fbb4d2f3e002e0fc9d6ddc6c0d455af3513ce2176fd4c666dc2f2291","abstract_canon_sha256":"692633a0654454bc7fe184790956da8839e1b0a81d0d7fcc9968794c1cb58bbf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:55.448607Z","signature_b64":"E6SYT/PqP760M6lHvcnE2bCQxnkBzsoSyjUhUbPcLsNzhMpJRjtWtwlbTy0IECM9uqLZ2z5DJ6eVrTOnAfWOBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"283831dbc0a84914139767184755edc1612862362ad800143dc441eb166b9ebb","last_reissued_at":"2026-05-18T00:20:55.447921Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:55.447921Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Algebraic Machine Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM","math.AC","math.RA"],"primary_cat":"cs.LG","authors_text":"Fernando Martin-Maroto, Gonzalo G. de Polavieja","submitted_at":"2018-03-14T13:09:35Z","abstract_excerpt":"Machine learning algorithms use error function minimization to fit a large set of parameters in a preexisting model. However, error minimization eventually leads to a memorization of the training dataset, losing the ability to generalize to other datasets. To achieve generalization something else is needed, for example a regularization method or stopping the training when error in a validation dataset is minimal. Here we propose a different approach to learning and generalization that is parameter-free, fully discrete and that does not use function minimization. We use the training data to fin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.05252","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":"1803.05252","created_at":"2026-05-18T00:20:55.448024+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.05252v2","created_at":"2026-05-18T00:20:55.448024+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.05252","created_at":"2026-05-18T00:20:55.448024+00:00"},{"alias_kind":"pith_short_12","alias_value":"FA4DDW6AVBER","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_16","alias_value":"FA4DDW6AVBERIE4X","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_8","alias_value":"FA4DDW6A","created_at":"2026-05-18T12:32:22.470017+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.22155","citing_title":"Algebraic Machine Learning for Small-to-Medium Datasets Is Competitive against Strong Standard Baselines","ref_index":9,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FA4DDW6AVBERIE4XM4MEOVPNYF","json":"https://pith.science/pith/FA4DDW6AVBERIE4XM4MEOVPNYF.json","graph_json":"https://pith.science/api/pith-number/FA4DDW6AVBERIE4XM4MEOVPNYF/graph.json","events_json":"https://pith.science/api/pith-number/FA4DDW6AVBERIE4XM4MEOVPNYF/events.json","paper":"https://pith.science/paper/FA4DDW6A"},"agent_actions":{"view_html":"https://pith.science/pith/FA4DDW6AVBERIE4XM4MEOVPNYF","download_json":"https://pith.science/pith/FA4DDW6AVBERIE4XM4MEOVPNYF.json","view_paper":"https://pith.science/paper/FA4DDW6A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.05252&json=true","fetch_graph":"https://pith.science/api/pith-number/FA4DDW6AVBERIE4XM4MEOVPNYF/graph.json","fetch_events":"https://pith.science/api/pith-number/FA4DDW6AVBERIE4XM4MEOVPNYF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FA4DDW6AVBERIE4XM4MEOVPNYF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FA4DDW6AVBERIE4XM4MEOVPNYF/action/storage_attestation","attest_author":"https://pith.science/pith/FA4DDW6AVBERIE4XM4MEOVPNYF/action/author_attestation","sign_citation":"https://pith.science/pith/FA4DDW6AVBERIE4XM4MEOVPNYF/action/citation_signature","submit_replication":"https://pith.science/pith/FA4DDW6AVBERIE4XM4MEOVPNYF/action/replication_record"}},"created_at":"2026-05-18T00:20:55.448024+00:00","updated_at":"2026-05-18T00:20:55.448024+00:00"}