{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:2CMBBGLFJ7FPKTW332DMGFM7SV","short_pith_number":"pith:2CMBBGLF","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"},"canonical_sha256":"d0981099654fcaf54edbde86c3159f9574d47dcdf942e65440d68ca447004870","source":{"kind":"arxiv","id":"1508.07755","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.07755","created_at":"2026-05-18T00:53:40Z"},{"alias_kind":"arxiv_version","alias_value":"1508.07755v3","created_at":"2026-05-18T00:53:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.07755","created_at":"2026-05-18T00:53:40Z"},{"alias_kind":"pith_short_12","alias_value":"2CMBBGLFJ7FP","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"2CMBBGLFJ7FPKTW3","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"2CMBBGLF","created_at":"2026-05-18T12:28:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:2CMBBGLFJ7FPKTW332DMGFM7SV","target":"record","payload":{"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"},"canonical_sha256":"d0981099654fcaf54edbde86c3159f9574d47dcdf942e65440d68ca447004870","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"},"source_kind":"arxiv","source_id":"1508.07755","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:53:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"omcCdkDKlDi9bRqj0ipcZNOFSa1mWyDodq7rvg7XeKKPCz/CyM/SvQRSQaXkEEOVZc8T5q35hSQA3TfTzk9iDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T15:05:55.126145Z"},"content_sha256":"bfd8dea51b003413ac145cde7085ba913b33e6bb997b22b65184db0700b9af2e","schema_version":"1.0","event_id":"sha256:bfd8dea51b003413ac145cde7085ba913b33e6bb997b22b65184db0700b9af2e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:2CMBBGLFJ7FPKTW332DMGFM7SV","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:53:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FZABevo/rXkXEroORezYaixfOyfRkTCuXrDn5XVJf7n0P4ke2fiMt4yowPp0n4/1IUiPsl5ynKgHtde/qFMzAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T15:05:55.126588Z"},"content_sha256":"6530077f4c35761b260073ae270b819e7489de8ec331982ab162a6610a2d5343","schema_version":"1.0","event_id":"sha256:6530077f4c35761b260073ae270b819e7489de8ec331982ab162a6610a2d5343"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2CMBBGLFJ7FPKTW332DMGFM7SV/bundle.json","state_url":"https://pith.science/pith/2CMBBGLFJ7FPKTW332DMGFM7SV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2CMBBGLFJ7FPKTW332DMGFM7SV/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-29T15:05:55Z","links":{"resolver":"https://pith.science/pith/2CMBBGLFJ7FPKTW332DMGFM7SV","bundle":"https://pith.science/pith/2CMBBGLFJ7FPKTW332DMGFM7SV/bundle.json","state":"https://pith.science/pith/2CMBBGLFJ7FPKTW332DMGFM7SV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2CMBBGLFJ7FPKTW332DMGFM7SV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:2CMBBGLFJ7FPKTW332DMGFM7SV","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"5171e16df6b5afabcf7d2bf6fcd8eb7d8a540125d8957b6146300a3474c75971","cross_cats_sorted":["cs.SC","math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.RA","submitted_at":"2015-08-31T10:22:07Z","title_canon_sha256":"dade3527d75f67b2b4fbc72084180444bbcc7a6785b90b9076fdd55a1c902f7e"},"schema_version":"1.0","source":{"id":"1508.07755","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.07755","created_at":"2026-05-18T00:53:40Z"},{"alias_kind":"arxiv_version","alias_value":"1508.07755v3","created_at":"2026-05-18T00:53:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.07755","created_at":"2026-05-18T00:53:40Z"},{"alias_kind":"pith_short_12","alias_value":"2CMBBGLFJ7FP","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"2CMBBGLFJ7FPKTW3","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"2CMBBGLF","created_at":"2026-05-18T12:28:59Z"}],"graph_snapshots":[{"event_id":"sha256:6530077f4c35761b260073ae270b819e7489de8ec331982ab162a6610a2d5343","target":"graph","created_at":"2026-05-18T00:53:40Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"G\\'abor Ivanyos, Lajos R\\'onyai, P\\'eter Kutas","cross_cats":["cs.SC","math.NT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.RA","submitted_at":"2015-08-31T10:22:07Z","title":"Computing explicit isomorphisms with full matrix algebras over $\\mathbb{F}_q(x)$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.07755","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:bfd8dea51b003413ac145cde7085ba913b33e6bb997b22b65184db0700b9af2e","target":"record","created_at":"2026-05-18T00:53:40Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"5171e16df6b5afabcf7d2bf6fcd8eb7d8a540125d8957b6146300a3474c75971","cross_cats_sorted":["cs.SC","math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.RA","submitted_at":"2015-08-31T10:22:07Z","title_canon_sha256":"dade3527d75f67b2b4fbc72084180444bbcc7a6785b90b9076fdd55a1c902f7e"},"schema_version":"1.0","source":{"id":"1508.07755","kind":"arxiv","version":3}},"canonical_sha256":"d0981099654fcaf54edbde86c3159f9574d47dcdf942e65440d68ca447004870","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d0981099654fcaf54edbde86c3159f9574d47dcdf942e65440d68ca447004870","first_computed_at":"2026-05-18T00:53:40.541858Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:53:40.541858Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FoyhLLJFi79ZxQr6jdmi9LdjcRjgl6CoTc9V1DnMNlMNQxLPX6j9F0jYrtlqV41XZjqNN8Nv4ubDZQZV/UTjDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:53:40.542356Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.07755","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bfd8dea51b003413ac145cde7085ba913b33e6bb997b22b65184db0700b9af2e","sha256:6530077f4c35761b260073ae270b819e7489de8ec331982ab162a6610a2d5343"],"state_sha256":"80e540824cf6b5108598d2068544f9f20e18907ef892f820934cbd77a2430d0a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I1M7o2/IUsM3VgjQ7QvQTO3leQaGrPjuU1yt5uThMfchAwDiHehaCqN5AJcGzaXpuzki/Scw4FGp1cxBaHbYBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T15:05:55.129471Z","bundle_sha256":"28de0d7cada16e024e873c8f4443f86fea672674a34309c066540191410ccddd"}}