{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:L7R5GXTTMC6JJTW33UJSPA4HFM","short_pith_number":"pith:L7R5GXTT","canonical_record":{"source":{"id":"1507.06389","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-23T05:50:15Z","cross_cats_sorted":[],"title_canon_sha256":"b2b1b78a03188567a929bc0190b50a9d074ee156c17cb4313c091f49e087160d","abstract_canon_sha256":"474a74f9a4f6ef7b4eeb174f61b12281caeca8e1376e7f45ecc57b180242dcff"},"schema_version":"1.0"},"canonical_sha256":"5fe3d35e7360bc94cedbdd132783872b38286d39e79512fef1e22dbca9b9d3d9","source":{"kind":"arxiv","id":"1507.06389","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.06389","created_at":"2026-05-18T01:36:07Z"},{"alias_kind":"arxiv_version","alias_value":"1507.06389v2","created_at":"2026-05-18T01:36:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.06389","created_at":"2026-05-18T01:36:07Z"},{"alias_kind":"pith_short_12","alias_value":"L7R5GXTTMC6J","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"L7R5GXTTMC6JJTW3","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"L7R5GXTT","created_at":"2026-05-18T12:29:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:L7R5GXTTMC6JJTW33UJSPA4HFM","target":"record","payload":{"canonical_record":{"source":{"id":"1507.06389","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-23T05:50:15Z","cross_cats_sorted":[],"title_canon_sha256":"b2b1b78a03188567a929bc0190b50a9d074ee156c17cb4313c091f49e087160d","abstract_canon_sha256":"474a74f9a4f6ef7b4eeb174f61b12281caeca8e1376e7f45ecc57b180242dcff"},"schema_version":"1.0"},"canonical_sha256":"5fe3d35e7360bc94cedbdd132783872b38286d39e79512fef1e22dbca9b9d3d9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:07.866300Z","signature_b64":"pr8oNRUy+P+X17guO22VpMvnBxvqUjcrL2ksPcYKzMLA7BhgXivLWH7qyGbM3LV4tVREwVDkQQa5Vgu/56CqAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5fe3d35e7360bc94cedbdd132783872b38286d39e79512fef1e22dbca9b9d3d9","last_reissued_at":"2026-05-18T01:36:07.865470Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:07.865470Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.06389","source_version":2,"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-18T01:36:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BdFu7lRg6KlS7a9dF/FV65L1db9vWJKGUzrlKsgNLikeGO/cLIVIvtw8WyVDn1/dStvvGvznEch87yDmFgHLCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T01:36:29.516735Z"},"content_sha256":"93ca3fb727e391ad4e425135c97e7d5a9f4028533b7c2eb4291d5e62cc23385d","schema_version":"1.0","event_id":"sha256:93ca3fb727e391ad4e425135c97e7d5a9f4028533b7c2eb4291d5e62cc23385d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:L7R5GXTTMC6JJTW33UJSPA4HFM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A formula for the number of the spanning trees of line graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Helin Gong, Xian'an Jin","submitted_at":"2015-07-23T05:50:15Z","abstract_excerpt":"Let $G=(V,E)$ be a loopless graph and $\\mathcal{T}(G)$ be the set of all spanning trees of $G$. Let $L(G)$ be the line graph of the graph $G$ and $t(L(G))$ be the number of spanning trees of $L(G)$. Then, by using techniques from electrical networks, we obtain the following formula: $$ t(L(G)) = \\frac{1}{\\prod_{v\\in V}d^2(v)}\\sum_{T\\subseteq \\mathcal{T}(G)}\\big[\\prod_{e = xy\\in T}d(x)d(y)\\big]\\big[\\prod_{e = uv\\in E\\backslash T}[d(u)+d(v)]\\big]. $$ As a result, we provide a very simple and different proof of the formula on the number of spanning trees of some irregular line graphs, and give a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.06389","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"},"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-18T01:36:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K6wRrPTeiINFf0sDuOHlGrz7I3iVHOHvIeXWH9154Iwykiw8q5M7SrHr3sWb+Yo2LAmt8vLrSwXeMIBWNEgYBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T01:36:29.517110Z"},"content_sha256":"18514e9b27dd65e8d61215899b8b14acd09185e0a195a94f0056f1c160eb1d68","schema_version":"1.0","event_id":"sha256:18514e9b27dd65e8d61215899b8b14acd09185e0a195a94f0056f1c160eb1d68"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/L7R5GXTTMC6JJTW33UJSPA4HFM/bundle.json","state_url":"https://pith.science/pith/L7R5GXTTMC6JJTW33UJSPA4HFM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/L7R5GXTTMC6JJTW33UJSPA4HFM/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-29T01:36:29Z","links":{"resolver":"https://pith.science/pith/L7R5GXTTMC6JJTW33UJSPA4HFM","bundle":"https://pith.science/pith/L7R5GXTTMC6JJTW33UJSPA4HFM/bundle.json","state":"https://pith.science/pith/L7R5GXTTMC6JJTW33UJSPA4HFM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/L7R5GXTTMC6JJTW33UJSPA4HFM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:L7R5GXTTMC6JJTW33UJSPA4HFM","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":"474a74f9a4f6ef7b4eeb174f61b12281caeca8e1376e7f45ecc57b180242dcff","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-23T05:50:15Z","title_canon_sha256":"b2b1b78a03188567a929bc0190b50a9d074ee156c17cb4313c091f49e087160d"},"schema_version":"1.0","source":{"id":"1507.06389","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.06389","created_at":"2026-05-18T01:36:07Z"},{"alias_kind":"arxiv_version","alias_value":"1507.06389v2","created_at":"2026-05-18T01:36:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.06389","created_at":"2026-05-18T01:36:07Z"},{"alias_kind":"pith_short_12","alias_value":"L7R5GXTTMC6J","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"L7R5GXTTMC6JJTW3","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"L7R5GXTT","created_at":"2026-05-18T12:29:29Z"}],"graph_snapshots":[{"event_id":"sha256:18514e9b27dd65e8d61215899b8b14acd09185e0a195a94f0056f1c160eb1d68","target":"graph","created_at":"2026-05-18T01:36:07Z","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":"Let $G=(V,E)$ be a loopless graph and $\\mathcal{T}(G)$ be the set of all spanning trees of $G$. Let $L(G)$ be the line graph of the graph $G$ and $t(L(G))$ be the number of spanning trees of $L(G)$. Then, by using techniques from electrical networks, we obtain the following formula: $$ t(L(G)) = \\frac{1}{\\prod_{v\\in V}d^2(v)}\\sum_{T\\subseteq \\mathcal{T}(G)}\\big[\\prod_{e = xy\\in T}d(x)d(y)\\big]\\big[\\prod_{e = uv\\in E\\backslash T}[d(u)+d(v)]\\big]. $$ As a result, we provide a very simple and different proof of the formula on the number of spanning trees of some irregular line graphs, and give a ","authors_text":"Helin Gong, Xian'an Jin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-23T05:50:15Z","title":"A formula for the number of the spanning trees of line graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.06389","kind":"arxiv","version":2},"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:93ca3fb727e391ad4e425135c97e7d5a9f4028533b7c2eb4291d5e62cc23385d","target":"record","created_at":"2026-05-18T01:36:07Z","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":"474a74f9a4f6ef7b4eeb174f61b12281caeca8e1376e7f45ecc57b180242dcff","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-23T05:50:15Z","title_canon_sha256":"b2b1b78a03188567a929bc0190b50a9d074ee156c17cb4313c091f49e087160d"},"schema_version":"1.0","source":{"id":"1507.06389","kind":"arxiv","version":2}},"canonical_sha256":"5fe3d35e7360bc94cedbdd132783872b38286d39e79512fef1e22dbca9b9d3d9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5fe3d35e7360bc94cedbdd132783872b38286d39e79512fef1e22dbca9b9d3d9","first_computed_at":"2026-05-18T01:36:07.865470Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:36:07.865470Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pr8oNRUy+P+X17guO22VpMvnBxvqUjcrL2ksPcYKzMLA7BhgXivLWH7qyGbM3LV4tVREwVDkQQa5Vgu/56CqAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:36:07.866300Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.06389","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:93ca3fb727e391ad4e425135c97e7d5a9f4028533b7c2eb4291d5e62cc23385d","sha256:18514e9b27dd65e8d61215899b8b14acd09185e0a195a94f0056f1c160eb1d68"],"state_sha256":"2a61fe45b4c22b37aaf721bebc2a15857ae9ba544e05d4883d4f18738f38746b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xumg2i83aZCqb3ub8UwMv/hVVbCf7ouj+zwJUkHgxph5VueLkYOm0QYKgmcbKO+I4zK2Ezv1toFbzWVLvHbtDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T01:36:29.518990Z","bundle_sha256":"e15e2d24acc7b50b0b5ab6a8af3361209442594ecd9c1e8ef2531b02059538a1"}}