{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:6D227I3DEQVB4GA7KHYWDFGEB7","short_pith_number":"pith:6D227I3D","canonical_record":{"source":{"id":"1707.05417","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-07-18T00:08:26Z","cross_cats_sorted":[],"title_canon_sha256":"f964a66c6a2a8f7e661c27448741f9d7c118bb6d8f2d3256cc62c1fa883d4c4f","abstract_canon_sha256":"16b9dfb39ac6a885ff17548a5250f5e759316e28fd0c2bb7a7ecc8a87f12c716"},"schema_version":"1.0"},"canonical_sha256":"f0f5afa363242a1e181f51f16194c40fe4169543461285f8eaffe21f2b6194b8","source":{"kind":"arxiv","id":"1707.05417","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.05417","created_at":"2026-05-18T00:40:02Z"},{"alias_kind":"arxiv_version","alias_value":"1707.05417v1","created_at":"2026-05-18T00:40:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.05417","created_at":"2026-05-18T00:40:02Z"},{"alias_kind":"pith_short_12","alias_value":"6D227I3DEQVB","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6D227I3DEQVB4GA7","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6D227I3D","created_at":"2026-05-18T12:31:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:6D227I3DEQVB4GA7KHYWDFGEB7","target":"record","payload":{"canonical_record":{"source":{"id":"1707.05417","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-07-18T00:08:26Z","cross_cats_sorted":[],"title_canon_sha256":"f964a66c6a2a8f7e661c27448741f9d7c118bb6d8f2d3256cc62c1fa883d4c4f","abstract_canon_sha256":"16b9dfb39ac6a885ff17548a5250f5e759316e28fd0c2bb7a7ecc8a87f12c716"},"schema_version":"1.0"},"canonical_sha256":"f0f5afa363242a1e181f51f16194c40fe4169543461285f8eaffe21f2b6194b8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:02.404852Z","signature_b64":"ssj0HkC4BGlIRHuEy5FGJIqCjUDOQzFZtMMjStZChBYbrVH8fRQdUGxctGIMbd++AD9LsLsIGjda4yo2cMwTCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f0f5afa363242a1e181f51f16194c40fe4169543461285f8eaffe21f2b6194b8","last_reissued_at":"2026-05-18T00:40:02.404398Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:02.404398Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.05417","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-18T00:40:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y83/q95sPIXfj5Td9JyJUY2WUcz8+9aTh3KBHTGI03gs3gm4ekuyt5wXmZbyi1SHu08DpsqQkCiAMAJATBSSCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T02:43:57.112016Z"},"content_sha256":"a56adedeb2497091c032a7a45cbfe7020045a653666a5a6f2f43ecc32d4ccb3f","schema_version":"1.0","event_id":"sha256:a56adedeb2497091c032a7a45cbfe7020045a653666a5a6f2f43ecc32d4ccb3f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:6D227I3DEQVB4GA7KHYWDFGEB7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"List Supermodular Coloring with Shorter Lists","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Yu Yokoi","submitted_at":"2017-07-18T00:08:26Z","abstract_excerpt":"In 1995, Galvin proved that a bipartite graph $G$ admits a list edge coloring if every edge is assigned a color list of length $\\Delta(G)$, the maximum degree of the graph. This result was improved by Borodin, Kostochka and Woodall, who proved that $G$ still admits a list edge coloring if every edge $e=st$ is assigned a list of $\\max\\{d_{G}(s), d_{G}(t)\\}$ colors. Recently, Iwata and Yokoi provided the list supermodular coloring theorem, that extends Galvin's result to the setting of Schrijver's supermodular coloring. This paper provides a common generalization of these two extensions of Galvi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.05417","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-18T00:40:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L+q+Z74TuNRSi0z2rAOk6goZ6yeOm5jPb3iEy4pLBlzvsMwxc4TNI8Cd6LzjU1aokuEB/k4Qt2j+epWOsJvEAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T02:43:57.112574Z"},"content_sha256":"6b38795f8be6e38d2268943b74ab1166d29962542993103dda8ca37fb66b0bf7","schema_version":"1.0","event_id":"sha256:6b38795f8be6e38d2268943b74ab1166d29962542993103dda8ca37fb66b0bf7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6D227I3DEQVB4GA7KHYWDFGEB7/bundle.json","state_url":"https://pith.science/pith/6D227I3DEQVB4GA7KHYWDFGEB7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6D227I3DEQVB4GA7KHYWDFGEB7/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-06-05T02:43:57Z","links":{"resolver":"https://pith.science/pith/6D227I3DEQVB4GA7KHYWDFGEB7","bundle":"https://pith.science/pith/6D227I3DEQVB4GA7KHYWDFGEB7/bundle.json","state":"https://pith.science/pith/6D227I3DEQVB4GA7KHYWDFGEB7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6D227I3DEQVB4GA7KHYWDFGEB7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:6D227I3DEQVB4GA7KHYWDFGEB7","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":"16b9dfb39ac6a885ff17548a5250f5e759316e28fd0c2bb7a7ecc8a87f12c716","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-07-18T00:08:26Z","title_canon_sha256":"f964a66c6a2a8f7e661c27448741f9d7c118bb6d8f2d3256cc62c1fa883d4c4f"},"schema_version":"1.0","source":{"id":"1707.05417","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.05417","created_at":"2026-05-18T00:40:02Z"},{"alias_kind":"arxiv_version","alias_value":"1707.05417v1","created_at":"2026-05-18T00:40:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.05417","created_at":"2026-05-18T00:40:02Z"},{"alias_kind":"pith_short_12","alias_value":"6D227I3DEQVB","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6D227I3DEQVB4GA7","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6D227I3D","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:6b38795f8be6e38d2268943b74ab1166d29962542993103dda8ca37fb66b0bf7","target":"graph","created_at":"2026-05-18T00:40:02Z","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":"In 1995, Galvin proved that a bipartite graph $G$ admits a list edge coloring if every edge is assigned a color list of length $\\Delta(G)$, the maximum degree of the graph. This result was improved by Borodin, Kostochka and Woodall, who proved that $G$ still admits a list edge coloring if every edge $e=st$ is assigned a list of $\\max\\{d_{G}(s), d_{G}(t)\\}$ colors. Recently, Iwata and Yokoi provided the list supermodular coloring theorem, that extends Galvin's result to the setting of Schrijver's supermodular coloring. This paper provides a common generalization of these two extensions of Galvi","authors_text":"Yu Yokoi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-07-18T00:08:26Z","title":"List Supermodular Coloring with Shorter Lists"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.05417","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:a56adedeb2497091c032a7a45cbfe7020045a653666a5a6f2f43ecc32d4ccb3f","target":"record","created_at":"2026-05-18T00:40:02Z","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":"16b9dfb39ac6a885ff17548a5250f5e759316e28fd0c2bb7a7ecc8a87f12c716","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-07-18T00:08:26Z","title_canon_sha256":"f964a66c6a2a8f7e661c27448741f9d7c118bb6d8f2d3256cc62c1fa883d4c4f"},"schema_version":"1.0","source":{"id":"1707.05417","kind":"arxiv","version":1}},"canonical_sha256":"f0f5afa363242a1e181f51f16194c40fe4169543461285f8eaffe21f2b6194b8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f0f5afa363242a1e181f51f16194c40fe4169543461285f8eaffe21f2b6194b8","first_computed_at":"2026-05-18T00:40:02.404398Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:40:02.404398Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ssj0HkC4BGlIRHuEy5FGJIqCjUDOQzFZtMMjStZChBYbrVH8fRQdUGxctGIMbd++AD9LsLsIGjda4yo2cMwTCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:40:02.404852Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.05417","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a56adedeb2497091c032a7a45cbfe7020045a653666a5a6f2f43ecc32d4ccb3f","sha256:6b38795f8be6e38d2268943b74ab1166d29962542993103dda8ca37fb66b0bf7"],"state_sha256":"972c51e58fc94def12322d43aff2046e75c54229bb6398e7e4a7a8275d5bb40b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eOcpRJhZaQYp18JSaYYGzHuM5mRME8yn/k+JrgoYMfBV2DpGDCT2SLxZH8TJgsdmW3/KKzmpfd0O5uoClAzlDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T02:43:57.115251Z","bundle_sha256":"35aa7e89e25d7b6a831f9efc863900855996d7a63611e0a150d0906eef249698"}}