{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:6H2AVCR64CD4GTOYKOPMI7RDW4","short_pith_number":"pith:6H2AVCR6","schema_version":"1.0","canonical_sha256":"f1f40a8a3ee087c34dd8539ec47e23b70c49482eed849a596e6395c1872d64ff","source":{"kind":"arxiv","id":"1209.5764","version":2},"attestation_state":"computed","paper":{"title":"Threshold functions for distinct parts: revisiting Erdos-Lehner","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"\\'Eva Czabarka, L\\'aszl\\'o Sz\\'ekely, Matteo Marsili","submitted_at":"2012-09-25T20:55:37Z","abstract_excerpt":"We study four problems: put $n$ distinguishable/non-distinguishable balls into $k$ non-empty distinguishable/non-distinguishable boxes randomly. What is the threshold function $k=k(n) $ to make almost sure that no two boxes contain the same number of balls? The non-distinguishable ball problems are very close to the Erd\\H os--Lehner asymptotic formula for the number of partitions of the integer $n$ into $k$ parts with $k=o(n^{1/3})$. The problem is motivated by the statistics of an experiment, where we only can tell whether outcomes are identical or different."},"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":"1209.5764","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-09-25T20:55:37Z","cross_cats_sorted":[],"title_canon_sha256":"24f183530170f69c9d4c2db44090620b7d847e1b6f00d40798f4b5c5e3e05583","abstract_canon_sha256":"af1dacce5f649f17ef2cc0b0771dfb13eedeaa6027562419339c05f08b92522b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:43:28.281655Z","signature_b64":"iTWhbz2jsHi2ZWnox8UrhwzZRYrxddZn8rYof6Hwu8hxusgDY/HBaw7hJjgv4HcLrlFATbA9Zd6Yec4oRetsCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f1f40a8a3ee087c34dd8539ec47e23b70c49482eed849a596e6395c1872d64ff","last_reissued_at":"2026-05-18T03:43:28.280908Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:43:28.280908Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Threshold functions for distinct parts: revisiting Erdos-Lehner","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"\\'Eva Czabarka, L\\'aszl\\'o Sz\\'ekely, Matteo Marsili","submitted_at":"2012-09-25T20:55:37Z","abstract_excerpt":"We study four problems: put $n$ distinguishable/non-distinguishable balls into $k$ non-empty distinguishable/non-distinguishable boxes randomly. What is the threshold function $k=k(n) $ to make almost sure that no two boxes contain the same number of balls? The non-distinguishable ball problems are very close to the Erd\\H os--Lehner asymptotic formula for the number of partitions of the integer $n$ into $k$ parts with $k=o(n^{1/3})$. The problem is motivated by the statistics of an experiment, where we only can tell whether outcomes are identical or different."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.5764","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":""},"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":"1209.5764","created_at":"2026-05-18T03:43:28.281021+00:00"},{"alias_kind":"arxiv_version","alias_value":"1209.5764v2","created_at":"2026-05-18T03:43:28.281021+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.5764","created_at":"2026-05-18T03:43:28.281021+00:00"},{"alias_kind":"pith_short_12","alias_value":"6H2AVCR64CD4","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_16","alias_value":"6H2AVCR64CD4GTOY","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_8","alias_value":"6H2AVCR6","created_at":"2026-05-18T12:26:56.085431+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/6H2AVCR64CD4GTOYKOPMI7RDW4","json":"https://pith.science/pith/6H2AVCR64CD4GTOYKOPMI7RDW4.json","graph_json":"https://pith.science/api/pith-number/6H2AVCR64CD4GTOYKOPMI7RDW4/graph.json","events_json":"https://pith.science/api/pith-number/6H2AVCR64CD4GTOYKOPMI7RDW4/events.json","paper":"https://pith.science/paper/6H2AVCR6"},"agent_actions":{"view_html":"https://pith.science/pith/6H2AVCR64CD4GTOYKOPMI7RDW4","download_json":"https://pith.science/pith/6H2AVCR64CD4GTOYKOPMI7RDW4.json","view_paper":"https://pith.science/paper/6H2AVCR6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1209.5764&json=true","fetch_graph":"https://pith.science/api/pith-number/6H2AVCR64CD4GTOYKOPMI7RDW4/graph.json","fetch_events":"https://pith.science/api/pith-number/6H2AVCR64CD4GTOYKOPMI7RDW4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6H2AVCR64CD4GTOYKOPMI7RDW4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6H2AVCR64CD4GTOYKOPMI7RDW4/action/storage_attestation","attest_author":"https://pith.science/pith/6H2AVCR64CD4GTOYKOPMI7RDW4/action/author_attestation","sign_citation":"https://pith.science/pith/6H2AVCR64CD4GTOYKOPMI7RDW4/action/citation_signature","submit_replication":"https://pith.science/pith/6H2AVCR64CD4GTOYKOPMI7RDW4/action/replication_record"}},"created_at":"2026-05-18T03:43:28.281021+00:00","updated_at":"2026-05-18T03:43:28.281021+00:00"}