{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:DQLB5RD7NQACO4O2WXSRLXALSK","short_pith_number":"pith:DQLB5RD7","schema_version":"1.0","canonical_sha256":"1c161ec47f6c002771dab5e515dc0b929bb0bf03d26351936b72b630d8b94559","source":{"kind":"arxiv","id":"1609.00396","version":1},"attestation_state":"computed","paper":{"title":"Language Classes Associated with Automata Over Matrix Groups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"A.C.Cem Say, Flavio D'Alessandro, \\\"Ozlem Salehi","submitted_at":"2016-09-01T20:24:55Z","abstract_excerpt":"We investigate the language classes recognized by group automata over matrix groups. We present a summary of the results obtained so far together with a number of new results. We look at the computational power of time-bounded group automata where the group under consideration has polynomial growth."},"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":"1609.00396","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2016-09-01T20:24:55Z","cross_cats_sorted":[],"title_canon_sha256":"ad6ecc197612008c5cd6bfa93566c3abb0607758d3812cc558d5a2c2098890ed","abstract_canon_sha256":"a8991913cdc948fd847bc3e87a2f7095dd5876f3ea4e9a47fd66a5d135b60552"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:06:23.951891Z","signature_b64":"GAhyRn6+DCmwHULO6nZ0tN4SsI24X5P1I09c/+rTAhiNYw4uYNHIaWyhX8fmVCu+kMapVjxJsGdrSWc3aGzPCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1c161ec47f6c002771dab5e515dc0b929bb0bf03d26351936b72b630d8b94559","last_reissued_at":"2026-05-18T01:06:23.951463Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:06:23.951463Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Language Classes Associated with Automata Over Matrix Groups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"A.C.Cem Say, Flavio D'Alessandro, \\\"Ozlem Salehi","submitted_at":"2016-09-01T20:24:55Z","abstract_excerpt":"We investigate the language classes recognized by group automata over matrix groups. We present a summary of the results obtained so far together with a number of new results. We look at the computational power of time-bounded group automata where the group under consideration has polynomial growth."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.00396","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":""},"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":"1609.00396","created_at":"2026-05-18T01:06:23.951535+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.00396v1","created_at":"2026-05-18T01:06:23.951535+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.00396","created_at":"2026-05-18T01:06:23.951535+00:00"},{"alias_kind":"pith_short_12","alias_value":"DQLB5RD7NQAC","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_16","alias_value":"DQLB5RD7NQACO4O2","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_8","alias_value":"DQLB5RD7","created_at":"2026-05-18T12:30:12.583610+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/DQLB5RD7NQACO4O2WXSRLXALSK","json":"https://pith.science/pith/DQLB5RD7NQACO4O2WXSRLXALSK.json","graph_json":"https://pith.science/api/pith-number/DQLB5RD7NQACO4O2WXSRLXALSK/graph.json","events_json":"https://pith.science/api/pith-number/DQLB5RD7NQACO4O2WXSRLXALSK/events.json","paper":"https://pith.science/paper/DQLB5RD7"},"agent_actions":{"view_html":"https://pith.science/pith/DQLB5RD7NQACO4O2WXSRLXALSK","download_json":"https://pith.science/pith/DQLB5RD7NQACO4O2WXSRLXALSK.json","view_paper":"https://pith.science/paper/DQLB5RD7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.00396&json=true","fetch_graph":"https://pith.science/api/pith-number/DQLB5RD7NQACO4O2WXSRLXALSK/graph.json","fetch_events":"https://pith.science/api/pith-number/DQLB5RD7NQACO4O2WXSRLXALSK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DQLB5RD7NQACO4O2WXSRLXALSK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DQLB5RD7NQACO4O2WXSRLXALSK/action/storage_attestation","attest_author":"https://pith.science/pith/DQLB5RD7NQACO4O2WXSRLXALSK/action/author_attestation","sign_citation":"https://pith.science/pith/DQLB5RD7NQACO4O2WXSRLXALSK/action/citation_signature","submit_replication":"https://pith.science/pith/DQLB5RD7NQACO4O2WXSRLXALSK/action/replication_record"}},"created_at":"2026-05-18T01:06:23.951535+00:00","updated_at":"2026-05-18T01:06:23.951535+00:00"}