{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:MUWWHKOOPPJSH2LYDM4NLGX5JV","short_pith_number":"pith:MUWWHKOO","schema_version":"1.0","canonical_sha256":"652d63a9ce7bd323e9781b38d59afd4d687a08e121ddd6e104acc994d70d8bdd","source":{"kind":"arxiv","id":"2607.00212","version":1},"attestation_state":"computed","paper":{"title":"Strong Majority Edge-Coloring","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Magdalena Prorok, Nika Salia, Sylwia Antoniuk","submitted_at":"2026-06-30T21:43:51Z","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."},"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":"2607.00212","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-30T21:43:51Z","cross_cats_sorted":[],"title_canon_sha256":"b3fba2ee557697755cf80aa3c21f4ee76aba80105781e17840e093994993e797","abstract_canon_sha256":"522f6daff357ae03a34aa1d1fab70ef75ae3faf5295751b53eee4653b64d312b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-02T00:18:39.249176Z","signature_b64":"4p1oAx7T6vLx8TyqlLaQxcx6LyHfatnlh8S6bPiZzfH+nR6n5wZ0Lb5EmXxHVArLqNLkl1ctHF+VG8Y2bJd0Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"652d63a9ce7bd323e9781b38d59afd4d687a08e121ddd6e104acc994d70d8bdd","last_reissued_at":"2026-07-02T00:18:39.248703Z","signature_status":"signed_v1","first_computed_at":"2026-07-02T00:18:39.248703Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Strong Majority Edge-Coloring","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Magdalena Prorok, Nika Salia, Sylwia Antoniuk","submitted_at":"2026-06-30T21:43:51Z","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."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.00212","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/2607.00212/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":"2607.00212","created_at":"2026-07-02T00:18:39.248777+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.00212v1","created_at":"2026-07-02T00:18:39.248777+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.00212","created_at":"2026-07-02T00:18:39.248777+00:00"},{"alias_kind":"pith_short_12","alias_value":"MUWWHKOOPPJS","created_at":"2026-07-02T00:18:39.248777+00:00"},{"alias_kind":"pith_short_16","alias_value":"MUWWHKOOPPJSH2LY","created_at":"2026-07-02T00:18:39.248777+00:00"},{"alias_kind":"pith_short_8","alias_value":"MUWWHKOO","created_at":"2026-07-02T00:18:39.248777+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/MUWWHKOOPPJSH2LYDM4NLGX5JV","json":"https://pith.science/pith/MUWWHKOOPPJSH2LYDM4NLGX5JV.json","graph_json":"https://pith.science/api/pith-number/MUWWHKOOPPJSH2LYDM4NLGX5JV/graph.json","events_json":"https://pith.science/api/pith-number/MUWWHKOOPPJSH2LYDM4NLGX5JV/events.json","paper":"https://pith.science/paper/MUWWHKOO"},"agent_actions":{"view_html":"https://pith.science/pith/MUWWHKOOPPJSH2LYDM4NLGX5JV","download_json":"https://pith.science/pith/MUWWHKOOPPJSH2LYDM4NLGX5JV.json","view_paper":"https://pith.science/paper/MUWWHKOO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.00212&json=true","fetch_graph":"https://pith.science/api/pith-number/MUWWHKOOPPJSH2LYDM4NLGX5JV/graph.json","fetch_events":"https://pith.science/api/pith-number/MUWWHKOOPPJSH2LYDM4NLGX5JV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MUWWHKOOPPJSH2LYDM4NLGX5JV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MUWWHKOOPPJSH2LYDM4NLGX5JV/action/storage_attestation","attest_author":"https://pith.science/pith/MUWWHKOOPPJSH2LYDM4NLGX5JV/action/author_attestation","sign_citation":"https://pith.science/pith/MUWWHKOOPPJSH2LYDM4NLGX5JV/action/citation_signature","submit_replication":"https://pith.science/pith/MUWWHKOOPPJSH2LYDM4NLGX5JV/action/replication_record"}},"created_at":"2026-07-02T00:18:39.248777+00:00","updated_at":"2026-07-02T00:18:39.248777+00:00"}