{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:XAKQRNLVZ2IFSPEGM5BOJUGPY4","short_pith_number":"pith:XAKQRNLV","canonical_record":{"source":{"id":"2606.05729","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-06-04T05:43:12Z","cross_cats_sorted":["cs.LG","math.IT"],"title_canon_sha256":"57a15fca5d8568a708be22c8605704445b67ad8ffb052c7704f32ef5924ea676","abstract_canon_sha256":"e98a346af059b162ab7d90a4a7c20b6a7d2facf8b4ec1be7ce57f5251e3765d1"},"schema_version":"1.0"},"canonical_sha256":"b81508b575ce90593c866742e4d0cfc70eb730124ca83979875c62d6e80694be","source":{"kind":"arxiv","id":"2606.05729","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.05729","created_at":"2026-06-05T01:15:00Z"},{"alias_kind":"arxiv_version","alias_value":"2606.05729v1","created_at":"2026-06-05T01:15:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.05729","created_at":"2026-06-05T01:15:00Z"},{"alias_kind":"pith_short_12","alias_value":"XAKQRNLVZ2IF","created_at":"2026-06-05T01:15:00Z"},{"alias_kind":"pith_short_16","alias_value":"XAKQRNLVZ2IFSPEG","created_at":"2026-06-05T01:15:00Z"},{"alias_kind":"pith_short_8","alias_value":"XAKQRNLV","created_at":"2026-06-05T01:15:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:XAKQRNLVZ2IFSPEGM5BOJUGPY4","target":"record","payload":{"canonical_record":{"source":{"id":"2606.05729","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-06-04T05:43:12Z","cross_cats_sorted":["cs.LG","math.IT"],"title_canon_sha256":"57a15fca5d8568a708be22c8605704445b67ad8ffb052c7704f32ef5924ea676","abstract_canon_sha256":"e98a346af059b162ab7d90a4a7c20b6a7d2facf8b4ec1be7ce57f5251e3765d1"},"schema_version":"1.0"},"canonical_sha256":"b81508b575ce90593c866742e4d0cfc70eb730124ca83979875c62d6e80694be","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-05T01:15:00.915484Z","signature_b64":"iUHeLTI/C0SDGyFqH+wQFkxNKrwYeU1nndoFHMCYnTCQq+59eyuX/Nh65O08cuYJTWjrmRZq53HkKJJnxNr4Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b81508b575ce90593c866742e4d0cfc70eb730124ca83979875c62d6e80694be","last_reissued_at":"2026-06-05T01:15:00.914957Z","signature_status":"signed_v1","first_computed_at":"2026-06-05T01:15:00.914957Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.05729","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-06-05T01:15:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SDEHEc1m9YL6vMsWT0nOb1VzR3PIApjsWEUV+cHtAkALJ4T2h8eQhNxcB7FOadvq3w/aGm8skyZ9K0N/OeSiCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T00:44:14.293772Z"},"content_sha256":"1043fcb030427f4322bdae21b07083ddc0d233e8b1ce884628f19e7c24056027","schema_version":"1.0","event_id":"sha256:1043fcb030427f4322bdae21b07083ddc0d233e8b1ce884628f19e7c24056027"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:XAKQRNLVZ2IFSPEGM5BOJUGPY4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Automated Proving of Shannon-Type Entropy Inequalities via Fine-Tuned Language Models and Guided Tree Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.IT"],"primary_cat":"cs.IT","authors_text":"Amin Gohari, Cheuk Ting Li, Linqi Song, Shaocheng Liu, Shing Yin Wong","submitted_at":"2026-06-04T05:43:12Z","abstract_excerpt":"Proving Shannon-type entropy inequalities is a fundamental task in information theory that often requires constructing non-trivial linear combinations of known constraints, which is a combinatorial search problem that scales poorly with the number of random variables. We investigate whether small-scale large language models (0.6B--1.7B parameters), fine-tuned on atomic proof steps and combined with guided beam search, can automate this process. On a held-out test set of 60 inequalities spanning n=10 to 15 variables, our 0.6B fine-tuned model achieves an 85\\% proof success rate with tree search"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.05729","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/2606.05729/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-06-05T01:15:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z0ORvBLEQU/73Sq0lopCBDB5IIFIti+1mtSSvKP8mf7sWchck4Jg3/6SWcLMwdQeQdNZOIubR23VjwY+UabAAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T00:44:14.294159Z"},"content_sha256":"012589858f008ea94a8e39c597df06604be4ccf71d1c8586d8a755c0bf291fa5","schema_version":"1.0","event_id":"sha256:012589858f008ea94a8e39c597df06604be4ccf71d1c8586d8a755c0bf291fa5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XAKQRNLVZ2IFSPEGM5BOJUGPY4/bundle.json","state_url":"https://pith.science/pith/XAKQRNLVZ2IFSPEGM5BOJUGPY4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XAKQRNLVZ2IFSPEGM5BOJUGPY4/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-03T00:44:14Z","links":{"resolver":"https://pith.science/pith/XAKQRNLVZ2IFSPEGM5BOJUGPY4","bundle":"https://pith.science/pith/XAKQRNLVZ2IFSPEGM5BOJUGPY4/bundle.json","state":"https://pith.science/pith/XAKQRNLVZ2IFSPEGM5BOJUGPY4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XAKQRNLVZ2IFSPEGM5BOJUGPY4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:XAKQRNLVZ2IFSPEGM5BOJUGPY4","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":"e98a346af059b162ab7d90a4a7c20b6a7d2facf8b4ec1be7ce57f5251e3765d1","cross_cats_sorted":["cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-06-04T05:43:12Z","title_canon_sha256":"57a15fca5d8568a708be22c8605704445b67ad8ffb052c7704f32ef5924ea676"},"schema_version":"1.0","source":{"id":"2606.05729","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.05729","created_at":"2026-06-05T01:15:00Z"},{"alias_kind":"arxiv_version","alias_value":"2606.05729v1","created_at":"2026-06-05T01:15:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.05729","created_at":"2026-06-05T01:15:00Z"},{"alias_kind":"pith_short_12","alias_value":"XAKQRNLVZ2IF","created_at":"2026-06-05T01:15:00Z"},{"alias_kind":"pith_short_16","alias_value":"XAKQRNLVZ2IFSPEG","created_at":"2026-06-05T01:15:00Z"},{"alias_kind":"pith_short_8","alias_value":"XAKQRNLV","created_at":"2026-06-05T01:15:00Z"}],"graph_snapshots":[{"event_id":"sha256:012589858f008ea94a8e39c597df06604be4ccf71d1c8586d8a755c0bf291fa5","target":"graph","created_at":"2026-06-05T01:15:00Z","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/2606.05729/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Proving Shannon-type entropy inequalities is a fundamental task in information theory that often requires constructing non-trivial linear combinations of known constraints, which is a combinatorial search problem that scales poorly with the number of random variables. We investigate whether small-scale large language models (0.6B--1.7B parameters), fine-tuned on atomic proof steps and combined with guided beam search, can automate this process. On a held-out test set of 60 inequalities spanning n=10 to 15 variables, our 0.6B fine-tuned model achieves an 85\\% proof success rate with tree search","authors_text":"Amin Gohari, Cheuk Ting Li, Linqi Song, Shaocheng Liu, Shing Yin Wong","cross_cats":["cs.LG","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-06-04T05:43:12Z","title":"Automated Proving of Shannon-Type Entropy Inequalities via Fine-Tuned Language Models and Guided Tree Search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.05729","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:1043fcb030427f4322bdae21b07083ddc0d233e8b1ce884628f19e7c24056027","target":"record","created_at":"2026-06-05T01:15:00Z","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":"e98a346af059b162ab7d90a4a7c20b6a7d2facf8b4ec1be7ce57f5251e3765d1","cross_cats_sorted":["cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-06-04T05:43:12Z","title_canon_sha256":"57a15fca5d8568a708be22c8605704445b67ad8ffb052c7704f32ef5924ea676"},"schema_version":"1.0","source":{"id":"2606.05729","kind":"arxiv","version":1}},"canonical_sha256":"b81508b575ce90593c866742e4d0cfc70eb730124ca83979875c62d6e80694be","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b81508b575ce90593c866742e4d0cfc70eb730124ca83979875c62d6e80694be","first_computed_at":"2026-06-05T01:15:00.914957Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-05T01:15:00.914957Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iUHeLTI/C0SDGyFqH+wQFkxNKrwYeU1nndoFHMCYnTCQq+59eyuX/Nh65O08cuYJTWjrmRZq53HkKJJnxNr4Aw==","signature_status":"signed_v1","signed_at":"2026-06-05T01:15:00.915484Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.05729","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1043fcb030427f4322bdae21b07083ddc0d233e8b1ce884628f19e7c24056027","sha256:012589858f008ea94a8e39c597df06604be4ccf71d1c8586d8a755c0bf291fa5"],"state_sha256":"f41465f464cad9f59b21daf2c3eb6d63303c7ed215ef8d7fc6b727aa22c3ca82"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3Z3ySNirUwfgqGsMgDyxMb4t0qy8JvR5Ps9fMaYeHqu3Y5MzXnM0C6Ly4lU6nEnUcPoFBoXPSWKtlggU6GioAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-03T00:44:14.296281Z","bundle_sha256":"e4c5cf280f8b992edfc7b893c918d4024bdf9869c43096dd9e42f6a8466bf5ce"}}