{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:EAWTA22ZPS4VPGLS53LEH23BBR","short_pith_number":"pith:EAWTA22Z","schema_version":"1.0","canonical_sha256":"202d306b597cb9579972eed643eb610c7a3c0249ed4063a7ad50f391489dec01","source":{"kind":"arxiv","id":"1105.0565","version":2},"attestation_state":"computed","paper":{"title":"Counting spanning trees in self-similar networks by evaluating determinants","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cond-mat.stat-mech","authors_text":"Bin Wu, Guanrong Chen, Yuan Lin, Zhongzhi Zhang","submitted_at":"2011-05-03T12:32:55Z","abstract_excerpt":"Spanning trees are relevant to various aspects of networks. Generally, the number of spanning trees in a network can be obtained by computing a related determinant of the Laplacian matrix of the network. However, for a large generic network, evaluating the relevant determinant is computationally intractable. In this paper, we develop a fairly generic technique for computing determinants corresponding to self-similar networks, thereby providing a method to determine the numbers of spanning trees in networks exhibiting self-similarity. We describe the computation process with a family of network"},"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":"1105.0565","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2011-05-03T12:32:55Z","cross_cats_sorted":[],"title_canon_sha256":"e284de8154369574585896bdd672c4ee2e5aa5d58998274d781f7863d34999d5","abstract_canon_sha256":"5c0bbb7dee20e3d70e0b8078f86c8d852b6ffd27f50f09f13631ec2bb767498e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:08:12.464652Z","signature_b64":"nVKauShphaZfwgOmV+fL9lcPb2oDmZlVn/FLsKDEkv3lI0JAT8k3sbgKHIvdenFYDHuHJkkvtqqRj1FS79orAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"202d306b597cb9579972eed643eb610c7a3c0249ed4063a7ad50f391489dec01","last_reissued_at":"2026-05-18T04:08:12.464122Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:08:12.464122Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Counting spanning trees in self-similar networks by evaluating determinants","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cond-mat.stat-mech","authors_text":"Bin Wu, Guanrong Chen, Yuan Lin, Zhongzhi Zhang","submitted_at":"2011-05-03T12:32:55Z","abstract_excerpt":"Spanning trees are relevant to various aspects of networks. Generally, the number of spanning trees in a network can be obtained by computing a related determinant of the Laplacian matrix of the network. However, for a large generic network, evaluating the relevant determinant is computationally intractable. In this paper, we develop a fairly generic technique for computing determinants corresponding to self-similar networks, thereby providing a method to determine the numbers of spanning trees in networks exhibiting self-similarity. We describe the computation process with a family of network"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.0565","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":"1105.0565","created_at":"2026-05-18T04:08:12.464212+00:00"},{"alias_kind":"arxiv_version","alias_value":"1105.0565v2","created_at":"2026-05-18T04:08:12.464212+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.0565","created_at":"2026-05-18T04:08:12.464212+00:00"},{"alias_kind":"pith_short_12","alias_value":"EAWTA22ZPS4V","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_16","alias_value":"EAWTA22ZPS4VPGLS","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_8","alias_value":"EAWTA22Z","created_at":"2026-05-18T12:26:26.731475+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/EAWTA22ZPS4VPGLS53LEH23BBR","json":"https://pith.science/pith/EAWTA22ZPS4VPGLS53LEH23BBR.json","graph_json":"https://pith.science/api/pith-number/EAWTA22ZPS4VPGLS53LEH23BBR/graph.json","events_json":"https://pith.science/api/pith-number/EAWTA22ZPS4VPGLS53LEH23BBR/events.json","paper":"https://pith.science/paper/EAWTA22Z"},"agent_actions":{"view_html":"https://pith.science/pith/EAWTA22ZPS4VPGLS53LEH23BBR","download_json":"https://pith.science/pith/EAWTA22ZPS4VPGLS53LEH23BBR.json","view_paper":"https://pith.science/paper/EAWTA22Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1105.0565&json=true","fetch_graph":"https://pith.science/api/pith-number/EAWTA22ZPS4VPGLS53LEH23BBR/graph.json","fetch_events":"https://pith.science/api/pith-number/EAWTA22ZPS4VPGLS53LEH23BBR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EAWTA22ZPS4VPGLS53LEH23BBR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EAWTA22ZPS4VPGLS53LEH23BBR/action/storage_attestation","attest_author":"https://pith.science/pith/EAWTA22ZPS4VPGLS53LEH23BBR/action/author_attestation","sign_citation":"https://pith.science/pith/EAWTA22ZPS4VPGLS53LEH23BBR/action/citation_signature","submit_replication":"https://pith.science/pith/EAWTA22ZPS4VPGLS53LEH23BBR/action/replication_record"}},"created_at":"2026-05-18T04:08:12.464212+00:00","updated_at":"2026-05-18T04:08:12.464212+00:00"}