{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:LZ52CSZFKHKV44BHVUCYIKVP3O","short_pith_number":"pith:LZ52CSZF","canonical_record":{"source":{"id":"1008.0267","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2010-08-02T09:55:49Z","cross_cats_sorted":["math-ph","math.MP","physics.comp-ph"],"title_canon_sha256":"cf0d962dbfcb8e77943ee3c7486f77f89783704c649997bcb7f687f9b2f6fc0b","abstract_canon_sha256":"73bac849b6aa10611889852c19fb7567855a3747fc68f120b37a4d5c019e3086"},"schema_version":"1.0"},"canonical_sha256":"5e7ba14b2551d55e7027ad05842aafdbbd3454ddb59d21e0545351c7d5e9bff2","source":{"kind":"arxiv","id":"1008.0267","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.0267","created_at":"2026-05-18T04:42:43Z"},{"alias_kind":"arxiv_version","alias_value":"1008.0267v1","created_at":"2026-05-18T04:42:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.0267","created_at":"2026-05-18T04:42:43Z"},{"alias_kind":"pith_short_12","alias_value":"LZ52CSZFKHKV","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_16","alias_value":"LZ52CSZFKHKV44BH","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_8","alias_value":"LZ52CSZF","created_at":"2026-05-18T12:26:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:LZ52CSZFKHKV44BHVUCYIKVP3O","target":"record","payload":{"canonical_record":{"source":{"id":"1008.0267","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2010-08-02T09:55:49Z","cross_cats_sorted":["math-ph","math.MP","physics.comp-ph"],"title_canon_sha256":"cf0d962dbfcb8e77943ee3c7486f77f89783704c649997bcb7f687f9b2f6fc0b","abstract_canon_sha256":"73bac849b6aa10611889852c19fb7567855a3747fc68f120b37a4d5c019e3086"},"schema_version":"1.0"},"canonical_sha256":"5e7ba14b2551d55e7027ad05842aafdbbd3454ddb59d21e0545351c7d5e9bff2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:42:43.650939Z","signature_b64":"cJjkufxQHwGeQquHj9ko0HoQCIwJkVCpuygYFbRy0YsN883fzHSOnSwWWAEkFk4QMdZr0/8i0nDagHi4NX26Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5e7ba14b2551d55e7027ad05842aafdbbd3454ddb59d21e0545351c7d5e9bff2","last_reissued_at":"2026-05-18T04:42:43.650335Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:42:43.650335Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1008.0267","source_version":1,"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-18T04:42:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+JOksM9czFLttHxBpj5BXEByX9LfEC0tUpvyZ9/Dd4w6S9OgRTNsVmBZm3NoGk3eSxlwxYXWFZYvdjqFT/CWDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T22:25:46.587208Z"},"content_sha256":"f220976a454aa256b9a4b7cbee6912249a4c78997ed541343ad1455a85926357","schema_version":"1.0","event_id":"sha256:f220976a454aa256b9a4b7cbee6912249a4c78997ed541343ad1455a85926357"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:LZ52CSZFKHKV44BHVUCYIKVP3O","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Enumeration of spanning trees in a pseudofractal scale-free web","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math-ph","math.MP","physics.comp-ph"],"primary_cat":"cond-mat.stat-mech","authors_text":"Bin Wu, Hongxiao Liu, Shuigeng Zhou, Zhongzhi Zhang","submitted_at":"2010-08-02T09:55:49Z","abstract_excerpt":"Spanning trees are an important quantity characterizing the reliability of a network, however, explicitly determining the number of spanning trees in networks is a theoretical challenge. In this paper, we study the number of spanning trees in a small-world scale-free network and obtain the exact expressions. We find that the entropy of spanning trees in the studied network is less than 1, which is in sharp contrast to previous result for the regular lattice with the same average degree, the entropy of which is higher than 1. Thus, the number of spanning trees in the scale-free network is much "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.0267","kind":"arxiv","version":1},"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-18T04:42:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GrvMy9NL79srdRaXiakU8VK/XUje11QBBWowJRzvxf+h4CznrNX3ej0kSodcCWM3ERpnwNXU5z+b/iTW1d1cAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T22:25:46.587869Z"},"content_sha256":"635b4e08bcfd886286eb362513716593fb5764d790c4fd2bf742f7c814652e57","schema_version":"1.0","event_id":"sha256:635b4e08bcfd886286eb362513716593fb5764d790c4fd2bf742f7c814652e57"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LZ52CSZFKHKV44BHVUCYIKVP3O/bundle.json","state_url":"https://pith.science/pith/LZ52CSZFKHKV44BHVUCYIKVP3O/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LZ52CSZFKHKV44BHVUCYIKVP3O/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-27T22:25:46Z","links":{"resolver":"https://pith.science/pith/LZ52CSZFKHKV44BHVUCYIKVP3O","bundle":"https://pith.science/pith/LZ52CSZFKHKV44BHVUCYIKVP3O/bundle.json","state":"https://pith.science/pith/LZ52CSZFKHKV44BHVUCYIKVP3O/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LZ52CSZFKHKV44BHVUCYIKVP3O/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:LZ52CSZFKHKV44BHVUCYIKVP3O","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":"73bac849b6aa10611889852c19fb7567855a3747fc68f120b37a4d5c019e3086","cross_cats_sorted":["math-ph","math.MP","physics.comp-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2010-08-02T09:55:49Z","title_canon_sha256":"cf0d962dbfcb8e77943ee3c7486f77f89783704c649997bcb7f687f9b2f6fc0b"},"schema_version":"1.0","source":{"id":"1008.0267","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.0267","created_at":"2026-05-18T04:42:43Z"},{"alias_kind":"arxiv_version","alias_value":"1008.0267v1","created_at":"2026-05-18T04:42:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.0267","created_at":"2026-05-18T04:42:43Z"},{"alias_kind":"pith_short_12","alias_value":"LZ52CSZFKHKV","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_16","alias_value":"LZ52CSZFKHKV44BH","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_8","alias_value":"LZ52CSZF","created_at":"2026-05-18T12:26:10Z"}],"graph_snapshots":[{"event_id":"sha256:635b4e08bcfd886286eb362513716593fb5764d790c4fd2bf742f7c814652e57","target":"graph","created_at":"2026-05-18T04:42:43Z","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":"Spanning trees are an important quantity characterizing the reliability of a network, however, explicitly determining the number of spanning trees in networks is a theoretical challenge. In this paper, we study the number of spanning trees in a small-world scale-free network and obtain the exact expressions. We find that the entropy of spanning trees in the studied network is less than 1, which is in sharp contrast to previous result for the regular lattice with the same average degree, the entropy of which is higher than 1. Thus, the number of spanning trees in the scale-free network is much ","authors_text":"Bin Wu, Hongxiao Liu, Shuigeng Zhou, Zhongzhi Zhang","cross_cats":["math-ph","math.MP","physics.comp-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2010-08-02T09:55:49Z","title":"Enumeration of spanning trees in a pseudofractal scale-free web"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.0267","kind":"arxiv","version":1},"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:f220976a454aa256b9a4b7cbee6912249a4c78997ed541343ad1455a85926357","target":"record","created_at":"2026-05-18T04:42:43Z","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":"73bac849b6aa10611889852c19fb7567855a3747fc68f120b37a4d5c019e3086","cross_cats_sorted":["math-ph","math.MP","physics.comp-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2010-08-02T09:55:49Z","title_canon_sha256":"cf0d962dbfcb8e77943ee3c7486f77f89783704c649997bcb7f687f9b2f6fc0b"},"schema_version":"1.0","source":{"id":"1008.0267","kind":"arxiv","version":1}},"canonical_sha256":"5e7ba14b2551d55e7027ad05842aafdbbd3454ddb59d21e0545351c7d5e9bff2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5e7ba14b2551d55e7027ad05842aafdbbd3454ddb59d21e0545351c7d5e9bff2","first_computed_at":"2026-05-18T04:42:43.650335Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:42:43.650335Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cJjkufxQHwGeQquHj9ko0HoQCIwJkVCpuygYFbRy0YsN883fzHSOnSwWWAEkFk4QMdZr0/8i0nDagHi4NX26Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:42:43.650939Z","signed_message":"canonical_sha256_bytes"},"source_id":"1008.0267","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f220976a454aa256b9a4b7cbee6912249a4c78997ed541343ad1455a85926357","sha256:635b4e08bcfd886286eb362513716593fb5764d790c4fd2bf742f7c814652e57"],"state_sha256":"e67cc41af529928e93b4743f31509321c1e92238cd945e6a3bb704b74cd4a956"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nEyQARfqaH1Wrni3gtJbP5136Sdz5XJ6L/tjvKw+9NwLKK9Cj+siWNWZTKTjrLMQ1vVI7xU52zM4Cx+BlTEJAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T22:25:46.590695Z","bundle_sha256":"47968db4a1fb4819fbe082b921fbec90580239ab26b78525adf7f0af6488060f"}}