{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:QHWMQG6AQHVZXQCEFR7NLYFLBM","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":"822be0b0ab1a6cff78013ffcf3c5ad0ae9fbf989c5453df3e1ced1142192d966","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-07-30T13:27:46Z","title_canon_sha256":"50a9b8abb5b1bbb6c5e7fd71ae6dec8a8304c591df1ce13759208389dfebf23c"},"schema_version":"1.0","source":{"id":"1407.8035","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.8035","created_at":"2026-05-18T01:25:47Z"},{"alias_kind":"arxiv_version","alias_value":"1407.8035v2","created_at":"2026-05-18T01:25:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.8035","created_at":"2026-05-18T01:25:47Z"},{"alias_kind":"pith_short_12","alias_value":"QHWMQG6AQHVZ","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"QHWMQG6AQHVZXQCE","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"QHWMQG6A","created_at":"2026-05-18T12:28:46Z"}],"graph_snapshots":[{"event_id":"sha256:cee637cd33ec12ef6c88313d939c883b3a66306a15e28238e0d71c311f12b122","target":"graph","created_at":"2026-05-18T01:25:47Z","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 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","authors_text":"Hossein Hajiabolhassan, Meysam Alishahi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-07-30T13:27:46Z","title":"On Chromatic Number and Minimum Cut"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.8035","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:2612525215a8ab6a589a85dfe3adda4ef20534f0943678c7ab0e7bb170647e0d","target":"record","created_at":"2026-05-18T01:25:47Z","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":"822be0b0ab1a6cff78013ffcf3c5ad0ae9fbf989c5453df3e1ced1142192d966","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-07-30T13:27:46Z","title_canon_sha256":"50a9b8abb5b1bbb6c5e7fd71ae6dec8a8304c591df1ce13759208389dfebf23c"},"schema_version":"1.0","source":{"id":"1407.8035","kind":"arxiv","version":2}},"canonical_sha256":"81ecc81bc081eb9bc0442c7ed5e0ab0b27f46581704c7e13cd244723152d3635","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"81ecc81bc081eb9bc0442c7ed5e0ab0b27f46581704c7e13cd244723152d3635","first_computed_at":"2026-05-18T01:25:47.605760Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:25:47.605760Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WIuQvr5nXV9d4VJVXJnjhseGLqm4n1+HZaRbpkomQY8++NZYkJbq3d4xqdw7XFfsE5OOcCbdV4IAQkvow+YTDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:25:47.606372Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.8035","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2612525215a8ab6a589a85dfe3adda4ef20534f0943678c7ab0e7bb170647e0d","sha256:cee637cd33ec12ef6c88313d939c883b3a66306a15e28238e0d71c311f12b122"],"state_sha256":"d04ecea0ff906f2c36355c6c041484b7b5e59263517110f25c87e136686c7530"}