{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:BVUIY4PL74A2SVTVEWWTSVMQ6D","short_pith_number":"pith:BVUIY4PL","schema_version":"1.0","canonical_sha256":"0d688c71ebff01a9567525ad395590f0e1a97a42f435b0a4ef77fc068d93934c","source":{"kind":"arxiv","id":"2104.04850","version":1},"attestation_state":"computed","paper":{"title":"Lower tails via relative entropy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Gady Kozma, Wojciech Samotij","submitted_at":"2021-04-10T19:58:41Z","abstract_excerpt":"We show that the naive mean-field approximation correctly predicts the leading term of the logarithmic lower tail probabilities for the number of copies of a given subgraph in $G(n,p)$ and of arithmetic progressions of a given length in random subsets of the integers in the entire range of densities where the mean-field approximation is viable.\n  Our main technical result provides sufficient conditions on the maximum degrees of a uniform hypergraph $\\mathcal{H}$ that guarantee that the logarithmic lower tail probabilities for the number of edges induced by a binomial random subset of the verti"},"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":"2104.04850","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2021-04-10T19:58:41Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"401240fe7f101e3c637c98ca4ad1ccc22839295a342f6952c3101fc28a1739f6","abstract_canon_sha256":"c3f14586f1a1b639d06edbb238c69cedf0c3a364af00be9157ca39d12f7750a2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:30:48.307341Z","signature_b64":"mPSFTbC62uoooaPzWqdMUJI5ZeDbvQa+Up+YGrSEzmCKdORISIZ7WISijEDwEvWht2mJmmsNTUpsQ8ZaZYD5BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0d688c71ebff01a9567525ad395590f0e1a97a42f435b0a4ef77fc068d93934c","last_reissued_at":"2026-07-05T02:30:48.306787Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:30:48.306787Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lower tails via relative entropy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Gady Kozma, Wojciech Samotij","submitted_at":"2021-04-10T19:58:41Z","abstract_excerpt":"We show that the naive mean-field approximation correctly predicts the leading term of the logarithmic lower tail probabilities for the number of copies of a given subgraph in $G(n,p)$ and of arithmetic progressions of a given length in random subsets of the integers in the entire range of densities where the mean-field approximation is viable.\n  Our main technical result provides sufficient conditions on the maximum degrees of a uniform hypergraph $\\mathcal{H}$ that guarantee that the logarithmic lower tail probabilities for the number of edges induced by a binomial random subset of the verti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2104.04850","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/2104.04850/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":"2104.04850","created_at":"2026-07-05T02:30:48.306841+00:00"},{"alias_kind":"arxiv_version","alias_value":"2104.04850v1","created_at":"2026-07-05T02:30:48.306841+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2104.04850","created_at":"2026-07-05T02:30:48.306841+00:00"},{"alias_kind":"pith_short_12","alias_value":"BVUIY4PL74A2","created_at":"2026-07-05T02:30:48.306841+00:00"},{"alias_kind":"pith_short_16","alias_value":"BVUIY4PL74A2SVTV","created_at":"2026-07-05T02:30:48.306841+00:00"},{"alias_kind":"pith_short_8","alias_value":"BVUIY4PL","created_at":"2026-07-05T02:30:48.306841+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/BVUIY4PL74A2SVTVEWWTSVMQ6D","json":"https://pith.science/pith/BVUIY4PL74A2SVTVEWWTSVMQ6D.json","graph_json":"https://pith.science/api/pith-number/BVUIY4PL74A2SVTVEWWTSVMQ6D/graph.json","events_json":"https://pith.science/api/pith-number/BVUIY4PL74A2SVTVEWWTSVMQ6D/events.json","paper":"https://pith.science/paper/BVUIY4PL"},"agent_actions":{"view_html":"https://pith.science/pith/BVUIY4PL74A2SVTVEWWTSVMQ6D","download_json":"https://pith.science/pith/BVUIY4PL74A2SVTVEWWTSVMQ6D.json","view_paper":"https://pith.science/paper/BVUIY4PL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2104.04850&json=true","fetch_graph":"https://pith.science/api/pith-number/BVUIY4PL74A2SVTVEWWTSVMQ6D/graph.json","fetch_events":"https://pith.science/api/pith-number/BVUIY4PL74A2SVTVEWWTSVMQ6D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BVUIY4PL74A2SVTVEWWTSVMQ6D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BVUIY4PL74A2SVTVEWWTSVMQ6D/action/storage_attestation","attest_author":"https://pith.science/pith/BVUIY4PL74A2SVTVEWWTSVMQ6D/action/author_attestation","sign_citation":"https://pith.science/pith/BVUIY4PL74A2SVTVEWWTSVMQ6D/action/citation_signature","submit_replication":"https://pith.science/pith/BVUIY4PL74A2SVTVEWWTSVMQ6D/action/replication_record"}},"created_at":"2026-07-05T02:30:48.306841+00:00","updated_at":"2026-07-05T02:30:48.306841+00:00"}