{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:2CMBBGLFJ7FPKTW332DMGFM7SV","short_pith_number":"pith:2CMBBGLF","schema_version":"1.0","canonical_sha256":"d0981099654fcaf54edbde86c3159f9574d47dcdf942e65440d68ca447004870","source":{"kind":"arxiv","id":"1508.07755","version":3},"attestation_state":"computed","paper":{"title":"Computing explicit isomorphisms with full matrix algebras over $\\mathbb{F}_q(x)$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SC","math.NT"],"primary_cat":"math.RA","authors_text":"G\\'abor Ivanyos, Lajos R\\'onyai, P\\'eter Kutas","submitted_at":"2015-08-31T10:22:07Z","abstract_excerpt":"We propose a polynomial time $f$-algorithm (a deterministic algorithm which uses an oracle for factoring univariate polynomials over $\\mathbb{F}_q$) for computing an isomorphism (if there is any) of a finite dimensional $\\mathbb{F}_q(x)$-algebra $A$ given by structure constants with the algebra of $n$ by $n$ matrices with entries from $\\mathbb{F}_q(x)$. The method is based on computing a finite $\\mathbb{F}_q$-subalgebra of $A$ which is the intersection of a maximal $\\mathbb{F}_q[x]$-order and a maximal $R$-order, where $R$ is the subring of $\\mathbb{F}_q(x)$ consisting of fractions of polynomi"},"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":"1508.07755","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.RA","submitted_at":"2015-08-31T10:22:07Z","cross_cats_sorted":["cs.SC","math.NT"],"title_canon_sha256":"dade3527d75f67b2b4fbc72084180444bbcc7a6785b90b9076fdd55a1c902f7e","abstract_canon_sha256":"5171e16df6b5afabcf7d2bf6fcd8eb7d8a540125d8957b6146300a3474c75971"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:40.542356Z","signature_b64":"FoyhLLJFi79ZxQr6jdmi9LdjcRjgl6CoTc9V1DnMNlMNQxLPX6j9F0jYrtlqV41XZjqNN8Nv4ubDZQZV/UTjDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d0981099654fcaf54edbde86c3159f9574d47dcdf942e65440d68ca447004870","last_reissued_at":"2026-05-18T00:53:40.541858Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:40.541858Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computing explicit isomorphisms with full matrix algebras over $\\mathbb{F}_q(x)$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SC","math.NT"],"primary_cat":"math.RA","authors_text":"G\\'abor Ivanyos, Lajos R\\'onyai, P\\'eter Kutas","submitted_at":"2015-08-31T10:22:07Z","abstract_excerpt":"We propose a polynomial time $f$-algorithm (a deterministic algorithm which uses an oracle for factoring univariate polynomials over $\\mathbb{F}_q$) for computing an isomorphism (if there is any) of a finite dimensional $\\mathbb{F}_q(x)$-algebra $A$ given by structure constants with the algebra of $n$ by $n$ matrices with entries from $\\mathbb{F}_q(x)$. The method is based on computing a finite $\\mathbb{F}_q$-subalgebra of $A$ which is the intersection of a maximal $\\mathbb{F}_q[x]$-order and a maximal $R$-order, where $R$ is the subring of $\\mathbb{F}_q(x)$ consisting of fractions of polynomi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.07755","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":"1508.07755","created_at":"2026-05-18T00:53:40.541942+00:00"},{"alias_kind":"arxiv_version","alias_value":"1508.07755v3","created_at":"2026-05-18T00:53:40.541942+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.07755","created_at":"2026-05-18T00:53:40.541942+00:00"},{"alias_kind":"pith_short_12","alias_value":"2CMBBGLFJ7FP","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_16","alias_value":"2CMBBGLFJ7FPKTW3","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_8","alias_value":"2CMBBGLF","created_at":"2026-05-18T12:28:59.999130+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/2CMBBGLFJ7FPKTW332DMGFM7SV","json":"https://pith.science/pith/2CMBBGLFJ7FPKTW332DMGFM7SV.json","graph_json":"https://pith.science/api/pith-number/2CMBBGLFJ7FPKTW332DMGFM7SV/graph.json","events_json":"https://pith.science/api/pith-number/2CMBBGLFJ7FPKTW332DMGFM7SV/events.json","paper":"https://pith.science/paper/2CMBBGLF"},"agent_actions":{"view_html":"https://pith.science/pith/2CMBBGLFJ7FPKTW332DMGFM7SV","download_json":"https://pith.science/pith/2CMBBGLFJ7FPKTW332DMGFM7SV.json","view_paper":"https://pith.science/paper/2CMBBGLF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1508.07755&json=true","fetch_graph":"https://pith.science/api/pith-number/2CMBBGLFJ7FPKTW332DMGFM7SV/graph.json","fetch_events":"https://pith.science/api/pith-number/2CMBBGLFJ7FPKTW332DMGFM7SV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2CMBBGLFJ7FPKTW332DMGFM7SV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2CMBBGLFJ7FPKTW332DMGFM7SV/action/storage_attestation","attest_author":"https://pith.science/pith/2CMBBGLFJ7FPKTW332DMGFM7SV/action/author_attestation","sign_citation":"https://pith.science/pith/2CMBBGLFJ7FPKTW332DMGFM7SV/action/citation_signature","submit_replication":"https://pith.science/pith/2CMBBGLFJ7FPKTW332DMGFM7SV/action/replication_record"}},"created_at":"2026-05-18T00:53:40.541942+00:00","updated_at":"2026-05-18T00:53:40.541942+00:00"}