{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:SLFFWYBP3I6N67JBVLOVCA7PHP","short_pith_number":"pith:SLFFWYBP","schema_version":"1.0","canonical_sha256":"92ca5b602fda3cdf7d21aadd5103ef3bdddfcf1ef60bbb311ab1f8e040df6f08","source":{"kind":"arxiv","id":"1912.12562","version":2},"attestation_state":"computed","paper":{"title":"The probability that an operator is nilpotent","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.RA"],"primary_cat":"math.CO","authors_text":"Tom Leinster","submitted_at":"2019-12-29T01:44:03Z","abstract_excerpt":"Choose a random linear operator on a vector space of finite cardinality N: then the probability that it is nilpotent is 1/N. This is a linear analogue of the fact that for a random self-map of a set of cardinality N, the probability that some iterate is constant is 1/N. The first result is due to Fine, Herstein and Hall, and the second is essentially Cayley's tree formula. We give a new proof of the result on nilpotents, analogous to Joyal's beautiful proof of Cayley's formula. It uses only general linear algebra and avoids calculation entirely."},"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":"1912.12562","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-12-29T01:44:03Z","cross_cats_sorted":["math.RA"],"title_canon_sha256":"2d1016a1ce3ab87927fe613cbf52f8fe5b0f40ff30ad8df4830ee8f262fb9b6a","abstract_canon_sha256":"cb5f6f5940b7a0cdd5fb6e4d984ad957552a327c86d1ebd4098a0bd138244b55"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:36:08.254034Z","signature_b64":"XjXwu42C2jAt0ihEQW6f9mC7RHwv31H1pJncYLj8ftsmudmqsStsDIldiIsj0zTN0hf6w47CoepCxrK+n29sAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"92ca5b602fda3cdf7d21aadd5103ef3bdddfcf1ef60bbb311ab1f8e040df6f08","last_reissued_at":"2026-07-05T01:36:08.253617Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:36:08.253617Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The probability that an operator is nilpotent","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.RA"],"primary_cat":"math.CO","authors_text":"Tom Leinster","submitted_at":"2019-12-29T01:44:03Z","abstract_excerpt":"Choose a random linear operator on a vector space of finite cardinality N: then the probability that it is nilpotent is 1/N. This is a linear analogue of the fact that for a random self-map of a set of cardinality N, the probability that some iterate is constant is 1/N. The first result is due to Fine, Herstein and Hall, and the second is essentially Cayley's tree formula. We give a new proof of the result on nilpotents, analogous to Joyal's beautiful proof of Cayley's formula. It uses only general linear algebra and avoids calculation entirely."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1912.12562","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1912.12562/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":"1912.12562","created_at":"2026-07-05T01:36:08.253681+00:00"},{"alias_kind":"arxiv_version","alias_value":"1912.12562v2","created_at":"2026-07-05T01:36:08.253681+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1912.12562","created_at":"2026-07-05T01:36:08.253681+00:00"},{"alias_kind":"pith_short_12","alias_value":"SLFFWYBP3I6N","created_at":"2026-07-05T01:36:08.253681+00:00"},{"alias_kind":"pith_short_16","alias_value":"SLFFWYBP3I6N67JB","created_at":"2026-07-05T01:36:08.253681+00:00"},{"alias_kind":"pith_short_8","alias_value":"SLFFWYBP","created_at":"2026-07-05T01:36:08.253681+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.16386","citing_title":"Groupoid Cardinality and Random Permutations","ref_index":9,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SLFFWYBP3I6N67JBVLOVCA7PHP","json":"https://pith.science/pith/SLFFWYBP3I6N67JBVLOVCA7PHP.json","graph_json":"https://pith.science/api/pith-number/SLFFWYBP3I6N67JBVLOVCA7PHP/graph.json","events_json":"https://pith.science/api/pith-number/SLFFWYBP3I6N67JBVLOVCA7PHP/events.json","paper":"https://pith.science/paper/SLFFWYBP"},"agent_actions":{"view_html":"https://pith.science/pith/SLFFWYBP3I6N67JBVLOVCA7PHP","download_json":"https://pith.science/pith/SLFFWYBP3I6N67JBVLOVCA7PHP.json","view_paper":"https://pith.science/paper/SLFFWYBP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1912.12562&json=true","fetch_graph":"https://pith.science/api/pith-number/SLFFWYBP3I6N67JBVLOVCA7PHP/graph.json","fetch_events":"https://pith.science/api/pith-number/SLFFWYBP3I6N67JBVLOVCA7PHP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SLFFWYBP3I6N67JBVLOVCA7PHP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SLFFWYBP3I6N67JBVLOVCA7PHP/action/storage_attestation","attest_author":"https://pith.science/pith/SLFFWYBP3I6N67JBVLOVCA7PHP/action/author_attestation","sign_citation":"https://pith.science/pith/SLFFWYBP3I6N67JBVLOVCA7PHP/action/citation_signature","submit_replication":"https://pith.science/pith/SLFFWYBP3I6N67JBVLOVCA7PHP/action/replication_record"}},"created_at":"2026-07-05T01:36:08.253681+00:00","updated_at":"2026-07-05T01:36:08.253681+00:00"}