{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:L7YZVH6D6W222XM4MEKC4CPD6X","short_pith_number":"pith:L7YZVH6D","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"},"canonical_sha256":"5ff19a9fc3f5b5ad5d9c61142e09e3f5e71cbfd5237c9f1c0a6d551e58224093","source":{"kind":"arxiv","id":"1802.00059","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.00059","created_at":"2026-05-18T00:24:36Z"},{"alias_kind":"arxiv_version","alias_value":"1802.00059v1","created_at":"2026-05-18T00:24:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.00059","created_at":"2026-05-18T00:24:36Z"},{"alias_kind":"pith_short_12","alias_value":"L7YZVH6D6W22","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"L7YZVH6D6W222XM4","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"L7YZVH6D","created_at":"2026-05-18T12:32:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:L7YZVH6D6W222XM4MEKC4CPD6X","target":"record","payload":{"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"},"canonical_sha256":"5ff19a9fc3f5b5ad5d9c61142e09e3f5e71cbfd5237c9f1c0a6d551e58224093","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"},"source_kind":"arxiv","source_id":"1802.00059","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:24:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gAlriyYFYBffHVTAgtuOToVZh5xYMN0E5NG+aP/KdMiBosl3+rjCOUVfvUwzwoSoZ3tKGNWCfM92rhFYsN3QAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T21:20:19.154328Z"},"content_sha256":"f707a694d54ca614c1bc157e247b2e6009d57a530f8d1e78542077fea59dd591","schema_version":"1.0","event_id":"sha256:f707a694d54ca614c1bc157e247b2e6009d57a530f8d1e78542077fea59dd591"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:L7YZVH6D6W222XM4MEKC4CPD6X","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:24:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ea1VeYTYx3rX2ZrPuvPqXk3xsxb6Ic0k7RGm23ypl/TDI7ZfFVKmoqcmc5BuoYBP1GSs+vQxApyTFbx00vmTDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T21:20:19.155002Z"},"content_sha256":"80cb92e504fc8d7f536104a1de64d4a124eb4f9ac91699c9f5fbe04a6859341b","schema_version":"1.0","event_id":"sha256:80cb92e504fc8d7f536104a1de64d4a124eb4f9ac91699c9f5fbe04a6859341b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/L7YZVH6D6W222XM4MEKC4CPD6X/bundle.json","state_url":"https://pith.science/pith/L7YZVH6D6W222XM4MEKC4CPD6X/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/L7YZVH6D6W222XM4MEKC4CPD6X/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-26T21:20:19Z","links":{"resolver":"https://pith.science/pith/L7YZVH6D6W222XM4MEKC4CPD6X","bundle":"https://pith.science/pith/L7YZVH6D6W222XM4MEKC4CPD6X/bundle.json","state":"https://pith.science/pith/L7YZVH6D6W222XM4MEKC4CPD6X/state.json","well_known_bundle":"https://pith.science/.well-known/pith/L7YZVH6D6W222XM4MEKC4CPD6X/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:L7YZVH6D6W222XM4MEKC4CPD6X","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":"a3335d02eb5a671651822f76be2260fb158db8f09cfb96b73340eb3221d83ec9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-01-31T20:45:26Z","title_canon_sha256":"320dedf72b2e3d128375cfb58d77bf74dc8f67cb78332ab597ed5112c0a3ae8e"},"schema_version":"1.0","source":{"id":"1802.00059","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.00059","created_at":"2026-05-18T00:24:36Z"},{"alias_kind":"arxiv_version","alias_value":"1802.00059v1","created_at":"2026-05-18T00:24:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.00059","created_at":"2026-05-18T00:24:36Z"},{"alias_kind":"pith_short_12","alias_value":"L7YZVH6D6W22","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"L7YZVH6D6W222XM4","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"L7YZVH6D","created_at":"2026-05-18T12:32:33Z"}],"graph_snapshots":[{"event_id":"sha256:80cb92e504fc8d7f536104a1de64d4a124eb4f9ac91699c9f5fbe04a6859341b","target":"graph","created_at":"2026-05-18T00:24:36Z","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":"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","authors_text":"Moumanti Podder","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-01-31T20:45:26Z","title":"First order theory on $G(n, c n^{-1})$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.00059","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:f707a694d54ca614c1bc157e247b2e6009d57a530f8d1e78542077fea59dd591","target":"record","created_at":"2026-05-18T00:24:36Z","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":"a3335d02eb5a671651822f76be2260fb158db8f09cfb96b73340eb3221d83ec9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-01-31T20:45:26Z","title_canon_sha256":"320dedf72b2e3d128375cfb58d77bf74dc8f67cb78332ab597ed5112c0a3ae8e"},"schema_version":"1.0","source":{"id":"1802.00059","kind":"arxiv","version":1}},"canonical_sha256":"5ff19a9fc3f5b5ad5d9c61142e09e3f5e71cbfd5237c9f1c0a6d551e58224093","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5ff19a9fc3f5b5ad5d9c61142e09e3f5e71cbfd5237c9f1c0a6d551e58224093","first_computed_at":"2026-05-18T00:24:36.882231Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:24:36.882231Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vMKASZyQ4g4991soxru5W9hHHXmYU1+ggtYfeKSB2F8BPJiA9OU9V3+/M0oZ3qHSfur8w2nsMHUcJwlXnTn+Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:24:36.882797Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.00059","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f707a694d54ca614c1bc157e247b2e6009d57a530f8d1e78542077fea59dd591","sha256:80cb92e504fc8d7f536104a1de64d4a124eb4f9ac91699c9f5fbe04a6859341b"],"state_sha256":"06c564082f82ce60fcebbcc7c58ecf2c4ddbbaa85d9cd1c26c314f42d8479068"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0hlaXPVAiKr83uc2zlaVruAtZugAsn/egSt29QzmrZynROyxEAeDFf1gTYvKvIEMmcTmzVlB+h1psj8Y4KMjBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T21:20:19.158014Z","bundle_sha256":"d46e42b44240ad988ccee3bbd55aaaec3e8f53a0fc8bc17c97be9c6688e10ade"}}