{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2007:4AWVFM2F7VJNRXRPFPMQTAUH3G","short_pith_number":"pith:4AWVFM2F","schema_version":"1.0","canonical_sha256":"e02d52b345fd52d8de2f2bd9098287d99003d7b42ec4bf8d78e8695bb0c6fdf7","source":{"kind":"arxiv","id":"math/0701609","version":1},"attestation_state":"computed","paper":{"title":"Defining Relations of Minimal Degree of the Trace Algebra of $3 \\times 3$ Matrices","license":"","headline":"","cross_cats":[],"primary_cat":"math.RA","authors_text":"Francesca Benanti, Vesselin Drensky","submitted_at":"2007-01-22T12:36:36Z","abstract_excerpt":"The trace algebra C(n,d) over a field of characteristic 0 is generated by all traces of products of d generic nxn matrices, n,d>1. Minimal sets of generators of C(n,d) are known for n=2 and n=3 for any d as well as for n=4 and n=5 and d=2. The defining relations between the generators are found for n=2 and any d and for n=3, d=2 only. Starting with the generating set of C(3,d) given by Abeasis and Pittaluga in 1989, we have shown that the minimal degree of the set of defining relations of C(3,d) is equal to 7 for any d>2. We have determined all relations of minimal degree. For d=3 we have also"},"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":"math/0701609","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.RA","submitted_at":"2007-01-22T12:36:36Z","cross_cats_sorted":[],"title_canon_sha256":"f432b70545aaab051a3106de80bf57e85632626f244a69f2098af15b70898cd9","abstract_canon_sha256":"b76c8a884e770c7f451b22bd8bb81597c1e7d69873722a9af8d1ae281cba323d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:58:57.555908Z","signature_b64":"z+knIFUx1O0Zs7ztFRs/q649owf2ptb7EO9AdWfCPI5ZYlBs9WMXfuPeaZN7i6M398wkX41njV4qbzwvHdw1DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e02d52b345fd52d8de2f2bd9098287d99003d7b42ec4bf8d78e8695bb0c6fdf7","last_reissued_at":"2026-07-04T14:58:57.555543Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:58:57.555543Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Defining Relations of Minimal Degree of the Trace Algebra of $3 \\times 3$ Matrices","license":"","headline":"","cross_cats":[],"primary_cat":"math.RA","authors_text":"Francesca Benanti, Vesselin Drensky","submitted_at":"2007-01-22T12:36:36Z","abstract_excerpt":"The trace algebra C(n,d) over a field of characteristic 0 is generated by all traces of products of d generic nxn matrices, n,d>1. Minimal sets of generators of C(n,d) are known for n=2 and n=3 for any d as well as for n=4 and n=5 and d=2. The defining relations between the generators are found for n=2 and any d and for n=3, d=2 only. Starting with the generating set of C(3,d) given by Abeasis and Pittaluga in 1989, we have shown that the minimal degree of the set of defining relations of C(3,d) is equal to 7 for any d>2. We have determined all relations of minimal degree. For d=3 we have also"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0701609","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/math/0701609/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"math/0701609","created_at":"2026-07-04T14:58:57.555606+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/0701609v1","created_at":"2026-07-04T14:58:57.555606+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0701609","created_at":"2026-07-04T14:58:57.555606+00:00"},{"alias_kind":"pith_short_12","alias_value":"4AWVFM2F7VJN","created_at":"2026-07-04T14:58:57.555606+00:00"},{"alias_kind":"pith_short_16","alias_value":"4AWVFM2F7VJNRXRP","created_at":"2026-07-04T14:58:57.555606+00:00"},{"alias_kind":"pith_short_8","alias_value":"4AWVFM2F","created_at":"2026-07-04T14:58:57.555606+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.08085","citing_title":"Fermionic trace relations and supersymmetric indices at finite $N$","ref_index":71,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4AWVFM2F7VJNRXRPFPMQTAUH3G","json":"https://pith.science/pith/4AWVFM2F7VJNRXRPFPMQTAUH3G.json","graph_json":"https://pith.science/api/pith-number/4AWVFM2F7VJNRXRPFPMQTAUH3G/graph.json","events_json":"https://pith.science/api/pith-number/4AWVFM2F7VJNRXRPFPMQTAUH3G/events.json","paper":"https://pith.science/paper/4AWVFM2F"},"agent_actions":{"view_html":"https://pith.science/pith/4AWVFM2F7VJNRXRPFPMQTAUH3G","download_json":"https://pith.science/pith/4AWVFM2F7VJNRXRPFPMQTAUH3G.json","view_paper":"https://pith.science/paper/4AWVFM2F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/0701609&json=true","fetch_graph":"https://pith.science/api/pith-number/4AWVFM2F7VJNRXRPFPMQTAUH3G/graph.json","fetch_events":"https://pith.science/api/pith-number/4AWVFM2F7VJNRXRPFPMQTAUH3G/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4AWVFM2F7VJNRXRPFPMQTAUH3G/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4AWVFM2F7VJNRXRPFPMQTAUH3G/action/storage_attestation","attest_author":"https://pith.science/pith/4AWVFM2F7VJNRXRPFPMQTAUH3G/action/author_attestation","sign_citation":"https://pith.science/pith/4AWVFM2F7VJNRXRPFPMQTAUH3G/action/citation_signature","submit_replication":"https://pith.science/pith/4AWVFM2F7VJNRXRPFPMQTAUH3G/action/replication_record"}},"created_at":"2026-07-04T14:58:57.555606+00:00","updated_at":"2026-07-04T14:58:57.555606+00:00"}