{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:YGANOW76LKDY7OQVU7RPJBVMIH","short_pith_number":"pith:YGANOW76","canonical_record":{"source":{"id":"1512.07847","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-12-24T16:19:30Z","cross_cats_sorted":[],"title_canon_sha256":"0c2fd1c3b1fb296383741670ae3fdd3e17522400ea5cd8b6e756b6266b8bb74e","abstract_canon_sha256":"8b815f8cc42cd412a067b3690f6f66575aeba9c14a7e85c0fb960e7979323d3a"},"schema_version":"1.0"},"canonical_sha256":"c180d75bfe5a878fba15a7e2f486ac41f0b7e99eae0b77f00dbfbcb02fced34d","source":{"kind":"arxiv","id":"1512.07847","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.07847","created_at":"2026-05-18T01:23:47Z"},{"alias_kind":"arxiv_version","alias_value":"1512.07847v1","created_at":"2026-05-18T01:23:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.07847","created_at":"2026-05-18T01:23:47Z"},{"alias_kind":"pith_short_12","alias_value":"YGANOW76LKDY","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"YGANOW76LKDY7OQV","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"YGANOW76","created_at":"2026-05-18T12:29:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:YGANOW76LKDY7OQVU7RPJBVMIH","target":"record","payload":{"canonical_record":{"source":{"id":"1512.07847","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-12-24T16:19:30Z","cross_cats_sorted":[],"title_canon_sha256":"0c2fd1c3b1fb296383741670ae3fdd3e17522400ea5cd8b6e756b6266b8bb74e","abstract_canon_sha256":"8b815f8cc42cd412a067b3690f6f66575aeba9c14a7e85c0fb960e7979323d3a"},"schema_version":"1.0"},"canonical_sha256":"c180d75bfe5a878fba15a7e2f486ac41f0b7e99eae0b77f00dbfbcb02fced34d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:23:47.656607Z","signature_b64":"JnrV0KRmuKMRxnEKklOOfimLAW8cKBrkEvLfkC9OmrS3FvuUpWp0BS6ZnyK6FwCpg2APcvv3E4nVE16mkX+IBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c180d75bfe5a878fba15a7e2f486ac41f0b7e99eae0b77f00dbfbcb02fced34d","last_reissued_at":"2026-05-18T01:23:47.655936Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:23:47.655936Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1512.07847","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:23:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QMsXgYJAtmzsf8Q1oSciZpT+qIsbaApz1XRcG+TVszFr/rozVmAtjEQySoL+hnj4n4uQMiUfcs2CG9rDMY1gCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T06:13:19.841858Z"},"content_sha256":"78e4cbf83d296e0a22eb42b79df36c17a6415d5d1b3e4d2a0edefb89628b4364","schema_version":"1.0","event_id":"sha256:78e4cbf83d296e0a22eb42b79df36c17a6415d5d1b3e4d2a0edefb89628b4364"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:YGANOW76LKDY7OQVU7RPJBVMIH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Choosability with union separation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Derrick Stolee, Kevin Moss, Mohit Kumbhat","submitted_at":"2015-12-24T16:19:30Z","abstract_excerpt":"List coloring generalizes graph coloring by requiring the color of a vertex to be selected from a list of colors specific to that vertex. One refinement of list coloring, called choosability with separation, requires that the intersection of adjacent lists is sufficiently small. We introduce a new refinement, called choosability with union separation, where we require that the union of adjacent lists is sufficiently large. For $t \\geq k$, a $(k,t)$-list assignment is a list assignment $L$ where $|L(v)| \\geq k$ for all vertices $v$ and $|L(u)\\cup L(v)| \\geq t$ for all edges $uv$. A graph is $(k"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.07847","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:23:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dif9QpmTkMYHTMztQpH8NLl9Gg+1YjXyQOYFB53VAe5AOpadcFArTJtnw1r401cPRC2HHP4U6qfv3ndC5ZcpBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T06:13:19.842204Z"},"content_sha256":"f3347ffacf3c73601741ab80276a14ce7f1b4baf0c90bb77d5d98f60ae1b7d89","schema_version":"1.0","event_id":"sha256:f3347ffacf3c73601741ab80276a14ce7f1b4baf0c90bb77d5d98f60ae1b7d89"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YGANOW76LKDY7OQVU7RPJBVMIH/bundle.json","state_url":"https://pith.science/pith/YGANOW76LKDY7OQVU7RPJBVMIH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YGANOW76LKDY7OQVU7RPJBVMIH/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-27T06:13:19Z","links":{"resolver":"https://pith.science/pith/YGANOW76LKDY7OQVU7RPJBVMIH","bundle":"https://pith.science/pith/YGANOW76LKDY7OQVU7RPJBVMIH/bundle.json","state":"https://pith.science/pith/YGANOW76LKDY7OQVU7RPJBVMIH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YGANOW76LKDY7OQVU7RPJBVMIH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:YGANOW76LKDY7OQVU7RPJBVMIH","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":"8b815f8cc42cd412a067b3690f6f66575aeba9c14a7e85c0fb960e7979323d3a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-12-24T16:19:30Z","title_canon_sha256":"0c2fd1c3b1fb296383741670ae3fdd3e17522400ea5cd8b6e756b6266b8bb74e"},"schema_version":"1.0","source":{"id":"1512.07847","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.07847","created_at":"2026-05-18T01:23:47Z"},{"alias_kind":"arxiv_version","alias_value":"1512.07847v1","created_at":"2026-05-18T01:23:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.07847","created_at":"2026-05-18T01:23:47Z"},{"alias_kind":"pith_short_12","alias_value":"YGANOW76LKDY","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"YGANOW76LKDY7OQV","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"YGANOW76","created_at":"2026-05-18T12:29:50Z"}],"graph_snapshots":[{"event_id":"sha256:f3347ffacf3c73601741ab80276a14ce7f1b4baf0c90bb77d5d98f60ae1b7d89","target":"graph","created_at":"2026-05-18T01:23:47Z","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":"List coloring generalizes graph coloring by requiring the color of a vertex to be selected from a list of colors specific to that vertex. One refinement of list coloring, called choosability with separation, requires that the intersection of adjacent lists is sufficiently small. We introduce a new refinement, called choosability with union separation, where we require that the union of adjacent lists is sufficiently large. For $t \\geq k$, a $(k,t)$-list assignment is a list assignment $L$ where $|L(v)| \\geq k$ for all vertices $v$ and $|L(u)\\cup L(v)| \\geq t$ for all edges $uv$. A graph is $(k","authors_text":"Derrick Stolee, Kevin Moss, Mohit Kumbhat","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-12-24T16:19:30Z","title":"Choosability with union separation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.07847","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:78e4cbf83d296e0a22eb42b79df36c17a6415d5d1b3e4d2a0edefb89628b4364","target":"record","created_at":"2026-05-18T01:23:47Z","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":"8b815f8cc42cd412a067b3690f6f66575aeba9c14a7e85c0fb960e7979323d3a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-12-24T16:19:30Z","title_canon_sha256":"0c2fd1c3b1fb296383741670ae3fdd3e17522400ea5cd8b6e756b6266b8bb74e"},"schema_version":"1.0","source":{"id":"1512.07847","kind":"arxiv","version":1}},"canonical_sha256":"c180d75bfe5a878fba15a7e2f486ac41f0b7e99eae0b77f00dbfbcb02fced34d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c180d75bfe5a878fba15a7e2f486ac41f0b7e99eae0b77f00dbfbcb02fced34d","first_computed_at":"2026-05-18T01:23:47.655936Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:23:47.655936Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JnrV0KRmuKMRxnEKklOOfimLAW8cKBrkEvLfkC9OmrS3FvuUpWp0BS6ZnyK6FwCpg2APcvv3E4nVE16mkX+IBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:23:47.656607Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.07847","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:78e4cbf83d296e0a22eb42b79df36c17a6415d5d1b3e4d2a0edefb89628b4364","sha256:f3347ffacf3c73601741ab80276a14ce7f1b4baf0c90bb77d5d98f60ae1b7d89"],"state_sha256":"62658e1da7c8e1374abf935e1be36b9e3942034e33decb6f9d50e7419b000104"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nzKcHb8ZiTvvadA/h1YEeEic1MqYJKAWR7DN6aYY09eyzhjFwYuyWu2hSd+IN2l2wICafcQlq6qs2E0vXCOsCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T06:13:19.844488Z","bundle_sha256":"cb96c3efa55dbc44720b275b4d6ba109e87758218ab5a645cfc8dba038360dec"}}