{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:KZCOAODCLRNGPYSCCLAMACGD7T","short_pith_number":"pith:KZCOAODC","canonical_record":{"source":{"id":"1009.2307","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"math.CO","submitted_at":"2010-09-13T06:56:59Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"cbaece0432de0a0d4eebbe5a4f7033ef29ecf86e810e26e977fc5b56ccab8911","abstract_canon_sha256":"f65a2cb4a0f4b628e76beb5046459619319f814023cd46b8047e7970b052d430"},"schema_version":"1.0"},"canonical_sha256":"5644e038625c5a67e24212c0c008c3fcff215d71a2794aa42432c717a8b56c3a","source":{"kind":"arxiv","id":"1009.2307","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.2307","created_at":"2026-05-18T04:22:29Z"},{"alias_kind":"arxiv_version","alias_value":"1009.2307v3","created_at":"2026-05-18T04:22:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.2307","created_at":"2026-05-18T04:22:29Z"},{"alias_kind":"pith_short_12","alias_value":"KZCOAODCLRNG","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_16","alias_value":"KZCOAODCLRNGPYSC","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_8","alias_value":"KZCOAODC","created_at":"2026-05-18T12:26:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:KZCOAODCLRNGPYSCCLAMACGD7T","target":"record","payload":{"canonical_record":{"source":{"id":"1009.2307","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"math.CO","submitted_at":"2010-09-13T06:56:59Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"cbaece0432de0a0d4eebbe5a4f7033ef29ecf86e810e26e977fc5b56ccab8911","abstract_canon_sha256":"f65a2cb4a0f4b628e76beb5046459619319f814023cd46b8047e7970b052d430"},"schema_version":"1.0"},"canonical_sha256":"5644e038625c5a67e24212c0c008c3fcff215d71a2794aa42432c717a8b56c3a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:22:29.633498Z","signature_b64":"JTnmcoEgTkAnLmNoy3w/uQTZBsiZNhqQMSdRmoTAn6a2cfh4hNNZkd0ebAh/4Fhn+0TodARLAK1BAvhpK6VCCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5644e038625c5a67e24212c0c008c3fcff215d71a2794aa42432c717a8b56c3a","last_reissued_at":"2026-05-18T04:22:29.632876Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:22:29.632876Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1009.2307","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-18T04:22:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7AzxunUDKFYS5waV+KV2KwlF5TL86/HLm7R1NzCA8tNdtSQJ/Nd6tXtPpVRfojUOB88jgB6EbGlnthg9LX2ODw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T03:37:18.071021Z"},"content_sha256":"22adab788bd38082b19d20f9ba218c2c7636cebaaec911db9fa53e04f56bc573","schema_version":"1.0","event_id":"sha256:22adab788bd38082b19d20f9ba218c2c7636cebaaec911db9fa53e04f56bc573"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:KZCOAODCLRNGPYSCCLAMACGD7T","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quasi-randomness of graph balanced cut properties","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Choongbum Lee, Hao Huang","submitted_at":"2010-09-13T06:56:59Z","abstract_excerpt":"Quasi-random graphs can be informally described as graphs whose edge distribution closely resembles that of a truly random graph of the same edge density. Recently, Shapira and Yuster proved the following result on quasi-randomness of graphs. Let $k \\ge 2$ be a fixed integer, $\\alpha_1,...,\\alpha_k$ be positive reals satisfying $\\sum_{i} \\alpha_i = 1$ and $(\\alpha_1,..., \\alpha_k) \\neq (1/k,...,1/k)$, and $G$ be a graph on $n$ vertices. If for every partition of the vertices of $G$ into sets $V_1,..., V_k$ of size $\\alpha_1 n,..., \\alpha_k n$, the number of complete graphs on $k$ vertices whic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.2307","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-18T04:22:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CHc3x+FhVKpZItPNJ4/A47+pIf5F4i1T0hcz+1Fhs8x/hwSkPvXWVfFFFh9JkYUerFKtfWREXNeAQ0i5DKE8Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T03:37:18.071364Z"},"content_sha256":"de2cab0f3e89fbffe18e81d70e7a06a16a335e7ae191e6f8022f34f293100ce7","schema_version":"1.0","event_id":"sha256:de2cab0f3e89fbffe18e81d70e7a06a16a335e7ae191e6f8022f34f293100ce7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KZCOAODCLRNGPYSCCLAMACGD7T/bundle.json","state_url":"https://pith.science/pith/KZCOAODCLRNGPYSCCLAMACGD7T/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KZCOAODCLRNGPYSCCLAMACGD7T/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-06-01T03:37:18Z","links":{"resolver":"https://pith.science/pith/KZCOAODCLRNGPYSCCLAMACGD7T","bundle":"https://pith.science/pith/KZCOAODCLRNGPYSCCLAMACGD7T/bundle.json","state":"https://pith.science/pith/KZCOAODCLRNGPYSCCLAMACGD7T/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KZCOAODCLRNGPYSCCLAMACGD7T/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:KZCOAODCLRNGPYSCCLAMACGD7T","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":"f65a2cb4a0f4b628e76beb5046459619319f814023cd46b8047e7970b052d430","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"math.CO","submitted_at":"2010-09-13T06:56:59Z","title_canon_sha256":"cbaece0432de0a0d4eebbe5a4f7033ef29ecf86e810e26e977fc5b56ccab8911"},"schema_version":"1.0","source":{"id":"1009.2307","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.2307","created_at":"2026-05-18T04:22:29Z"},{"alias_kind":"arxiv_version","alias_value":"1009.2307v3","created_at":"2026-05-18T04:22:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.2307","created_at":"2026-05-18T04:22:29Z"},{"alias_kind":"pith_short_12","alias_value":"KZCOAODCLRNG","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_16","alias_value":"KZCOAODCLRNGPYSC","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_8","alias_value":"KZCOAODC","created_at":"2026-05-18T12:26:09Z"}],"graph_snapshots":[{"event_id":"sha256:de2cab0f3e89fbffe18e81d70e7a06a16a335e7ae191e6f8022f34f293100ce7","target":"graph","created_at":"2026-05-18T04:22:29Z","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":"Quasi-random graphs can be informally described as graphs whose edge distribution closely resembles that of a truly random graph of the same edge density. Recently, Shapira and Yuster proved the following result on quasi-randomness of graphs. Let $k \\ge 2$ be a fixed integer, $\\alpha_1,...,\\alpha_k$ be positive reals satisfying $\\sum_{i} \\alpha_i = 1$ and $(\\alpha_1,..., \\alpha_k) \\neq (1/k,...,1/k)$, and $G$ be a graph on $n$ vertices. If for every partition of the vertices of $G$ into sets $V_1,..., V_k$ of size $\\alpha_1 n,..., \\alpha_k n$, the number of complete graphs on $k$ vertices whic","authors_text":"Choongbum Lee, Hao Huang","cross_cats":["cs.DM"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"math.CO","submitted_at":"2010-09-13T06:56:59Z","title":"Quasi-randomness of graph balanced cut properties"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.2307","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:22adab788bd38082b19d20f9ba218c2c7636cebaaec911db9fa53e04f56bc573","target":"record","created_at":"2026-05-18T04:22:29Z","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":"f65a2cb4a0f4b628e76beb5046459619319f814023cd46b8047e7970b052d430","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"math.CO","submitted_at":"2010-09-13T06:56:59Z","title_canon_sha256":"cbaece0432de0a0d4eebbe5a4f7033ef29ecf86e810e26e977fc5b56ccab8911"},"schema_version":"1.0","source":{"id":"1009.2307","kind":"arxiv","version":3}},"canonical_sha256":"5644e038625c5a67e24212c0c008c3fcff215d71a2794aa42432c717a8b56c3a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5644e038625c5a67e24212c0c008c3fcff215d71a2794aa42432c717a8b56c3a","first_computed_at":"2026-05-18T04:22:29.632876Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:22:29.632876Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JTnmcoEgTkAnLmNoy3w/uQTZBsiZNhqQMSdRmoTAn6a2cfh4hNNZkd0ebAh/4Fhn+0TodARLAK1BAvhpK6VCCw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:22:29.633498Z","signed_message":"canonical_sha256_bytes"},"source_id":"1009.2307","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:22adab788bd38082b19d20f9ba218c2c7636cebaaec911db9fa53e04f56bc573","sha256:de2cab0f3e89fbffe18e81d70e7a06a16a335e7ae191e6f8022f34f293100ce7"],"state_sha256":"a900d8fdf2c51ca30d9984712b76f68b34d3dec4c86c84b672bcaca4b4952bf4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M2UjflKfUwQqmyuXIJpUMA72Isx1xJBncUzmL3SbfOMqGuqcxlA6kNXoYCYxbGR6kHV0/clOIpRLKyjPG+bWDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T03:37:18.073119Z","bundle_sha256":"1ce6a4972e76346e05b76d45a37baa30520f2262604540a0e83c021102bfe8ec"}}