{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:APW3F3O5BLPQKTK22UGVJEURQP","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":"1e94b66f8aabbe14a70e251113763df01ca397cb5f07a4602a3fe94153c91e8b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-26T14:51:13Z","title_canon_sha256":"9c3946e70cabe427d1ce007052d496ee85b6ac3e346c0069703b64c8a5e91802"},"schema_version":"1.0","source":{"id":"2605.27111","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.27111","created_at":"2026-05-27T02:05:42Z"},{"alias_kind":"arxiv_version","alias_value":"2605.27111v1","created_at":"2026-05-27T02:05:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.27111","created_at":"2026-05-27T02:05:42Z"},{"alias_kind":"pith_short_12","alias_value":"APW3F3O5BLPQ","created_at":"2026-05-27T02:05:42Z"},{"alias_kind":"pith_short_16","alias_value":"APW3F3O5BLPQKTK2","created_at":"2026-05-27T02:05:42Z"},{"alias_kind":"pith_short_8","alias_value":"APW3F3O5","created_at":"2026-05-27T02:05:42Z"}],"graph_snapshots":[{"event_id":"sha256:57a1902338f0a490b146f7df9348cb9d9c4d057e12a00ea21b07266bea4212bb","target":"graph","created_at":"2026-05-27T02:05:42Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2605.27111/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Let $r$ be a positive integer and $G$ be a graph. The list $r$-hued chromatic number of $G$, denoted by $\\chi_{L,r}(G)$, is the smallest integer $k$, such that for each $k$-list $L$ of $G$, $G$ has an $(L,r)$-coloring. It is proved in [Discrete Math. 306 (16) (2006) 1997-2004] that every tree $G$ satisfies $\\chi_{r}(G)=\\min\\{r,\\Delta(G)\\}+1$. It is known that every cycle graph $C_{n}$ with order $n$ has $\\chi_{L,r}(C_{n})=\\chi_{r}(C_{n})$. The main results are the following:\n  $(1)$ If $G$ is a tree, then $\\chi_{L,r}(G)=\\min\\{r,\\Delta(G)\\}+1$;\n  $(2)$ Let $G$ be a unicyclic graph which is not ","authors_text":"Fengxia Liu, Yu Miao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-26T14:51:13Z","title":"The list r-hued coloring of trees and unicyclic graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.27111","kind":"arxiv","version":1},"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:ce00adebc8d71e93919390104693a14f3c0972e217c6e5889698cf0862cf850e","target":"record","created_at":"2026-05-27T02:05:42Z","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":"1e94b66f8aabbe14a70e251113763df01ca397cb5f07a4602a3fe94153c91e8b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-26T14:51:13Z","title_canon_sha256":"9c3946e70cabe427d1ce007052d496ee85b6ac3e346c0069703b64c8a5e91802"},"schema_version":"1.0","source":{"id":"2605.27111","kind":"arxiv","version":1}},"canonical_sha256":"03edb2eddd0adf054d5ad50d54929183da35e088d6b54636fd57df7a8f0ea8b5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"03edb2eddd0adf054d5ad50d54929183da35e088d6b54636fd57df7a8f0ea8b5","first_computed_at":"2026-05-27T02:05:42.513919Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-27T02:05:42.513919Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"r7bUJ9CRQ10CkHKfFDrLh48Xn7P0gaaltzI1zd/4nGvjkgauuQCt79M84PNX3sJiAB7o3m1YW4Zx7F1e/0cOBw==","signature_status":"signed_v1","signed_at":"2026-05-27T02:05:42.514929Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.27111","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ce00adebc8d71e93919390104693a14f3c0972e217c6e5889698cf0862cf850e","sha256:57a1902338f0a490b146f7df9348cb9d9c4d057e12a00ea21b07266bea4212bb"],"state_sha256":"92e120db6b86c0ee2300a0127f4c23977cf2c48fdcc293598b08fa038a3e2825"}