{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:XHYW3GUUC5ZYNXVIFMLA2NLC2M","short_pith_number":"pith:XHYW3GUU","schema_version":"1.0","canonical_sha256":"b9f16d9a94177386dea82b160d3562d30cbd3181ecdc2162299b947ac35e4b59","source":{"kind":"arxiv","id":"2407.13457","version":2},"attestation_state":"computed","paper":{"title":"Entropy factorization via curvature","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CO","math.FA"],"primary_cat":"math.PR","authors_text":"Justin Salez, Pietro Caputo","submitted_at":"2024-07-18T12:33:58Z","abstract_excerpt":"We develop a new framework for establishing approximate factorization of entropy on arbitrary probability spaces, using a geometric notion known as non-negative sectional curvature. The resulting estimates are equivalent to entropy subadditivity and generalized Brascamp-Lieb inequalities, and provide a sharp modified log-Sobolev inequality for the Gibbs sampler of several particle systems in both continuous and discrete settings. The method allows us to obtain simple proofs of known results, as well as some new inequalities. We illustrate this through various applications, including discrete G"},"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":"2407.13457","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.PR","submitted_at":"2024-07-18T12:33:58Z","cross_cats_sorted":["math.CO","math.FA"],"title_canon_sha256":"b94fa86dd73efc1c174ddd327c827ff96a748515f03194b53d14f219f60c5195","abstract_canon_sha256":"8df8c8a0c205f9ee56745aa1c1a7bfe01504a526044de031347e1b38fe96f030"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:48:45.758308Z","signature_b64":"FbBdvf1tW5ZBi9B0KxtmYXqJiorNHCwFlhqsIB67o/EUXhklw5MYeVOt470C9a1Rj3UkDFnTlcpg5tDbzJAcBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b9f16d9a94177386dea82b160d3562d30cbd3181ecdc2162299b947ac35e4b59","last_reissued_at":"2026-07-05T08:48:45.757783Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:48:45.757783Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Entropy factorization via curvature","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CO","math.FA"],"primary_cat":"math.PR","authors_text":"Justin Salez, Pietro Caputo","submitted_at":"2024-07-18T12:33:58Z","abstract_excerpt":"We develop a new framework for establishing approximate factorization of entropy on arbitrary probability spaces, using a geometric notion known as non-negative sectional curvature. The resulting estimates are equivalent to entropy subadditivity and generalized Brascamp-Lieb inequalities, and provide a sharp modified log-Sobolev inequality for the Gibbs sampler of several particle systems in both continuous and discrete settings. The method allows us to obtain simple proofs of known results, as well as some new inequalities. We illustrate this through various applications, including discrete G"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.13457","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2407.13457/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2407.13457","created_at":"2026-07-05T08:48:45.757840+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.13457v2","created_at":"2026-07-05T08:48:45.757840+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.13457","created_at":"2026-07-05T08:48:45.757840+00:00"},{"alias_kind":"pith_short_12","alias_value":"XHYW3GUUC5ZY","created_at":"2026-07-05T08:48:45.757840+00:00"},{"alias_kind":"pith_short_16","alias_value":"XHYW3GUUC5ZYNXVI","created_at":"2026-07-05T08:48:45.757840+00:00"},{"alias_kind":"pith_short_8","alias_value":"XHYW3GUU","created_at":"2026-07-05T08:48:45.757840+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.27073","citing_title":"Retention Profiles and KL Contraction Bounds in Finite Markov Chains","ref_index":9,"is_internal_anchor":false},{"citing_arxiv_id":"2505.00894","citing_title":"Non-Adaptive Cryptanalytic Time-Space Lower Bounds via a Shearer-like Inequality for Permutations","ref_index":15,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XHYW3GUUC5ZYNXVIFMLA2NLC2M","json":"https://pith.science/pith/XHYW3GUUC5ZYNXVIFMLA2NLC2M.json","graph_json":"https://pith.science/api/pith-number/XHYW3GUUC5ZYNXVIFMLA2NLC2M/graph.json","events_json":"https://pith.science/api/pith-number/XHYW3GUUC5ZYNXVIFMLA2NLC2M/events.json","paper":"https://pith.science/paper/XHYW3GUU"},"agent_actions":{"view_html":"https://pith.science/pith/XHYW3GUUC5ZYNXVIFMLA2NLC2M","download_json":"https://pith.science/pith/XHYW3GUUC5ZYNXVIFMLA2NLC2M.json","view_paper":"https://pith.science/paper/XHYW3GUU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.13457&json=true","fetch_graph":"https://pith.science/api/pith-number/XHYW3GUUC5ZYNXVIFMLA2NLC2M/graph.json","fetch_events":"https://pith.science/api/pith-number/XHYW3GUUC5ZYNXVIFMLA2NLC2M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XHYW3GUUC5ZYNXVIFMLA2NLC2M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XHYW3GUUC5ZYNXVIFMLA2NLC2M/action/storage_attestation","attest_author":"https://pith.science/pith/XHYW3GUUC5ZYNXVIFMLA2NLC2M/action/author_attestation","sign_citation":"https://pith.science/pith/XHYW3GUUC5ZYNXVIFMLA2NLC2M/action/citation_signature","submit_replication":"https://pith.science/pith/XHYW3GUUC5ZYNXVIFMLA2NLC2M/action/replication_record"}},"created_at":"2026-07-05T08:48:45.757840+00:00","updated_at":"2026-07-05T08:48:45.757840+00:00"}