{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:GADKKUJFOPG6QKE4LCG7PONOPB","short_pith_number":"pith:GADKKUJF","canonical_record":{"source":{"id":"1404.1206","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-04-04T10:07:51Z","cross_cats_sorted":[],"title_canon_sha256":"3dd66671d86e7135473cf4fb9b671f433330405ab2a7205b81f74e1b0802be69","abstract_canon_sha256":"e791f97a65d03d5d7051d5baecf9ac9709eb7d45e40bc7cf71d10deed618b13b"},"schema_version":"1.0"},"canonical_sha256":"3006a5512573cde8289c588df7b9ae786280344822efa26d10f85a2d24b5c73a","source":{"kind":"arxiv","id":"1404.1206","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:GADKKUJFOPG6QKE4LCG7PONOPB","target":"record","payload":{"canonical_record":{"source":{"id":"1404.1206","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-04-04T10:07:51Z","cross_cats_sorted":[],"title_canon_sha256":"3dd66671d86e7135473cf4fb9b671f433330405ab2a7205b81f74e1b0802be69","abstract_canon_sha256":"e791f97a65d03d5d7051d5baecf9ac9709eb7d45e40bc7cf71d10deed618b13b"},"schema_version":"1.0"},"canonical_sha256":"3006a5512573cde8289c588df7b9ae786280344822efa26d10f85a2d24b5c73a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:48.707559Z","signature_b64":"dA5rcDwrTGeX3dcmVppSJM8pv8IvoAltfwCZ/nCsG3dC4I6sbcP1d4DExPmFukwoZmBLAdrsqopMjhkEQpYyDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3006a5512573cde8289c588df7b9ae786280344822efa26d10f85a2d24b5c73a","last_reissued_at":"2026-05-18T00:13:48.707018Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:48.707018Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1404.1206","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:13:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/QFw+04P1rORXy1YfJnNyuEtE2Muov06M83IG4JBVZ+5DstLB5kFo5w44IoVBMY1yx728pdy878UdJVMPEk3Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T01:33:21.639746Z"},"content_sha256":"839a78b7a0c94c71a458cdb7a07fd00123641c82f5bd70a15e74507d8dd35265","schema_version":"1.0","event_id":"sha256:839a78b7a0c94c71a458cdb7a07fd00123641c82f5bd70a15e74507d8dd35265"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:GADKKUJFOPG6QKE4LCG7PONOPB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"How unproportional must a graph be?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alex Scott, Humberto Naves, Oleg Pikhurko","submitted_at":"2014-04-04T10:07:51Z","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),"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.1206","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:13:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Lgt6d4UMX38xx8Xx2MhHDECYkUS5BlPJ47jyG2EL4JNOB/xyVDWqFTl6aUAopLIlRE7eAZnUXMw7JxLlstKPCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T01:33:21.640095Z"},"content_sha256":"28fdb5db290aaea3f6d7a61d48351a3ea887202d6e725be816d76cd860c9c6fc","schema_version":"1.0","event_id":"sha256:28fdb5db290aaea3f6d7a61d48351a3ea887202d6e725be816d76cd860c9c6fc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GADKKUJFOPG6QKE4LCG7PONOPB/bundle.json","state_url":"https://pith.science/pith/GADKKUJFOPG6QKE4LCG7PONOPB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GADKKUJFOPG6QKE4LCG7PONOPB/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-20T01:33:21Z","links":{"resolver":"https://pith.science/pith/GADKKUJFOPG6QKE4LCG7PONOPB","bundle":"https://pith.science/pith/GADKKUJFOPG6QKE4LCG7PONOPB/bundle.json","state":"https://pith.science/pith/GADKKUJFOPG6QKE4LCG7PONOPB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GADKKUJFOPG6QKE4LCG7PONOPB/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bREs0UPQqXfvr86w7Cf5DL5Ir9+BGIzY16rH8dJ6gKdjypUq8s+Etg9EiCqxM0qlOMobMQKx3Lr8ab7tgpmJCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T01:33:21.643462Z","bundle_sha256":"b5d8c28167fc60d936483f21660ef7387d602030e406c1a89e848306e0e8c60d"}}