{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:YSDI377RWW4MAAUZKDTT4VZ7GU","short_pith_number":"pith:YSDI377R","schema_version":"1.0","canonical_sha256":"c4868dfff1b5b8c0029950e73e573f3537564364dbb1e32f9ff7760914f41a81","source":{"kind":"arxiv","id":"1606.01586","version":3},"attestation_state":"computed","paper":{"title":"The average number of spanning trees in sparse graphs with given degrees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Brendan D. McKay, Catherine Greenhill, Matthew Kwan, Mikhail Isaev","submitted_at":"2016-06-05T23:57:22Z","abstract_excerpt":"We give an asymptotic expression for the expected number of spanning trees in a random graph with a given degree sequence $\\boldsymbol{d}=(d_1,\\ldots, d_n)$, provided that the number of edges is at least $n + \\textstyle{\\frac{1}{2}} d_{\\max}^4$, where $d_{\\max}$ is the maximum degree. A key part of our argument involves establishing a concentration result for a certain family of functions over random trees with given degrees, using Pr\\\"ufer codes."},"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":"1606.01586","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-06-05T23:57:22Z","cross_cats_sorted":[],"title_canon_sha256":"c2148bd3c6867b268591cce960126564fe27ae9082d3cd62bde95b44e52849aa","abstract_canon_sha256":"9e60ed1469fc9c35a0c281931dfd3e3cae4b486a2e6a40564ec76b35f28ec46c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:29.519369Z","signature_b64":"rkMlWjsMGpR64AvqGDl9gyEBZ3G1f0xY472bC2o0OQn9GcELBptFo1W70SY5cV+2zoVqTTGeoxJgKF80TQtjAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c4868dfff1b5b8c0029950e73e573f3537564364dbb1e32f9ff7760914f41a81","last_reissued_at":"2026-05-18T00:50:29.518743Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:29.518743Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The average number of spanning trees in sparse graphs with given degrees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Brendan D. McKay, Catherine Greenhill, Matthew Kwan, Mikhail Isaev","submitted_at":"2016-06-05T23:57:22Z","abstract_excerpt":"We give an asymptotic expression for the expected number of spanning trees in a random graph with a given degree sequence $\\boldsymbol{d}=(d_1,\\ldots, d_n)$, provided that the number of edges is at least $n + \\textstyle{\\frac{1}{2}} d_{\\max}^4$, where $d_{\\max}$ is the maximum degree. A key part of our argument involves establishing a concentration result for a certain family of functions over random trees with given degrees, using Pr\\\"ufer codes."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.01586","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":"1606.01586","created_at":"2026-05-18T00:50:29.518857+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.01586v3","created_at":"2026-05-18T00:50:29.518857+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.01586","created_at":"2026-05-18T00:50:29.518857+00:00"},{"alias_kind":"pith_short_12","alias_value":"YSDI377RWW4M","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_16","alias_value":"YSDI377RWW4MAAUZ","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_8","alias_value":"YSDI377R","created_at":"2026-05-18T12:30:53.716459+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/YSDI377RWW4MAAUZKDTT4VZ7GU","json":"https://pith.science/pith/YSDI377RWW4MAAUZKDTT4VZ7GU.json","graph_json":"https://pith.science/api/pith-number/YSDI377RWW4MAAUZKDTT4VZ7GU/graph.json","events_json":"https://pith.science/api/pith-number/YSDI377RWW4MAAUZKDTT4VZ7GU/events.json","paper":"https://pith.science/paper/YSDI377R"},"agent_actions":{"view_html":"https://pith.science/pith/YSDI377RWW4MAAUZKDTT4VZ7GU","download_json":"https://pith.science/pith/YSDI377RWW4MAAUZKDTT4VZ7GU.json","view_paper":"https://pith.science/paper/YSDI377R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.01586&json=true","fetch_graph":"https://pith.science/api/pith-number/YSDI377RWW4MAAUZKDTT4VZ7GU/graph.json","fetch_events":"https://pith.science/api/pith-number/YSDI377RWW4MAAUZKDTT4VZ7GU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YSDI377RWW4MAAUZKDTT4VZ7GU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YSDI377RWW4MAAUZKDTT4VZ7GU/action/storage_attestation","attest_author":"https://pith.science/pith/YSDI377RWW4MAAUZKDTT4VZ7GU/action/author_attestation","sign_citation":"https://pith.science/pith/YSDI377RWW4MAAUZKDTT4VZ7GU/action/citation_signature","submit_replication":"https://pith.science/pith/YSDI377RWW4MAAUZKDTT4VZ7GU/action/replication_record"}},"created_at":"2026-05-18T00:50:29.518857+00:00","updated_at":"2026-05-18T00:50:29.518857+00:00"}