{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:RCJNA4BE7Y237XU5AUZ7Q3ULDG","short_pith_number":"pith:RCJNA4BE","schema_version":"1.0","canonical_sha256":"8892d07024fe35bfde9d0533f86e8b19b5da1e338b044b77e1f74a8ab0318ce9","source":{"kind":"arxiv","id":"1803.08548","version":1},"attestation_state":"computed","paper":{"title":"A George Szekeres Formula for Restricted Partitions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"L. Bruce Richmond","submitted_at":"2018-03-22T19:08:23Z","abstract_excerpt":"We derive an asymptotic formula for $A(n,j,r)$ the number of integer partitions of $n$ into at most $j$ parts each part $\\le r$. We assume $j$ and $r$ are near their mean values. We also investigate the second largest part, the number of parts $\\ge 2$, etc. We show that the fraction of the partitions of an even integer $n$ that are graphical, ie. whose parts form the degree sequence of a simple graph, is $O(\\ln^{-1/2} n)$. Probabilistic results are used in our discussion of graphical partitions. The George Szekeres circle method is essential for our asymptotic results on partitions. We determi"},"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":"1803.08548","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-22T19:08:23Z","cross_cats_sorted":[],"title_canon_sha256":"d2c78ec5559ce1b7a837986b70a6da62b49c0b2494bd7ddf92ec5c3989d93a0b","abstract_canon_sha256":"d62e4db1491b1bae0b71bb1d31ba4d2cfcef32ae491fd7388ab933eff26a434f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:21.361150Z","signature_b64":"SKaM2/Pye6EGl/Bzs8vUTbpLjfG85V+vND3u3KT0geySM+wCqtThcqYOP5Dy9yWqx+gFIbYtYI5xcX5NBqqjDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8892d07024fe35bfde9d0533f86e8b19b5da1e338b044b77e1f74a8ab0318ce9","last_reissued_at":"2026-05-18T00:20:21.360485Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:21.360485Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A George Szekeres Formula for Restricted Partitions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"L. Bruce Richmond","submitted_at":"2018-03-22T19:08:23Z","abstract_excerpt":"We derive an asymptotic formula for $A(n,j,r)$ the number of integer partitions of $n$ into at most $j$ parts each part $\\le r$. We assume $j$ and $r$ are near their mean values. We also investigate the second largest part, the number of parts $\\ge 2$, etc. We show that the fraction of the partitions of an even integer $n$ that are graphical, ie. whose parts form the degree sequence of a simple graph, is $O(\\ln^{-1/2} n)$. Probabilistic results are used in our discussion of graphical partitions. The George Szekeres circle method is essential for our asymptotic results on partitions. We determi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.08548","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":"1803.08548","created_at":"2026-05-18T00:20:21.360571+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.08548v1","created_at":"2026-05-18T00:20:21.360571+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.08548","created_at":"2026-05-18T00:20:21.360571+00:00"},{"alias_kind":"pith_short_12","alias_value":"RCJNA4BE7Y23","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_16","alias_value":"RCJNA4BE7Y237XU5","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_8","alias_value":"RCJNA4BE","created_at":"2026-05-18T12:32:50.500415+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/RCJNA4BE7Y237XU5AUZ7Q3ULDG","json":"https://pith.science/pith/RCJNA4BE7Y237XU5AUZ7Q3ULDG.json","graph_json":"https://pith.science/api/pith-number/RCJNA4BE7Y237XU5AUZ7Q3ULDG/graph.json","events_json":"https://pith.science/api/pith-number/RCJNA4BE7Y237XU5AUZ7Q3ULDG/events.json","paper":"https://pith.science/paper/RCJNA4BE"},"agent_actions":{"view_html":"https://pith.science/pith/RCJNA4BE7Y237XU5AUZ7Q3ULDG","download_json":"https://pith.science/pith/RCJNA4BE7Y237XU5AUZ7Q3ULDG.json","view_paper":"https://pith.science/paper/RCJNA4BE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.08548&json=true","fetch_graph":"https://pith.science/api/pith-number/RCJNA4BE7Y237XU5AUZ7Q3ULDG/graph.json","fetch_events":"https://pith.science/api/pith-number/RCJNA4BE7Y237XU5AUZ7Q3ULDG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RCJNA4BE7Y237XU5AUZ7Q3ULDG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RCJNA4BE7Y237XU5AUZ7Q3ULDG/action/storage_attestation","attest_author":"https://pith.science/pith/RCJNA4BE7Y237XU5AUZ7Q3ULDG/action/author_attestation","sign_citation":"https://pith.science/pith/RCJNA4BE7Y237XU5AUZ7Q3ULDG/action/citation_signature","submit_replication":"https://pith.science/pith/RCJNA4BE7Y237XU5AUZ7Q3ULDG/action/replication_record"}},"created_at":"2026-05-18T00:20:21.360571+00:00","updated_at":"2026-05-18T00:20:21.360571+00:00"}