{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:LZXATQKGDNP4XXJJAUWJHK466R","short_pith_number":"pith:LZXATQKG","canonical_record":{"source":{"id":"2411.14879","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2024-11-18T04:09:44Z","cross_cats_sorted":["eess.SP","math.IT"],"title_canon_sha256":"921cac8998c93a824525001438c47a751c550b222213730653fbf263d9415650","abstract_canon_sha256":"527912cab106320b1fe9cd330a2f4c27498fa578ac05f602bd9c1ea1aa5356af"},"schema_version":"1.0"},"canonical_sha256":"5e6e09c1461b5fcbdd29052c93ab9ef472ccb27108e8b2156d0c6605963848e4","source":{"kind":"arxiv","id":"2411.14879","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.14879","created_at":"2026-07-05T09:39:13Z"},{"alias_kind":"arxiv_version","alias_value":"2411.14879v1","created_at":"2026-07-05T09:39:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.14879","created_at":"2026-07-05T09:39:13Z"},{"alias_kind":"pith_short_12","alias_value":"LZXATQKGDNP4","created_at":"2026-07-05T09:39:13Z"},{"alias_kind":"pith_short_16","alias_value":"LZXATQKGDNP4XXJJ","created_at":"2026-07-05T09:39:13Z"},{"alias_kind":"pith_short_8","alias_value":"LZXATQKG","created_at":"2026-07-05T09:39:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:LZXATQKGDNP4XXJJAUWJHK466R","target":"record","payload":{"canonical_record":{"source":{"id":"2411.14879","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2024-11-18T04:09:44Z","cross_cats_sorted":["eess.SP","math.IT"],"title_canon_sha256":"921cac8998c93a824525001438c47a751c550b222213730653fbf263d9415650","abstract_canon_sha256":"527912cab106320b1fe9cd330a2f4c27498fa578ac05f602bd9c1ea1aa5356af"},"schema_version":"1.0"},"canonical_sha256":"5e6e09c1461b5fcbdd29052c93ab9ef472ccb27108e8b2156d0c6605963848e4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:39:13.093886Z","signature_b64":"ga5d3HK1JxOn2alLjjfAjW3r+szqhTGp9bTwdFioE+ynePSBjaL5FdDZFeAiGuZ93klDQGoylwy/Rd8U/4VjAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5e6e09c1461b5fcbdd29052c93ab9ef472ccb27108e8b2156d0c6605963848e4","last_reissued_at":"2026-07-05T09:39:13.093539Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:39:13.093539Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2411.14879","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:39:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xj5qszVQ8LNKPSS655Mt3+T/0fGp31YoQaGsEODjF3i2R84rDcjoXP6Um9VanJasdSGLctMH9z5fINurtZ0pBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T18:36:26.643549Z"},"content_sha256":"9f4825c1e315e00b14f7020570269acbc3b7e77f56dc7b36b552aebef89a2860","schema_version":"1.0","event_id":"sha256:9f4825c1e315e00b14f7020570269acbc3b7e77f56dc7b36b552aebef89a2860"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:LZXATQKGDNP4XXJJAUWJHK466R","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Random Permutation Codes: Lossless Source Coding of Non-Sequential Data","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["eess.SP","math.IT"],"primary_cat":"cs.IT","authors_text":"Daniel Severo","submitted_at":"2024-11-18T04:09:44Z","abstract_excerpt":"This thesis deals with the problem of communicating and storing non-sequential data. We investigate this problem through the lens of lossless source coding, also sometimes referred to as lossless compression, from both an algorithmic and information-theoretic perspective.\n  Lossless compression algorithms typically preserve the ordering in which data points are compressed. However, there are data types where order is not meaningful, such as collections of files, rows in a database, nodes in a graph, and, notably, datasets in machine learning applications.\n  Compressing with traditional algorit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.14879","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/2411.14879/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:39:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X06BkWUGJX0Kncn9BpR9CT8gAaa+xLVVq9vBEPGLJCfFyZuIJT2KXimPTcM0/zrNXL155ZPjnKQ0amhgUMSbAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T18:36:26.644537Z"},"content_sha256":"3485ef4f124ffe94633d716920cbb9c7bdbc0a99141623e8d97cff6bdc5f4f27","schema_version":"1.0","event_id":"sha256:3485ef4f124ffe94633d716920cbb9c7bdbc0a99141623e8d97cff6bdc5f4f27"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LZXATQKGDNP4XXJJAUWJHK466R/bundle.json","state_url":"https://pith.science/pith/LZXATQKGDNP4XXJJAUWJHK466R/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LZXATQKGDNP4XXJJAUWJHK466R/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-08-11T18:36:26Z","links":{"resolver":"https://pith.science/pith/LZXATQKGDNP4XXJJAUWJHK466R","bundle":"https://pith.science/pith/LZXATQKGDNP4XXJJAUWJHK466R/bundle.json","state":"https://pith.science/pith/LZXATQKGDNP4XXJJAUWJHK466R/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LZXATQKGDNP4XXJJAUWJHK466R/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:LZXATQKGDNP4XXJJAUWJHK466R","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":"527912cab106320b1fe9cd330a2f4c27498fa578ac05f602bd9c1ea1aa5356af","cross_cats_sorted":["eess.SP","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2024-11-18T04:09:44Z","title_canon_sha256":"921cac8998c93a824525001438c47a751c550b222213730653fbf263d9415650"},"schema_version":"1.0","source":{"id":"2411.14879","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.14879","created_at":"2026-07-05T09:39:13Z"},{"alias_kind":"arxiv_version","alias_value":"2411.14879v1","created_at":"2026-07-05T09:39:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.14879","created_at":"2026-07-05T09:39:13Z"},{"alias_kind":"pith_short_12","alias_value":"LZXATQKGDNP4","created_at":"2026-07-05T09:39:13Z"},{"alias_kind":"pith_short_16","alias_value":"LZXATQKGDNP4XXJJ","created_at":"2026-07-05T09:39:13Z"},{"alias_kind":"pith_short_8","alias_value":"LZXATQKG","created_at":"2026-07-05T09:39:13Z"}],"graph_snapshots":[{"event_id":"sha256:3485ef4f124ffe94633d716920cbb9c7bdbc0a99141623e8d97cff6bdc5f4f27","target":"graph","created_at":"2026-07-05T09:39:13Z","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/2411.14879/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This thesis deals with the problem of communicating and storing non-sequential data. We investigate this problem through the lens of lossless source coding, also sometimes referred to as lossless compression, from both an algorithmic and information-theoretic perspective.\n  Lossless compression algorithms typically preserve the ordering in which data points are compressed. However, there are data types where order is not meaningful, such as collections of files, rows in a database, nodes in a graph, and, notably, datasets in machine learning applications.\n  Compressing with traditional algorit","authors_text":"Daniel Severo","cross_cats":["eess.SP","math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2024-11-18T04:09:44Z","title":"Random Permutation Codes: Lossless Source Coding of Non-Sequential Data"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.14879","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:9f4825c1e315e00b14f7020570269acbc3b7e77f56dc7b36b552aebef89a2860","target":"record","created_at":"2026-07-05T09:39:13Z","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":"527912cab106320b1fe9cd330a2f4c27498fa578ac05f602bd9c1ea1aa5356af","cross_cats_sorted":["eess.SP","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2024-11-18T04:09:44Z","title_canon_sha256":"921cac8998c93a824525001438c47a751c550b222213730653fbf263d9415650"},"schema_version":"1.0","source":{"id":"2411.14879","kind":"arxiv","version":1}},"canonical_sha256":"5e6e09c1461b5fcbdd29052c93ab9ef472ccb27108e8b2156d0c6605963848e4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5e6e09c1461b5fcbdd29052c93ab9ef472ccb27108e8b2156d0c6605963848e4","first_computed_at":"2026-07-05T09:39:13.093539Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:39:13.093539Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ga5d3HK1JxOn2alLjjfAjW3r+szqhTGp9bTwdFioE+ynePSBjaL5FdDZFeAiGuZ93klDQGoylwy/Rd8U/4VjAA==","signature_status":"signed_v1","signed_at":"2026-07-05T09:39:13.093886Z","signed_message":"canonical_sha256_bytes"},"source_id":"2411.14879","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9f4825c1e315e00b14f7020570269acbc3b7e77f56dc7b36b552aebef89a2860","sha256:3485ef4f124ffe94633d716920cbb9c7bdbc0a99141623e8d97cff6bdc5f4f27"],"state_sha256":"b4ce5d483a91b9bf35f5a111b3d89b39de8d4152d8c6e6e59354ab45402630e9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rWqpB6rpURwKsOVJFWQZuOGZC8ioVEyGtanaGNp0ga2jESVtfmbf72TYaW9t18C2JLFDafTrzT4uEsvBvQO1Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T18:36:26.652113Z","bundle_sha256":"8523bdbde75efb34316c68793005daef1c991b03b07a299938dc6452f71c47ab"}}