{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:QPFADKRKYHYPS2BOS2JMKSYOIJ","short_pith_number":"pith:QPFADKRK","schema_version":"1.0","canonical_sha256":"83ca01aa2ac1f0f9682e9692c54b0e425a9123902993884ad91445b16e2a3bc8","source":{"kind":"arxiv","id":"1503.01922","version":2},"attestation_state":"computed","paper":{"title":"Spanning trees in random series-parallel graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Juanjo Ru\\'e, Julia Ehrenm\\\"uller","submitted_at":"2015-03-06T11:26:00Z","abstract_excerpt":"By means of analytic techniques we show that the expected number of spanning trees in a connected labelled series-parallel graph on $n$ vertices chosen uniformly at random satisfies an estimate of the form $s \\varrho^{-n} (1+o(1))$, where $s$ and $\\varrho$ are computable constants, the values of which are approximately $s \\approx 0.09063$ and $\\varrho^{-1} \\approx 2.08415$. We obtain analogue results for subfamilies of series-parallel graphs including 2-connected series-parallel graphs, 2-trees, and series-parallel graphs with fixed excess."},"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":"1503.01922","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-06T11:26:00Z","cross_cats_sorted":[],"title_canon_sha256":"0523e966b006a73769778d7c67dad24c9a9e97be6815cfcaa5abc5dc55ae00bf","abstract_canon_sha256":"96a96fa50bc4eb24071a491d9afde36fcec29aa098018acae3ea95b274eaa771"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:24:25.076673Z","signature_b64":"FHz+4us+Ct6b3iZPEXhxCvwp/sxQ0lAbgoPaUKkZKFo9XelyqMljnXb4oax1FcjmeetrkEriFp0fM79qE/pQDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"83ca01aa2ac1f0f9682e9692c54b0e425a9123902993884ad91445b16e2a3bc8","last_reissued_at":"2026-05-18T01:24:25.075165Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:24:25.075165Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Spanning trees in random series-parallel graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Juanjo Ru\\'e, Julia Ehrenm\\\"uller","submitted_at":"2015-03-06T11:26:00Z","abstract_excerpt":"By means of analytic techniques we show that the expected number of spanning trees in a connected labelled series-parallel graph on $n$ vertices chosen uniformly at random satisfies an estimate of the form $s \\varrho^{-n} (1+o(1))$, where $s$ and $\\varrho$ are computable constants, the values of which are approximately $s \\approx 0.09063$ and $\\varrho^{-1} \\approx 2.08415$. We obtain analogue results for subfamilies of series-parallel graphs including 2-connected series-parallel graphs, 2-trees, and series-parallel graphs with fixed excess."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.01922","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1503.01922","created_at":"2026-05-18T01:24:25.075289+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.01922v2","created_at":"2026-05-18T01:24:25.075289+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.01922","created_at":"2026-05-18T01:24:25.075289+00:00"},{"alias_kind":"pith_short_12","alias_value":"QPFADKRKYHYP","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_16","alias_value":"QPFADKRKYHYPS2BO","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_8","alias_value":"QPFADKRK","created_at":"2026-05-18T12:29:37.295048+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/QPFADKRKYHYPS2BOS2JMKSYOIJ","json":"https://pith.science/pith/QPFADKRKYHYPS2BOS2JMKSYOIJ.json","graph_json":"https://pith.science/api/pith-number/QPFADKRKYHYPS2BOS2JMKSYOIJ/graph.json","events_json":"https://pith.science/api/pith-number/QPFADKRKYHYPS2BOS2JMKSYOIJ/events.json","paper":"https://pith.science/paper/QPFADKRK"},"agent_actions":{"view_html":"https://pith.science/pith/QPFADKRKYHYPS2BOS2JMKSYOIJ","download_json":"https://pith.science/pith/QPFADKRKYHYPS2BOS2JMKSYOIJ.json","view_paper":"https://pith.science/paper/QPFADKRK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.01922&json=true","fetch_graph":"https://pith.science/api/pith-number/QPFADKRKYHYPS2BOS2JMKSYOIJ/graph.json","fetch_events":"https://pith.science/api/pith-number/QPFADKRKYHYPS2BOS2JMKSYOIJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QPFADKRKYHYPS2BOS2JMKSYOIJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QPFADKRKYHYPS2BOS2JMKSYOIJ/action/storage_attestation","attest_author":"https://pith.science/pith/QPFADKRKYHYPS2BOS2JMKSYOIJ/action/author_attestation","sign_citation":"https://pith.science/pith/QPFADKRKYHYPS2BOS2JMKSYOIJ/action/citation_signature","submit_replication":"https://pith.science/pith/QPFADKRKYHYPS2BOS2JMKSYOIJ/action/replication_record"}},"created_at":"2026-05-18T01:24:25.075289+00:00","updated_at":"2026-05-18T01:24:25.075289+00:00"}