{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:YNXUCVZMPS5P7HVVS7YRODSQKW","short_pith_number":"pith:YNXUCVZM","schema_version":"1.0","canonical_sha256":"c36f41572c7cbaff9eb597f1170e505593bd1931bd13b4736d8e55fcb8aca72f","source":{"kind":"arxiv","id":"1603.09384","version":1},"attestation_state":"computed","paper":{"title":"Regular colorings and factors of regular graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrew J. Uzzell, Anton Bernshteyn, Danny Rorabaugh, Jonathan Rollin, Omid Khormali, Ryan R. Martin, Songling Shan","submitted_at":"2016-03-30T21:07:24Z","abstract_excerpt":"An $(r-1,1)$-coloring of an $r$-regular graph $G$ is an edge coloring such that each vertex is incident to $r-1$ edges of one color and $1$ edge of a different color. In this paper, we completely characterize all $4$-regular pseudographs (graphs that may contain parallel edges and loops) which do not have a $(3,1)$-coloring. An $\\{r-1,1\\}$-factor of an $r$-regular graph is a spanning subgraph in which each vertex has degree either $r-1$ or $1$. We prove various conditions that that must hold for any vertex-minimal $5$-regular pseudographs without $(4,1)$-colorings or without $\\{4,1\\}$-factors."},"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":"1603.09384","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-03-30T21:07:24Z","cross_cats_sorted":[],"title_canon_sha256":"ab6a59e619de77a2ea264dcd7d94e9109c7a6ec5f7f3d8893609439311e29883","abstract_canon_sha256":"e9ffda93170f7e31929efa5846c6c641650d0fc5f57dc90875b48aaf98b10364"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:58.783756Z","signature_b64":"I0GTEl1nKP2PG0hRneP02shWAccgkP1Wv6o639SJQwUr0d0tt5XeR026Mmq/go9Tegyn0qrcvgoS8+mpdWHAAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c36f41572c7cbaff9eb597f1170e505593bd1931bd13b4736d8e55fcb8aca72f","last_reissued_at":"2026-05-18T01:17:58.783080Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:58.783080Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Regular colorings and factors of regular graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrew J. Uzzell, Anton Bernshteyn, Danny Rorabaugh, Jonathan Rollin, Omid Khormali, Ryan R. Martin, Songling Shan","submitted_at":"2016-03-30T21:07:24Z","abstract_excerpt":"An $(r-1,1)$-coloring of an $r$-regular graph $G$ is an edge coloring such that each vertex is incident to $r-1$ edges of one color and $1$ edge of a different color. In this paper, we completely characterize all $4$-regular pseudographs (graphs that may contain parallel edges and loops) which do not have a $(3,1)$-coloring. An $\\{r-1,1\\}$-factor of an $r$-regular graph is a spanning subgraph in which each vertex has degree either $r-1$ or $1$. We prove various conditions that that must hold for any vertex-minimal $5$-regular pseudographs without $(4,1)$-colorings or without $\\{4,1\\}$-factors."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.09384","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":""},"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":"1603.09384","created_at":"2026-05-18T01:17:58.783185+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.09384v1","created_at":"2026-05-18T01:17:58.783185+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.09384","created_at":"2026-05-18T01:17:58.783185+00:00"},{"alias_kind":"pith_short_12","alias_value":"YNXUCVZMPS5P","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_16","alias_value":"YNXUCVZMPS5P7HVV","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_8","alias_value":"YNXUCVZM","created_at":"2026-05-18T12:30:53.716459+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/YNXUCVZMPS5P7HVVS7YRODSQKW","json":"https://pith.science/pith/YNXUCVZMPS5P7HVVS7YRODSQKW.json","graph_json":"https://pith.science/api/pith-number/YNXUCVZMPS5P7HVVS7YRODSQKW/graph.json","events_json":"https://pith.science/api/pith-number/YNXUCVZMPS5P7HVVS7YRODSQKW/events.json","paper":"https://pith.science/paper/YNXUCVZM"},"agent_actions":{"view_html":"https://pith.science/pith/YNXUCVZMPS5P7HVVS7YRODSQKW","download_json":"https://pith.science/pith/YNXUCVZMPS5P7HVVS7YRODSQKW.json","view_paper":"https://pith.science/paper/YNXUCVZM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.09384&json=true","fetch_graph":"https://pith.science/api/pith-number/YNXUCVZMPS5P7HVVS7YRODSQKW/graph.json","fetch_events":"https://pith.science/api/pith-number/YNXUCVZMPS5P7HVVS7YRODSQKW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YNXUCVZMPS5P7HVVS7YRODSQKW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YNXUCVZMPS5P7HVVS7YRODSQKW/action/storage_attestation","attest_author":"https://pith.science/pith/YNXUCVZMPS5P7HVVS7YRODSQKW/action/author_attestation","sign_citation":"https://pith.science/pith/YNXUCVZMPS5P7HVVS7YRODSQKW/action/citation_signature","submit_replication":"https://pith.science/pith/YNXUCVZMPS5P7HVVS7YRODSQKW/action/replication_record"}},"created_at":"2026-05-18T01:17:58.783185+00:00","updated_at":"2026-05-18T01:17:58.783185+00:00"}