{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:6XEAEORGZKONTLQ7KSP7YLSHO5","short_pith_number":"pith:6XEAEORG","canonical_record":{"source":{"id":"1710.06047","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.AP","submitted_at":"2017-10-17T01:32:28Z","cross_cats_sorted":["stat.ME"],"title_canon_sha256":"d21670e47d275e2c7d591a7291f3086eee4b2de421cb5409388f6081db1eab98","abstract_canon_sha256":"7d05f2c768a910f0c538d12f3919f63d2376f37d633fb6abd60d8417d380fd0d"},"schema_version":"1.0"},"canonical_sha256":"f5c8023a26ca9cd9ae1f549ffc2e47775da209ee9abcae4a444bcb86564cb8b4","source":{"kind":"arxiv","id":"1710.06047","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.06047","created_at":"2026-05-18T00:32:37Z"},{"alias_kind":"arxiv_version","alias_value":"1710.06047v1","created_at":"2026-05-18T00:32:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.06047","created_at":"2026-05-18T00:32:37Z"},{"alias_kind":"pith_short_12","alias_value":"6XEAEORGZKON","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6XEAEORGZKONTLQ7","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6XEAEORG","created_at":"2026-05-18T12:31:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:6XEAEORGZKONTLQ7KSP7YLSHO5","target":"record","payload":{"canonical_record":{"source":{"id":"1710.06047","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.AP","submitted_at":"2017-10-17T01:32:28Z","cross_cats_sorted":["stat.ME"],"title_canon_sha256":"d21670e47d275e2c7d591a7291f3086eee4b2de421cb5409388f6081db1eab98","abstract_canon_sha256":"7d05f2c768a910f0c538d12f3919f63d2376f37d633fb6abd60d8417d380fd0d"},"schema_version":"1.0"},"canonical_sha256":"f5c8023a26ca9cd9ae1f549ffc2e47775da209ee9abcae4a444bcb86564cb8b4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:32:37.938373Z","signature_b64":"fvldg6GNdPy/oSpFnJORm1XlXEjnmDLnVpr4LJ3O4YesXPmYlBfBJGSCoJJ/34C/k0W9CUNCoqIzdXZ+maLLBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f5c8023a26ca9cd9ae1f549ffc2e47775da209ee9abcae4a444bcb86564cb8b4","last_reissued_at":"2026-05-18T00:32:37.937731Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:32:37.937731Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.06047","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:32:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3xAI081OpZWxKZ6aOv1Nli9XHuVVlIoBhMoHChZDvqQf0GJHixWqoGp6uQRY8jyZCRBmLGXQV6HYH2Or9P0BDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T06:46:12.872024Z"},"content_sha256":"53488d29f4e3007fa8069bc0d47cea44a00db1412960d659a86285e108d6d56d","schema_version":"1.0","event_id":"sha256:53488d29f4e3007fa8069bc0d47cea44a00db1412960d659a86285e108d6d56d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:6XEAEORGZKONTLQ7KSP7YLSHO5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Bayesian Sorting Hat: A Decision-Theoretic Approach to Size-Constrained Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ME"],"primary_cat":"stat.AP","authors_text":"Justin D. Silverman, Rachel K. Silverman","submitted_at":"2017-10-17T01:32:28Z","abstract_excerpt":"Size-constrained clustering (SCC) refers to the dual problem of using observations to determine latent cluster structure while at the same time assigning observations to the unknown clusters subject to an analyst defined constraint on cluster sizes. While several approaches have been proposed, SCC remains a difficult problem due to the combinatorial dependency between observations introduced by the size-constraints. Here we reformulate SCC as a decision problem and introduce a novel loss function to capture various types of size constraints. As opposed to prior work, our approach is uniquely s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.06047","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:32:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1S822GgXHDRfkIemdvI6szZMpK0rzEt2KkBSpOwY7GkP82Ck+H7faYAP85WBN5UWkjKhg1wEpJdtLJvWDkqEDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T06:46:12.872402Z"},"content_sha256":"c9a0350814617287ecedf80897993c91b1c8fdf831769e216633f087fc0295aa","schema_version":"1.0","event_id":"sha256:c9a0350814617287ecedf80897993c91b1c8fdf831769e216633f087fc0295aa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6XEAEORGZKONTLQ7KSP7YLSHO5/bundle.json","state_url":"https://pith.science/pith/6XEAEORGZKONTLQ7KSP7YLSHO5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6XEAEORGZKONTLQ7KSP7YLSHO5/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-01T06:46:12Z","links":{"resolver":"https://pith.science/pith/6XEAEORGZKONTLQ7KSP7YLSHO5","bundle":"https://pith.science/pith/6XEAEORGZKONTLQ7KSP7YLSHO5/bundle.json","state":"https://pith.science/pith/6XEAEORGZKONTLQ7KSP7YLSHO5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6XEAEORGZKONTLQ7KSP7YLSHO5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:6XEAEORGZKONTLQ7KSP7YLSHO5","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":"7d05f2c768a910f0c538d12f3919f63d2376f37d633fb6abd60d8417d380fd0d","cross_cats_sorted":["stat.ME"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.AP","submitted_at":"2017-10-17T01:32:28Z","title_canon_sha256":"d21670e47d275e2c7d591a7291f3086eee4b2de421cb5409388f6081db1eab98"},"schema_version":"1.0","source":{"id":"1710.06047","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.06047","created_at":"2026-05-18T00:32:37Z"},{"alias_kind":"arxiv_version","alias_value":"1710.06047v1","created_at":"2026-05-18T00:32:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.06047","created_at":"2026-05-18T00:32:37Z"},{"alias_kind":"pith_short_12","alias_value":"6XEAEORGZKON","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6XEAEORGZKONTLQ7","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6XEAEORG","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:c9a0350814617287ecedf80897993c91b1c8fdf831769e216633f087fc0295aa","target":"graph","created_at":"2026-05-18T00:32:37Z","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"},"paper":{"abstract_excerpt":"Size-constrained clustering (SCC) refers to the dual problem of using observations to determine latent cluster structure while at the same time assigning observations to the unknown clusters subject to an analyst defined constraint on cluster sizes. While several approaches have been proposed, SCC remains a difficult problem due to the combinatorial dependency between observations introduced by the size-constraints. Here we reformulate SCC as a decision problem and introduce a novel loss function to capture various types of size constraints. As opposed to prior work, our approach is uniquely s","authors_text":"Justin D. Silverman, Rachel K. Silverman","cross_cats":["stat.ME"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.AP","submitted_at":"2017-10-17T01:32:28Z","title":"The Bayesian Sorting Hat: A Decision-Theoretic Approach to Size-Constrained Clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.06047","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:53488d29f4e3007fa8069bc0d47cea44a00db1412960d659a86285e108d6d56d","target":"record","created_at":"2026-05-18T00:32:37Z","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":"7d05f2c768a910f0c538d12f3919f63d2376f37d633fb6abd60d8417d380fd0d","cross_cats_sorted":["stat.ME"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.AP","submitted_at":"2017-10-17T01:32:28Z","title_canon_sha256":"d21670e47d275e2c7d591a7291f3086eee4b2de421cb5409388f6081db1eab98"},"schema_version":"1.0","source":{"id":"1710.06047","kind":"arxiv","version":1}},"canonical_sha256":"f5c8023a26ca9cd9ae1f549ffc2e47775da209ee9abcae4a444bcb86564cb8b4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f5c8023a26ca9cd9ae1f549ffc2e47775da209ee9abcae4a444bcb86564cb8b4","first_computed_at":"2026-05-18T00:32:37.937731Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:32:37.937731Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fvldg6GNdPy/oSpFnJORm1XlXEjnmDLnVpr4LJ3O4YesXPmYlBfBJGSCoJJ/34C/k0W9CUNCoqIzdXZ+maLLBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:32:37.938373Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.06047","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:53488d29f4e3007fa8069bc0d47cea44a00db1412960d659a86285e108d6d56d","sha256:c9a0350814617287ecedf80897993c91b1c8fdf831769e216633f087fc0295aa"],"state_sha256":"a1098d31024cc5be2ee7e65674c061bcad8847d5b2e8339e9d07c81095fd194b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mPKvV5GOgDnsgj10LL56Z+GCJ93CfbriuyDpevvDZljfAW4E9e77NZJj702uK/Xf1I2dUw3Mb5Q9eRnWZbs9CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T06:46:12.874580Z","bundle_sha256":"bf71b8707776e4134925e996df5dbc47e9625a219755a6b054eeb62943bab352"}}