{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:L7YZVH6D6W222XM4MEKC4CPD6X","short_pith_number":"pith:L7YZVH6D","schema_version":"1.0","canonical_sha256":"5ff19a9fc3f5b5ad5d9c61142e09e3f5e71cbfd5237c9f1c0a6d551e58224093","source":{"kind":"arxiv","id":"1802.00059","version":1},"attestation_state":"computed","paper":{"title":"First order theory on $G(n, c n^{-1})$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Moumanti Podder","submitted_at":"2018-01-31T20:45:26Z","abstract_excerpt":"A well-known result of Shelah and Spencer tells us that the almost sure theory for first order language on the random graph sequence $\\left\\{G(n, cn^{-1})\\right\\}$ is not complete. This paper proposes and proves what the complete set of completions of the almost sure theory for $\\left\\{G(n, c n^{-1})\\right\\}$ should be. The almost sure theory $T$ consists of two sentence groups: the first states that all the components are trees or unicyclic components, and the second states that, given any $k \\in \\mathbb{N}$ and any finite tree $t$, there are at least $k$ components isomorphic to $t$. We defi"},"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":"1802.00059","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-01-31T20:45:26Z","cross_cats_sorted":[],"title_canon_sha256":"320dedf72b2e3d128375cfb58d77bf74dc8f67cb78332ab597ed5112c0a3ae8e","abstract_canon_sha256":"a3335d02eb5a671651822f76be2260fb158db8f09cfb96b73340eb3221d83ec9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:36.882797Z","signature_b64":"vMKASZyQ4g4991soxru5W9hHHXmYU1+ggtYfeKSB2F8BPJiA9OU9V3+/M0oZ3qHSfur8w2nsMHUcJwlXnTn+Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5ff19a9fc3f5b5ad5d9c61142e09e3f5e71cbfd5237c9f1c0a6d551e58224093","last_reissued_at":"2026-05-18T00:24:36.882231Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:36.882231Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"First order theory on $G(n, c n^{-1})$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Moumanti Podder","submitted_at":"2018-01-31T20:45:26Z","abstract_excerpt":"A well-known result of Shelah and Spencer tells us that the almost sure theory for first order language on the random graph sequence $\\left\\{G(n, cn^{-1})\\right\\}$ is not complete. This paper proposes and proves what the complete set of completions of the almost sure theory for $\\left\\{G(n, c n^{-1})\\right\\}$ should be. The almost sure theory $T$ consists of two sentence groups: the first states that all the components are trees or unicyclic components, and the second states that, given any $k \\in \\mathbb{N}$ and any finite tree $t$, there are at least $k$ components isomorphic to $t$. We defi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.00059","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":"1802.00059","created_at":"2026-05-18T00:24:36.882322+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.00059v1","created_at":"2026-05-18T00:24:36.882322+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.00059","created_at":"2026-05-18T00:24:36.882322+00:00"},{"alias_kind":"pith_short_12","alias_value":"L7YZVH6D6W22","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_16","alias_value":"L7YZVH6D6W222XM4","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_8","alias_value":"L7YZVH6D","created_at":"2026-05-18T12:32:33.847187+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/L7YZVH6D6W222XM4MEKC4CPD6X","json":"https://pith.science/pith/L7YZVH6D6W222XM4MEKC4CPD6X.json","graph_json":"https://pith.science/api/pith-number/L7YZVH6D6W222XM4MEKC4CPD6X/graph.json","events_json":"https://pith.science/api/pith-number/L7YZVH6D6W222XM4MEKC4CPD6X/events.json","paper":"https://pith.science/paper/L7YZVH6D"},"agent_actions":{"view_html":"https://pith.science/pith/L7YZVH6D6W222XM4MEKC4CPD6X","download_json":"https://pith.science/pith/L7YZVH6D6W222XM4MEKC4CPD6X.json","view_paper":"https://pith.science/paper/L7YZVH6D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.00059&json=true","fetch_graph":"https://pith.science/api/pith-number/L7YZVH6D6W222XM4MEKC4CPD6X/graph.json","fetch_events":"https://pith.science/api/pith-number/L7YZVH6D6W222XM4MEKC4CPD6X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L7YZVH6D6W222XM4MEKC4CPD6X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L7YZVH6D6W222XM4MEKC4CPD6X/action/storage_attestation","attest_author":"https://pith.science/pith/L7YZVH6D6W222XM4MEKC4CPD6X/action/author_attestation","sign_citation":"https://pith.science/pith/L7YZVH6D6W222XM4MEKC4CPD6X/action/citation_signature","submit_replication":"https://pith.science/pith/L7YZVH6D6W222XM4MEKC4CPD6X/action/replication_record"}},"created_at":"2026-05-18T00:24:36.882322+00:00","updated_at":"2026-05-18T00:24:36.882322+00:00"}