{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:OZHR7ZBK6MPWK3RQ2GFE73YHPE","short_pith_number":"pith:OZHR7ZBK","schema_version":"1.0","canonical_sha256":"764f1fe42af31f656e30d18a4fef07791fa9cb0e48b64e3afb7ae40e1495d2f5","source":{"kind":"arxiv","id":"1403.6430","version":5},"attestation_state":"computed","paper":{"title":"The finite basis problem for words with at most two non-linear variables","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GR","authors_text":"Olga Sapir","submitted_at":"2014-03-25T17:32:43Z","abstract_excerpt":"Let A be an alphabet and W be a set of words in the free monoid A*. Let S(W) denote the Rees quotient over the ideal of A* consisting of all words that are not subwords of words in W. We call a set of words W finitely based if the monoid S(W) is finitely based.\n  We find a simple algorithm that recognizes finitely based words among words with at most two non-linear variables. We also describe syntactically all hereditary finitely based monoids of the form S(W)."},"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":"1403.6430","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2014-03-25T17:32:43Z","cross_cats_sorted":[],"title_canon_sha256":"5082d7b264aeb2cac2e562cd694e5f7773ce5e182dec971778fb97ac43f05f10","abstract_canon_sha256":"7fef2745ba3866691ffecbb930c0b599e589f8560a31c4960aaf00803f9520ce"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:58.151113Z","signature_b64":"2dDVFrvG2Bj2rgBSsOtaIjxI960p+C9X+/ou7rwKFi7955d4o1s5+B4iTMQDWiuIa3mJiwXUElKsDVUp/z8pAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"764f1fe42af31f656e30d18a4fef07791fa9cb0e48b64e3afb7ae40e1495d2f5","last_reissued_at":"2026-05-18T01:04:58.150379Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:58.150379Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The finite basis problem for words with at most two non-linear variables","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GR","authors_text":"Olga Sapir","submitted_at":"2014-03-25T17:32:43Z","abstract_excerpt":"Let A be an alphabet and W be a set of words in the free monoid A*. Let S(W) denote the Rees quotient over the ideal of A* consisting of all words that are not subwords of words in W. We call a set of words W finitely based if the monoid S(W) is finitely based.\n  We find a simple algorithm that recognizes finitely based words among words with at most two non-linear variables. We also describe syntactically all hereditary finitely based monoids of the form S(W)."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.6430","kind":"arxiv","version":5},"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":"1403.6430","created_at":"2026-05-18T01:04:58.150493+00:00"},{"alias_kind":"arxiv_version","alias_value":"1403.6430v5","created_at":"2026-05-18T01:04:58.150493+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.6430","created_at":"2026-05-18T01:04:58.150493+00:00"},{"alias_kind":"pith_short_12","alias_value":"OZHR7ZBK6MPW","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_16","alias_value":"OZHR7ZBK6MPWK3RQ","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_8","alias_value":"OZHR7ZBK","created_at":"2026-05-18T12:28:43.426989+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/OZHR7ZBK6MPWK3RQ2GFE73YHPE","json":"https://pith.science/pith/OZHR7ZBK6MPWK3RQ2GFE73YHPE.json","graph_json":"https://pith.science/api/pith-number/OZHR7ZBK6MPWK3RQ2GFE73YHPE/graph.json","events_json":"https://pith.science/api/pith-number/OZHR7ZBK6MPWK3RQ2GFE73YHPE/events.json","paper":"https://pith.science/paper/OZHR7ZBK"},"agent_actions":{"view_html":"https://pith.science/pith/OZHR7ZBK6MPWK3RQ2GFE73YHPE","download_json":"https://pith.science/pith/OZHR7ZBK6MPWK3RQ2GFE73YHPE.json","view_paper":"https://pith.science/paper/OZHR7ZBK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1403.6430&json=true","fetch_graph":"https://pith.science/api/pith-number/OZHR7ZBK6MPWK3RQ2GFE73YHPE/graph.json","fetch_events":"https://pith.science/api/pith-number/OZHR7ZBK6MPWK3RQ2GFE73YHPE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OZHR7ZBK6MPWK3RQ2GFE73YHPE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OZHR7ZBK6MPWK3RQ2GFE73YHPE/action/storage_attestation","attest_author":"https://pith.science/pith/OZHR7ZBK6MPWK3RQ2GFE73YHPE/action/author_attestation","sign_citation":"https://pith.science/pith/OZHR7ZBK6MPWK3RQ2GFE73YHPE/action/citation_signature","submit_replication":"https://pith.science/pith/OZHR7ZBK6MPWK3RQ2GFE73YHPE/action/replication_record"}},"created_at":"2026-05-18T01:04:58.150493+00:00","updated_at":"2026-05-18T01:04:58.150493+00:00"}