{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:JEQGXVDOQQGRNOKZOPBZ2L2PCX","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":"6dcac1a9190abc1859b6a6f4c0ca45cc8d6ce766c90a6a2d37ef57ec91989b70","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2021-09-17T21:41:13Z","title_canon_sha256":"3b68769704fd94ddbf3ca816821e68da3141bd05361374b1c6d5f6c61cd498e6"},"schema_version":"1.0","source":{"id":"2109.10222","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2109.10222","created_at":"2026-07-05T04:53:39Z"},{"alias_kind":"arxiv_version","alias_value":"2109.10222v3","created_at":"2026-07-05T04:53:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2109.10222","created_at":"2026-07-05T04:53:39Z"},{"alias_kind":"pith_short_12","alias_value":"JEQGXVDOQQGR","created_at":"2026-07-05T04:53:39Z"},{"alias_kind":"pith_short_16","alias_value":"JEQGXVDOQQGRNOKZ","created_at":"2026-07-05T04:53:39Z"},{"alias_kind":"pith_short_8","alias_value":"JEQGXVDO","created_at":"2026-07-05T04:53:39Z"}],"graph_snapshots":[{"event_id":"sha256:4365b2b8ab753499b27774bfcd64c776f49a846399e3dd681ae07a3308f5ba0b","target":"graph","created_at":"2026-07-05T04:53:39Z","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/2109.10222/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"For positive integers $n$ and $m$, consider a multiset of non-empty subsets of $[m]$ such that there is a \\textit{unique} partition of these subsets into $n$ partitions of $[m]$. We study the maximum possible size $g(n,m)$ of such a multiset. We focus on the regime $n \\leq 2^{m-1}-1$ and show that $g(n,m) \\geq \\Omega(\\frac{nm}{\\log_2 n})$. When $n = 2^{cm}$ for any $c \\in (0,1)$, this lower bound simplifies to $\\Omega(\\frac{n}{c})$, and we show a matching upper bound $g(n,m) \\leq O(\\frac{n}{c}\\log_2(\\frac{1}{c}))$ that is optimal up to a factor of $\\log_2(\\frac{1}{c})$. We also compute $g(n,m)","authors_text":"Varun Sivashankar","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2021-09-17T21:41:13Z","title":"Extremal Uniquely Resolvable Multisets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2109.10222","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:589cc93bcbeecf24f916d7c88228aced8860745fab310dd3b209a58fc3f504c4","target":"record","created_at":"2026-07-05T04:53:39Z","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":"6dcac1a9190abc1859b6a6f4c0ca45cc8d6ce766c90a6a2d37ef57ec91989b70","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2021-09-17T21:41:13Z","title_canon_sha256":"3b68769704fd94ddbf3ca816821e68da3141bd05361374b1c6d5f6c61cd498e6"},"schema_version":"1.0","source":{"id":"2109.10222","kind":"arxiv","version":3}},"canonical_sha256":"49206bd46e840d16b95973c39d2f4f15d1ef8824632008d991afc8a0d795294a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"49206bd46e840d16b95973c39d2f4f15d1ef8824632008d991afc8a0d795294a","first_computed_at":"2026-07-05T04:53:39.709635Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:53:39.709635Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BChSRQ1KQrjn70fE3cgB6g1M+I3VmsCeYU2WsuSkpH5vjcg+F+Pu67qBxyND3PizWZNZMtCShJpxuMoOLioADQ==","signature_status":"signed_v1","signed_at":"2026-07-05T04:53:39.710017Z","signed_message":"canonical_sha256_bytes"},"source_id":"2109.10222","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:589cc93bcbeecf24f916d7c88228aced8860745fab310dd3b209a58fc3f504c4","sha256:4365b2b8ab753499b27774bfcd64c776f49a846399e3dd681ae07a3308f5ba0b"],"state_sha256":"57ce34afa38b0e27b1fdd3bcd9afe7cea2f591d6f745cfd036f0a65ef8531d53"}