{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:DWKSGLWIUDSESNVFA6CWQCAY4J","short_pith_number":"pith:DWKSGLWI","schema_version":"1.0","canonical_sha256":"1d95232ec8a0e44936a50785680818e27e045c2981fc599531a554ddd7d78f72","source":{"kind":"arxiv","id":"1003.3498","version":3},"attestation_state":"computed","paper":{"title":"The missing log in large deviations for triangle counts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Sourav Chatterjee","submitted_at":"2010-03-18T00:28:22Z","abstract_excerpt":"This paper solves the problem of sharp large deviation estimates for the upper tail of the number of triangles in an Erdos-Renyi random graph, by establishing a logarithmic factor in the exponent that was missing till now. It is possible that the method of proof may extend to general subgraph counts."},"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":"1003.3498","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2010-03-18T00:28:22Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"39d2b82155c3dccfc9532c773c91799fb2f40f406a3b961f9196755f4f9287fb","abstract_canon_sha256":"4134764aa6bf4e815a5efd2b78d9c96c440c7040327b9267ea68cbb45150ffe7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:24:36.321998Z","signature_b64":"Uq2pBu5YS+kldexJDSKycclXwfm5VADOa7HR1RWIBnBdr63M/WnaE64SCmA3YoANBCNDabcqX4Icp38tDIkjDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1d95232ec8a0e44936a50785680818e27e045c2981fc599531a554ddd7d78f72","last_reissued_at":"2026-05-18T04:24:36.321531Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:24:36.321531Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The missing log in large deviations for triangle counts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Sourav Chatterjee","submitted_at":"2010-03-18T00:28:22Z","abstract_excerpt":"This paper solves the problem of sharp large deviation estimates for the upper tail of the number of triangles in an Erdos-Renyi random graph, by establishing a logarithmic factor in the exponent that was missing till now. It is possible that the method of proof may extend to general subgraph counts."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1003.3498","kind":"arxiv","version":3},"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":"1003.3498","created_at":"2026-05-18T04:24:36.321601+00:00"},{"alias_kind":"arxiv_version","alias_value":"1003.3498v3","created_at":"2026-05-18T04:24:36.321601+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1003.3498","created_at":"2026-05-18T04:24:36.321601+00:00"},{"alias_kind":"pith_short_12","alias_value":"DWKSGLWIUDSE","created_at":"2026-05-18T12:26:06.534383+00:00"},{"alias_kind":"pith_short_16","alias_value":"DWKSGLWIUDSESNVF","created_at":"2026-05-18T12:26:06.534383+00:00"},{"alias_kind":"pith_short_8","alias_value":"DWKSGLWI","created_at":"2026-05-18T12:26:06.534383+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/DWKSGLWIUDSESNVFA6CWQCAY4J","json":"https://pith.science/pith/DWKSGLWIUDSESNVFA6CWQCAY4J.json","graph_json":"https://pith.science/api/pith-number/DWKSGLWIUDSESNVFA6CWQCAY4J/graph.json","events_json":"https://pith.science/api/pith-number/DWKSGLWIUDSESNVFA6CWQCAY4J/events.json","paper":"https://pith.science/paper/DWKSGLWI"},"agent_actions":{"view_html":"https://pith.science/pith/DWKSGLWIUDSESNVFA6CWQCAY4J","download_json":"https://pith.science/pith/DWKSGLWIUDSESNVFA6CWQCAY4J.json","view_paper":"https://pith.science/paper/DWKSGLWI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1003.3498&json=true","fetch_graph":"https://pith.science/api/pith-number/DWKSGLWIUDSESNVFA6CWQCAY4J/graph.json","fetch_events":"https://pith.science/api/pith-number/DWKSGLWIUDSESNVFA6CWQCAY4J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DWKSGLWIUDSESNVFA6CWQCAY4J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DWKSGLWIUDSESNVFA6CWQCAY4J/action/storage_attestation","attest_author":"https://pith.science/pith/DWKSGLWIUDSESNVFA6CWQCAY4J/action/author_attestation","sign_citation":"https://pith.science/pith/DWKSGLWIUDSESNVFA6CWQCAY4J/action/citation_signature","submit_replication":"https://pith.science/pith/DWKSGLWIUDSESNVFA6CWQCAY4J/action/replication_record"}},"created_at":"2026-05-18T04:24:36.321601+00:00","updated_at":"2026-05-18T04:24:36.321601+00:00"}