{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:IF76O3RM4IZTFZYA3PDX5UOEQ6","short_pith_number":"pith:IF76O3RM","schema_version":"1.0","canonical_sha256":"417fe76e2ce23332e700dbc77ed1c4879028779fa73b9306133fd0d89dcfac17","source":{"kind":"arxiv","id":"2505.14623","version":1},"attestation_state":"computed","paper":{"title":"Non-isomorphic subgraphs in random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Maksim Zhukovskii, Michael Krivelevich","submitted_at":"2025-05-20T17:14:16Z","abstract_excerpt":"We establish the asymptotic behaviour of $\\mu(G(n,p))$, the number of unlabelled induced subgraphs in the binomial random graph $G(n,p)$, for almost the entire range of the probability parameter $p=p(n)\\in[0,1]$. In particular, we show that typically the number of subgraphs becomes exponential when $p$ passes $1/n$, reaches maximum possible base of exponent (asymptotically) when $p\\gg 1/n$, and reaches the asymptotic value $2^n$ when $p$ passes $2\\ln n/n$. For $p\\gg \\ln n/n$, we get the first order term and asymptotics of the second order term of $\\mu(G(n,p))$. We also prove that random regula"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2505.14623","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-05-20T17:14:16Z","cross_cats_sorted":[],"title_canon_sha256":"969e3191a366637303008119e8949339850393d3cbac34d09ccf4a32ed9750d7","abstract_canon_sha256":"7e7bc96ae9fdd8c2769364ba2c238a0fe3911c30a45e7b2f922fb718400f809d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:06:16.581646Z","signature_b64":"7wRJG2dDeou8iSsI4GzXJwndjYq8at1IW/WgCvUFJajE20mkHKSO3/AUruH+SHX1oG9g9iyJNjtBNIQq8liXAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"417fe76e2ce23332e700dbc77ed1c4879028779fa73b9306133fd0d89dcfac17","last_reissued_at":"2026-07-05T11:06:16.581067Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:06:16.581067Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Non-isomorphic subgraphs in random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Maksim Zhukovskii, Michael Krivelevich","submitted_at":"2025-05-20T17:14:16Z","abstract_excerpt":"We establish the asymptotic behaviour of $\\mu(G(n,p))$, the number of unlabelled induced subgraphs in the binomial random graph $G(n,p)$, for almost the entire range of the probability parameter $p=p(n)\\in[0,1]$. In particular, we show that typically the number of subgraphs becomes exponential when $p$ passes $1/n$, reaches maximum possible base of exponent (asymptotically) when $p\\gg 1/n$, and reaches the asymptotic value $2^n$ when $p$ passes $2\\ln n/n$. For $p\\gg \\ln n/n$, we get the first order term and asymptotics of the second order term of $\\mu(G(n,p))$. We also prove that random regula"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.14623","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2505.14623/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2505.14623","created_at":"2026-07-05T11:06:16.581152+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.14623v1","created_at":"2026-07-05T11:06:16.581152+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.14623","created_at":"2026-07-05T11:06:16.581152+00:00"},{"alias_kind":"pith_short_12","alias_value":"IF76O3RM4IZT","created_at":"2026-07-05T11:06:16.581152+00:00"},{"alias_kind":"pith_short_16","alias_value":"IF76O3RM4IZTFZYA","created_at":"2026-07-05T11:06:16.581152+00:00"},{"alias_kind":"pith_short_8","alias_value":"IF76O3RM","created_at":"2026-07-05T11:06:16.581152+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.23384","citing_title":"A large hole in pseudo-random graphs","ref_index":21,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IF76O3RM4IZTFZYA3PDX5UOEQ6","json":"https://pith.science/pith/IF76O3RM4IZTFZYA3PDX5UOEQ6.json","graph_json":"https://pith.science/api/pith-number/IF76O3RM4IZTFZYA3PDX5UOEQ6/graph.json","events_json":"https://pith.science/api/pith-number/IF76O3RM4IZTFZYA3PDX5UOEQ6/events.json","paper":"https://pith.science/paper/IF76O3RM"},"agent_actions":{"view_html":"https://pith.science/pith/IF76O3RM4IZTFZYA3PDX5UOEQ6","download_json":"https://pith.science/pith/IF76O3RM4IZTFZYA3PDX5UOEQ6.json","view_paper":"https://pith.science/paper/IF76O3RM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.14623&json=true","fetch_graph":"https://pith.science/api/pith-number/IF76O3RM4IZTFZYA3PDX5UOEQ6/graph.json","fetch_events":"https://pith.science/api/pith-number/IF76O3RM4IZTFZYA3PDX5UOEQ6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IF76O3RM4IZTFZYA3PDX5UOEQ6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IF76O3RM4IZTFZYA3PDX5UOEQ6/action/storage_attestation","attest_author":"https://pith.science/pith/IF76O3RM4IZTFZYA3PDX5UOEQ6/action/author_attestation","sign_citation":"https://pith.science/pith/IF76O3RM4IZTFZYA3PDX5UOEQ6/action/citation_signature","submit_replication":"https://pith.science/pith/IF76O3RM4IZTFZYA3PDX5UOEQ6/action/replication_record"}},"created_at":"2026-07-05T11:06:16.581152+00:00","updated_at":"2026-07-05T11:06:16.581152+00:00"}