{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:JJS6NBGN3GSKMAXNIL6ZICKVYT","short_pith_number":"pith:JJS6NBGN","schema_version":"1.0","canonical_sha256":"4a65e684cdd9a4a602ed42fd940955c4f866b59bb083b661a3390c11b820e807","source":{"kind":"arxiv","id":"2605.23828","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2605.23828","created_at":"2026-05-25T02:02:34.403444+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.23828v1","created_at":"2026-05-25T02:02:34.403444+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.23828","created_at":"2026-05-25T02:02:34.403444+00:00"},{"alias_kind":"pith_short_12","alias_value":"JJS6NBGN3GSK","created_at":"2026-05-25T02:02:34.403444+00:00"},{"alias_kind":"pith_short_16","alias_value":"JJS6NBGN3GSKMAXN","created_at":"2026-05-25T02:02:34.403444+00:00"},{"alias_kind":"pith_short_8","alias_value":"JJS6NBGN","created_at":"2026-05-25T02:02:34.403444+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JJS6NBGN3GSKMAXNIL6ZICKVYT","json":"https://pith.science/pith/JJS6NBGN3GSKMAXNIL6ZICKVYT.json","graph_json":"https://pith.science/api/pith-number/JJS6NBGN3GSKMAXNIL6ZICKVYT/graph.json","events_json":"https://pith.science/api/pith-number/JJS6NBGN3GSKMAXNIL6ZICKVYT/events.json","paper":"https://pith.science/paper/JJS6NBGN"},"agent_actions":{"view_html":"https://pith.science/pith/JJS6NBGN3GSKMAXNIL6ZICKVYT","download_json":"https://pith.science/pith/JJS6NBGN3GSKMAXNIL6ZICKVYT.json","view_paper":"https://pith.science/paper/JJS6NBGN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.23828&json=true","fetch_graph":"https://pith.science/api/pith-number/JJS6NBGN3GSKMAXNIL6ZICKVYT/graph.json","fetch_events":"https://pith.science/api/pith-number/JJS6NBGN3GSKMAXNIL6ZICKVYT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JJS6NBGN3GSKMAXNIL6ZICKVYT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JJS6NBGN3GSKMAXNIL6ZICKVYT/action/storage_attestation","attest_author":"https://pith.science/pith/JJS6NBGN3GSKMAXNIL6ZICKVYT/action/author_attestation","sign_citation":"https://pith.science/pith/JJS6NBGN3GSKMAXNIL6ZICKVYT/action/citation_signature","submit_replication":"https://pith.science/pith/JJS6NBGN3GSKMAXNIL6ZICKVYT/action/replication_record"}},"created_at":"2026-05-25T02:02:34.403444+00:00","updated_at":"2026-05-25T02:02:34.403444+00:00"}