{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:UTSY2F3F32TMBYQUT4QPHYYSXO","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":"5811a879ab75258fa918898097b3b0dcccb6d2488db3b907bf2cb38491be2f2f","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-10-12T15:56:02Z","title_canon_sha256":"672da3ebc6e01c7e0c18765c7c41386741f96ec1300dca492b87fe7853ded823"},"schema_version":"1.0","source":{"id":"1610.03762","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.03762","created_at":"2026-05-18T01:02:29Z"},{"alias_kind":"arxiv_version","alias_value":"1610.03762v1","created_at":"2026-05-18T01:02:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.03762","created_at":"2026-05-18T01:02:29Z"},{"alias_kind":"pith_short_12","alias_value":"UTSY2F3F32TM","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"UTSY2F3F32TMBYQU","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"UTSY2F3F","created_at":"2026-05-18T12:30:46Z"}],"graph_snapshots":[{"event_id":"sha256:7b6061d1480b7fefdaf53c0a36c2a6e31db7509abab875312927878d97ca962c","target":"graph","created_at":"2026-05-18T01:02: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":"We consider classes of pseudo-random graphs on $n$ vertices for which the degree of every vertex and the co-degree between every pair of vertices are in the intervals $(np - Cn^\\delta,np+Cn^\\delta)$ and $(np^2- C n^\\delta, np^2 +C n^\\delta)$ respectively, for some absolute constant $C$, and $p, \\delta \\in (0,1)$. We show that for such pseudo-random graphs the number of induced isomorphic copies of subgraphs of size $s$ are approximately same as that of an Erd\\H{o}s-R\\'{e}yni random graph with edge connectivity probability $p$ as long as $s \\le (((1-\\delta)\\wedge \\frac{1}{2})-o(1))\\log n/\\log (","authors_text":"Andrew Nobel, Anirban Basak, Shankar Bhamidi, Suman Chakraborty","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-10-12T15:56:02Z","title":"Large subgraphs in pseudo-random graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.03762","kind":"arxiv","version":1},"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:0f5860af184dba50bae09bd2fd34c1c7ff44b48c5869cb2ec59b303849c979e1","target":"record","created_at":"2026-05-18T01:02: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":"5811a879ab75258fa918898097b3b0dcccb6d2488db3b907bf2cb38491be2f2f","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-10-12T15:56:02Z","title_canon_sha256":"672da3ebc6e01c7e0c18765c7c41386741f96ec1300dca492b87fe7853ded823"},"schema_version":"1.0","source":{"id":"1610.03762","kind":"arxiv","version":1}},"canonical_sha256":"a4e58d1765dea6c0e2149f20f3e312bbb1fd50fc161cc871bed5ff9198540315","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a4e58d1765dea6c0e2149f20f3e312bbb1fd50fc161cc871bed5ff9198540315","first_computed_at":"2026-05-18T01:02:29.322481Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:02:29.322481Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nfMELRim1CQXItxiqVdOTpucjpBIKAqPEMvYreEBAlUS19IqLe+A/JQwsAp7Ol2grS4Hx7Fha0nfC7g1tC+9Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:02:29.323088Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.03762","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0f5860af184dba50bae09bd2fd34c1c7ff44b48c5869cb2ec59b303849c979e1","sha256:7b6061d1480b7fefdaf53c0a36c2a6e31db7509abab875312927878d97ca962c"],"state_sha256":"da2c9cd1197a74993bc5f7f9deee34d0b6e343e6571b2330560ab12e714b9ef7"}