{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:T4H5J2O2ARRTBV4NSBGKWJI7FT","short_pith_number":"pith:T4H5J2O2","schema_version":"1.0","canonical_sha256":"9f0fd4e9da046330d78d904cab251f2cc0eabcb76c5ffc4a9e17e3d78ed53a89","source":{"kind":"arxiv","id":"2207.11593","version":3},"attestation_state":"computed","paper":{"title":"A very sharp threshold for first order logic distinguishability of random graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LO","math.LO","math.PR"],"primary_cat":"math.CO","authors_text":"Itai Benjamini, Maksim Zhukovskii","submitted_at":"2022-07-23T20:08:18Z","abstract_excerpt":"In this paper we find an integer $h=h(n)$ such that the minimum number of variables of a first order sentence that distinguishes between two independent uniformly distributed random graphs of size $n$ with the asymptotically largest possible probability $\\frac{1}{4}-o(1)$ belongs to $\\{h,h+1,h+2,h+3\\}$. We also prove that the minimum (random) $k$ such that two independent random graphs are distinguishable by a first order sentence with $k$ variables belongs to $\\{h,h+1,h+2\\}$ with probability $1-o(1)$."},"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":"2207.11593","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2022-07-23T20:08:18Z","cross_cats_sorted":["cs.LO","math.LO","math.PR"],"title_canon_sha256":"9b1ca60ef34e4f6e421d6d573341a1bdeea99a97847eb3f2eda745b09613a848","abstract_canon_sha256":"a0b163b5ec6aeced0f6c7742b6e03f7294802d14a4d1e77b9e1c9a44b7a8f3c8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:36:16.770633Z","signature_b64":"nwZCtw5mo3NdZrnxEcQPmboHbytfZw0nPvg12WYW3cZk4uVcEw7zw7iXr23o7Kt6GUZRBEn1FhgI2YdOPcx5Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9f0fd4e9da046330d78d904cab251f2cc0eabcb76c5ffc4a9e17e3d78ed53a89","last_reissued_at":"2026-07-05T11:36:16.770081Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:36:16.770081Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A very sharp threshold for first order logic distinguishability of random graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LO","math.LO","math.PR"],"primary_cat":"math.CO","authors_text":"Itai Benjamini, Maksim Zhukovskii","submitted_at":"2022-07-23T20:08:18Z","abstract_excerpt":"In this paper we find an integer $h=h(n)$ such that the minimum number of variables of a first order sentence that distinguishes between two independent uniformly distributed random graphs of size $n$ with the asymptotically largest possible probability $\\frac{1}{4}-o(1)$ belongs to $\\{h,h+1,h+2,h+3\\}$. We also prove that the minimum (random) $k$ such that two independent random graphs are distinguishable by a first order sentence with $k$ variables belongs to $\\{h,h+1,h+2\\}$ with probability $1-o(1)$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2207.11593","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2207.11593/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":"2207.11593","created_at":"2026-07-05T11:36:16.770137+00:00"},{"alias_kind":"arxiv_version","alias_value":"2207.11593v3","created_at":"2026-07-05T11:36:16.770137+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.11593","created_at":"2026-07-05T11:36:16.770137+00:00"},{"alias_kind":"pith_short_12","alias_value":"T4H5J2O2ARRT","created_at":"2026-07-05T11:36:16.770137+00:00"},{"alias_kind":"pith_short_16","alias_value":"T4H5J2O2ARRTBV4N","created_at":"2026-07-05T11:36:16.770137+00:00"},{"alias_kind":"pith_short_8","alias_value":"T4H5J2O2","created_at":"2026-07-05T11:36:16.770137+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/T4H5J2O2ARRTBV4NSBGKWJI7FT","json":"https://pith.science/pith/T4H5J2O2ARRTBV4NSBGKWJI7FT.json","graph_json":"https://pith.science/api/pith-number/T4H5J2O2ARRTBV4NSBGKWJI7FT/graph.json","events_json":"https://pith.science/api/pith-number/T4H5J2O2ARRTBV4NSBGKWJI7FT/events.json","paper":"https://pith.science/paper/T4H5J2O2"},"agent_actions":{"view_html":"https://pith.science/pith/T4H5J2O2ARRTBV4NSBGKWJI7FT","download_json":"https://pith.science/pith/T4H5J2O2ARRTBV4NSBGKWJI7FT.json","view_paper":"https://pith.science/paper/T4H5J2O2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2207.11593&json=true","fetch_graph":"https://pith.science/api/pith-number/T4H5J2O2ARRTBV4NSBGKWJI7FT/graph.json","fetch_events":"https://pith.science/api/pith-number/T4H5J2O2ARRTBV4NSBGKWJI7FT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T4H5J2O2ARRTBV4NSBGKWJI7FT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T4H5J2O2ARRTBV4NSBGKWJI7FT/action/storage_attestation","attest_author":"https://pith.science/pith/T4H5J2O2ARRTBV4NSBGKWJI7FT/action/author_attestation","sign_citation":"https://pith.science/pith/T4H5J2O2ARRTBV4NSBGKWJI7FT/action/citation_signature","submit_replication":"https://pith.science/pith/T4H5J2O2ARRTBV4NSBGKWJI7FT/action/replication_record"}},"created_at":"2026-07-05T11:36:16.770137+00:00","updated_at":"2026-07-05T11:36:16.770137+00:00"}