{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:AD3PHLOAMFNLBLGVCZNMNIVH5C","short_pith_number":"pith:AD3PHLOA","canonical_record":{"source":{"id":"1211.1356","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.RA","submitted_at":"2012-11-06T19:35:32Z","cross_cats_sorted":["math.NT"],"title_canon_sha256":"9f31075f90cbc978a140942354cff671473b90c1065fde705c8438230dc50329","abstract_canon_sha256":"9e74355ade849bf6d594c3f15762bcf4c7f8b74f064d1a960692c50ab3d8aa3b"},"schema_version":"1.0"},"canonical_sha256":"00f6f3adc0615ab0acd5165ac6a2a7e8900932af8b9edbefcf05a6bb204c249a","source":{"kind":"arxiv","id":"1211.1356","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.1356","created_at":"2026-05-18T02:48:01Z"},{"alias_kind":"arxiv_version","alias_value":"1211.1356v1","created_at":"2026-05-18T02:48:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.1356","created_at":"2026-05-18T02:48:01Z"},{"alias_kind":"pith_short_12","alias_value":"AD3PHLOAMFNL","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"AD3PHLOAMFNLBLGV","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"AD3PHLOA","created_at":"2026-05-18T12:26:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:AD3PHLOAMFNLBLGVCZNMNIVH5C","target":"record","payload":{"canonical_record":{"source":{"id":"1211.1356","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.RA","submitted_at":"2012-11-06T19:35:32Z","cross_cats_sorted":["math.NT"],"title_canon_sha256":"9f31075f90cbc978a140942354cff671473b90c1065fde705c8438230dc50329","abstract_canon_sha256":"9e74355ade849bf6d594c3f15762bcf4c7f8b74f064d1a960692c50ab3d8aa3b"},"schema_version":"1.0"},"canonical_sha256":"00f6f3adc0615ab0acd5165ac6a2a7e8900932af8b9edbefcf05a6bb204c249a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:48:01.162723Z","signature_b64":"Uvu35Mr1aYJl/DjnnKFbSgXc3MumYoK/Vp3OeKjOLqJIm70iRjIrivVkBvMldWQ90N+uHH/0lFCkyISkr/sxCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"00f6f3adc0615ab0acd5165ac6a2a7e8900932af8b9edbefcf05a6bb204c249a","last_reissued_at":"2026-05-18T02:48:01.162240Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:48:01.162240Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1211.1356","source_version":1,"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-18T02:48:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z1synrKIikWGKX6due+aUUP/c1R86GGJ6UroAFlTev5Dqav/UlS9dRYqc3JuQyxx4z1GpRfJxhSP274CCV/cBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T22:33:29.232459Z"},"content_sha256":"c13d9e07072d12db83d72fededef282f959ff9e8a48584deca0cd9332deda807","schema_version":"1.0","event_id":"sha256:c13d9e07072d12db83d72fededef282f959ff9e8a48584deca0cd9332deda807"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:AD3PHLOAMFNLBLGVCZNMNIVH5C","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improved algorithms for splitting full matrix algebras","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"math.RA","authors_text":"\\'Ad\\'am D. Lelkes, G\\'abor Ivanyos, Lajos R\\'onyai","submitted_at":"2012-11-06T19:35:32Z","abstract_excerpt":"Let $\\K$ be an algebraic number field of degree $d$ and discriminant $\\Delta$ over $\\Q$. Let $\\A$ be an associative algebra over $\\K$ given by structure constants such that $\\A\\cong M_n(\\K)$ holds for some positive integer $n$. Suppose that $d$, $n$ and $|\\Delta|$ are bounded. In a previous paper a polynomial time ff-algorithm was given to construct explicitly an isomorphism $\\A \\rightarrow M_n(\\K)$.\n  Here we simplify and improve this algorithm in the cases $n\\leq 43$, $\\K=\\Q$, and $n=2$, with $\\K=\\Q(\\sqrt{-1})$ or $\\K=\\Q(\\sqrt{-3})$. The improvements are based on work by Y. Kitaoka and R. Co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.1356","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"},"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-18T02:48:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o2NwWqZK+1kjPY6n27SrDWZerz1XSdbBUFCkNOU1yoS7C5S5f+1RjC43JVoFTVuguPsAYmwOpRg8RKea/dAKCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T22:33:29.232835Z"},"content_sha256":"9a3fd3f65febc0e569349bbbcf467e32cda2923e3e58d4c86315f5445163e8f8","schema_version":"1.0","event_id":"sha256:9a3fd3f65febc0e569349bbbcf467e32cda2923e3e58d4c86315f5445163e8f8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AD3PHLOAMFNLBLGVCZNMNIVH5C/bundle.json","state_url":"https://pith.science/pith/AD3PHLOAMFNLBLGVCZNMNIVH5C/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AD3PHLOAMFNLBLGVCZNMNIVH5C/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-28T22:33:29Z","links":{"resolver":"https://pith.science/pith/AD3PHLOAMFNLBLGVCZNMNIVH5C","bundle":"https://pith.science/pith/AD3PHLOAMFNLBLGVCZNMNIVH5C/bundle.json","state":"https://pith.science/pith/AD3PHLOAMFNLBLGVCZNMNIVH5C/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AD3PHLOAMFNLBLGVCZNMNIVH5C/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:AD3PHLOAMFNLBLGVCZNMNIVH5C","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":"9e74355ade849bf6d594c3f15762bcf4c7f8b74f064d1a960692c50ab3d8aa3b","cross_cats_sorted":["math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.RA","submitted_at":"2012-11-06T19:35:32Z","title_canon_sha256":"9f31075f90cbc978a140942354cff671473b90c1065fde705c8438230dc50329"},"schema_version":"1.0","source":{"id":"1211.1356","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.1356","created_at":"2026-05-18T02:48:01Z"},{"alias_kind":"arxiv_version","alias_value":"1211.1356v1","created_at":"2026-05-18T02:48:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.1356","created_at":"2026-05-18T02:48:01Z"},{"alias_kind":"pith_short_12","alias_value":"AD3PHLOAMFNL","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"AD3PHLOAMFNLBLGV","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"AD3PHLOA","created_at":"2026-05-18T12:26:58Z"}],"graph_snapshots":[{"event_id":"sha256:9a3fd3f65febc0e569349bbbcf467e32cda2923e3e58d4c86315f5445163e8f8","target":"graph","created_at":"2026-05-18T02:48:01Z","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":"Let $\\K$ be an algebraic number field of degree $d$ and discriminant $\\Delta$ over $\\Q$. Let $\\A$ be an associative algebra over $\\K$ given by structure constants such that $\\A\\cong M_n(\\K)$ holds for some positive integer $n$. Suppose that $d$, $n$ and $|\\Delta|$ are bounded. In a previous paper a polynomial time ff-algorithm was given to construct explicitly an isomorphism $\\A \\rightarrow M_n(\\K)$.\n  Here we simplify and improve this algorithm in the cases $n\\leq 43$, $\\K=\\Q$, and $n=2$, with $\\K=\\Q(\\sqrt{-1})$ or $\\K=\\Q(\\sqrt{-3})$. The improvements are based on work by Y. Kitaoka and R. Co","authors_text":"\\'Ad\\'am D. Lelkes, G\\'abor Ivanyos, Lajos R\\'onyai","cross_cats":["math.NT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.RA","submitted_at":"2012-11-06T19:35:32Z","title":"Improved algorithms for splitting full matrix algebras"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.1356","kind":"arxiv","version":1},"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:c13d9e07072d12db83d72fededef282f959ff9e8a48584deca0cd9332deda807","target":"record","created_at":"2026-05-18T02:48:01Z","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":"9e74355ade849bf6d594c3f15762bcf4c7f8b74f064d1a960692c50ab3d8aa3b","cross_cats_sorted":["math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.RA","submitted_at":"2012-11-06T19:35:32Z","title_canon_sha256":"9f31075f90cbc978a140942354cff671473b90c1065fde705c8438230dc50329"},"schema_version":"1.0","source":{"id":"1211.1356","kind":"arxiv","version":1}},"canonical_sha256":"00f6f3adc0615ab0acd5165ac6a2a7e8900932af8b9edbefcf05a6bb204c249a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"00f6f3adc0615ab0acd5165ac6a2a7e8900932af8b9edbefcf05a6bb204c249a","first_computed_at":"2026-05-18T02:48:01.162240Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:48:01.162240Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Uvu35Mr1aYJl/DjnnKFbSgXc3MumYoK/Vp3OeKjOLqJIm70iRjIrivVkBvMldWQ90N+uHH/0lFCkyISkr/sxCA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:48:01.162723Z","signed_message":"canonical_sha256_bytes"},"source_id":"1211.1356","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c13d9e07072d12db83d72fededef282f959ff9e8a48584deca0cd9332deda807","sha256:9a3fd3f65febc0e569349bbbcf467e32cda2923e3e58d4c86315f5445163e8f8"],"state_sha256":"5b8cc77f0cb2f54ff2589d5e4d7898b9205e1d08bc959cf068fd2411c4f80369"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aIoHzqVsi2xUaDuM9rXgZQWht9YkPyULa+gXHpRneS5PkweyVFrlozlitfTLviboKQP82qBvVxbRM3w4JsJzBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T22:33:29.235007Z","bundle_sha256":"3eb80b1c33d72b78b0546ee2b75e27ec85dc57008c4393f7ad1874d8c82d58a8"}}