{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:ORNC4HAQSAJ5MRWORJRW3FCAHT","short_pith_number":"pith:ORNC4HAQ","schema_version":"1.0","canonical_sha256":"745a2e1c109013d646ce8a636d94403ce3b014f09c39825311aa34196e58d480","source":{"kind":"arxiv","id":"1806.02316","version":1},"attestation_state":"computed","paper":{"title":"Set partitions without blocks of certain sizes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andreas Weingartner, Joshua Culver","submitted_at":"2018-06-06T17:34:17Z","abstract_excerpt":"We give an asymptotic estimate for the number of partitions of a set of $n$ elements, whose block sizes avoid a given set $\\mathcal{S}$ of natural numbers. As an application, we derive an estimate for the number of partitions of a set with $n$ elements, which have the property that its blocks can be combined to form subsets of any size between $1$ and $n$."},"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":"1806.02316","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-06-06T17:34:17Z","cross_cats_sorted":[],"title_canon_sha256":"5868b73925b22a2720edf298ca37cb37ee8b2c9ce28301233e69e78c9ab38486","abstract_canon_sha256":"bcd118cfce21849cf090621823046e5a23fef9e2dca16778acc8f602a3eecc03"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:01.877221Z","signature_b64":"NxSREENLegae7zORRJHEedBCM26JsQ3SsC+ofALgv40cBxIkAldT0yWubRG71LoNUM5NVInhLyLgtuU1SoTpCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"745a2e1c109013d646ce8a636d94403ce3b014f09c39825311aa34196e58d480","last_reissued_at":"2026-05-18T00:14:01.876625Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:01.876625Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Set partitions without blocks of certain sizes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andreas Weingartner, Joshua Culver","submitted_at":"2018-06-06T17:34:17Z","abstract_excerpt":"We give an asymptotic estimate for the number of partitions of a set of $n$ elements, whose block sizes avoid a given set $\\mathcal{S}$ of natural numbers. As an application, we derive an estimate for the number of partitions of a set with $n$ elements, which have the property that its blocks can be combined to form subsets of any size between $1$ and $n$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.02316","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":"1806.02316","created_at":"2026-05-18T00:14:01.876708+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.02316v1","created_at":"2026-05-18T00:14:01.876708+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.02316","created_at":"2026-05-18T00:14:01.876708+00:00"},{"alias_kind":"pith_short_12","alias_value":"ORNC4HAQSAJ5","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_16","alias_value":"ORNC4HAQSAJ5MRWO","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_8","alias_value":"ORNC4HAQ","created_at":"2026-05-18T12:32:43.782077+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/ORNC4HAQSAJ5MRWORJRW3FCAHT","json":"https://pith.science/pith/ORNC4HAQSAJ5MRWORJRW3FCAHT.json","graph_json":"https://pith.science/api/pith-number/ORNC4HAQSAJ5MRWORJRW3FCAHT/graph.json","events_json":"https://pith.science/api/pith-number/ORNC4HAQSAJ5MRWORJRW3FCAHT/events.json","paper":"https://pith.science/paper/ORNC4HAQ"},"agent_actions":{"view_html":"https://pith.science/pith/ORNC4HAQSAJ5MRWORJRW3FCAHT","download_json":"https://pith.science/pith/ORNC4HAQSAJ5MRWORJRW3FCAHT.json","view_paper":"https://pith.science/paper/ORNC4HAQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.02316&json=true","fetch_graph":"https://pith.science/api/pith-number/ORNC4HAQSAJ5MRWORJRW3FCAHT/graph.json","fetch_events":"https://pith.science/api/pith-number/ORNC4HAQSAJ5MRWORJRW3FCAHT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ORNC4HAQSAJ5MRWORJRW3FCAHT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ORNC4HAQSAJ5MRWORJRW3FCAHT/action/storage_attestation","attest_author":"https://pith.science/pith/ORNC4HAQSAJ5MRWORJRW3FCAHT/action/author_attestation","sign_citation":"https://pith.science/pith/ORNC4HAQSAJ5MRWORJRW3FCAHT/action/citation_signature","submit_replication":"https://pith.science/pith/ORNC4HAQSAJ5MRWORJRW3FCAHT/action/replication_record"}},"created_at":"2026-05-18T00:14:01.876708+00:00","updated_at":"2026-05-18T00:14:01.876708+00:00"}