{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:QIQOAK4ZFSD53JBMUDH4O4WYH6","short_pith_number":"pith:QIQOAK4Z","schema_version":"1.0","canonical_sha256":"8220e02b992c87dda42ca0cfc772d83fb42b0bae6c12397b70c1d65af2c3ac68","source":{"kind":"arxiv","id":"1907.07376","version":1},"attestation_state":"computed","paper":{"title":"Formulas counting spanning trees in line graphs and their extensions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Fengming Dong","submitted_at":"2019-07-17T08:03:04Z","abstract_excerpt":"For any connected multigraph $G=(V,E)$ and any $M\\subseteq E$, if $M$ induces an acyclic subgraph of $G$ and removing all edges in $M$ yields a subgraph of $G$ whose components are complete graphs, a formula for $\\tau_G(M)$ is obtained, where $\\tau_G(M)$ is the number of spanning trees in $G$ which contain all edges in $M$. Applying this result, we can easily obtain a formula for the number of spanning trees in the line graph or the middle graph of an arbitrary graph. Applying this result, we also show that for any connected graph $G$ with a clique $U$ which is a cut-set of $G$, the number of "},"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":"1907.07376","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-17T08:03:04Z","cross_cats_sorted":[],"title_canon_sha256":"5765b6205c264c4d77a700e26d6a3f25b433daa40aec73e4531300d79a259cfe","abstract_canon_sha256":"b05bbb92cc3a775504826f38cbe64fa9044558547f0ac0cec08a4b7bb965193f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:22.439902Z","signature_b64":"YnyOCyBB4LkYVznF9xovfuiIbUtpNQ/rrZE+U12N0IpjSixK22CUzYEpP9xYXTN2dIin3n7dsVRBTJAsGXdrCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8220e02b992c87dda42ca0cfc772d83fb42b0bae6c12397b70c1d65af2c3ac68","last_reissued_at":"2026-05-17T23:40:22.439244Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:22.439244Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Formulas counting spanning trees in line graphs and their extensions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Fengming Dong","submitted_at":"2019-07-17T08:03:04Z","abstract_excerpt":"For any connected multigraph $G=(V,E)$ and any $M\\subseteq E$, if $M$ induces an acyclic subgraph of $G$ and removing all edges in $M$ yields a subgraph of $G$ whose components are complete graphs, a formula for $\\tau_G(M)$ is obtained, where $\\tau_G(M)$ is the number of spanning trees in $G$ which contain all edges in $M$. Applying this result, we can easily obtain a formula for the number of spanning trees in the line graph or the middle graph of an arbitrary graph. Applying this result, we also show that for any connected graph $G$ with a clique $U$ which is a cut-set of $G$, the number of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.07376","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1907.07376","created_at":"2026-05-17T23:40:22.439333+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.07376v1","created_at":"2026-05-17T23:40:22.439333+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.07376","created_at":"2026-05-17T23:40:22.439333+00:00"},{"alias_kind":"pith_short_12","alias_value":"QIQOAK4ZFSD5","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_16","alias_value":"QIQOAK4ZFSD53JBM","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_8","alias_value":"QIQOAK4Z","created_at":"2026-05-18T12:33:27.125529+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/QIQOAK4ZFSD53JBMUDH4O4WYH6","json":"https://pith.science/pith/QIQOAK4ZFSD53JBMUDH4O4WYH6.json","graph_json":"https://pith.science/api/pith-number/QIQOAK4ZFSD53JBMUDH4O4WYH6/graph.json","events_json":"https://pith.science/api/pith-number/QIQOAK4ZFSD53JBMUDH4O4WYH6/events.json","paper":"https://pith.science/paper/QIQOAK4Z"},"agent_actions":{"view_html":"https://pith.science/pith/QIQOAK4ZFSD53JBMUDH4O4WYH6","download_json":"https://pith.science/pith/QIQOAK4ZFSD53JBMUDH4O4WYH6.json","view_paper":"https://pith.science/paper/QIQOAK4Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.07376&json=true","fetch_graph":"https://pith.science/api/pith-number/QIQOAK4ZFSD53JBMUDH4O4WYH6/graph.json","fetch_events":"https://pith.science/api/pith-number/QIQOAK4ZFSD53JBMUDH4O4WYH6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QIQOAK4ZFSD53JBMUDH4O4WYH6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QIQOAK4ZFSD53JBMUDH4O4WYH6/action/storage_attestation","attest_author":"https://pith.science/pith/QIQOAK4ZFSD53JBMUDH4O4WYH6/action/author_attestation","sign_citation":"https://pith.science/pith/QIQOAK4ZFSD53JBMUDH4O4WYH6/action/citation_signature","submit_replication":"https://pith.science/pith/QIQOAK4ZFSD53JBMUDH4O4WYH6/action/replication_record"}},"created_at":"2026-05-17T23:40:22.439333+00:00","updated_at":"2026-05-17T23:40:22.439333+00:00"}