{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:J3SM4MTUKZQAKJQ6VW4FH4B6PV","short_pith_number":"pith:J3SM4MTU","canonical_record":{"source":{"id":"2406.14171","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2024-06-20T10:23:38Z","cross_cats_sorted":["cs.CL"],"title_canon_sha256":"7d8b21ed82fd97bd316c7cd9dd781d0567bbff3e6578496963f05c23aefa3381","abstract_canon_sha256":"2be7aa380bb82c192eb3db59818d897a83ccf8f37e16651f855153bb091ef4de"},"schema_version":"1.0"},"canonical_sha256":"4ee4ce3274566005261eadb853f03e7d469f749b412413b7786fe522f7e02fd5","source":{"kind":"arxiv","id":"2406.14171","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2406.14171","created_at":"2026-07-05T08:34:39Z"},{"alias_kind":"arxiv_version","alias_value":"2406.14171v1","created_at":"2026-07-05T08:34:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.14171","created_at":"2026-07-05T08:34:39Z"},{"alias_kind":"pith_short_12","alias_value":"J3SM4MTUKZQA","created_at":"2026-07-05T08:34:39Z"},{"alias_kind":"pith_short_16","alias_value":"J3SM4MTUKZQAKJQ6","created_at":"2026-07-05T08:34:39Z"},{"alias_kind":"pith_short_8","alias_value":"J3SM4MTU","created_at":"2026-07-05T08:34:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:J3SM4MTUKZQAKJQ6VW4FH4B6PV","target":"record","payload":{"canonical_record":{"source":{"id":"2406.14171","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2024-06-20T10:23:38Z","cross_cats_sorted":["cs.CL"],"title_canon_sha256":"7d8b21ed82fd97bd316c7cd9dd781d0567bbff3e6578496963f05c23aefa3381","abstract_canon_sha256":"2be7aa380bb82c192eb3db59818d897a83ccf8f37e16651f855153bb091ef4de"},"schema_version":"1.0"},"canonical_sha256":"4ee4ce3274566005261eadb853f03e7d469f749b412413b7786fe522f7e02fd5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:34:39.825066Z","signature_b64":"zTNfihdFI7QcYi0J1312i/wmN5xSVfPcU2E8+tlSyxYsXKRC6bwzFHcX8cCJr/qqprZ4z2maQ7sdVJ+9alx2CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4ee4ce3274566005261eadb853f03e7d469f749b412413b7786fe522f7e02fd5","last_reissued_at":"2026-07-05T08:34:39.824534Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:34:39.824534Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2406.14171","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-05T08:34:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LCfGpp9KGwr/AO0HKoMt1RrReKu6e5PmdECH8wAuPwO3md6Hp2ZO04isJnp9JfZTKsNWCskwE6RiyrDzvoNfCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T21:28:27.589723Z"},"content_sha256":"bb3c3072d1dca0f883812bec89847a2f0d287186ebd3c77c5928dee352896e74","schema_version":"1.0","event_id":"sha256:bb3c3072d1dca0f883812bec89847a2f0d287186ebd3c77c5928dee352896e74"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:J3SM4MTUKZQAKJQ6VW4FH4B6PV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Ranking LLMs by compression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.AI","authors_text":"Chao Huang, Haibo Hu, Ming Li, Peijia Guo, Rui Zhang, Ziguang Li","submitted_at":"2024-06-20T10:23:38Z","abstract_excerpt":"We conceptualize the process of understanding as information compression, and propose a method for ranking large language models (LLMs) based on lossless data compression. We demonstrate the equivalence of compression length under arithmetic coding with cumulative negative log probabilities when using a large language model as a prior, that is, the pre-training phase of the model is essentially the process of learning the optimal coding length. At the same time, the evaluation metric compression ratio can be obtained without actual compression, which greatly saves overhead. In this paper, we u"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.14171","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/2406.14171/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-05T08:34:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DqYJO84z6S0xCaLp+icVEFeWLTCl+FNxCcn9mwICMNfqRX86Z2WW/TI0d/pj21NPp7yUhb6x+55NXrLLQk6pBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T21:28:27.590236Z"},"content_sha256":"ee77db6a8b5cfd620ec37fa6f2b382fe030628747eff5f3e0c8ca15ce8ec1fe3","schema_version":"1.0","event_id":"sha256:ee77db6a8b5cfd620ec37fa6f2b382fe030628747eff5f3e0c8ca15ce8ec1fe3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/J3SM4MTUKZQAKJQ6VW4FH4B6PV/bundle.json","state_url":"https://pith.science/pith/J3SM4MTUKZQAKJQ6VW4FH4B6PV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/J3SM4MTUKZQAKJQ6VW4FH4B6PV/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-21T21:28:27Z","links":{"resolver":"https://pith.science/pith/J3SM4MTUKZQAKJQ6VW4FH4B6PV","bundle":"https://pith.science/pith/J3SM4MTUKZQAKJQ6VW4FH4B6PV/bundle.json","state":"https://pith.science/pith/J3SM4MTUKZQAKJQ6VW4FH4B6PV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/J3SM4MTUKZQAKJQ6VW4FH4B6PV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:J3SM4MTUKZQAKJQ6VW4FH4B6PV","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":"2be7aa380bb82c192eb3db59818d897a83ccf8f37e16651f855153bb091ef4de","cross_cats_sorted":["cs.CL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2024-06-20T10:23:38Z","title_canon_sha256":"7d8b21ed82fd97bd316c7cd9dd781d0567bbff3e6578496963f05c23aefa3381"},"schema_version":"1.0","source":{"id":"2406.14171","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2406.14171","created_at":"2026-07-05T08:34:39Z"},{"alias_kind":"arxiv_version","alias_value":"2406.14171v1","created_at":"2026-07-05T08:34:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.14171","created_at":"2026-07-05T08:34:39Z"},{"alias_kind":"pith_short_12","alias_value":"J3SM4MTUKZQA","created_at":"2026-07-05T08:34:39Z"},{"alias_kind":"pith_short_16","alias_value":"J3SM4MTUKZQAKJQ6","created_at":"2026-07-05T08:34:39Z"},{"alias_kind":"pith_short_8","alias_value":"J3SM4MTU","created_at":"2026-07-05T08:34:39Z"}],"graph_snapshots":[{"event_id":"sha256:ee77db6a8b5cfd620ec37fa6f2b382fe030628747eff5f3e0c8ca15ce8ec1fe3","target":"graph","created_at":"2026-07-05T08:34: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/2406.14171/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We conceptualize the process of understanding as information compression, and propose a method for ranking large language models (LLMs) based on lossless data compression. We demonstrate the equivalence of compression length under arithmetic coding with cumulative negative log probabilities when using a large language model as a prior, that is, the pre-training phase of the model is essentially the process of learning the optimal coding length. At the same time, the evaluation metric compression ratio can be obtained without actual compression, which greatly saves overhead. In this paper, we u","authors_text":"Chao Huang, Haibo Hu, Ming Li, Peijia Guo, Rui Zhang, Ziguang Li","cross_cats":["cs.CL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2024-06-20T10:23:38Z","title":"Ranking LLMs by compression"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.14171","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:bb3c3072d1dca0f883812bec89847a2f0d287186ebd3c77c5928dee352896e74","target":"record","created_at":"2026-07-05T08:34: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":"2be7aa380bb82c192eb3db59818d897a83ccf8f37e16651f855153bb091ef4de","cross_cats_sorted":["cs.CL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2024-06-20T10:23:38Z","title_canon_sha256":"7d8b21ed82fd97bd316c7cd9dd781d0567bbff3e6578496963f05c23aefa3381"},"schema_version":"1.0","source":{"id":"2406.14171","kind":"arxiv","version":1}},"canonical_sha256":"4ee4ce3274566005261eadb853f03e7d469f749b412413b7786fe522f7e02fd5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4ee4ce3274566005261eadb853f03e7d469f749b412413b7786fe522f7e02fd5","first_computed_at":"2026-07-05T08:34:39.824534Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:34:39.824534Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zTNfihdFI7QcYi0J1312i/wmN5xSVfPcU2E8+tlSyxYsXKRC6bwzFHcX8cCJr/qqprZ4z2maQ7sdVJ+9alx2CA==","signature_status":"signed_v1","signed_at":"2026-07-05T08:34:39.825066Z","signed_message":"canonical_sha256_bytes"},"source_id":"2406.14171","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bb3c3072d1dca0f883812bec89847a2f0d287186ebd3c77c5928dee352896e74","sha256:ee77db6a8b5cfd620ec37fa6f2b382fe030628747eff5f3e0c8ca15ce8ec1fe3"],"state_sha256":"0085b17b8485fd76d21d59640c46a31b0027c2a21f0c84e135e518496f84caf3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CgfIYghIBWIOEgmU1xfvhMkKqIC86WATqyvBtmTozenCD5Q1F6IJvl1MdsMA2OF+WFLDizlhng6Gerqcq2AeBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-21T21:28:27.595373Z","bundle_sha256":"cfd927d896d15a4c94e138f9f8140df694f8625aee1d457e22587a140e775cab"}}