{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:MWVANM7L7UGCUGYCBZOWF3E52R","short_pith_number":"pith:MWVANM7L","schema_version":"1.0","canonical_sha256":"65aa06b3ebfd0c2a1b020e5d62ec9dd44805082acd073405a3b6c24403526d01","source":{"kind":"arxiv","id":"1304.0896","version":1},"attestation_state":"computed","paper":{"title":"On the convergence of probabilities of the random graphs' properties expressed by first-order formulae with a bounded quantifier depth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Maksim Zhukovskii","submitted_at":"2013-04-03T10:02:06Z","abstract_excerpt":"An asymptotic behavior of the probabilities of first-order properties of Erdos-Renyi random graph G(N,p), lnp=-alnN, is studied in the article. We prove the covergence law for formulae with quantifier depth bounded by k when a=1/(k-2)."},"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":"1304.0896","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-04-03T10:02:06Z","cross_cats_sorted":[],"title_canon_sha256":"0c248ff599e7f128eb736ab3bb44a09bfdeeb28c92292fa86a1e0766d84b4bbb","abstract_canon_sha256":"c47f57290d7e79a44e80e15261d3fc58835023824c26a309cacafbbeebaf7484"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:29:05.816424Z","signature_b64":"a8n2BbpB5w1d58C8FlOEAFJBU6ZhloAtlZKeF7qoH3/4js/O52++QidfvJqKVAYJCmW0LpzG6Gxu9SostxSLBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"65aa06b3ebfd0c2a1b020e5d62ec9dd44805082acd073405a3b6c24403526d01","last_reissued_at":"2026-05-18T03:29:05.815557Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:29:05.815557Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the convergence of probabilities of the random graphs' properties expressed by first-order formulae with a bounded quantifier depth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Maksim Zhukovskii","submitted_at":"2013-04-03T10:02:06Z","abstract_excerpt":"An asymptotic behavior of the probabilities of first-order properties of Erdos-Renyi random graph G(N,p), lnp=-alnN, is studied in the article. We prove the covergence law for formulae with quantifier depth bounded by k when a=1/(k-2)."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.0896","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":""},"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":"1304.0896","created_at":"2026-05-18T03:29:05.815714+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.0896v1","created_at":"2026-05-18T03:29:05.815714+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.0896","created_at":"2026-05-18T03:29:05.815714+00:00"},{"alias_kind":"pith_short_12","alias_value":"MWVANM7L7UGC","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_16","alias_value":"MWVANM7L7UGCUGYC","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_8","alias_value":"MWVANM7L","created_at":"2026-05-18T12:27:52.871228+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/MWVANM7L7UGCUGYCBZOWF3E52R","json":"https://pith.science/pith/MWVANM7L7UGCUGYCBZOWF3E52R.json","graph_json":"https://pith.science/api/pith-number/MWVANM7L7UGCUGYCBZOWF3E52R/graph.json","events_json":"https://pith.science/api/pith-number/MWVANM7L7UGCUGYCBZOWF3E52R/events.json","paper":"https://pith.science/paper/MWVANM7L"},"agent_actions":{"view_html":"https://pith.science/pith/MWVANM7L7UGCUGYCBZOWF3E52R","download_json":"https://pith.science/pith/MWVANM7L7UGCUGYCBZOWF3E52R.json","view_paper":"https://pith.science/paper/MWVANM7L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.0896&json=true","fetch_graph":"https://pith.science/api/pith-number/MWVANM7L7UGCUGYCBZOWF3E52R/graph.json","fetch_events":"https://pith.science/api/pith-number/MWVANM7L7UGCUGYCBZOWF3E52R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MWVANM7L7UGCUGYCBZOWF3E52R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MWVANM7L7UGCUGYCBZOWF3E52R/action/storage_attestation","attest_author":"https://pith.science/pith/MWVANM7L7UGCUGYCBZOWF3E52R/action/author_attestation","sign_citation":"https://pith.science/pith/MWVANM7L7UGCUGYCBZOWF3E52R/action/citation_signature","submit_replication":"https://pith.science/pith/MWVANM7L7UGCUGYCBZOWF3E52R/action/replication_record"}},"created_at":"2026-05-18T03:29:05.815714+00:00","updated_at":"2026-05-18T03:29:05.815714+00:00"}