{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:YNXUCVZMPS5P7HVVS7YRODSQKW","short_pith_number":"pith:YNXUCVZM","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"},"canonical_sha256":"c36f41572c7cbaff9eb597f1170e505593bd1931bd13b4736d8e55fcb8aca72f","source":{"kind":"arxiv","id":"1603.09384","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.09384","created_at":"2026-05-18T01:17:58Z"},{"alias_kind":"arxiv_version","alias_value":"1603.09384v1","created_at":"2026-05-18T01:17:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.09384","created_at":"2026-05-18T01:17:58Z"},{"alias_kind":"pith_short_12","alias_value":"YNXUCVZMPS5P","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"YNXUCVZMPS5P7HVV","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"YNXUCVZM","created_at":"2026-05-18T12:30:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:YNXUCVZMPS5P7HVVS7YRODSQKW","target":"record","payload":{"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"},"canonical_sha256":"c36f41572c7cbaff9eb597f1170e505593bd1931bd13b4736d8e55fcb8aca72f","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"},"source_kind":"arxiv","source_id":"1603.09384","source_version":1,"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:17:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I2f4iAk5wMH/pQAy2Jfv+RtPzSYHBiYw7Xxbsne6IL1k2b4TklGebRvz2ocOPFcy+4wtrKQQhVAk0ZnxURlhDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T19:05:06.057591Z"},"content_sha256":"21c7250d218855945528dfbb2adbf4900ed2289d76506f2c411e125db6ae9505","schema_version":"1.0","event_id":"sha256:21c7250d218855945528dfbb2adbf4900ed2289d76506f2c411e125db6ae9505"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:YNXUCVZMPS5P7HVVS7YRODSQKW","target":"graph","payload":{"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"},"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:17:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WrP95eOcsCqZI7ECkOhextWxIN2l6LqwKDCBf4dmn1wGwAtRdQQ9VXKywbCX1fGJRtlU5UArIXRFTEdHJYpPBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T19:05:06.058383Z"},"content_sha256":"1ea5d9797caee2b8e39a376bad345b94dbecda0a3b6d451cea238d4e5341b139","schema_version":"1.0","event_id":"sha256:1ea5d9797caee2b8e39a376bad345b94dbecda0a3b6d451cea238d4e5341b139"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YNXUCVZMPS5P7HVVS7YRODSQKW/bundle.json","state_url":"https://pith.science/pith/YNXUCVZMPS5P7HVVS7YRODSQKW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YNXUCVZMPS5P7HVVS7YRODSQKW/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-05-31T19:05:06Z","links":{"resolver":"https://pith.science/pith/YNXUCVZMPS5P7HVVS7YRODSQKW","bundle":"https://pith.science/pith/YNXUCVZMPS5P7HVVS7YRODSQKW/bundle.json","state":"https://pith.science/pith/YNXUCVZMPS5P7HVVS7YRODSQKW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YNXUCVZMPS5P7HVVS7YRODSQKW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:YNXUCVZMPS5P7HVVS7YRODSQKW","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":"e9ffda93170f7e31929efa5846c6c641650d0fc5f57dc90875b48aaf98b10364","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-03-30T21:07:24Z","title_canon_sha256":"ab6a59e619de77a2ea264dcd7d94e9109c7a6ec5f7f3d8893609439311e29883"},"schema_version":"1.0","source":{"id":"1603.09384","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.09384","created_at":"2026-05-18T01:17:58Z"},{"alias_kind":"arxiv_version","alias_value":"1603.09384v1","created_at":"2026-05-18T01:17:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.09384","created_at":"2026-05-18T01:17:58Z"},{"alias_kind":"pith_short_12","alias_value":"YNXUCVZMPS5P","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"YNXUCVZMPS5P7HVV","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"YNXUCVZM","created_at":"2026-05-18T12:30:53Z"}],"graph_snapshots":[{"event_id":"sha256:1ea5d9797caee2b8e39a376bad345b94dbecda0a3b6d451cea238d4e5341b139","target":"graph","created_at":"2026-05-18T01:17:58Z","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":"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.","authors_text":"Andrew J. Uzzell, Anton Bernshteyn, Danny Rorabaugh, Jonathan Rollin, Omid Khormali, Ryan R. Martin, Songling Shan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-03-30T21:07:24Z","title":"Regular colorings and factors of regular graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.09384","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:21c7250d218855945528dfbb2adbf4900ed2289d76506f2c411e125db6ae9505","target":"record","created_at":"2026-05-18T01:17:58Z","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":"e9ffda93170f7e31929efa5846c6c641650d0fc5f57dc90875b48aaf98b10364","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-03-30T21:07:24Z","title_canon_sha256":"ab6a59e619de77a2ea264dcd7d94e9109c7a6ec5f7f3d8893609439311e29883"},"schema_version":"1.0","source":{"id":"1603.09384","kind":"arxiv","version":1}},"canonical_sha256":"c36f41572c7cbaff9eb597f1170e505593bd1931bd13b4736d8e55fcb8aca72f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c36f41572c7cbaff9eb597f1170e505593bd1931bd13b4736d8e55fcb8aca72f","first_computed_at":"2026-05-18T01:17:58.783080Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:17:58.783080Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"I0GTEl1nKP2PG0hRneP02shWAccgkP1Wv6o639SJQwUr0d0tt5XeR026Mmq/go9Tegyn0qrcvgoS8+mpdWHAAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:17:58.783756Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.09384","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:21c7250d218855945528dfbb2adbf4900ed2289d76506f2c411e125db6ae9505","sha256:1ea5d9797caee2b8e39a376bad345b94dbecda0a3b6d451cea238d4e5341b139"],"state_sha256":"33f263cfdecd8e29d072cecdd951a533b11d80b1382d76f557e70aff00e15ab6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kSpIghT11HLaL69xNk91GsYRWNUM4lysdmDlWsmxI+VSCy1Cp6yBh8mk8HmK8aswgu6t/52HzfQFdkA6ArxOAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T19:05:06.062953Z","bundle_sha256":"bb6ce09554dd725b7c67024a13bb9f9fa1c5f626249abf854325963d6b8f7615"}}