{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:PSE73NPNPVJ5AHQCRAQZKI5GZS","short_pith_number":"pith:PSE73NPN","canonical_record":{"source":{"id":"1707.02635","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-07-09T20:40:44Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"cbf6318db4f2b59270337c44c7855b0939481b598adaa64e160c57496e498a4b","abstract_canon_sha256":"1ea4ef6aa245d452b8cd6333fe209306975d81d8a927c2ee1b5d3e909b8f1fdf"},"schema_version":"1.0"},"canonical_sha256":"7c89fdb5ed7d53d01e0288219523a6cc875e1f990482955a5fc22749a75ab581","source":{"kind":"arxiv","id":"1707.02635","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.02635","created_at":"2026-05-18T00:10:24Z"},{"alias_kind":"arxiv_version","alias_value":"1707.02635v3","created_at":"2026-05-18T00:10:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.02635","created_at":"2026-05-18T00:10:24Z"},{"alias_kind":"pith_short_12","alias_value":"PSE73NPNPVJ5","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"PSE73NPNPVJ5AHQC","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"PSE73NPN","created_at":"2026-05-18T12:31:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:PSE73NPNPVJ5AHQCRAQZKI5GZS","target":"record","payload":{"canonical_record":{"source":{"id":"1707.02635","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-07-09T20:40:44Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"cbf6318db4f2b59270337c44c7855b0939481b598adaa64e160c57496e498a4b","abstract_canon_sha256":"1ea4ef6aa245d452b8cd6333fe209306975d81d8a927c2ee1b5d3e909b8f1fdf"},"schema_version":"1.0"},"canonical_sha256":"7c89fdb5ed7d53d01e0288219523a6cc875e1f990482955a5fc22749a75ab581","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:24.428047Z","signature_b64":"AZfjBxA3uOs03vIfwS4o72+FtBPnQvMzHHuL157b2yZsViAWbrfZhv2weeqnnEQFgG4uEmCPsWQjsFXEN7OYDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7c89fdb5ed7d53d01e0288219523a6cc875e1f990482955a5fc22749a75ab581","last_reissued_at":"2026-05-18T00:10:24.427323Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:24.427323Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.02635","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:10:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"arR9vYLEuY9ICwKRwvQVh0fSCA/HZ+bCpwYSbrKkkcWnwb7RlMAt5OjbB4cBfWg5CVbGxMMq8H3XZL6ukGYqAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T11:25:22.974963Z"},"content_sha256":"c82960f3ba2173e9476d5e93ef232d65206b3a78eb47d2b1b34e7cd5702e1c83","schema_version":"1.0","event_id":"sha256:c82960f3ba2173e9476d5e93ef232d65206b3a78eb47d2b1b34e7cd5702e1c83"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:PSE73NPNPVJ5AHQCRAQZKI5GZS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The smallest singular value of a shifted $d$-regular random square matrix","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Alexander Litvak, Anna Lytova, Konstantin Tikhomirov, Nicole Tomczak-Jaegermann, Pierre Youssef","submitted_at":"2017-07-09T20:40:44Z","abstract_excerpt":"We derive a lower bound on the smallest singular value of a random $d$-regular matrix, that is, the adjacency matrix of a random $d$-regular directed graph. More precisely, let $C_1<d< c_1 n/\\log^2 n$ and let $\\mathcal{M}_{n,d}$ be the set of all $0/1$-valued square $n\\times n$ matrices such that each row and each column of a matrix $M\\in \\mathcal{M}_{n,d}$ has exactly $d$ ones. Let $M$ be uniformly distributed on $\\mathcal{M}_{n,d}$. Then the smallest singular value $s_{n} (M)$ of $M$ is greater than $c_2 n^{-6}$ with probability at least $1-C_2\\log^2 d/\\sqrt{d}$, where $c_1$, $c_2$, $C_1$, a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.02635","kind":"arxiv","version":3},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:10:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hsE02V37OiYgYL8oAw8dcvOdaX6+kSpbOihnBkWzfXzUfHdhqonTJwwD33KBU/NnBVGODP+w7Y2v4/eiT7RcBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T11:25:22.975616Z"},"content_sha256":"e2532ef4143b5920f1518230ddd0f10dacec2e0c2a9eeea24415fafe010b52c6","schema_version":"1.0","event_id":"sha256:e2532ef4143b5920f1518230ddd0f10dacec2e0c2a9eeea24415fafe010b52c6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PSE73NPNPVJ5AHQCRAQZKI5GZS/bundle.json","state_url":"https://pith.science/pith/PSE73NPNPVJ5AHQCRAQZKI5GZS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PSE73NPNPVJ5AHQCRAQZKI5GZS/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-30T11:25:22Z","links":{"resolver":"https://pith.science/pith/PSE73NPNPVJ5AHQCRAQZKI5GZS","bundle":"https://pith.science/pith/PSE73NPNPVJ5AHQCRAQZKI5GZS/bundle.json","state":"https://pith.science/pith/PSE73NPNPVJ5AHQCRAQZKI5GZS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PSE73NPNPVJ5AHQCRAQZKI5GZS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:PSE73NPNPVJ5AHQCRAQZKI5GZS","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"1ea4ef6aa245d452b8cd6333fe209306975d81d8a927c2ee1b5d3e909b8f1fdf","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-07-09T20:40:44Z","title_canon_sha256":"cbf6318db4f2b59270337c44c7855b0939481b598adaa64e160c57496e498a4b"},"schema_version":"1.0","source":{"id":"1707.02635","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.02635","created_at":"2026-05-18T00:10:24Z"},{"alias_kind":"arxiv_version","alias_value":"1707.02635v3","created_at":"2026-05-18T00:10:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.02635","created_at":"2026-05-18T00:10:24Z"},{"alias_kind":"pith_short_12","alias_value":"PSE73NPNPVJ5","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"PSE73NPNPVJ5AHQC","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"PSE73NPN","created_at":"2026-05-18T12:31:37Z"}],"graph_snapshots":[{"event_id":"sha256:e2532ef4143b5920f1518230ddd0f10dacec2e0c2a9eeea24415fafe010b52c6","target":"graph","created_at":"2026-05-18T00:10:24Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"We derive a lower bound on the smallest singular value of a random $d$-regular matrix, that is, the adjacency matrix of a random $d$-regular directed graph. More precisely, let $C_1<d< c_1 n/\\log^2 n$ and let $\\mathcal{M}_{n,d}$ be the set of all $0/1$-valued square $n\\times n$ matrices such that each row and each column of a matrix $M\\in \\mathcal{M}_{n,d}$ has exactly $d$ ones. Let $M$ be uniformly distributed on $\\mathcal{M}_{n,d}$. Then the smallest singular value $s_{n} (M)$ of $M$ is greater than $c_2 n^{-6}$ with probability at least $1-C_2\\log^2 d/\\sqrt{d}$, where $c_1$, $c_2$, $C_1$, a","authors_text":"Alexander Litvak, Anna Lytova, Konstantin Tikhomirov, Nicole Tomczak-Jaegermann, Pierre Youssef","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-07-09T20:40:44Z","title":"The smallest singular value of a shifted $d$-regular random square matrix"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.02635","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:c82960f3ba2173e9476d5e93ef232d65206b3a78eb47d2b1b34e7cd5702e1c83","target":"record","created_at":"2026-05-18T00:10:24Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"1ea4ef6aa245d452b8cd6333fe209306975d81d8a927c2ee1b5d3e909b8f1fdf","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-07-09T20:40:44Z","title_canon_sha256":"cbf6318db4f2b59270337c44c7855b0939481b598adaa64e160c57496e498a4b"},"schema_version":"1.0","source":{"id":"1707.02635","kind":"arxiv","version":3}},"canonical_sha256":"7c89fdb5ed7d53d01e0288219523a6cc875e1f990482955a5fc22749a75ab581","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7c89fdb5ed7d53d01e0288219523a6cc875e1f990482955a5fc22749a75ab581","first_computed_at":"2026-05-18T00:10:24.427323Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:10:24.427323Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AZfjBxA3uOs03vIfwS4o72+FtBPnQvMzHHuL157b2yZsViAWbrfZhv2weeqnnEQFgG4uEmCPsWQjsFXEN7OYDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:10:24.428047Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.02635","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c82960f3ba2173e9476d5e93ef232d65206b3a78eb47d2b1b34e7cd5702e1c83","sha256:e2532ef4143b5920f1518230ddd0f10dacec2e0c2a9eeea24415fafe010b52c6"],"state_sha256":"e2b7b71e44f294edc39d781c655257aa3c96a1cc0b7616dc903b7a7418c86717"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J3ibjWt3LgtqGkUKALQF6TTADYAJVxoiOFikBGnQViv651fI3xV5R3FJpyJcw0EWnycNSubi2CE8W9vnsf9SAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T11:25:22.979322Z","bundle_sha256":"096ee9468d95c37d58e71477a699c2119d0fb90fa114c41b5bd28812f990d691"}}