{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:JG6QRE52KIC2TCN3ZKUVJZIHDM","short_pith_number":"pith:JG6QRE52","canonical_record":{"source":{"id":"1608.06912","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-24T18:18:31Z","cross_cats_sorted":[],"title_canon_sha256":"d1774bcfa4f545b75e737d6c682775006c26aecf757c0437d9a484a1def869bc","abstract_canon_sha256":"b76ed832f1427083f04a0acc722a4322c09eb1ab73665c3e5db96bb1eb550c24"},"schema_version":"1.0"},"canonical_sha256":"49bd0893ba5205a989bbcaa954e5071b0b01d72694872fb8186194eda964db57","source":{"kind":"arxiv","id":"1608.06912","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.06912","created_at":"2026-05-18T00:03:29Z"},{"alias_kind":"arxiv_version","alias_value":"1608.06912v2","created_at":"2026-05-18T00:03:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.06912","created_at":"2026-05-18T00:03:29Z"},{"alias_kind":"pith_short_12","alias_value":"JG6QRE52KIC2","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"JG6QRE52KIC2TCN3","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"JG6QRE52","created_at":"2026-05-18T12:30:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:JG6QRE52KIC2TCN3ZKUVJZIHDM","target":"record","payload":{"canonical_record":{"source":{"id":"1608.06912","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-24T18:18:31Z","cross_cats_sorted":[],"title_canon_sha256":"d1774bcfa4f545b75e737d6c682775006c26aecf757c0437d9a484a1def869bc","abstract_canon_sha256":"b76ed832f1427083f04a0acc722a4322c09eb1ab73665c3e5db96bb1eb550c24"},"schema_version":"1.0"},"canonical_sha256":"49bd0893ba5205a989bbcaa954e5071b0b01d72694872fb8186194eda964db57","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:29.785005Z","signature_b64":"J0H43Rb2T7TOXPsJLh9En/b9xfs3EcbZGWKWEjs1anh3B/QpiIDDJGCK60PZGusimZEKYAFkM5xkPwXImeD0Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"49bd0893ba5205a989bbcaa954e5071b0b01d72694872fb8186194eda964db57","last_reissued_at":"2026-05-18T00:03:29.784348Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:29.784348Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1608.06912","source_version":2,"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:03:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"64uCKNTyd00uAsaoloPvrWhy8TDrDbsM/gQLD/2mFvlZ5lkVH/I/KpsG3KF2lxCC5UtEQe8iL7f0g3WyeGPyCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T06:35:37.621305Z"},"content_sha256":"1cefb9f44b2ac34bbfc62d98d14c1ef1e81d15b20147eb68871d64a034b928d8","schema_version":"1.0","event_id":"sha256:1cefb9f44b2ac34bbfc62d98d14c1ef1e81d15b20147eb68871d64a034b928d8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:JG6QRE52KIC2TCN3ZKUVJZIHDM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Majority choosability of digraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bart{\\l}omiej Bosek, Jaros{\\l}aw Grytczuk, Marcin Anholcer","submitted_at":"2016-08-24T18:18:31Z","abstract_excerpt":"A \\emph{majority coloring} of a digraph is a coloring of its vertices such that for each vertex $v$, at most half of the out-neighbors of $v$ has the same color as $v$. A digraph $D$ is \\emph{majority $k$-choosable} if for any assignment of lists of colors of size $k$ to the vertices there is a majority coloring of $D$ from these lists. We prove that every digraph is majority $4$-choosable. This gives a positive answer to a question posed recently by Kreutzer, Oum, Seymour, van der Zypen, and Wood in \\cite{Kreutzer}. We obtain this result as a consequence of a more general theorem, in which ma"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.06912","kind":"arxiv","version":2},"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:03:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RgZNvA92DzcKhzPu2IJjCMx4ElnNFX/Pn3N1OGA59EajqGOVsdZu2EInlZlOe0fppIr2KZDWLwgxJGaTgcnOCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T06:35:37.621672Z"},"content_sha256":"1ec845e87457b87b79a276d38649ceadd8420dbbaacc3feafda5bb998b311193","schema_version":"1.0","event_id":"sha256:1ec845e87457b87b79a276d38649ceadd8420dbbaacc3feafda5bb998b311193"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JG6QRE52KIC2TCN3ZKUVJZIHDM/bundle.json","state_url":"https://pith.science/pith/JG6QRE52KIC2TCN3ZKUVJZIHDM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JG6QRE52KIC2TCN3ZKUVJZIHDM/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-20T06:35:37Z","links":{"resolver":"https://pith.science/pith/JG6QRE52KIC2TCN3ZKUVJZIHDM","bundle":"https://pith.science/pith/JG6QRE52KIC2TCN3ZKUVJZIHDM/bundle.json","state":"https://pith.science/pith/JG6QRE52KIC2TCN3ZKUVJZIHDM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JG6QRE52KIC2TCN3ZKUVJZIHDM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:JG6QRE52KIC2TCN3ZKUVJZIHDM","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":"b76ed832f1427083f04a0acc722a4322c09eb1ab73665c3e5db96bb1eb550c24","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-24T18:18:31Z","title_canon_sha256":"d1774bcfa4f545b75e737d6c682775006c26aecf757c0437d9a484a1def869bc"},"schema_version":"1.0","source":{"id":"1608.06912","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.06912","created_at":"2026-05-18T00:03:29Z"},{"alias_kind":"arxiv_version","alias_value":"1608.06912v2","created_at":"2026-05-18T00:03:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.06912","created_at":"2026-05-18T00:03:29Z"},{"alias_kind":"pith_short_12","alias_value":"JG6QRE52KIC2","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"JG6QRE52KIC2TCN3","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"JG6QRE52","created_at":"2026-05-18T12:30:25Z"}],"graph_snapshots":[{"event_id":"sha256:1ec845e87457b87b79a276d38649ceadd8420dbbaacc3feafda5bb998b311193","target":"graph","created_at":"2026-05-18T00:03:29Z","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":"A \\emph{majority coloring} of a digraph is a coloring of its vertices such that for each vertex $v$, at most half of the out-neighbors of $v$ has the same color as $v$. A digraph $D$ is \\emph{majority $k$-choosable} if for any assignment of lists of colors of size $k$ to the vertices there is a majority coloring of $D$ from these lists. We prove that every digraph is majority $4$-choosable. This gives a positive answer to a question posed recently by Kreutzer, Oum, Seymour, van der Zypen, and Wood in \\cite{Kreutzer}. We obtain this result as a consequence of a more general theorem, in which ma","authors_text":"Bart{\\l}omiej Bosek, Jaros{\\l}aw Grytczuk, Marcin Anholcer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-24T18:18:31Z","title":"Majority choosability of digraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.06912","kind":"arxiv","version":2},"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:1cefb9f44b2ac34bbfc62d98d14c1ef1e81d15b20147eb68871d64a034b928d8","target":"record","created_at":"2026-05-18T00:03:29Z","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":"b76ed832f1427083f04a0acc722a4322c09eb1ab73665c3e5db96bb1eb550c24","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-24T18:18:31Z","title_canon_sha256":"d1774bcfa4f545b75e737d6c682775006c26aecf757c0437d9a484a1def869bc"},"schema_version":"1.0","source":{"id":"1608.06912","kind":"arxiv","version":2}},"canonical_sha256":"49bd0893ba5205a989bbcaa954e5071b0b01d72694872fb8186194eda964db57","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"49bd0893ba5205a989bbcaa954e5071b0b01d72694872fb8186194eda964db57","first_computed_at":"2026-05-18T00:03:29.784348Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:03:29.784348Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"J0H43Rb2T7TOXPsJLh9En/b9xfs3EcbZGWKWEjs1anh3B/QpiIDDJGCK60PZGusimZEKYAFkM5xkPwXImeD0Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:03:29.785005Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.06912","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1cefb9f44b2ac34bbfc62d98d14c1ef1e81d15b20147eb68871d64a034b928d8","sha256:1ec845e87457b87b79a276d38649ceadd8420dbbaacc3feafda5bb998b311193"],"state_sha256":"1db8f06258c9e46058e53b7740777e92fc920b9007aa82a5e9e567f89e69aa9c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c8D3waJHoA5yPnIBZNe4iLTu2yBDJSo4Fk8gYx7qCFdMVvUMaBBukyrEaRAGhCYwkAYU585UT6dc3LwfKon+Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T06:35:37.623714Z","bundle_sha256":"3c154336cdca7dd225cd1cccbe3fb582feaa13fc3700349288418826b4b3941d"}}