{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:LXLHBO4CBABCAEHICNTSNTVRVD","short_pith_number":"pith:LXLHBO4C","canonical_record":{"source":{"id":"1606.06427","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-06-21T05:18:00Z","cross_cats_sorted":[],"title_canon_sha256":"f8b378cbcc81bff2cc0b75a5a0841db9eb26615319125047692d7e50195ca41a","abstract_canon_sha256":"f4c6d746373571e5a32f717fafe17dfb44a615cd509048788992a4f3094bd4dc"},"schema_version":"1.0"},"canonical_sha256":"5dd670bb8208022010e8136726ceb1a8fd6438ada5a21ece6b76cd47aca38c3f","source":{"kind":"arxiv","id":"1606.06427","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.06427","created_at":"2026-05-18T01:12:09Z"},{"alias_kind":"arxiv_version","alias_value":"1606.06427v1","created_at":"2026-05-18T01:12:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.06427","created_at":"2026-05-18T01:12:09Z"},{"alias_kind":"pith_short_12","alias_value":"LXLHBO4CBABC","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"LXLHBO4CBABCAEHI","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"LXLHBO4C","created_at":"2026-05-18T12:30:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:LXLHBO4CBABCAEHICNTSNTVRVD","target":"record","payload":{"canonical_record":{"source":{"id":"1606.06427","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-06-21T05:18:00Z","cross_cats_sorted":[],"title_canon_sha256":"f8b378cbcc81bff2cc0b75a5a0841db9eb26615319125047692d7e50195ca41a","abstract_canon_sha256":"f4c6d746373571e5a32f717fafe17dfb44a615cd509048788992a4f3094bd4dc"},"schema_version":"1.0"},"canonical_sha256":"5dd670bb8208022010e8136726ceb1a8fd6438ada5a21ece6b76cd47aca38c3f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:09.610371Z","signature_b64":"KqjgCN8px5q1Ovuhe6sltwVuHQdOrNoinD9D9yrH79aYtDiYuB5mSt/G9TBwzMTW3AUB2mwyljDS+IPxlZ/hAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5dd670bb8208022010e8136726ceb1a8fd6438ada5a21ece6b76cd47aca38c3f","last_reissued_at":"2026-05-18T01:12:09.609745Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:09.609745Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1606.06427","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-18T01:12:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I/DJsQlHKTERKNf/CFwEZZn5rVOevf+jsQlfRbNWDJWyeKjTA4HfinbFcWgqYjWD5aWp3LHqprZ/weUhcUWBAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T12:23:13.340225Z"},"content_sha256":"4ec520ab59d3e2357b00c979686993cccda6f4a4b4708952c42fb57461fb18c0","schema_version":"1.0","event_id":"sha256:4ec520ab59d3e2357b00c979686993cccda6f4a4b4708952c42fb57461fb18c0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:LXLHBO4CBABCAEHICNTSNTVRVD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Clustering with Capacity and Size Constraints: A Deterministic Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Mayank Baranwal, Srinivasa M. Salapaka","submitted_at":"2016-06-21T05:18:00Z","abstract_excerpt":"This paper discusses a deterministic clustering approach to capacitated resource allocation problems. In particular, the Deterministic Annealing (DA) algorithm from the data-compression literature, which bears a distinct analogy to the phase transformation under annealing process in statistical physics, is adapted to address problems pertaining to clustering with several forms of size constraints. These constraints are addressed through appropriate modifications of the basic DA formulation by judiciously adjusting the free-energy function in the DA algorithm. At a given value of the annealing "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.06427","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-18T01:12:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"popn2kW9ary9LkGcXVg2xtcExDh55jq7PpKTBaby0g7GDvSP9L6S/g7lljA6VCImcAAfQy78UZH0y4ub95aaDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T12:23:13.340590Z"},"content_sha256":"3e81ad819f8fe0f4f207f2da8e65e23901b787c3c992146137d3700f90c99c77","schema_version":"1.0","event_id":"sha256:3e81ad819f8fe0f4f207f2da8e65e23901b787c3c992146137d3700f90c99c77"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LXLHBO4CBABCAEHICNTSNTVRVD/bundle.json","state_url":"https://pith.science/pith/LXLHBO4CBABCAEHICNTSNTVRVD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LXLHBO4CBABCAEHICNTSNTVRVD/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-23T12:23:13Z","links":{"resolver":"https://pith.science/pith/LXLHBO4CBABCAEHICNTSNTVRVD","bundle":"https://pith.science/pith/LXLHBO4CBABCAEHICNTSNTVRVD/bundle.json","state":"https://pith.science/pith/LXLHBO4CBABCAEHICNTSNTVRVD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LXLHBO4CBABCAEHICNTSNTVRVD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:LXLHBO4CBABCAEHICNTSNTVRVD","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":"f4c6d746373571e5a32f717fafe17dfb44a615cd509048788992a4f3094bd4dc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-06-21T05:18:00Z","title_canon_sha256":"f8b378cbcc81bff2cc0b75a5a0841db9eb26615319125047692d7e50195ca41a"},"schema_version":"1.0","source":{"id":"1606.06427","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.06427","created_at":"2026-05-18T01:12:09Z"},{"alias_kind":"arxiv_version","alias_value":"1606.06427v1","created_at":"2026-05-18T01:12:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.06427","created_at":"2026-05-18T01:12:09Z"},{"alias_kind":"pith_short_12","alias_value":"LXLHBO4CBABC","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"LXLHBO4CBABCAEHI","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"LXLHBO4C","created_at":"2026-05-18T12:30:29Z"}],"graph_snapshots":[{"event_id":"sha256:3e81ad819f8fe0f4f207f2da8e65e23901b787c3c992146137d3700f90c99c77","target":"graph","created_at":"2026-05-18T01:12:09Z","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":"This paper discusses a deterministic clustering approach to capacitated resource allocation problems. In particular, the Deterministic Annealing (DA) algorithm from the data-compression literature, which bears a distinct analogy to the phase transformation under annealing process in statistical physics, is adapted to address problems pertaining to clustering with several forms of size constraints. These constraints are addressed through appropriate modifications of the basic DA formulation by judiciously adjusting the free-energy function in the DA algorithm. At a given value of the annealing ","authors_text":"Mayank Baranwal, Srinivasa M. Salapaka","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-06-21T05:18:00Z","title":"Clustering with Capacity and Size Constraints: A Deterministic Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.06427","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:4ec520ab59d3e2357b00c979686993cccda6f4a4b4708952c42fb57461fb18c0","target":"record","created_at":"2026-05-18T01:12:09Z","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":"f4c6d746373571e5a32f717fafe17dfb44a615cd509048788992a4f3094bd4dc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-06-21T05:18:00Z","title_canon_sha256":"f8b378cbcc81bff2cc0b75a5a0841db9eb26615319125047692d7e50195ca41a"},"schema_version":"1.0","source":{"id":"1606.06427","kind":"arxiv","version":1}},"canonical_sha256":"5dd670bb8208022010e8136726ceb1a8fd6438ada5a21ece6b76cd47aca38c3f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5dd670bb8208022010e8136726ceb1a8fd6438ada5a21ece6b76cd47aca38c3f","first_computed_at":"2026-05-18T01:12:09.609745Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:12:09.609745Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KqjgCN8px5q1Ovuhe6sltwVuHQdOrNoinD9D9yrH79aYtDiYuB5mSt/G9TBwzMTW3AUB2mwyljDS+IPxlZ/hAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:12:09.610371Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.06427","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4ec520ab59d3e2357b00c979686993cccda6f4a4b4708952c42fb57461fb18c0","sha256:3e81ad819f8fe0f4f207f2da8e65e23901b787c3c992146137d3700f90c99c77"],"state_sha256":"4c140af03d765e4631af6cb1bcd10daaa64a98e9fb225bb1844b8028e251e093"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OlwyqsS6Dd5lvf6FfO9et+ZSJbm6RSdw7h6fmXkwyDsK9SF9UHDqeUJ/UXAp7XZ6lpraL3HVPmsGTXiyiDNDCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T12:23:13.342456Z","bundle_sha256":"c3bc65d54acfa197f93cff62d61c39c7456c27e7ed8fb0494ca78574e6538e3a"}}