{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:GADKKUJFOPG6QKE4LCG7PONOPB","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":"e791f97a65d03d5d7051d5baecf9ac9709eb7d45e40bc7cf71d10deed618b13b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-04-04T10:07:51Z","title_canon_sha256":"3dd66671d86e7135473cf4fb9b671f433330405ab2a7205b81f74e1b0802be69"},"schema_version":"1.0","source":{"id":"1404.1206","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.1206","created_at":"2026-05-18T00:13:48Z"},{"alias_kind":"arxiv_version","alias_value":"1404.1206v3","created_at":"2026-05-18T00:13:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.1206","created_at":"2026-05-18T00:13:48Z"},{"alias_kind":"pith_short_12","alias_value":"GADKKUJFOPG6","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"GADKKUJFOPG6QKE4","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"GADKKUJF","created_at":"2026-05-18T12:28:30Z"}],"graph_snapshots":[{"event_id":"sha256:28fdb5db290aaea3f6d7a61d48351a3ea887202d6e725be816d76cd860c9c6fc","target":"graph","created_at":"2026-05-18T00:13:48Z","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":"Let $u_k(G,p)$ be the maximum over all $k$-vertex graphs $F$ of by how much the number of induced copies of $F$ in $G$ differs from its expectation in the binomial random graph with the same number of vertices as $G$ and with edge probability $p$. This may be viewed as a measure of how close $G$ is to being $p$-quasirandom. For a positive integer $n$ and $0<p<1$, let $D(n,p)$ be the distance from $p\\binom{n}{2}$ to the nearest integer. Our main result is that, for fixed $k\\ge 4$ and for $n$ large, the minimum of $u_k(G,p)$ over $n$-vertex graphs has order of magnitude $\\Theta\\big(\\max\\{D(n,p),","authors_text":"Alex Scott, Humberto Naves, Oleg Pikhurko","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-04-04T10:07:51Z","title":"How unproportional must a graph be?"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.1206","kind":"arxiv","version":3},"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:839a78b7a0c94c71a458cdb7a07fd00123641c82f5bd70a15e74507d8dd35265","target":"record","created_at":"2026-05-18T00:13:48Z","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":"e791f97a65d03d5d7051d5baecf9ac9709eb7d45e40bc7cf71d10deed618b13b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-04-04T10:07:51Z","title_canon_sha256":"3dd66671d86e7135473cf4fb9b671f433330405ab2a7205b81f74e1b0802be69"},"schema_version":"1.0","source":{"id":"1404.1206","kind":"arxiv","version":3}},"canonical_sha256":"3006a5512573cde8289c588df7b9ae786280344822efa26d10f85a2d24b5c73a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3006a5512573cde8289c588df7b9ae786280344822efa26d10f85a2d24b5c73a","first_computed_at":"2026-05-18T00:13:48.707018Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:13:48.707018Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dA5rcDwrTGeX3dcmVppSJM8pv8IvoAltfwCZ/nCsG3dC4I6sbcP1d4DExPmFukwoZmBLAdrsqopMjhkEQpYyDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:13:48.707559Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.1206","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:839a78b7a0c94c71a458cdb7a07fd00123641c82f5bd70a15e74507d8dd35265","sha256:28fdb5db290aaea3f6d7a61d48351a3ea887202d6e725be816d76cd860c9c6fc"],"state_sha256":"7c84f473fcc2f3ab8d8eda2815d6f9bbbf6441e2b24b92f7be76bae3058cb944"}