{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:VVRCHLZWZRUXE5X2L6SJG6SPX5","short_pith_number":"pith:VVRCHLZW","schema_version":"1.0","canonical_sha256":"ad6223af36cc697276fa5fa4937a4fbf5a7d1dbd51fe7ab5bc7e0b07ea66f60e","source":{"kind":"arxiv","id":"1312.4607","version":1},"attestation_state":"computed","paper":{"title":"How to pick a random integer matrix? (and other questions)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.GT"],"primary_cat":"math.GR","authors_text":"Igor Rivin","submitted_at":"2013-12-17T01:56:31Z","abstract_excerpt":"We discuss the question of how to pick a matrix uniformly (in an appropriate sense) at random from groups big and small. We give algorithms in some cases, and indicate interesting problems in others."},"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":"1312.4607","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2013-12-17T01:56:31Z","cross_cats_sorted":["math.GT"],"title_canon_sha256":"45c819c10672d69248740a2714bea2fec35c1a9f8acfcd7803ce94a81de25517","abstract_canon_sha256":"9900ba76a283d954beaa904bebac8259229ef12edc87087f4a13b78eddac4a70"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:04:23.498650Z","signature_b64":"huJLPXN/HLfXEDwghJS7WZvNeRvePWLyP4nkH+aKMu9Y2peqi+DqJ99EWEOsa4svM1BIkrjf1pb4KDMisvSDCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ad6223af36cc697276fa5fa4937a4fbf5a7d1dbd51fe7ab5bc7e0b07ea66f60e","last_reissued_at":"2026-05-18T03:04:23.498215Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:04:23.498215Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"How to pick a random integer matrix? (and other questions)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.GT"],"primary_cat":"math.GR","authors_text":"Igor Rivin","submitted_at":"2013-12-17T01:56:31Z","abstract_excerpt":"We discuss the question of how to pick a matrix uniformly (in an appropriate sense) at random from groups big and small. We give algorithms in some cases, and indicate interesting problems in others."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.4607","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":"1312.4607","created_at":"2026-05-18T03:04:23.498278+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.4607v1","created_at":"2026-05-18T03:04:23.498278+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.4607","created_at":"2026-05-18T03:04:23.498278+00:00"},{"alias_kind":"pith_short_12","alias_value":"VVRCHLZWZRUX","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_16","alias_value":"VVRCHLZWZRUXE5X2","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_8","alias_value":"VVRCHLZW","created_at":"2026-05-18T12:28:04.890932+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/VVRCHLZWZRUXE5X2L6SJG6SPX5","json":"https://pith.science/pith/VVRCHLZWZRUXE5X2L6SJG6SPX5.json","graph_json":"https://pith.science/api/pith-number/VVRCHLZWZRUXE5X2L6SJG6SPX5/graph.json","events_json":"https://pith.science/api/pith-number/VVRCHLZWZRUXE5X2L6SJG6SPX5/events.json","paper":"https://pith.science/paper/VVRCHLZW"},"agent_actions":{"view_html":"https://pith.science/pith/VVRCHLZWZRUXE5X2L6SJG6SPX5","download_json":"https://pith.science/pith/VVRCHLZWZRUXE5X2L6SJG6SPX5.json","view_paper":"https://pith.science/paper/VVRCHLZW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.4607&json=true","fetch_graph":"https://pith.science/api/pith-number/VVRCHLZWZRUXE5X2L6SJG6SPX5/graph.json","fetch_events":"https://pith.science/api/pith-number/VVRCHLZWZRUXE5X2L6SJG6SPX5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VVRCHLZWZRUXE5X2L6SJG6SPX5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VVRCHLZWZRUXE5X2L6SJG6SPX5/action/storage_attestation","attest_author":"https://pith.science/pith/VVRCHLZWZRUXE5X2L6SJG6SPX5/action/author_attestation","sign_citation":"https://pith.science/pith/VVRCHLZWZRUXE5X2L6SJG6SPX5/action/citation_signature","submit_replication":"https://pith.science/pith/VVRCHLZWZRUXE5X2L6SJG6SPX5/action/replication_record"}},"created_at":"2026-05-18T03:04:23.498278+00:00","updated_at":"2026-05-18T03:04:23.498278+00:00"}