{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:YTNHFSFA572QHW3T46D7QKL7SO","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":"fed5d7c636ff3feb91c583bd5bbc920f7e8ca3c53981865b5ae3ed508921d9db","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-29T05:46:48Z","title_canon_sha256":"16bd28d921e819dbf1d2fd1be723f820467cfb4d8a6d88b783c5aba7d486884f"},"schema_version":"1.0","source":{"id":"1507.08022","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.08022","created_at":"2026-05-18T00:46:02Z"},{"alias_kind":"arxiv_version","alias_value":"1507.08022v3","created_at":"2026-05-18T00:46:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.08022","created_at":"2026-05-18T00:46:02Z"},{"alias_kind":"pith_short_12","alias_value":"YTNHFSFA572Q","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"YTNHFSFA572QHW3T","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"YTNHFSFA","created_at":"2026-05-18T12:29:52Z"}],"graph_snapshots":[{"event_id":"sha256:5e084552096c850db4f1c785b6ed05cb636d8e6d9b094f75eb22fd286b437008","target":"graph","created_at":"2026-05-18T00:46:02Z","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":"For any graph $G$, let $t(G)$ be the number of spanning trees of $G$, $L(G)$ be the line graph of $G$ and for any non-negative integer $r$, $S_r(G)$ be the graph obtained from $G$ by replacing each edge $e$ by a path of length $r+1$ connecting the two ends of $e$. In this paper we obtain an expression for $t(L(S_r(G)))$ in terms of spanning trees of $G$ by a combinatorial approach. This result generalizes some known results on the relation between $t(L(S_r(G)))$ and $t(G)$ and gives an explicit expression $t(L(S_r(G)))=k^{m+s-n-1}(rk+2)^{m-n+1}t(G)$ if $G$ is of order $n+s$ and size $m+s$ in w","authors_text":"Fengming Dong, Weigen Yan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-29T05:46:48Z","title":"Expression for the Number of Spanning Trees of Line Graphs of Arbitrary Connected Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.08022","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:daab54d64345a477068f8d632fda658e9d2b7648a42d5384ad7f3658aaac61c7","target":"record","created_at":"2026-05-18T00:46:02Z","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":"fed5d7c636ff3feb91c583bd5bbc920f7e8ca3c53981865b5ae3ed508921d9db","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-29T05:46:48Z","title_canon_sha256":"16bd28d921e819dbf1d2fd1be723f820467cfb4d8a6d88b783c5aba7d486884f"},"schema_version":"1.0","source":{"id":"1507.08022","kind":"arxiv","version":3}},"canonical_sha256":"c4da72c8a0eff503db73e787f8297f93929a8da8bf9eeba4e3ce3bbc9710bebd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c4da72c8a0eff503db73e787f8297f93929a8da8bf9eeba4e3ce3bbc9710bebd","first_computed_at":"2026-05-18T00:46:02.836572Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:02.836572Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lZ23Q51OKk88HnV2KKz16R5k9D7diP0MIdg+F4+e7FHMVkgWFSR66/4gMlFbtptdgWVf3ENxZeUe1vNq6TXPBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:02.836983Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.08022","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:daab54d64345a477068f8d632fda658e9d2b7648a42d5384ad7f3658aaac61c7","sha256:5e084552096c850db4f1c785b6ed05cb636d8e6d9b094f75eb22fd286b437008"],"state_sha256":"f6de0324ac80c1e10f1a68aeec7be0fcf8e276ed8a3dd4bdbbcc923684b83c93"}