{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:D2QS7WWF3NKSB557LCE5I52ZIN","short_pith_number":"pith:D2QS7WWF","schema_version":"1.0","canonical_sha256":"1ea12fdac5db5520f7bf5889d47759437461b84c9174e4ca7244daea9d9f49d9","source":{"kind":"arxiv","id":"1401.7021","version":3},"attestation_state":"computed","paper":{"title":"Logical limit laws for minor-closed classes of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.LO","math.PR"],"primary_cat":"math.CO","authors_text":"Anusch Taraz, Marc Noy, Peter Heinig, Tobias Muller","submitted_at":"2014-01-27T21:04:22Z","abstract_excerpt":"Let $\\mathcal G$ be an addable, minor-closed class of graphs. We prove that the zero-one law holds in monadic second-order logic (MSO) for the random graph drawn uniformly at random from all {\\em connected} graphs in $\\mathcal G$ on $n$ vertices, and the convergence law in MSO holds if we draw uniformly at random from all graphs in $\\mathcal G$ on $n$ vertices. We also prove analogues of these results for the class of graphs embeddable on a fixed surface, provided we restrict attention to first order logic (FO). Moreover, the limiting probability that a given FO sentence is satisfied is indepe"},"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":"1401.7021","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-27T21:04:22Z","cross_cats_sorted":["math.LO","math.PR"],"title_canon_sha256":"3aea549174425b0323bc11a398819b15be432853584592f367ef24222466d230","abstract_canon_sha256":"8bfe8c86afd25b1e0c66f97ec2eb670b262d1512d899dc65e3cbf2422891357a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:31.006741Z","signature_b64":"sUAFeGgUQAdjzHJdqHlys8nb2DhsW5NIdFZ8GNDZ6j0kjjp4Qy8W9XscBmaPOvhaVQEcV5WxOm7yxH2rAOM1Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1ea12fdac5db5520f7bf5889d47759437461b84c9174e4ca7244daea9d9f49d9","last_reissued_at":"2026-05-18T00:26:31.005973Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:31.005973Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Logical limit laws for minor-closed classes of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.LO","math.PR"],"primary_cat":"math.CO","authors_text":"Anusch Taraz, Marc Noy, Peter Heinig, Tobias Muller","submitted_at":"2014-01-27T21:04:22Z","abstract_excerpt":"Let $\\mathcal G$ be an addable, minor-closed class of graphs. We prove that the zero-one law holds in monadic second-order logic (MSO) for the random graph drawn uniformly at random from all {\\em connected} graphs in $\\mathcal G$ on $n$ vertices, and the convergence law in MSO holds if we draw uniformly at random from all graphs in $\\mathcal G$ on $n$ vertices. We also prove analogues of these results for the class of graphs embeddable on a fixed surface, provided we restrict attention to first order logic (FO). Moreover, the limiting probability that a given FO sentence is satisfied is indepe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.7021","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":""},"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":"1401.7021","created_at":"2026-05-18T00:26:31.006091+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.7021v3","created_at":"2026-05-18T00:26:31.006091+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.7021","created_at":"2026-05-18T00:26:31.006091+00:00"},{"alias_kind":"pith_short_12","alias_value":"D2QS7WWF3NKS","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_16","alias_value":"D2QS7WWF3NKSB557","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_8","alias_value":"D2QS7WWF","created_at":"2026-05-18T12:28:25.294606+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/D2QS7WWF3NKSB557LCE5I52ZIN","json":"https://pith.science/pith/D2QS7WWF3NKSB557LCE5I52ZIN.json","graph_json":"https://pith.science/api/pith-number/D2QS7WWF3NKSB557LCE5I52ZIN/graph.json","events_json":"https://pith.science/api/pith-number/D2QS7WWF3NKSB557LCE5I52ZIN/events.json","paper":"https://pith.science/paper/D2QS7WWF"},"agent_actions":{"view_html":"https://pith.science/pith/D2QS7WWF3NKSB557LCE5I52ZIN","download_json":"https://pith.science/pith/D2QS7WWF3NKSB557LCE5I52ZIN.json","view_paper":"https://pith.science/paper/D2QS7WWF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.7021&json=true","fetch_graph":"https://pith.science/api/pith-number/D2QS7WWF3NKSB557LCE5I52ZIN/graph.json","fetch_events":"https://pith.science/api/pith-number/D2QS7WWF3NKSB557LCE5I52ZIN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D2QS7WWF3NKSB557LCE5I52ZIN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D2QS7WWF3NKSB557LCE5I52ZIN/action/storage_attestation","attest_author":"https://pith.science/pith/D2QS7WWF3NKSB557LCE5I52ZIN/action/author_attestation","sign_citation":"https://pith.science/pith/D2QS7WWF3NKSB557LCE5I52ZIN/action/citation_signature","submit_replication":"https://pith.science/pith/D2QS7WWF3NKSB557LCE5I52ZIN/action/replication_record"}},"created_at":"2026-05-18T00:26:31.006091+00:00","updated_at":"2026-05-18T00:26:31.006091+00:00"}