{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:DHG2K3AT3TQIXQ3PEXLIPRVLUR","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":"38379268e6bf65cd8994ad9ef4c5c43a8b87b807be823bfecc0f3d282abf135b","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2019-07-22T23:26:08Z","title_canon_sha256":"9af1075e0713b77677f53872bdc1874caf917f4b8cd5b1256472710afad9cf0e"},"schema_version":"1.0","source":{"id":"1907.09628","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.09628","created_at":"2026-07-05T00:36:29Z"},{"alias_kind":"arxiv_version","alias_value":"1907.09628v1","created_at":"2026-07-05T00:36:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.09628","created_at":"2026-07-05T00:36:29Z"},{"alias_kind":"pith_short_12","alias_value":"DHG2K3AT3TQI","created_at":"2026-07-05T00:36:29Z"},{"alias_kind":"pith_short_16","alias_value":"DHG2K3AT3TQIXQ3P","created_at":"2026-07-05T00:36:29Z"},{"alias_kind":"pith_short_8","alias_value":"DHG2K3AT","created_at":"2026-07-05T00:36:29Z"}],"graph_snapshots":[{"event_id":"sha256:04cc1130264be2a4d82c741067d9363d7a60123643e9b3852bfe9c10dd8daf70","target":"graph","created_at":"2026-07-05T00:36:29Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1907.09628/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This is an expository note answering a question posed to us by Richard Stanley, in which we prove a limit shape theorem for partitions of $n$ which maximize the number of subpartitions. The limit shape and the growth rate of the number of subpartitions are explicit. The key ideas are to use large deviations estimates for random walks, together with convex analysis and the Hardy-Ramanujan asymptotics. Our limit shape coincides with Vershik's limit shape for uniform random partitions.","authors_text":"Ivan Corwin, Shalin Parekh","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2019-07-22T23:26:08Z","title":"Limit Shape of Subpartition Maximizing Partitions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.09628","kind":"arxiv","version":1},"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:8529bff6400534f60e142bbdaa6b4a71dc2c29c36ec355ef242570ebfa90efe0","target":"record","created_at":"2026-07-05T00:36:29Z","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":"38379268e6bf65cd8994ad9ef4c5c43a8b87b807be823bfecc0f3d282abf135b","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2019-07-22T23:26:08Z","title_canon_sha256":"9af1075e0713b77677f53872bdc1874caf917f4b8cd5b1256472710afad9cf0e"},"schema_version":"1.0","source":{"id":"1907.09628","kind":"arxiv","version":1}},"canonical_sha256":"19cda56c13dce08bc36f25d687c6aba46efcbe55295500f2c8c51be517cd3266","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"19cda56c13dce08bc36f25d687c6aba46efcbe55295500f2c8c51be517cd3266","first_computed_at":"2026-07-05T00:36:29.292027Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:36:29.292027Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rNOoTjgjx95Tn781ep2WoRCBl6++gEMUs9HNRjHRvJ7yptgDn4Kv3OfXvH5r3igUMRcbNTCv9QW2KUv6oScPBg==","signature_status":"signed_v1","signed_at":"2026-07-05T00:36:29.292498Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.09628","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8529bff6400534f60e142bbdaa6b4a71dc2c29c36ec355ef242570ebfa90efe0","sha256:04cc1130264be2a4d82c741067d9363d7a60123643e9b3852bfe9c10dd8daf70"],"state_sha256":"655d958b4548c748ca90c807433d3ae8c34e11c0d850e989cdc62a7b3699e747"}