{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:AU6Z2HUTIBJOAXSE7SZ45GK75Z","short_pith_number":"pith:AU6Z2HUT","schema_version":"1.0","canonical_sha256":"053d9d1e934052e05e44fcb3ce995fee60872b206e95fe0b0b8598df144faceb","source":{"kind":"arxiv","id":"1812.03346","version":2},"attestation_state":"computed","paper":{"title":"A Frobenius-Schreier-Sims Algorithm to tensor decompose algebras","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.GR","math.RT"],"primary_cat":"math.RA","authors_text":"Henry Kvinge, Ian Holm Kessler, James B. Wilson","submitted_at":"2018-12-08T16:36:18Z","abstract_excerpt":"We introduce a decomposition of associative algebras into a tensor product of cyclic modules. This produces a means to encode a basis with logarithmic information and thus extends the reach of calculation with large algebras. Our technique is an analogue to the Schreier-Sims algorithm for permutation groups and is a by-product of Frobenius reciprocity."},"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":"1812.03346","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.RA","submitted_at":"2018-12-08T16:36:18Z","cross_cats_sorted":["math.GR","math.RT"],"title_canon_sha256":"37435be38263c1014bf02635ed1898728285f8206b843577dc53117fb4d055df","abstract_canon_sha256":"30f6eb5b13e1da3152b1c262a53d580beb03d8cdcfd2e361f27ef2c8ed3224be"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:13.295653Z","signature_b64":"vK+9VLr87+RBMixufrzdIxE023SXg6Fdhn2S+W1yvDXFkvs4Te4oS3MppZPxmFs0fZtBpPcaaboRYqUuzMhCCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"053d9d1e934052e05e44fcb3ce995fee60872b206e95fe0b0b8598df144faceb","last_reissued_at":"2026-05-17T23:58:13.295095Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:13.295095Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Frobenius-Schreier-Sims Algorithm to tensor decompose algebras","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.GR","math.RT"],"primary_cat":"math.RA","authors_text":"Henry Kvinge, Ian Holm Kessler, James B. Wilson","submitted_at":"2018-12-08T16:36:18Z","abstract_excerpt":"We introduce a decomposition of associative algebras into a tensor product of cyclic modules. This produces a means to encode a basis with logarithmic information and thus extends the reach of calculation with large algebras. Our technique is an analogue to the Schreier-Sims algorithm for permutation groups and is a by-product of Frobenius reciprocity."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.03346","kind":"arxiv","version":2},"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":"1812.03346","created_at":"2026-05-17T23:58:13.295168+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.03346v2","created_at":"2026-05-17T23:58:13.295168+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.03346","created_at":"2026-05-17T23:58:13.295168+00:00"},{"alias_kind":"pith_short_12","alias_value":"AU6Z2HUTIBJO","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_16","alias_value":"AU6Z2HUTIBJOAXSE","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_8","alias_value":"AU6Z2HUT","created_at":"2026-05-18T12:32:13.499390+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/AU6Z2HUTIBJOAXSE7SZ45GK75Z","json":"https://pith.science/pith/AU6Z2HUTIBJOAXSE7SZ45GK75Z.json","graph_json":"https://pith.science/api/pith-number/AU6Z2HUTIBJOAXSE7SZ45GK75Z/graph.json","events_json":"https://pith.science/api/pith-number/AU6Z2HUTIBJOAXSE7SZ45GK75Z/events.json","paper":"https://pith.science/paper/AU6Z2HUT"},"agent_actions":{"view_html":"https://pith.science/pith/AU6Z2HUTIBJOAXSE7SZ45GK75Z","download_json":"https://pith.science/pith/AU6Z2HUTIBJOAXSE7SZ45GK75Z.json","view_paper":"https://pith.science/paper/AU6Z2HUT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.03346&json=true","fetch_graph":"https://pith.science/api/pith-number/AU6Z2HUTIBJOAXSE7SZ45GK75Z/graph.json","fetch_events":"https://pith.science/api/pith-number/AU6Z2HUTIBJOAXSE7SZ45GK75Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AU6Z2HUTIBJOAXSE7SZ45GK75Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AU6Z2HUTIBJOAXSE7SZ45GK75Z/action/storage_attestation","attest_author":"https://pith.science/pith/AU6Z2HUTIBJOAXSE7SZ45GK75Z/action/author_attestation","sign_citation":"https://pith.science/pith/AU6Z2HUTIBJOAXSE7SZ45GK75Z/action/citation_signature","submit_replication":"https://pith.science/pith/AU6Z2HUTIBJOAXSE7SZ45GK75Z/action/replication_record"}},"created_at":"2026-05-17T23:58:13.295168+00:00","updated_at":"2026-05-17T23:58:13.295168+00:00"}