{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:CO7YXUACKP7AQDSKQSWJHD5BOH","short_pith_number":"pith:CO7YXUAC","schema_version":"1.0","canonical_sha256":"13bf8bd00253fe080e4a84ac938fa171d65be218dacf085de2aad25b06cdbb7a","source":{"kind":"arxiv","id":"1606.06663","version":2},"attestation_state":"computed","paper":{"title":"Contraction of graphs and spanning k-end trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hamed Ghasemian Zoeram","submitted_at":"2016-06-21T17:08:03Z","abstract_excerpt":"A tree with at most k leaves is called k-ended tree, and a tree with exactly k leaves is called k-end tree, where a leaf is a vertex of degree one. Contraction of a graph G along the edge e means deleting the edge e and identifying its end vertices and deleting all edges between every two vertex except one edge to gain again a simple graph and is denoted bye G/e. In this paper we prove some theorems related to a graph and its contraction. For example we prove the following theorem. If G is a connected graph that has a spanning k-end tree and |V (G)| > K + 1 then there exist an edge e such G/e "},"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":"1606.06663","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-06-21T17:08:03Z","cross_cats_sorted":[],"title_canon_sha256":"d5d043784ee50b18636a3a8b2b49292dc5d0d1503d9d391e9b067d33d8e51bda","abstract_canon_sha256":"cab6e4b1a1ee63e76b1b7701c42b7c0b7611dfe0181478e747186f6050ffae11"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:50.882603Z","signature_b64":"mk4ZM4qwtFq741QwOnOcnawT7YGhicwwQe2vJ4cLuM/duSJ1ON5AVMxvKaVZjQodOLLspVWYDW59ymQkToo6Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"13bf8bd00253fe080e4a84ac938fa171d65be218dacf085de2aad25b06cdbb7a","last_reissued_at":"2026-05-18T00:53:50.882194Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:50.882194Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Contraction of graphs and spanning k-end trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hamed Ghasemian Zoeram","submitted_at":"2016-06-21T17:08:03Z","abstract_excerpt":"A tree with at most k leaves is called k-ended tree, and a tree with exactly k leaves is called k-end tree, where a leaf is a vertex of degree one. Contraction of a graph G along the edge e means deleting the edge e and identifying its end vertices and deleting all edges between every two vertex except one edge to gain again a simple graph and is denoted bye G/e. In this paper we prove some theorems related to a graph and its contraction. For example we prove the following theorem. If G is a connected graph that has a spanning k-end tree and |V (G)| > K + 1 then there exist an edge e such G/e "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.06663","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":"1606.06663","created_at":"2026-05-18T00:53:50.882255+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.06663v2","created_at":"2026-05-18T00:53:50.882255+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.06663","created_at":"2026-05-18T00:53:50.882255+00:00"},{"alias_kind":"pith_short_12","alias_value":"CO7YXUACKP7A","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_16","alias_value":"CO7YXUACKP7AQDSK","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_8","alias_value":"CO7YXUAC","created_at":"2026-05-18T12:30:09.641336+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/CO7YXUACKP7AQDSKQSWJHD5BOH","json":"https://pith.science/pith/CO7YXUACKP7AQDSKQSWJHD5BOH.json","graph_json":"https://pith.science/api/pith-number/CO7YXUACKP7AQDSKQSWJHD5BOH/graph.json","events_json":"https://pith.science/api/pith-number/CO7YXUACKP7AQDSKQSWJHD5BOH/events.json","paper":"https://pith.science/paper/CO7YXUAC"},"agent_actions":{"view_html":"https://pith.science/pith/CO7YXUACKP7AQDSKQSWJHD5BOH","download_json":"https://pith.science/pith/CO7YXUACKP7AQDSKQSWJHD5BOH.json","view_paper":"https://pith.science/paper/CO7YXUAC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.06663&json=true","fetch_graph":"https://pith.science/api/pith-number/CO7YXUACKP7AQDSKQSWJHD5BOH/graph.json","fetch_events":"https://pith.science/api/pith-number/CO7YXUACKP7AQDSKQSWJHD5BOH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CO7YXUACKP7AQDSKQSWJHD5BOH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CO7YXUACKP7AQDSKQSWJHD5BOH/action/storage_attestation","attest_author":"https://pith.science/pith/CO7YXUACKP7AQDSKQSWJHD5BOH/action/author_attestation","sign_citation":"https://pith.science/pith/CO7YXUACKP7AQDSKQSWJHD5BOH/action/citation_signature","submit_replication":"https://pith.science/pith/CO7YXUACKP7AQDSKQSWJHD5BOH/action/replication_record"}},"created_at":"2026-05-18T00:53:50.882255+00:00","updated_at":"2026-05-18T00:53:50.882255+00:00"}