{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:YFJ7YUBNC44MYNNWFZJCYD3SRZ","short_pith_number":"pith:YFJ7YUBN","schema_version":"1.0","canonical_sha256":"c153fc502d1738cc35b62e522c0f728e77701bb720db69fe666ba4c2fd10b651","source":{"kind":"arxiv","id":"2506.03370","version":1},"attestation_state":"computed","paper":{"title":"Comparison of different Unique hard attention transformer models by the formal languages they can recognize","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.CL","cs.FL"],"primary_cat":"cs.LG","authors_text":"Leonid Ryvkin","submitted_at":"2025-06-03T20:28:51Z","abstract_excerpt":"This note is a survey of various results on the capabilities of unique hard attention transformers encoders (UHATs) to recognize formal languages. We distinguish between masked vs. non-masked, finite vs. infinite image and general vs. bilinear attention score functions. We recall some relations between these models, as well as a lower bound in terms of first-order logic and an upper bound in terms of circuit complexity."},"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":"2506.03370","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2025-06-03T20:28:51Z","cross_cats_sorted":["cs.CL","cs.FL"],"title_canon_sha256":"ecd849f950575b87a4e0e4578de1ad6cab89bec19ab3efa62f2e4a39847741ea","abstract_canon_sha256":"700d01be119ac4f9ea293456d807fd39a14a8e0651e309a2579306a199e239de"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:15:26.073342Z","signature_b64":"LLbXiN0Y8m+kWu2uOMRnulppeEFWfraqYH4h+mI4QiMlodIT5+i87xGjQ2wB2hpgVVupmyXjyV2Z655X9TV0Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c153fc502d1738cc35b62e522c0f728e77701bb720db69fe666ba4c2fd10b651","last_reissued_at":"2026-07-05T11:15:26.072901Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:15:26.072901Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Comparison of different Unique hard attention transformer models by the formal languages they can recognize","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.CL","cs.FL"],"primary_cat":"cs.LG","authors_text":"Leonid Ryvkin","submitted_at":"2025-06-03T20:28:51Z","abstract_excerpt":"This note is a survey of various results on the capabilities of unique hard attention transformers encoders (UHATs) to recognize formal languages. We distinguish between masked vs. non-masked, finite vs. infinite image and general vs. bilinear attention score functions. We recall some relations between these models, as well as a lower bound in terms of first-order logic and an upper bound in terms of circuit complexity."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.03370","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2506.03370/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2506.03370","created_at":"2026-07-05T11:15:26.072955+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.03370v1","created_at":"2026-07-05T11:15:26.072955+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.03370","created_at":"2026-07-05T11:15:26.072955+00:00"},{"alias_kind":"pith_short_12","alias_value":"YFJ7YUBNC44M","created_at":"2026-07-05T11:15:26.072955+00:00"},{"alias_kind":"pith_short_16","alias_value":"YFJ7YUBNC44MYNNW","created_at":"2026-07-05T11:15:26.072955+00:00"},{"alias_kind":"pith_short_8","alias_value":"YFJ7YUBN","created_at":"2026-07-05T11:15:26.072955+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/YFJ7YUBNC44MYNNWFZJCYD3SRZ","json":"https://pith.science/pith/YFJ7YUBNC44MYNNWFZJCYD3SRZ.json","graph_json":"https://pith.science/api/pith-number/YFJ7YUBNC44MYNNWFZJCYD3SRZ/graph.json","events_json":"https://pith.science/api/pith-number/YFJ7YUBNC44MYNNWFZJCYD3SRZ/events.json","paper":"https://pith.science/paper/YFJ7YUBN"},"agent_actions":{"view_html":"https://pith.science/pith/YFJ7YUBNC44MYNNWFZJCYD3SRZ","download_json":"https://pith.science/pith/YFJ7YUBNC44MYNNWFZJCYD3SRZ.json","view_paper":"https://pith.science/paper/YFJ7YUBN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.03370&json=true","fetch_graph":"https://pith.science/api/pith-number/YFJ7YUBNC44MYNNWFZJCYD3SRZ/graph.json","fetch_events":"https://pith.science/api/pith-number/YFJ7YUBNC44MYNNWFZJCYD3SRZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YFJ7YUBNC44MYNNWFZJCYD3SRZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YFJ7YUBNC44MYNNWFZJCYD3SRZ/action/storage_attestation","attest_author":"https://pith.science/pith/YFJ7YUBNC44MYNNWFZJCYD3SRZ/action/author_attestation","sign_citation":"https://pith.science/pith/YFJ7YUBNC44MYNNWFZJCYD3SRZ/action/citation_signature","submit_replication":"https://pith.science/pith/YFJ7YUBNC44MYNNWFZJCYD3SRZ/action/replication_record"}},"created_at":"2026-07-05T11:15:26.072955+00:00","updated_at":"2026-07-05T11:15:26.072955+00:00"}