{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:JJS6NBGN3GSKMAXNIL6ZICKVYT","short_pith_number":"pith:JJS6NBGN","canonical_record":{"source":{"id":"2605.23828","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-22T16:33:39Z","cross_cats_sorted":[],"title_canon_sha256":"823dd4a0504ea7e83e9cb4d2a730f1abee34d54a03afc647c6c01f28dd1644e7","abstract_canon_sha256":"3ffc100426d08ded447b93b8813e5f83164ffe14ca9e704208f4c81f22fb4798"},"schema_version":"1.0"},"canonical_sha256":"4a65e684cdd9a4a602ed42fd940955c4f866b59bb083b661a3390c11b820e807","source":{"kind":"arxiv","id":"2605.23828","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.23828","created_at":"2026-05-25T02:02:34Z"},{"alias_kind":"arxiv_version","alias_value":"2605.23828v1","created_at":"2026-05-25T02:02:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.23828","created_at":"2026-05-25T02:02:34Z"},{"alias_kind":"pith_short_12","alias_value":"JJS6NBGN3GSK","created_at":"2026-05-25T02:02:34Z"},{"alias_kind":"pith_short_16","alias_value":"JJS6NBGN3GSKMAXN","created_at":"2026-05-25T02:02:34Z"},{"alias_kind":"pith_short_8","alias_value":"JJS6NBGN","created_at":"2026-05-25T02:02:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:JJS6NBGN3GSKMAXNIL6ZICKVYT","target":"record","payload":{"canonical_record":{"source":{"id":"2605.23828","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-22T16:33:39Z","cross_cats_sorted":[],"title_canon_sha256":"823dd4a0504ea7e83e9cb4d2a730f1abee34d54a03afc647c6c01f28dd1644e7","abstract_canon_sha256":"3ffc100426d08ded447b93b8813e5f83164ffe14ca9e704208f4c81f22fb4798"},"schema_version":"1.0"},"canonical_sha256":"4a65e684cdd9a4a602ed42fd940955c4f866b59bb083b661a3390c11b820e807","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-25T02:02:34.404047Z","signature_b64":"bxngJHmW82J6Ds4KDhg4fIPoDghFJgG5bz9t8/tHG396BXWQEB6CpkpBuhy5Xph4nCEgj07MQvCr+qHyUUdrBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4a65e684cdd9a4a602ed42fd940955c4f866b59bb083b661a3390c11b820e807","last_reissued_at":"2026-05-25T02:02:34.403336Z","signature_status":"signed_v1","first_computed_at":"2026-05-25T02:02:34.403336Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.23828","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-25T02:02:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OqObJfwNuJHQibK90T6M2OZLTkMVJa2ee88UNKwwuWz9Emxlza0UIcqM2l/6hNqKBst38qPrKcraYdngkiDXCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T21:20:25.349907Z"},"content_sha256":"f6ecb3e8cfbb0fcd2c4de13c4c90bb237a25909002b5e9a3ba759abab9b2c9e8","schema_version":"1.0","event_id":"sha256:f6ecb3e8cfbb0fcd2c4de13c4c90bb237a25909002b5e9a3ba759abab9b2c9e8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:JJS6NBGN3GSKMAXNIL6ZICKVYT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Strong majority colorings of graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Mariusz Wo\\'zniak, Mateusz Kamyczura, Monika Pil\\'sniak, Rafa{\\l} Kalinowski","submitted_at":"2026-05-22T16:33:39Z","abstract_excerpt":"Motivated by majority vertex-colorings of graphs and digraphs and majority edge-colorings of graphs, we introduce two concepts of strong majority colorings. A strong majority vertex-coloring of a graph $G=(V,E)$ is a mapping $c:V\\rightarrow C$ such that for every vertex $v\\in V$ and every color $\\alpha\\in C$, at most half of the neighbors of $v$ have color $\\alpha$. The strong majority number of $G$, denoted Maj$(G)$, is the least number of colors in such a coloring. We show that Maj$(G)$ can be arbitrarily large and prove a tight upper bound Maj$(G)\\le 2\\Delta(G)+1$ for every graph $G$ withou"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.23828","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.23828/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-25T02:02:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SGYMjVFV00IgqZ/fEUwxXCcSx4AN17RUx/XKjp1T9Ged27HYbAL60m5lLj7SBA7S8951mpgjA4WSzO7PHkepCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T21:20:25.350276Z"},"content_sha256":"54a4302a308de881722bae2bb0c397093927009a8bb358a2394984cc894f2ed2","schema_version":"1.0","event_id":"sha256:54a4302a308de881722bae2bb0c397093927009a8bb358a2394984cc894f2ed2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JJS6NBGN3GSKMAXNIL6ZICKVYT/bundle.json","state_url":"https://pith.science/pith/JJS6NBGN3GSKMAXNIL6ZICKVYT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JJS6NBGN3GSKMAXNIL6ZICKVYT/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-01T21:20:25Z","links":{"resolver":"https://pith.science/pith/JJS6NBGN3GSKMAXNIL6ZICKVYT","bundle":"https://pith.science/pith/JJS6NBGN3GSKMAXNIL6ZICKVYT/bundle.json","state":"https://pith.science/pith/JJS6NBGN3GSKMAXNIL6ZICKVYT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JJS6NBGN3GSKMAXNIL6ZICKVYT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:JJS6NBGN3GSKMAXNIL6ZICKVYT","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":"3ffc100426d08ded447b93b8813e5f83164ffe14ca9e704208f4c81f22fb4798","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-22T16:33:39Z","title_canon_sha256":"823dd4a0504ea7e83e9cb4d2a730f1abee34d54a03afc647c6c01f28dd1644e7"},"schema_version":"1.0","source":{"id":"2605.23828","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.23828","created_at":"2026-05-25T02:02:34Z"},{"alias_kind":"arxiv_version","alias_value":"2605.23828v1","created_at":"2026-05-25T02:02:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.23828","created_at":"2026-05-25T02:02:34Z"},{"alias_kind":"pith_short_12","alias_value":"JJS6NBGN3GSK","created_at":"2026-05-25T02:02:34Z"},{"alias_kind":"pith_short_16","alias_value":"JJS6NBGN3GSKMAXN","created_at":"2026-05-25T02:02:34Z"},{"alias_kind":"pith_short_8","alias_value":"JJS6NBGN","created_at":"2026-05-25T02:02:34Z"}],"graph_snapshots":[{"event_id":"sha256:54a4302a308de881722bae2bb0c397093927009a8bb358a2394984cc894f2ed2","target":"graph","created_at":"2026-05-25T02:02:34Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2605.23828/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Motivated by majority vertex-colorings of graphs and digraphs and majority edge-colorings of graphs, we introduce two concepts of strong majority colorings. A strong majority vertex-coloring of a graph $G=(V,E)$ is a mapping $c:V\\rightarrow C$ such that for every vertex $v\\in V$ and every color $\\alpha\\in C$, at most half of the neighbors of $v$ have color $\\alpha$. The strong majority number of $G$, denoted Maj$(G)$, is the least number of colors in such a coloring. We show that Maj$(G)$ can be arbitrarily large and prove a tight upper bound Maj$(G)\\le 2\\Delta(G)+1$ for every graph $G$ withou","authors_text":"Mariusz Wo\\'zniak, Mateusz Kamyczura, Monika Pil\\'sniak, Rafa{\\l} Kalinowski","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-22T16:33:39Z","title":"Strong majority colorings of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.23828","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:f6ecb3e8cfbb0fcd2c4de13c4c90bb237a25909002b5e9a3ba759abab9b2c9e8","target":"record","created_at":"2026-05-25T02:02:34Z","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":"3ffc100426d08ded447b93b8813e5f83164ffe14ca9e704208f4c81f22fb4798","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-22T16:33:39Z","title_canon_sha256":"823dd4a0504ea7e83e9cb4d2a730f1abee34d54a03afc647c6c01f28dd1644e7"},"schema_version":"1.0","source":{"id":"2605.23828","kind":"arxiv","version":1}},"canonical_sha256":"4a65e684cdd9a4a602ed42fd940955c4f866b59bb083b661a3390c11b820e807","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4a65e684cdd9a4a602ed42fd940955c4f866b59bb083b661a3390c11b820e807","first_computed_at":"2026-05-25T02:02:34.403336Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-25T02:02:34.403336Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bxngJHmW82J6Ds4KDhg4fIPoDghFJgG5bz9t8/tHG396BXWQEB6CpkpBuhy5Xph4nCEgj07MQvCr+qHyUUdrBg==","signature_status":"signed_v1","signed_at":"2026-05-25T02:02:34.404047Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.23828","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f6ecb3e8cfbb0fcd2c4de13c4c90bb237a25909002b5e9a3ba759abab9b2c9e8","sha256:54a4302a308de881722bae2bb0c397093927009a8bb358a2394984cc894f2ed2"],"state_sha256":"be156ef851cf5474904201722a6ae96e122b108e260934d665a5538340b966c5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nWPSkGBN6W6zShCSVzaPScOsjCjiehJ5xPb5Da0XDTckpTHQR+tfTsKyLIqk7tc3nT6iNs6jO0W4Am8El/ddBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T21:20:25.352337Z","bundle_sha256":"253bb498ebaefc90ac32e554ac83f5e220235608afc362ec4edfebba5b7e38bc"}}