{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:GEKRZTHQXWHU4OZADNEJ4PLEZU","short_pith_number":"pith:GEKRZTHQ","canonical_record":{"source":{"id":"1201.4228","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2012-01-20T08:27:44Z","cross_cats_sorted":[],"title_canon_sha256":"e40bdf938ac3f50b452c769faf10008119317aae95e02e603078b0a7ffda96c7","abstract_canon_sha256":"eaa0dc3d982914226032a942174380aeff7c2d7ae90249c272194af9be8db652"},"schema_version":"1.0"},"canonical_sha256":"31151cccf0bd8f4e3b201b489e3d64cd04f9ae901ec0900f3083421089643d82","source":{"kind":"arxiv","id":"1201.4228","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.4228","created_at":"2026-05-18T03:57:26Z"},{"alias_kind":"arxiv_version","alias_value":"1201.4228v1","created_at":"2026-05-18T03:57:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.4228","created_at":"2026-05-18T03:57:26Z"},{"alias_kind":"pith_short_12","alias_value":"GEKRZTHQXWHU","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"GEKRZTHQXWHU4OZA","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"GEKRZTHQ","created_at":"2026-05-18T12:27:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:GEKRZTHQXWHU4OZADNEJ4PLEZU","target":"record","payload":{"canonical_record":{"source":{"id":"1201.4228","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2012-01-20T08:27:44Z","cross_cats_sorted":[],"title_canon_sha256":"e40bdf938ac3f50b452c769faf10008119317aae95e02e603078b0a7ffda96c7","abstract_canon_sha256":"eaa0dc3d982914226032a942174380aeff7c2d7ae90249c272194af9be8db652"},"schema_version":"1.0"},"canonical_sha256":"31151cccf0bd8f4e3b201b489e3d64cd04f9ae901ec0900f3083421089643d82","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:57:26.600678Z","signature_b64":"ccDnqRhuCRusbQjzorwl4+8P4Io+cXEp5ko2IUXPUfHItHJMRJFlztAk09d1tNWP87A54I3cI2wTdd5Nx06eAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"31151cccf0bd8f4e3b201b489e3d64cd04f9ae901ec0900f3083421089643d82","last_reissued_at":"2026-05-18T03:57:26.599853Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:57:26.599853Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1201.4228","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-18T03:57:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JXfx0HGXQGMmtsGXnVqoGjCLNHIMpkUGAvtu1bURc7heqkzK3Cyzth/3Ml7ZbJE6tF1fRRW6bJcT0oF5JItQAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T17:45:08.700907Z"},"content_sha256":"8a9a1d93f4cefc6c2a6759cf2816079842ab33f3eb82b4f66414400da916c2b1","schema_version":"1.0","event_id":"sha256:8a9a1d93f4cefc6c2a6759cf2816079842ab33f3eb82b4f66414400da916c2b1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:GEKRZTHQXWHU4OZADNEJ4PLEZU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Counting spanning trees in a small-world Farey graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cond-mat.stat-mech","authors_text":"Bin Wu, Yuan Lin, Zhongzhi Zhang","submitted_at":"2012-01-20T08:27:44Z","abstract_excerpt":"The problem of spanning trees is closely related to various interesting problems in the area of statistical physics, but determining the number of spanning trees in general networks is computationally intractable. In this paper, we perform a study on the enumeration of spanning trees in a specific small-world network with an exponential distribution of vertex degrees, which is called a Farey graph since it is associated with the famous Farey sequence. According to the particular network structure, we provide some recursive relations governing the Laplacian characteristic polynomials of a Farey"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.4228","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-18T03:57:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gjJ7EhacaeHZeUjSip2NFlYcNTPLsVUb6/v9igbM3c1Aqoqo8kd2QW3Lkyr6pY8PYCapIbTeC2QhTl/DxvZ2Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T17:45:08.701666Z"},"content_sha256":"b4cc1feae94cf72b0aaaccd33a842fca90dbbae20f754ca974cad8cb21777b26","schema_version":"1.0","event_id":"sha256:b4cc1feae94cf72b0aaaccd33a842fca90dbbae20f754ca974cad8cb21777b26"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GEKRZTHQXWHU4OZADNEJ4PLEZU/bundle.json","state_url":"https://pith.science/pith/GEKRZTHQXWHU4OZADNEJ4PLEZU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GEKRZTHQXWHU4OZADNEJ4PLEZU/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-25T17:45:08Z","links":{"resolver":"https://pith.science/pith/GEKRZTHQXWHU4OZADNEJ4PLEZU","bundle":"https://pith.science/pith/GEKRZTHQXWHU4OZADNEJ4PLEZU/bundle.json","state":"https://pith.science/pith/GEKRZTHQXWHU4OZADNEJ4PLEZU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GEKRZTHQXWHU4OZADNEJ4PLEZU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:GEKRZTHQXWHU4OZADNEJ4PLEZU","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":"eaa0dc3d982914226032a942174380aeff7c2d7ae90249c272194af9be8db652","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2012-01-20T08:27:44Z","title_canon_sha256":"e40bdf938ac3f50b452c769faf10008119317aae95e02e603078b0a7ffda96c7"},"schema_version":"1.0","source":{"id":"1201.4228","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.4228","created_at":"2026-05-18T03:57:26Z"},{"alias_kind":"arxiv_version","alias_value":"1201.4228v1","created_at":"2026-05-18T03:57:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.4228","created_at":"2026-05-18T03:57:26Z"},{"alias_kind":"pith_short_12","alias_value":"GEKRZTHQXWHU","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"GEKRZTHQXWHU4OZA","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"GEKRZTHQ","created_at":"2026-05-18T12:27:06Z"}],"graph_snapshots":[{"event_id":"sha256:b4cc1feae94cf72b0aaaccd33a842fca90dbbae20f754ca974cad8cb21777b26","target":"graph","created_at":"2026-05-18T03:57:26Z","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":"The problem of spanning trees is closely related to various interesting problems in the area of statistical physics, but determining the number of spanning trees in general networks is computationally intractable. In this paper, we perform a study on the enumeration of spanning trees in a specific small-world network with an exponential distribution of vertex degrees, which is called a Farey graph since it is associated with the famous Farey sequence. According to the particular network structure, we provide some recursive relations governing the Laplacian characteristic polynomials of a Farey","authors_text":"Bin Wu, Yuan Lin, Zhongzhi Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2012-01-20T08:27:44Z","title":"Counting spanning trees in a small-world Farey graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.4228","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:8a9a1d93f4cefc6c2a6759cf2816079842ab33f3eb82b4f66414400da916c2b1","target":"record","created_at":"2026-05-18T03:57:26Z","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":"eaa0dc3d982914226032a942174380aeff7c2d7ae90249c272194af9be8db652","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2012-01-20T08:27:44Z","title_canon_sha256":"e40bdf938ac3f50b452c769faf10008119317aae95e02e603078b0a7ffda96c7"},"schema_version":"1.0","source":{"id":"1201.4228","kind":"arxiv","version":1}},"canonical_sha256":"31151cccf0bd8f4e3b201b489e3d64cd04f9ae901ec0900f3083421089643d82","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"31151cccf0bd8f4e3b201b489e3d64cd04f9ae901ec0900f3083421089643d82","first_computed_at":"2026-05-18T03:57:26.599853Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:57:26.599853Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ccDnqRhuCRusbQjzorwl4+8P4Io+cXEp5ko2IUXPUfHItHJMRJFlztAk09d1tNWP87A54I3cI2wTdd5Nx06eAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:57:26.600678Z","signed_message":"canonical_sha256_bytes"},"source_id":"1201.4228","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8a9a1d93f4cefc6c2a6759cf2816079842ab33f3eb82b4f66414400da916c2b1","sha256:b4cc1feae94cf72b0aaaccd33a842fca90dbbae20f754ca974cad8cb21777b26"],"state_sha256":"83dfe765a7049cf762c4868c9efa4398eed2b6f61ebc613e8bb632eb39b0ad72"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KfmrsMd1y3c0LxcoxWzm1IOSpSvjxTVSEXGT31D7blRVl6c87qUeaMrbyGUMWnCFZbja/5f+ZDczRZ9GcrTBAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T17:45:08.705677Z","bundle_sha256":"e7edc46fdf0554f672d8e514028a775d654835bf7ebf5061725f45e0304edf8d"}}