{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:4DK2CU2BFLX4XMHRDBL7C37W2R","short_pith_number":"pith:4DK2CU2B","schema_version":"1.0","canonical_sha256":"e0d5a153412aefcbb0f11857f16ff6d4770582d6dd5fb1463b1581a282f1aa3d","source":{"kind":"arxiv","id":"2506.04993","version":1},"attestation_state":"computed","paper":{"title":"Well-hued graphs with first difference two","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Geoffrey Boyer, Jeremy Lyle, Kirsti Kuenzel, Ryan Pellico","submitted_at":"2025-06-05T13:02:47Z","abstract_excerpt":"A graph $G$ is said to be well-hued if every maximal $k$-colorable subgraph of $G$ has the same order $a_k$. Therefore, if $G$ is well-hued, we can associate with $G$ a sequence $\\{a_k\\}$. Necessary and sufficient conditions were given as to when a sequence $\\{a_k\\}$ is realized by a well-hued graph. Further, it was conjectured there is only one connected well-hued graph with $a_2 = a_1 + 2$ for every $a_1 \\ge 4$. In this paper, we prove this conjecture as well as characterize nearly all well-hued graphs with $a_1=2$. We also investigate when both $G$ and its complement are well-hued."},"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":"2506.04993","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2025-06-05T13:02:47Z","cross_cats_sorted":[],"title_canon_sha256":"323eec148598102ab13f4652614a3e6f4529883e483769969c7592a66acc5729","abstract_canon_sha256":"bd148958089e531af7e972ae04e8938a4861d1574a08d3da5af4ec9d2a05ce0d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:16:40.363822Z","signature_b64":"GzdjtyiCCDTrxtzzQOL7v2F50ECY0JUIgo7aIqObhOgq/r7LF87S42AvUl0PS1uzaeFNR9RLTeXWHx/BpYDzCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e0d5a153412aefcbb0f11857f16ff6d4770582d6dd5fb1463b1581a282f1aa3d","last_reissued_at":"2026-07-05T11:16:40.363320Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:16:40.363320Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Well-hued graphs with first difference two","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Geoffrey Boyer, Jeremy Lyle, Kirsti Kuenzel, Ryan Pellico","submitted_at":"2025-06-05T13:02:47Z","abstract_excerpt":"A graph $G$ is said to be well-hued if every maximal $k$-colorable subgraph of $G$ has the same order $a_k$. Therefore, if $G$ is well-hued, we can associate with $G$ a sequence $\\{a_k\\}$. Necessary and sufficient conditions were given as to when a sequence $\\{a_k\\}$ is realized by a well-hued graph. Further, it was conjectured there is only one connected well-hued graph with $a_2 = a_1 + 2$ for every $a_1 \\ge 4$. In this paper, we prove this conjecture as well as characterize nearly all well-hued graphs with $a_1=2$. We also investigate when both $G$ and its complement are well-hued."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.04993","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2506.04993/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2506.04993","created_at":"2026-07-05T11:16:40.363380+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.04993v1","created_at":"2026-07-05T11:16:40.363380+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.04993","created_at":"2026-07-05T11:16:40.363380+00:00"},{"alias_kind":"pith_short_12","alias_value":"4DK2CU2BFLX4","created_at":"2026-07-05T11:16:40.363380+00:00"},{"alias_kind":"pith_short_16","alias_value":"4DK2CU2BFLX4XMHR","created_at":"2026-07-05T11:16:40.363380+00:00"},{"alias_kind":"pith_short_8","alias_value":"4DK2CU2B","created_at":"2026-07-05T11:16:40.363380+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/4DK2CU2BFLX4XMHRDBL7C37W2R","json":"https://pith.science/pith/4DK2CU2BFLX4XMHRDBL7C37W2R.json","graph_json":"https://pith.science/api/pith-number/4DK2CU2BFLX4XMHRDBL7C37W2R/graph.json","events_json":"https://pith.science/api/pith-number/4DK2CU2BFLX4XMHRDBL7C37W2R/events.json","paper":"https://pith.science/paper/4DK2CU2B"},"agent_actions":{"view_html":"https://pith.science/pith/4DK2CU2BFLX4XMHRDBL7C37W2R","download_json":"https://pith.science/pith/4DK2CU2BFLX4XMHRDBL7C37W2R.json","view_paper":"https://pith.science/paper/4DK2CU2B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.04993&json=true","fetch_graph":"https://pith.science/api/pith-number/4DK2CU2BFLX4XMHRDBL7C37W2R/graph.json","fetch_events":"https://pith.science/api/pith-number/4DK2CU2BFLX4XMHRDBL7C37W2R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4DK2CU2BFLX4XMHRDBL7C37W2R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4DK2CU2BFLX4XMHRDBL7C37W2R/action/storage_attestation","attest_author":"https://pith.science/pith/4DK2CU2BFLX4XMHRDBL7C37W2R/action/author_attestation","sign_citation":"https://pith.science/pith/4DK2CU2BFLX4XMHRDBL7C37W2R/action/citation_signature","submit_replication":"https://pith.science/pith/4DK2CU2BFLX4XMHRDBL7C37W2R/action/replication_record"}},"created_at":"2026-07-05T11:16:40.363380+00:00","updated_at":"2026-07-05T11:16:40.363380+00:00"}