{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:YSDI377RWW4MAAUZKDTT4VZ7GU","short_pith_number":"pith:YSDI377R","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"},"canonical_sha256":"c4868dfff1b5b8c0029950e73e573f3537564364dbb1e32f9ff7760914f41a81","source":{"kind":"arxiv","id":"1606.01586","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.01586","created_at":"2026-05-18T00:50:29Z"},{"alias_kind":"arxiv_version","alias_value":"1606.01586v3","created_at":"2026-05-18T00:50:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.01586","created_at":"2026-05-18T00:50:29Z"},{"alias_kind":"pith_short_12","alias_value":"YSDI377RWW4M","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"YSDI377RWW4MAAUZ","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"YSDI377R","created_at":"2026-05-18T12:30:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:YSDI377RWW4MAAUZKDTT4VZ7GU","target":"record","payload":{"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"},"canonical_sha256":"c4868dfff1b5b8c0029950e73e573f3537564364dbb1e32f9ff7760914f41a81","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"},"source_kind":"arxiv","source_id":"1606.01586","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:50:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qFvNGwdvuAXVP8o1WFechguEdmifxVt6jlWJO7++OfneZqRBc83MxZInTdyXcmCksXQBoKf2fAkD8k8slAW9Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T19:32:38.186274Z"},"content_sha256":"6688bb19300cd749300ea580cf4b3b75d077c61b289f72ac6062233d4d4a4e71","schema_version":"1.0","event_id":"sha256:6688bb19300cd749300ea580cf4b3b75d077c61b289f72ac6062233d4d4a4e71"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:YSDI377RWW4MAAUZKDTT4VZ7GU","target":"graph","payload":{"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"},"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:50:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UnJNZqXx++3+38Kmop9oSsVWbn8vTkaNVR1ka5KrWw3BMnF1+eekxFn7mZgciOize3JuZ3+MrLzPHjVU7uEiBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T19:32:38.186992Z"},"content_sha256":"8c03c2b2daf741c77265f6d5579ee2c4e545b1762561ee05dd65b06f2f57e832","schema_version":"1.0","event_id":"sha256:8c03c2b2daf741c77265f6d5579ee2c4e545b1762561ee05dd65b06f2f57e832"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YSDI377RWW4MAAUZKDTT4VZ7GU/bundle.json","state_url":"https://pith.science/pith/YSDI377RWW4MAAUZKDTT4VZ7GU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YSDI377RWW4MAAUZKDTT4VZ7GU/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-06-08T19:32:38Z","links":{"resolver":"https://pith.science/pith/YSDI377RWW4MAAUZKDTT4VZ7GU","bundle":"https://pith.science/pith/YSDI377RWW4MAAUZKDTT4VZ7GU/bundle.json","state":"https://pith.science/pith/YSDI377RWW4MAAUZKDTT4VZ7GU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YSDI377RWW4MAAUZKDTT4VZ7GU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:YSDI377RWW4MAAUZKDTT4VZ7GU","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":"9e60ed1469fc9c35a0c281931dfd3e3cae4b486a2e6a40564ec76b35f28ec46c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-06-05T23:57:22Z","title_canon_sha256":"c2148bd3c6867b268591cce960126564fe27ae9082d3cd62bde95b44e52849aa"},"schema_version":"1.0","source":{"id":"1606.01586","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.01586","created_at":"2026-05-18T00:50:29Z"},{"alias_kind":"arxiv_version","alias_value":"1606.01586v3","created_at":"2026-05-18T00:50:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.01586","created_at":"2026-05-18T00:50:29Z"},{"alias_kind":"pith_short_12","alias_value":"YSDI377RWW4M","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"YSDI377RWW4MAAUZ","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"YSDI377R","created_at":"2026-05-18T12:30:53Z"}],"graph_snapshots":[{"event_id":"sha256:8c03c2b2daf741c77265f6d5579ee2c4e545b1762561ee05dd65b06f2f57e832","target":"graph","created_at":"2026-05-18T00:50:29Z","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 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.","authors_text":"Brendan D. McKay, Catherine Greenhill, Matthew Kwan, Mikhail Isaev","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-06-05T23:57:22Z","title":"The average number of spanning trees in sparse graphs with given degrees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.01586","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:6688bb19300cd749300ea580cf4b3b75d077c61b289f72ac6062233d4d4a4e71","target":"record","created_at":"2026-05-18T00:50:29Z","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":"9e60ed1469fc9c35a0c281931dfd3e3cae4b486a2e6a40564ec76b35f28ec46c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-06-05T23:57:22Z","title_canon_sha256":"c2148bd3c6867b268591cce960126564fe27ae9082d3cd62bde95b44e52849aa"},"schema_version":"1.0","source":{"id":"1606.01586","kind":"arxiv","version":3}},"canonical_sha256":"c4868dfff1b5b8c0029950e73e573f3537564364dbb1e32f9ff7760914f41a81","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c4868dfff1b5b8c0029950e73e573f3537564364dbb1e32f9ff7760914f41a81","first_computed_at":"2026-05-18T00:50:29.518743Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:50:29.518743Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rkMlWjsMGpR64AvqGDl9gyEBZ3G1f0xY472bC2o0OQn9GcELBptFo1W70SY5cV+2zoVqTTGeoxJgKF80TQtjAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:50:29.519369Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.01586","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6688bb19300cd749300ea580cf4b3b75d077c61b289f72ac6062233d4d4a4e71","sha256:8c03c2b2daf741c77265f6d5579ee2c4e545b1762561ee05dd65b06f2f57e832"],"state_sha256":"519f8336a150d70a418d2f7db7701b4ff1e3192556ffa492d7030a4cce5be6c3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hst8l58u7OFe5GCXFgqvPmhgvzOmvXY0GADs0DoxjMU8ZWL0pOJXDXWkmp7SmWyiN4Wj7NZ2D6BR8GNjJbxTAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T19:32:38.191014Z","bundle_sha256":"60f13c432f705d81827b8308c421629a296aafdafed9bc883a44f87d0daf1a1f"}}