{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:3IA7F2OKCAZHT5BA5MXXUFLA7Z","short_pith_number":"pith:3IA7F2OK","canonical_record":{"source":{"id":"1003.4699","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-03-24T17:21:52Z","cross_cats_sorted":[],"title_canon_sha256":"4266b677cb5051d85ae6297b6a8969060687338858b17664a48ffdbef863c1c6","abstract_canon_sha256":"5cd0680398d194381dd8b013282b8f671a5efd0e1f2581bb5c0fad89bea2fd19"},"schema_version":"1.0"},"canonical_sha256":"da01f2e9ca103279f420eb2f7a1560fe57759807c003c764a3559b02285ba8b1","source":{"kind":"arxiv","id":"1003.4699","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1003.4699","created_at":"2026-05-17T23:54:27Z"},{"alias_kind":"arxiv_version","alias_value":"1003.4699v2","created_at":"2026-05-17T23:54:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1003.4699","created_at":"2026-05-17T23:54:27Z"},{"alias_kind":"pith_short_12","alias_value":"3IA7F2OKCAZH","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_16","alias_value":"3IA7F2OKCAZHT5BA","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_8","alias_value":"3IA7F2OK","created_at":"2026-05-18T12:26:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:3IA7F2OKCAZHT5BA5MXXUFLA7Z","target":"record","payload":{"canonical_record":{"source":{"id":"1003.4699","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-03-24T17:21:52Z","cross_cats_sorted":[],"title_canon_sha256":"4266b677cb5051d85ae6297b6a8969060687338858b17664a48ffdbef863c1c6","abstract_canon_sha256":"5cd0680398d194381dd8b013282b8f671a5efd0e1f2581bb5c0fad89bea2fd19"},"schema_version":"1.0"},"canonical_sha256":"da01f2e9ca103279f420eb2f7a1560fe57759807c003c764a3559b02285ba8b1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:27.503180Z","signature_b64":"sHnA+A+nwwW5OvLdTk9u5YFcP+fB++fIknHlktJgrQOUYoSRhoHMbu6vzNhP9VUtM5ZiWC0Ou35OPknBRb5kCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"da01f2e9ca103279f420eb2f7a1560fe57759807c003c764a3559b02285ba8b1","last_reissued_at":"2026-05-17T23:54:27.502555Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:27.502555Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1003.4699","source_version":2,"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-17T23:54:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XvM2nvkyKD3SPtYA7z7AZJLRTA+pKwiYFeg6y1D+8mPvYXLR/uHWDhvhvxttk0AOwN0up1d2I05p9sPesVAqDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T14:24:59.959489Z"},"content_sha256":"3165aa088d35857e3769807e20f220cdb85b13d8d7b66f11557a3256dd8e07df","schema_version":"1.0","event_id":"sha256:3165aa088d35857e3769807e20f220cdb85b13d8d7b66f11557a3256dd8e07df"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:3IA7F2OKCAZHT5BA5MXXUFLA7Z","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Asymptotic study of subcritical graph classes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"\\'Eric Fusy, Juanjo Ru\\'e, Michael Drmota, Mihyun Kang, Veronika Kraus","submitted_at":"2010-03-24T17:21:52Z","abstract_excerpt":"We present a unified general method for the asymptotic study of graphs from the so-called \"subcritical\"$ $ graph classes, which include the classes of cacti graphs, outerplanar graphs, and series-parallel graphs. This general method works both in the labelled and unlabelled framework. The main results concern the asymptotic enumeration and the limit laws of properties of random graphs chosen from subcritical classes. We show that the number $g_n/n!$ (resp. $g_n$) of labelled (resp. unlabelled) graphs on $n$ vertices from a subcritical graph class ${G}=\\cup_n {G_n}$ satisfies asymptotically the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1003.4699","kind":"arxiv","version":2},"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-17T23:54:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+jKdUBPE/x1teG7MrFnGoJsH8nJhLOElw8AS7UCbDDltXMtjDFpP9kgTt2Qokpu9xLjB5Iqi4U7udB4a0wSlDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T14:24:59.960137Z"},"content_sha256":"def5b1071c49eda67b527c978cb275108adca839485a50a91aada49290f473d5","schema_version":"1.0","event_id":"sha256:def5b1071c49eda67b527c978cb275108adca839485a50a91aada49290f473d5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3IA7F2OKCAZHT5BA5MXXUFLA7Z/bundle.json","state_url":"https://pith.science/pith/3IA7F2OKCAZHT5BA5MXXUFLA7Z/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3IA7F2OKCAZHT5BA5MXXUFLA7Z/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-25T14:24:59Z","links":{"resolver":"https://pith.science/pith/3IA7F2OKCAZHT5BA5MXXUFLA7Z","bundle":"https://pith.science/pith/3IA7F2OKCAZHT5BA5MXXUFLA7Z/bundle.json","state":"https://pith.science/pith/3IA7F2OKCAZHT5BA5MXXUFLA7Z/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3IA7F2OKCAZHT5BA5MXXUFLA7Z/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:3IA7F2OKCAZHT5BA5MXXUFLA7Z","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":"5cd0680398d194381dd8b013282b8f671a5efd0e1f2581bb5c0fad89bea2fd19","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-03-24T17:21:52Z","title_canon_sha256":"4266b677cb5051d85ae6297b6a8969060687338858b17664a48ffdbef863c1c6"},"schema_version":"1.0","source":{"id":"1003.4699","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1003.4699","created_at":"2026-05-17T23:54:27Z"},{"alias_kind":"arxiv_version","alias_value":"1003.4699v2","created_at":"2026-05-17T23:54:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1003.4699","created_at":"2026-05-17T23:54:27Z"},{"alias_kind":"pith_short_12","alias_value":"3IA7F2OKCAZH","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_16","alias_value":"3IA7F2OKCAZHT5BA","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_8","alias_value":"3IA7F2OK","created_at":"2026-05-18T12:26:03Z"}],"graph_snapshots":[{"event_id":"sha256:def5b1071c49eda67b527c978cb275108adca839485a50a91aada49290f473d5","target":"graph","created_at":"2026-05-17T23:54:27Z","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":"We present a unified general method for the asymptotic study of graphs from the so-called \"subcritical\"$ $ graph classes, which include the classes of cacti graphs, outerplanar graphs, and series-parallel graphs. This general method works both in the labelled and unlabelled framework. The main results concern the asymptotic enumeration and the limit laws of properties of random graphs chosen from subcritical classes. We show that the number $g_n/n!$ (resp. $g_n$) of labelled (resp. unlabelled) graphs on $n$ vertices from a subcritical graph class ${G}=\\cup_n {G_n}$ satisfies asymptotically the","authors_text":"\\'Eric Fusy, Juanjo Ru\\'e, Michael Drmota, Mihyun Kang, Veronika Kraus","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-03-24T17:21:52Z","title":"Asymptotic study of subcritical graph classes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1003.4699","kind":"arxiv","version":2},"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:3165aa088d35857e3769807e20f220cdb85b13d8d7b66f11557a3256dd8e07df","target":"record","created_at":"2026-05-17T23:54:27Z","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":"5cd0680398d194381dd8b013282b8f671a5efd0e1f2581bb5c0fad89bea2fd19","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-03-24T17:21:52Z","title_canon_sha256":"4266b677cb5051d85ae6297b6a8969060687338858b17664a48ffdbef863c1c6"},"schema_version":"1.0","source":{"id":"1003.4699","kind":"arxiv","version":2}},"canonical_sha256":"da01f2e9ca103279f420eb2f7a1560fe57759807c003c764a3559b02285ba8b1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"da01f2e9ca103279f420eb2f7a1560fe57759807c003c764a3559b02285ba8b1","first_computed_at":"2026-05-17T23:54:27.502555Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:54:27.502555Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sHnA+A+nwwW5OvLdTk9u5YFcP+fB++fIknHlktJgrQOUYoSRhoHMbu6vzNhP9VUtM5ZiWC0Ou35OPknBRb5kCA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:54:27.503180Z","signed_message":"canonical_sha256_bytes"},"source_id":"1003.4699","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3165aa088d35857e3769807e20f220cdb85b13d8d7b66f11557a3256dd8e07df","sha256:def5b1071c49eda67b527c978cb275108adca839485a50a91aada49290f473d5"],"state_sha256":"e3a76040241bc2d384fed5eb9c6831d4b2dac0621aa8e8a42fed19d43f489a35"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ilLuWs0HVJxrsDfQsfbrlF/2gvjGMYAiNE40hQcQLWNkestP90cSDJoZjUUGEHNAzZIk/nQvi4/KDYLQP+GkAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T14:24:59.964101Z","bundle_sha256":"262ec26356df50e7fbb874c0e8ec1ddca329f9d793ef5bbe01e9e5526c716ec1"}}