{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:7DP6GBBUVEWS7DI2SLBQJBRWWM","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":"ebcd4257d11f27a0fcbfc7a752d347488e9b651c476bea8eb0ed69533940086b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-18T14:49:22Z","title_canon_sha256":"ca2214986e545c3f2fc14cd7e3ecb3211a6abc642ff564ffe2b8f36e3ceb4e72"},"schema_version":"1.0","source":{"id":"1903.07488","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.07488","created_at":"2026-05-17T23:49:38Z"},{"alias_kind":"arxiv_version","alias_value":"1903.07488v2","created_at":"2026-05-17T23:49:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.07488","created_at":"2026-05-17T23:49:38Z"},{"alias_kind":"pith_short_12","alias_value":"7DP6GBBUVEWS","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"7DP6GBBUVEWS7DI2","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"7DP6GBBU","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:0e095432ffa947ec420e07b5237d6cb7c017d13f990e2ef3bc189c1318ebc123","target":"graph","created_at":"2026-05-17T23:49:38Z","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"},"paper":{"abstract_excerpt":"This paper examines bounds on upper tails for cycle counts in $G_{n,p}$. For a fixed graph $H$ define $\\xi_H= \\xi_H^{n,p}$ to be the number of copies of $H$ in $G_{n,p}$. It is a much studied and surprisingly difficult problem to understand the upper tail of the distribution of $\\xi_H$, for example, to estimate \\begin{equation*}\n  \\mathbb{P}(\\xi_H > 2 \\mathbb{E}\\xi_H). \\end{equation*} The best known result for general $H$ and $p$ is due to Janson, Oleszkiewicz, and Ruci\\'nski, who, in 2004, proved \\begin{align}\\label{a:JOR} \\exp[-O_{H, \\eta}(M_H(n,p) \\ln(1/p))]&<\\mathbb{P}(\\xi_H > (1+\\eta)\\mat","authors_text":"Abigail Raz","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-18T14:49:22Z","title":"Upper tail bounds for cycles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.07488","kind":"arxiv","version":2},"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:1ac42179c09b8fd2f477c533cf2e17fa8686facf821aa53ba01bc41f8d67298e","target":"record","created_at":"2026-05-17T23:49:38Z","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":"ebcd4257d11f27a0fcbfc7a752d347488e9b651c476bea8eb0ed69533940086b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-18T14:49:22Z","title_canon_sha256":"ca2214986e545c3f2fc14cd7e3ecb3211a6abc642ff564ffe2b8f36e3ceb4e72"},"schema_version":"1.0","source":{"id":"1903.07488","kind":"arxiv","version":2}},"canonical_sha256":"f8dfe30434a92d2f8d1a92c3048636b310d1f01429d680b292473d019e3e841b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f8dfe30434a92d2f8d1a92c3048636b310d1f01429d680b292473d019e3e841b","first_computed_at":"2026-05-17T23:49:38.494923Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:49:38.494923Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CqB6PfRvS8NaMZWgni68oYE4q00E6BJ5N/3Hp6ohdcukrR6MC95CZD9ZJWgL39GsYa+o5M4jGAny6NX37xX4Bw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:49:38.495691Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.07488","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1ac42179c09b8fd2f477c533cf2e17fa8686facf821aa53ba01bc41f8d67298e","sha256:0e095432ffa947ec420e07b5237d6cb7c017d13f990e2ef3bc189c1318ebc123"],"state_sha256":"e80b8b3a63f6cd9bab56730887a6c2a3582d6ff30ea3cd76c08cc470ba84bf49"}