{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:QHWMQG6AQHVZXQCEFR7NLYFLBM","short_pith_number":"pith:QHWMQG6A","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"},"canonical_sha256":"81ecc81bc081eb9bc0442c7ed5e0ab0b27f46581704c7e13cd244723152d3635","source":{"kind":"arxiv","id":"1407.8035","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:QHWMQG6AQHVZXQCEFR7NLYFLBM","target":"record","payload":{"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"},"canonical_sha256":"81ecc81bc081eb9bc0442c7ed5e0ab0b27f46581704c7e13cd244723152d3635","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"},"source_kind":"arxiv","source_id":"1407.8035","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:25:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eP16npY5nEIw4KYyntHbXYeC0PZ96ixvr8ZbqPrOqVPx7OwgqEep7U5stP98vK4WminVK4es4FnyzzsI30ojBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T20:47:42.637730Z"},"content_sha256":"2612525215a8ab6a589a85dfe3adda4ef20534f0943678c7ab0e7bb170647e0d","schema_version":"1.0","event_id":"sha256:2612525215a8ab6a589a85dfe3adda4ef20534f0943678c7ab0e7bb170647e0d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:QHWMQG6AQHVZXQCEFR7NLYFLBM","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:25:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"omPgJeWJqXNIJ+AwzCjrBItK1SClHYKOva2EZVThFijv+Xs7Pv4QCx3CCbkmnfG+hG/lLZgQIekumlPRUV8gBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T20:47:42.638076Z"},"content_sha256":"cee637cd33ec12ef6c88313d939c883b3a66306a15e28238e0d71c311f12b122","schema_version":"1.0","event_id":"sha256:cee637cd33ec12ef6c88313d939c883b3a66306a15e28238e0d71c311f12b122"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QHWMQG6AQHVZXQCEFR7NLYFLBM/bundle.json","state_url":"https://pith.science/pith/QHWMQG6AQHVZXQCEFR7NLYFLBM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QHWMQG6AQHVZXQCEFR7NLYFLBM/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-02T20:47:42Z","links":{"resolver":"https://pith.science/pith/QHWMQG6AQHVZXQCEFR7NLYFLBM","bundle":"https://pith.science/pith/QHWMQG6AQHVZXQCEFR7NLYFLBM/bundle.json","state":"https://pith.science/pith/QHWMQG6AQHVZXQCEFR7NLYFLBM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QHWMQG6AQHVZXQCEFR7NLYFLBM/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FKCajKZlwHm2bFnhQbB/wqU+R//p6D2Z+hkzO5hp351NSmBEjg1lRw5tnTaSaX6T/ppkYVwrq9eoHV/2SJS+Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T20:47:42.640065Z","bundle_sha256":"e207aca25eb186a047f0207c12a02f6e05e6d46e4ca66f9cf39a2ab91150d8af"}}