{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:D2QS7WWF3NKSB557LCE5I52ZIN","short_pith_number":"pith:D2QS7WWF","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"},"canonical_sha256":"1ea12fdac5db5520f7bf5889d47759437461b84c9174e4ca7244daea9d9f49d9","source":{"kind":"arxiv","id":"1401.7021","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.7021","created_at":"2026-05-18T00:26:31Z"},{"alias_kind":"arxiv_version","alias_value":"1401.7021v3","created_at":"2026-05-18T00:26:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.7021","created_at":"2026-05-18T00:26:31Z"},{"alias_kind":"pith_short_12","alias_value":"D2QS7WWF3NKS","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"D2QS7WWF3NKSB557","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"D2QS7WWF","created_at":"2026-05-18T12:28:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:D2QS7WWF3NKSB557LCE5I52ZIN","target":"record","payload":{"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"},"canonical_sha256":"1ea12fdac5db5520f7bf5889d47759437461b84c9174e4ca7244daea9d9f49d9","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"},"source_kind":"arxiv","source_id":"1401.7021","source_version":3,"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:26:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Tfgt/AYPD82PBYv+AHAdAuU1bxEXT6BmoeAwaKDTuu0QGvm1sSWrhNq8/fs5wjx5a9/7oiQxiSfOPHIhRwDiAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T19:42:50.194202Z"},"content_sha256":"d11d387dd0628fdf094c8ad8b34d95d24d4e102ca4c510dab66272ebeaa12e0e","schema_version":"1.0","event_id":"sha256:d11d387dd0628fdf094c8ad8b34d95d24d4e102ca4c510dab66272ebeaa12e0e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:D2QS7WWF3NKSB557LCE5I52ZIN","target":"graph","payload":{"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"},"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:26:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cceggFJz4shPIcLGARRMI7FO93XyKJUM54e/S4VvPTJreXbGMYbJcfOfA7ag0uPL7yiK4+vjWcvykswLoMhXAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T19:42:50.194905Z"},"content_sha256":"e9dbb1fd950b00aa384e1f48cdda2021b1164f6921eefe9f68996dd87f51bc66","schema_version":"1.0","event_id":"sha256:e9dbb1fd950b00aa384e1f48cdda2021b1164f6921eefe9f68996dd87f51bc66"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/D2QS7WWF3NKSB557LCE5I52ZIN/bundle.json","state_url":"https://pith.science/pith/D2QS7WWF3NKSB557LCE5I52ZIN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/D2QS7WWF3NKSB557LCE5I52ZIN/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-27T19:42:50Z","links":{"resolver":"https://pith.science/pith/D2QS7WWF3NKSB557LCE5I52ZIN","bundle":"https://pith.science/pith/D2QS7WWF3NKSB557LCE5I52ZIN/bundle.json","state":"https://pith.science/pith/D2QS7WWF3NKSB557LCE5I52ZIN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/D2QS7WWF3NKSB557LCE5I52ZIN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:D2QS7WWF3NKSB557LCE5I52ZIN","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":"8bfe8c86afd25b1e0c66f97ec2eb670b262d1512d899dc65e3cbf2422891357a","cross_cats_sorted":["math.LO","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-27T21:04:22Z","title_canon_sha256":"3aea549174425b0323bc11a398819b15be432853584592f367ef24222466d230"},"schema_version":"1.0","source":{"id":"1401.7021","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.7021","created_at":"2026-05-18T00:26:31Z"},{"alias_kind":"arxiv_version","alias_value":"1401.7021v3","created_at":"2026-05-18T00:26:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.7021","created_at":"2026-05-18T00:26:31Z"},{"alias_kind":"pith_short_12","alias_value":"D2QS7WWF3NKS","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"D2QS7WWF3NKSB557","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"D2QS7WWF","created_at":"2026-05-18T12:28:25Z"}],"graph_snapshots":[{"event_id":"sha256:e9dbb1fd950b00aa384e1f48cdda2021b1164f6921eefe9f68996dd87f51bc66","target":"graph","created_at":"2026-05-18T00:26:31Z","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":"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","authors_text":"Anusch Taraz, Marc Noy, Peter Heinig, Tobias Muller","cross_cats":["math.LO","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-27T21:04:22Z","title":"Logical limit laws for minor-closed classes of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.7021","kind":"arxiv","version":3},"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:d11d387dd0628fdf094c8ad8b34d95d24d4e102ca4c510dab66272ebeaa12e0e","target":"record","created_at":"2026-05-18T00:26:31Z","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":"8bfe8c86afd25b1e0c66f97ec2eb670b262d1512d899dc65e3cbf2422891357a","cross_cats_sorted":["math.LO","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-27T21:04:22Z","title_canon_sha256":"3aea549174425b0323bc11a398819b15be432853584592f367ef24222466d230"},"schema_version":"1.0","source":{"id":"1401.7021","kind":"arxiv","version":3}},"canonical_sha256":"1ea12fdac5db5520f7bf5889d47759437461b84c9174e4ca7244daea9d9f49d9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1ea12fdac5db5520f7bf5889d47759437461b84c9174e4ca7244daea9d9f49d9","first_computed_at":"2026-05-18T00:26:31.005973Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:26:31.005973Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sUAFeGgUQAdjzHJdqHlys8nb2DhsW5NIdFZ8GNDZ6j0kjjp4Qy8W9XscBmaPOvhaVQEcV5WxOm7yxH2rAOM1Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:26:31.006741Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.7021","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d11d387dd0628fdf094c8ad8b34d95d24d4e102ca4c510dab66272ebeaa12e0e","sha256:e9dbb1fd950b00aa384e1f48cdda2021b1164f6921eefe9f68996dd87f51bc66"],"state_sha256":"324be0ad16cdf39b94ac26983daa3c2f49e74f0b62b60fffc1b4b42a6c4b30d4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KwuorNnGZ/EamGHwos78wcKhwu5NTtXvoQ5m/XgHS7SNFAGlL5MTNAe6GzmlEpjXvmb/tpz5Rj25MWc1rybKAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T19:42:50.197954Z","bundle_sha256":"cb30fb582b0ea94eb6922b98e16cd2964bd2ee8b9daf7463ea8b3a182b356903"}}