{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:MUWWHKOOPPJSH2LYDM4NLGX5JV","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":"522f6daff357ae03a34aa1d1fab70ef75ae3faf5295751b53eee4653b64d312b","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-30T21:43:51Z","title_canon_sha256":"b3fba2ee557697755cf80aa3c21f4ee76aba80105781e17840e093994993e797"},"schema_version":"1.0","source":{"id":"2607.00212","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.00212","created_at":"2026-07-02T00:18:39Z"},{"alias_kind":"arxiv_version","alias_value":"2607.00212v1","created_at":"2026-07-02T00:18:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.00212","created_at":"2026-07-02T00:18:39Z"},{"alias_kind":"pith_short_12","alias_value":"MUWWHKOOPPJS","created_at":"2026-07-02T00:18:39Z"},{"alias_kind":"pith_short_16","alias_value":"MUWWHKOOPPJSH2LY","created_at":"2026-07-02T00:18:39Z"},{"alias_kind":"pith_short_8","alias_value":"MUWWHKOO","created_at":"2026-07-02T00:18:39Z"}],"graph_snapshots":[{"event_id":"sha256:c184e63f33285d493de21925aab7ac4a3607bc9d3e328a3f6b3fc38a6cc6a53b","target":"graph","created_at":"2026-07-02T00:18:39Z","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/2607.00212/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A strong majority edge-coloring of a graph is an edge-coloring in which, for every edge $e$ and every color $i$, at most half of the edges adjacent to $e$ have color $i$. Such a coloring exists only for graphs with no pendant path of length two, which, following Kalinowski, Kamyczura, Pil\\'sniak, and Wo\\'zniak, we call admissible. They proved that every admissible graph admits such a coloring with at most eight colors and conjectured that four colors always suffice. We improve the upper bound from eight to five.","authors_text":"Magdalena Prorok, Nika Salia, Sylwia Antoniuk","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-30T21:43:51Z","title":"Strong Majority Edge-Coloring"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.00212","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:6150a0b49bd5775b5aaeae1af662053eec7b263fd13fc970978193f79eac20de","target":"record","created_at":"2026-07-02T00:18:39Z","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":"522f6daff357ae03a34aa1d1fab70ef75ae3faf5295751b53eee4653b64d312b","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-30T21:43:51Z","title_canon_sha256":"b3fba2ee557697755cf80aa3c21f4ee76aba80105781e17840e093994993e797"},"schema_version":"1.0","source":{"id":"2607.00212","kind":"arxiv","version":1}},"canonical_sha256":"652d63a9ce7bd323e9781b38d59afd4d687a08e121ddd6e104acc994d70d8bdd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"652d63a9ce7bd323e9781b38d59afd4d687a08e121ddd6e104acc994d70d8bdd","first_computed_at":"2026-07-02T00:18:39.248703Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-02T00:18:39.248703Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4p1oAx7T6vLx8TyqlLaQxcx6LyHfatnlh8S6bPiZzfH+nR6n5wZ0Lb5EmXxHVArLqNLkl1ctHF+VG8Y2bJd0Bg==","signature_status":"signed_v1","signed_at":"2026-07-02T00:18:39.249176Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.00212","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6150a0b49bd5775b5aaeae1af662053eec7b263fd13fc970978193f79eac20de","sha256:c184e63f33285d493de21925aab7ac4a3607bc9d3e328a3f6b3fc38a6cc6a53b"],"state_sha256":"0b80f38696ecaddfd33d4d55dc656666150a6b1adf5efce2a267ce358fc2821d"}