{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:ZCMIHZIU6Y3DYPGGVYHKAYPWE3","short_pith_number":"pith:ZCMIHZIU","schema_version":"1.0","canonical_sha256":"c89883e514f6363c3cc6ae0ea061f626d7c9068035546d1ce5d32a3fcefb654c","source":{"kind":"arxiv","id":"1508.04093","version":2},"attestation_state":"computed","paper":{"title":"Optimal Concentration of Information Content For Log-Concave Densities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.FA","math.IT"],"primary_cat":"math.PR","authors_text":"Liyao Wang, Matthieu Fradelizi, Mokshay Madiman","submitted_at":"2015-08-17T17:41:14Z","abstract_excerpt":"An elementary proof is provided of sharp bounds for the varentropy of random vectors with log-concave densities, as well as for deviations of the information content from its mean. These bounds significantly improve on the bounds obtained by Bobkov and Madiman ({\\it Ann. Probab.}, 39(4):1528--1543, 2011)."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1508.04093","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-08-17T17:41:14Z","cross_cats_sorted":["cs.IT","math.FA","math.IT"],"title_canon_sha256":"e5342d59d429eb830e3df349b7d4fb715c4e2d68aa1f3687ff49b195a8ee6186","abstract_canon_sha256":"9b27bf5428f270939a0f3efcae040e090414fa831bcb4f771a76a09b895697f2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:08.764867Z","signature_b64":"/MUcbC++6HBx/uGnYlOFwojmfmL7amN9AXZB5lzqOxrTE54OCLaqXNtDkBeRhRClBC0q3k9KPMAFTsNDxu4nAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c89883e514f6363c3cc6ae0ea061f626d7c9068035546d1ce5d32a3fcefb654c","last_reissued_at":"2026-05-17T23:52:08.764423Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:08.764423Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Concentration of Information Content For Log-Concave Densities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.FA","math.IT"],"primary_cat":"math.PR","authors_text":"Liyao Wang, Matthieu Fradelizi, Mokshay Madiman","submitted_at":"2015-08-17T17:41:14Z","abstract_excerpt":"An elementary proof is provided of sharp bounds for the varentropy of random vectors with log-concave densities, as well as for deviations of the information content from its mean. These bounds significantly improve on the bounds obtained by Bobkov and Madiman ({\\it Ann. Probab.}, 39(4):1528--1543, 2011)."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.04093","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1508.04093","created_at":"2026-05-17T23:52:08.764493+00:00"},{"alias_kind":"arxiv_version","alias_value":"1508.04093v2","created_at":"2026-05-17T23:52:08.764493+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.04093","created_at":"2026-05-17T23:52:08.764493+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZCMIHZIU6Y3D","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZCMIHZIU6Y3DYPGG","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZCMIHZIU","created_at":"2026-05-18T12:29:52.810259+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZCMIHZIU6Y3DYPGGVYHKAYPWE3","json":"https://pith.science/pith/ZCMIHZIU6Y3DYPGGVYHKAYPWE3.json","graph_json":"https://pith.science/api/pith-number/ZCMIHZIU6Y3DYPGGVYHKAYPWE3/graph.json","events_json":"https://pith.science/api/pith-number/ZCMIHZIU6Y3DYPGGVYHKAYPWE3/events.json","paper":"https://pith.science/paper/ZCMIHZIU"},"agent_actions":{"view_html":"https://pith.science/pith/ZCMIHZIU6Y3DYPGGVYHKAYPWE3","download_json":"https://pith.science/pith/ZCMIHZIU6Y3DYPGGVYHKAYPWE3.json","view_paper":"https://pith.science/paper/ZCMIHZIU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1508.04093&json=true","fetch_graph":"https://pith.science/api/pith-number/ZCMIHZIU6Y3DYPGGVYHKAYPWE3/graph.json","fetch_events":"https://pith.science/api/pith-number/ZCMIHZIU6Y3DYPGGVYHKAYPWE3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZCMIHZIU6Y3DYPGGVYHKAYPWE3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZCMIHZIU6Y3DYPGGVYHKAYPWE3/action/storage_attestation","attest_author":"https://pith.science/pith/ZCMIHZIU6Y3DYPGGVYHKAYPWE3/action/author_attestation","sign_citation":"https://pith.science/pith/ZCMIHZIU6Y3DYPGGVYHKAYPWE3/action/citation_signature","submit_replication":"https://pith.science/pith/ZCMIHZIU6Y3DYPGGVYHKAYPWE3/action/replication_record"}},"created_at":"2026-05-17T23:52:08.764493+00:00","updated_at":"2026-05-17T23:52:08.764493+00:00"}