{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:OWYF5N7SVZTGGCZSPM6USSKOED","short_pith_number":"pith:OWYF5N7S","schema_version":"1.0","canonical_sha256":"75b05eb7f2ae66630b327b3d49494e20ef3b4ae6bbd016244fcde8c60eeb7d80","source":{"kind":"arxiv","id":"1506.03460","version":1},"attestation_state":"computed","paper":{"title":"Sweeping words and the length of a generic vector subspace of M_n(F)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.RA","authors_text":"Igor Klep, \\v{S}pela \\v{S}penko","submitted_at":"2015-06-10T20:03:20Z","abstract_excerpt":"The main result of this short note is a generic version of Paz's conjecture on the lengths of generating sets in matrix algebras. Consider a generic g-tuple A=(A_1,..., A_g) of nxn matrices over a field. We show that whenever $g^{2d}\\geq n^2$, the set of all words of degree 2d in A spans the full nxn matrix algebra. Our proofs use generic matrices, are combinatorial and depend on the construction of a special kind of directed multigraphs with few edge-disjoint walks."},"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":"1506.03460","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.RA","submitted_at":"2015-06-10T20:03:20Z","cross_cats_sorted":[],"title_canon_sha256":"bcf8d54f6aade6f360810d556152e01ac018a45178bb05b40454e8d484b3fb3c","abstract_canon_sha256":"bf5e19af8c4dd49b82f287a29056998680ba729e71dd8148c970d8a0e8f48a6c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:10.556017Z","signature_b64":"diAGVrKkYcRzk6lsWNx1ON2QXBaO5uEEYXR76XGZNfUSriW432+1YPYMUWvAaQLt0KaBrlGulxHe+AycAxP9BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"75b05eb7f2ae66630b327b3d49494e20ef3b4ae6bbd016244fcde8c60eeb7d80","last_reissued_at":"2026-05-18T01:10:10.555620Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:10.555620Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sweeping words and the length of a generic vector subspace of M_n(F)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.RA","authors_text":"Igor Klep, \\v{S}pela \\v{S}penko","submitted_at":"2015-06-10T20:03:20Z","abstract_excerpt":"The main result of this short note is a generic version of Paz's conjecture on the lengths of generating sets in matrix algebras. Consider a generic g-tuple A=(A_1,..., A_g) of nxn matrices over a field. We show that whenever $g^{2d}\\geq n^2$, the set of all words of degree 2d in A spans the full nxn matrix algebra. Our proofs use generic matrices, are combinatorial and depend on the construction of a special kind of directed multigraphs with few edge-disjoint walks."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.03460","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1506.03460","created_at":"2026-05-18T01:10:10.555684+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.03460v1","created_at":"2026-05-18T01:10:10.555684+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.03460","created_at":"2026-05-18T01:10:10.555684+00:00"},{"alias_kind":"pith_short_12","alias_value":"OWYF5N7SVZTG","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_16","alias_value":"OWYF5N7SVZTGGCZS","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_8","alias_value":"OWYF5N7S","created_at":"2026-05-18T12:29:34.919912+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/OWYF5N7SVZTGGCZSPM6USSKOED","json":"https://pith.science/pith/OWYF5N7SVZTGGCZSPM6USSKOED.json","graph_json":"https://pith.science/api/pith-number/OWYF5N7SVZTGGCZSPM6USSKOED/graph.json","events_json":"https://pith.science/api/pith-number/OWYF5N7SVZTGGCZSPM6USSKOED/events.json","paper":"https://pith.science/paper/OWYF5N7S"},"agent_actions":{"view_html":"https://pith.science/pith/OWYF5N7SVZTGGCZSPM6USSKOED","download_json":"https://pith.science/pith/OWYF5N7SVZTGGCZSPM6USSKOED.json","view_paper":"https://pith.science/paper/OWYF5N7S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.03460&json=true","fetch_graph":"https://pith.science/api/pith-number/OWYF5N7SVZTGGCZSPM6USSKOED/graph.json","fetch_events":"https://pith.science/api/pith-number/OWYF5N7SVZTGGCZSPM6USSKOED/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OWYF5N7SVZTGGCZSPM6USSKOED/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OWYF5N7SVZTGGCZSPM6USSKOED/action/storage_attestation","attest_author":"https://pith.science/pith/OWYF5N7SVZTGGCZSPM6USSKOED/action/author_attestation","sign_citation":"https://pith.science/pith/OWYF5N7SVZTGGCZSPM6USSKOED/action/citation_signature","submit_replication":"https://pith.science/pith/OWYF5N7SVZTGGCZSPM6USSKOED/action/replication_record"}},"created_at":"2026-05-18T01:10:10.555684+00:00","updated_at":"2026-05-18T01:10:10.555684+00:00"}