{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:T77B2G6R5UK3E5LPBRHC2IPCV4","short_pith_number":"pith:T77B2G6R","canonical_record":{"source":{"id":"2607.28707","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2026-07-30T15:59:51Z","cross_cats_sorted":[],"title_canon_sha256":"024c140cdf7e71c92617329d7b7ef368ee949ff08d683a12b43edfb390826884","abstract_canon_sha256":"1b633ccedea7b11c823aae4d8e6180a55070cf2596b39011c82c6d8f6295156b"},"schema_version":"1.0"},"canonical_sha256":"9ffe1d1bd1ed15b2756f0c4e2d21e2af37d16e38396dd8a24ebe9cb801feae98","source":{"kind":"arxiv","id":"2607.28707","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.28707","created_at":"2026-08-03T00:12:13Z"},{"alias_kind":"arxiv_version","alias_value":"2607.28707v1","created_at":"2026-08-03T00:12:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.28707","created_at":"2026-08-03T00:12:13Z"},{"alias_kind":"pith_short_12","alias_value":"T77B2G6R5UK3","created_at":"2026-08-03T00:12:13Z"},{"alias_kind":"pith_short_16","alias_value":"T77B2G6R5UK3E5LP","created_at":"2026-08-03T00:12:13Z"},{"alias_kind":"pith_short_8","alias_value":"T77B2G6R","created_at":"2026-08-03T00:12:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:T77B2G6R5UK3E5LPBRHC2IPCV4","target":"record","payload":{"canonical_record":{"source":{"id":"2607.28707","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2026-07-30T15:59:51Z","cross_cats_sorted":[],"title_canon_sha256":"024c140cdf7e71c92617329d7b7ef368ee949ff08d683a12b43edfb390826884","abstract_canon_sha256":"1b633ccedea7b11c823aae4d8e6180a55070cf2596b39011c82c6d8f6295156b"},"schema_version":"1.0"},"canonical_sha256":"9ffe1d1bd1ed15b2756f0c4e2d21e2af37d16e38396dd8a24ebe9cb801feae98","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-03T00:12:13.862150Z","signature_b64":"OjmvcuLZs8EuZEB8eXnDk880QfJUYSIr4gf6lpzBNUApu8g1Oxweckk6BMpr7IUwFf84gpM0kplCMIzgNCVlBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9ffe1d1bd1ed15b2756f0c4e2d21e2af37d16e38396dd8a24ebe9cb801feae98","last_reissued_at":"2026-08-03T00:12:13.859985Z","signature_status":"signed_v1","first_computed_at":"2026-08-03T00:12:13.859985Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2607.28707","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-08-03T00:12:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0YlF8JCYs/PLVinb1r3wnbw8DZRTglJxiMrGFvH6u5ELiAxe6UUQkv78VbptCKxSEuuhiCpzm9HI3vPx6JbtAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T17:01:14.774310Z"},"content_sha256":"1ad461a54ff3462e7eeef855111ca42030026edf67f58909e35a77f571ec3b7a","schema_version":"1.0","event_id":"sha256:1ad461a54ff3462e7eeef855111ca42030026edf67f58909e35a77f571ec3b7a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:T77B2G6R5UK3E5LPBRHC2IPCV4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Demystifying Entropy-based Selection for Chain-of-Thought Compression in Large Reasoning Models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Daniel Scalena, Elisabetta Fersini, Gabriele Sarti, Luca Bortolussi, Malvina Nissim, Sara Candussio","submitted_at":"2026-07-30T15:59:51Z","abstract_excerpt":"Entropy-based pruning has been proposed as an effective method for compressing Chain-of-Thought (CoT) reasoning with negligible accuracy loss. We test the robustness of low- and high-entropy CoT step selection methods across various models and reasoning tasks, showing that entropy offers no advantage over random pruning in any evaluated setting. Moving from sentences to tokens, we then show that retaining low-entropy tokens seems effective only on mathematical benchmarks. We find this is due to the inherently low-entropy nature of numeric tokens, which also convey semantic content in such prob"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.28707","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/2607.28707/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-08-03T00:12:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+I74msi6hHRebue6T8JXCFSxm6Yoa27a2Eb0KjPPD2Cn6GeaO5WrQsmlo4jS2N2zUeR6LLuBam4Gk7eyw0uLAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T17:01:14.774841Z"},"content_sha256":"a50501b1f795b881666c75c52a34c419ee932f81ad7ef14095ee4b37c6215141","schema_version":"1.0","event_id":"sha256:a50501b1f795b881666c75c52a34c419ee932f81ad7ef14095ee4b37c6215141"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/T77B2G6R5UK3E5LPBRHC2IPCV4/bundle.json","state_url":"https://pith.science/pith/T77B2G6R5UK3E5LPBRHC2IPCV4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/T77B2G6R5UK3E5LPBRHC2IPCV4/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-04T17:01:14Z","links":{"resolver":"https://pith.science/pith/T77B2G6R5UK3E5LPBRHC2IPCV4","bundle":"https://pith.science/pith/T77B2G6R5UK3E5LPBRHC2IPCV4/bundle.json","state":"https://pith.science/pith/T77B2G6R5UK3E5LPBRHC2IPCV4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/T77B2G6R5UK3E5LPBRHC2IPCV4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:T77B2G6R5UK3E5LPBRHC2IPCV4","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":"1b633ccedea7b11c823aae4d8e6180a55070cf2596b39011c82c6d8f6295156b","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2026-07-30T15:59:51Z","title_canon_sha256":"024c140cdf7e71c92617329d7b7ef368ee949ff08d683a12b43edfb390826884"},"schema_version":"1.0","source":{"id":"2607.28707","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.28707","created_at":"2026-08-03T00:12:13Z"},{"alias_kind":"arxiv_version","alias_value":"2607.28707v1","created_at":"2026-08-03T00:12:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.28707","created_at":"2026-08-03T00:12:13Z"},{"alias_kind":"pith_short_12","alias_value":"T77B2G6R5UK3","created_at":"2026-08-03T00:12:13Z"},{"alias_kind":"pith_short_16","alias_value":"T77B2G6R5UK3E5LP","created_at":"2026-08-03T00:12:13Z"},{"alias_kind":"pith_short_8","alias_value":"T77B2G6R","created_at":"2026-08-03T00:12:13Z"}],"graph_snapshots":[{"event_id":"sha256:a50501b1f795b881666c75c52a34c419ee932f81ad7ef14095ee4b37c6215141","target":"graph","created_at":"2026-08-03T00:12: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/2607.28707/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Entropy-based pruning has been proposed as an effective method for compressing Chain-of-Thought (CoT) reasoning with negligible accuracy loss. We test the robustness of low- and high-entropy CoT step selection methods across various models and reasoning tasks, showing that entropy offers no advantage over random pruning in any evaluated setting. Moving from sentences to tokens, we then show that retaining low-entropy tokens seems effective only on mathematical benchmarks. We find this is due to the inherently low-entropy nature of numeric tokens, which also convey semantic content in such prob","authors_text":"Daniel Scalena, Elisabetta Fersini, Gabriele Sarti, Luca Bortolussi, Malvina Nissim, Sara Candussio","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2026-07-30T15:59:51Z","title":"Demystifying Entropy-based Selection for Chain-of-Thought Compression in Large Reasoning Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.28707","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:1ad461a54ff3462e7eeef855111ca42030026edf67f58909e35a77f571ec3b7a","target":"record","created_at":"2026-08-03T00:12: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":"1b633ccedea7b11c823aae4d8e6180a55070cf2596b39011c82c6d8f6295156b","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2026-07-30T15:59:51Z","title_canon_sha256":"024c140cdf7e71c92617329d7b7ef368ee949ff08d683a12b43edfb390826884"},"schema_version":"1.0","source":{"id":"2607.28707","kind":"arxiv","version":1}},"canonical_sha256":"9ffe1d1bd1ed15b2756f0c4e2d21e2af37d16e38396dd8a24ebe9cb801feae98","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9ffe1d1bd1ed15b2756f0c4e2d21e2af37d16e38396dd8a24ebe9cb801feae98","first_computed_at":"2026-08-03T00:12:13.859985Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-08-03T00:12:13.859985Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OjmvcuLZs8EuZEB8eXnDk880QfJUYSIr4gf6lpzBNUApu8g1Oxweckk6BMpr7IUwFf84gpM0kplCMIzgNCVlBg==","signature_status":"signed_v1","signed_at":"2026-08-03T00:12:13.862150Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.28707","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1ad461a54ff3462e7eeef855111ca42030026edf67f58909e35a77f571ec3b7a","sha256:a50501b1f795b881666c75c52a34c419ee932f81ad7ef14095ee4b37c6215141"],"state_sha256":"f472a2416bcf62173135ca60edd17dec05aeba1864373a52df6b000c774a8639"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IBr57++Xtjiv/w474uq9ueVlonun6twSXDIkWqMdGZjJhp/MoMrcjuDGxLm8n6pFfaHfgWj/BeGz9xlAWCyHCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T17:01:14.780149Z","bundle_sha256":"77a0079f2ef58361a2449977af3f1f71a81e08e54c89563300cae35a7c5294a2"}}