{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:QHWMQG6AQHVZXQCEFR7NLYFLBM","short_pith_number":"pith:QHWMQG6A","schema_version":"1.0","canonical_sha256":"81ecc81bc081eb9bc0442c7ed5e0ab0b27f46581704c7e13cd244723152d3635","source":{"kind":"arxiv","id":"1407.8035","version":2},"attestation_state":"computed","paper":{"title":"On Chromatic Number and Minimum Cut","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hossein Hajiabolhassan, Meysam Alishahi","submitted_at":"2014-07-30T13:27:46Z","abstract_excerpt":"For a graph $G$, the tree graph ${\\cal T}_{G,t}$ has all tree subgraphs of $G$ with $t$ vertices as vertex set and two tree subgraphs are neighbors if they are edge-disjoint. Also, the $r^{th}$ cut number of $G$ is the minimum number of edges between parts of a partition of vertex set of $G$ into two parts such that each part has size at least $r$. We show that if $t=(1-o(1))n$ and $n$ is large enough, then for any dense graph $G$ with $n$ vertices, the chromatic number of the tree graph ${\\cal T}_{G,t}$ is equal to the $(n-t+1)^{th}$ cut number of $G$. In particular, as a consequence, we prov"},"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":"1407.8035","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-07-30T13:27:46Z","cross_cats_sorted":[],"title_canon_sha256":"50a9b8abb5b1bbb6c5e7fd71ae6dec8a8304c591df1ce13759208389dfebf23c","abstract_canon_sha256":"822be0b0ab1a6cff78013ffcf3c5ad0ae9fbf989c5453df3e1ced1142192d966"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:25:47.606372Z","signature_b64":"WIuQvr5nXV9d4VJVXJnjhseGLqm4n1+HZaRbpkomQY8++NZYkJbq3d4xqdw7XFfsE5OOcCbdV4IAQkvow+YTDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"81ecc81bc081eb9bc0442c7ed5e0ab0b27f46581704c7e13cd244723152d3635","last_reissued_at":"2026-05-18T01:25:47.605760Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:25:47.605760Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Chromatic Number and Minimum Cut","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hossein Hajiabolhassan, Meysam Alishahi","submitted_at":"2014-07-30T13:27:46Z","abstract_excerpt":"For a graph $G$, the tree graph ${\\cal T}_{G,t}$ has all tree subgraphs of $G$ with $t$ vertices as vertex set and two tree subgraphs are neighbors if they are edge-disjoint. Also, the $r^{th}$ cut number of $G$ is the minimum number of edges between parts of a partition of vertex set of $G$ into two parts such that each part has size at least $r$. We show that if $t=(1-o(1))n$ and $n$ is large enough, then for any dense graph $G$ with $n$ vertices, the chromatic number of the tree graph ${\\cal T}_{G,t}$ is equal to the $(n-t+1)^{th}$ cut number of $G$. In particular, as a consequence, we prov"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.8035","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":"1407.8035","created_at":"2026-05-18T01:25:47.605840+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.8035v2","created_at":"2026-05-18T01:25:47.605840+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.8035","created_at":"2026-05-18T01:25:47.605840+00:00"},{"alias_kind":"pith_short_12","alias_value":"QHWMQG6AQHVZ","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_16","alias_value":"QHWMQG6AQHVZXQCE","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_8","alias_value":"QHWMQG6A","created_at":"2026-05-18T12:28:46.137349+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/QHWMQG6AQHVZXQCEFR7NLYFLBM","json":"https://pith.science/pith/QHWMQG6AQHVZXQCEFR7NLYFLBM.json","graph_json":"https://pith.science/api/pith-number/QHWMQG6AQHVZXQCEFR7NLYFLBM/graph.json","events_json":"https://pith.science/api/pith-number/QHWMQG6AQHVZXQCEFR7NLYFLBM/events.json","paper":"https://pith.science/paper/QHWMQG6A"},"agent_actions":{"view_html":"https://pith.science/pith/QHWMQG6AQHVZXQCEFR7NLYFLBM","download_json":"https://pith.science/pith/QHWMQG6AQHVZXQCEFR7NLYFLBM.json","view_paper":"https://pith.science/paper/QHWMQG6A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.8035&json=true","fetch_graph":"https://pith.science/api/pith-number/QHWMQG6AQHVZXQCEFR7NLYFLBM/graph.json","fetch_events":"https://pith.science/api/pith-number/QHWMQG6AQHVZXQCEFR7NLYFLBM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QHWMQG6AQHVZXQCEFR7NLYFLBM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QHWMQG6AQHVZXQCEFR7NLYFLBM/action/storage_attestation","attest_author":"https://pith.science/pith/QHWMQG6AQHVZXQCEFR7NLYFLBM/action/author_attestation","sign_citation":"https://pith.science/pith/QHWMQG6AQHVZXQCEFR7NLYFLBM/action/citation_signature","submit_replication":"https://pith.science/pith/QHWMQG6AQHVZXQCEFR7NLYFLBM/action/replication_record"}},"created_at":"2026-05-18T01:25:47.605840+00:00","updated_at":"2026-05-18T01:25:47.605840+00:00"}