{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:4Y3L5GCPIV3NUVTGCWHUCBIIPQ","short_pith_number":"pith:4Y3L5GCP","canonical_record":{"source":{"id":"2412.00369","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-11-30T06:24:34Z","cross_cats_sorted":[],"title_canon_sha256":"8e6599353fd475f09b861ccc9b358c35afe149d4c70d4e81aaeee6a5c65829c9","abstract_canon_sha256":"8acf9dfd009e8077ba036d20bcca842881434e8e923063c457d73c84012b4747"},"schema_version":"1.0"},"canonical_sha256":"e636be984f4576da5666158f4105087c106653706d0843e2fe882f947e78f929","source":{"kind":"arxiv","id":"2412.00369","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.00369","created_at":"2026-07-05T09:42:40Z"},{"alias_kind":"arxiv_version","alias_value":"2412.00369v1","created_at":"2026-07-05T09:42:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.00369","created_at":"2026-07-05T09:42:40Z"},{"alias_kind":"pith_short_12","alias_value":"4Y3L5GCPIV3N","created_at":"2026-07-05T09:42:40Z"},{"alias_kind":"pith_short_16","alias_value":"4Y3L5GCPIV3NUVTG","created_at":"2026-07-05T09:42:40Z"},{"alias_kind":"pith_short_8","alias_value":"4Y3L5GCP","created_at":"2026-07-05T09:42:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:4Y3L5GCPIV3NUVTGCWHUCBIIPQ","target":"record","payload":{"canonical_record":{"source":{"id":"2412.00369","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-11-30T06:24:34Z","cross_cats_sorted":[],"title_canon_sha256":"8e6599353fd475f09b861ccc9b358c35afe149d4c70d4e81aaeee6a5c65829c9","abstract_canon_sha256":"8acf9dfd009e8077ba036d20bcca842881434e8e923063c457d73c84012b4747"},"schema_version":"1.0"},"canonical_sha256":"e636be984f4576da5666158f4105087c106653706d0843e2fe882f947e78f929","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:42:40.178137Z","signature_b64":"lJxr3I34stBlgHZ02e8HPSdisI06pJzu9Uyj1meUUzvP2tzRMkL8TQOgsTLseitDwz9VHed06II/UH1ovP9GDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e636be984f4576da5666158f4105087c106653706d0843e2fe882f947e78f929","last_reissued_at":"2026-07-05T09:42:40.177577Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:42:40.177577Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2412.00369","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-07-05T09:42:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wjFL1r5gOC445PT8RPP6wWzFSQ1eTvX32hlfQxNIWQ2A0iAX6HFbwOt0leId6aUUA4464PkrUjjnxQxC0JZwCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T18:13:35.178903Z"},"content_sha256":"ccb761783d02adcf62dd203914e8dde0ed019602de44cb4dff9cabefedd8a09d","schema_version":"1.0","event_id":"sha256:ccb761783d02adcf62dd203914e8dde0ed019602de44cb4dff9cabefedd8a09d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:4Y3L5GCPIV3NUVTGCWHUCBIIPQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Random Cycle Coding: Lossless Compression of Cluster Assignments via Bits-Back Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Alireza Makhzani, Ashish Khisti, Daniel Severo","submitted_at":"2024-11-30T06:24:34Z","abstract_excerpt":"We present an optimal method for encoding cluster assignments of arbitrary data sets. Our method, Random Cycle Coding (RCC), encodes data sequentially and sends assignment information as cycles of the permutation defined by the order of encoded elements. RCC does not require any training and its worst-case complexity scales quasi-linearly with the size of the largest cluster. We characterize the achievable bit rates as a function of cluster sizes and number of elements, showing RCC consistently outperforms previous methods while requiring less compute and memory resources. Experiments show RCC"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.00369","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2412.00369/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T09:42:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dEeK04xNbqrHgy5IsLlZ3LHIWxFjdgYCHVNbKw4RmiV5W5GsEUDLxJfiPyU+zGFdCrJqlKEwiskV0zzufFCVCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T18:13:35.179273Z"},"content_sha256":"3fe32876fce13107e8f02b43cf9387348436e744f77c12cf30f3393c1de20880","schema_version":"1.0","event_id":"sha256:3fe32876fce13107e8f02b43cf9387348436e744f77c12cf30f3393c1de20880"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4Y3L5GCPIV3NUVTGCWHUCBIIPQ/bundle.json","state_url":"https://pith.science/pith/4Y3L5GCPIV3NUVTGCWHUCBIIPQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4Y3L5GCPIV3NUVTGCWHUCBIIPQ/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-07-06T18:13:35Z","links":{"resolver":"https://pith.science/pith/4Y3L5GCPIV3NUVTGCWHUCBIIPQ","bundle":"https://pith.science/pith/4Y3L5GCPIV3NUVTGCWHUCBIIPQ/bundle.json","state":"https://pith.science/pith/4Y3L5GCPIV3NUVTGCWHUCBIIPQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4Y3L5GCPIV3NUVTGCWHUCBIIPQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:4Y3L5GCPIV3NUVTGCWHUCBIIPQ","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":"8acf9dfd009e8077ba036d20bcca842881434e8e923063c457d73c84012b4747","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-11-30T06:24:34Z","title_canon_sha256":"8e6599353fd475f09b861ccc9b358c35afe149d4c70d4e81aaeee6a5c65829c9"},"schema_version":"1.0","source":{"id":"2412.00369","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.00369","created_at":"2026-07-05T09:42:40Z"},{"alias_kind":"arxiv_version","alias_value":"2412.00369v1","created_at":"2026-07-05T09:42:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.00369","created_at":"2026-07-05T09:42:40Z"},{"alias_kind":"pith_short_12","alias_value":"4Y3L5GCPIV3N","created_at":"2026-07-05T09:42:40Z"},{"alias_kind":"pith_short_16","alias_value":"4Y3L5GCPIV3NUVTG","created_at":"2026-07-05T09:42:40Z"},{"alias_kind":"pith_short_8","alias_value":"4Y3L5GCP","created_at":"2026-07-05T09:42:40Z"}],"graph_snapshots":[{"event_id":"sha256:3fe32876fce13107e8f02b43cf9387348436e744f77c12cf30f3393c1de20880","target":"graph","created_at":"2026-07-05T09:42:40Z","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/2412.00369/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We present an optimal method for encoding cluster assignments of arbitrary data sets. Our method, Random Cycle Coding (RCC), encodes data sequentially and sends assignment information as cycles of the permutation defined by the order of encoded elements. RCC does not require any training and its worst-case complexity scales quasi-linearly with the size of the largest cluster. We characterize the achievable bit rates as a function of cluster sizes and number of elements, showing RCC consistently outperforms previous methods while requiring less compute and memory resources. Experiments show RCC","authors_text":"Alireza Makhzani, Ashish Khisti, Daniel Severo","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-11-30T06:24:34Z","title":"Random Cycle Coding: Lossless Compression of Cluster Assignments via Bits-Back Coding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.00369","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:ccb761783d02adcf62dd203914e8dde0ed019602de44cb4dff9cabefedd8a09d","target":"record","created_at":"2026-07-05T09:42:40Z","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":"8acf9dfd009e8077ba036d20bcca842881434e8e923063c457d73c84012b4747","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-11-30T06:24:34Z","title_canon_sha256":"8e6599353fd475f09b861ccc9b358c35afe149d4c70d4e81aaeee6a5c65829c9"},"schema_version":"1.0","source":{"id":"2412.00369","kind":"arxiv","version":1}},"canonical_sha256":"e636be984f4576da5666158f4105087c106653706d0843e2fe882f947e78f929","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e636be984f4576da5666158f4105087c106653706d0843e2fe882f947e78f929","first_computed_at":"2026-07-05T09:42:40.177577Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:42:40.177577Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lJxr3I34stBlgHZ02e8HPSdisI06pJzu9Uyj1meUUzvP2tzRMkL8TQOgsTLseitDwz9VHed06II/UH1ovP9GDA==","signature_status":"signed_v1","signed_at":"2026-07-05T09:42:40.178137Z","signed_message":"canonical_sha256_bytes"},"source_id":"2412.00369","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ccb761783d02adcf62dd203914e8dde0ed019602de44cb4dff9cabefedd8a09d","sha256:3fe32876fce13107e8f02b43cf9387348436e744f77c12cf30f3393c1de20880"],"state_sha256":"985ac205ad737ccb1443450b61d62750de9dc72f1098173617df67be94dc984c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LZhD0Kem8DkB0ASO/XtNkAHYP65JS5BREyg9EJpiesAl8+U1Uet+ODqH8BaarUGV8XP0UehO4M3Eh8mdsvTZBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T18:13:35.181279Z","bundle_sha256":"c2978068f0c463265df1f2e448d1829c8bf9c5a3070f3506dd41add87a8a8450"}}