{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:VNN26BETTB3GNB5LTDOOII2UJW","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":"5e4bb726c60099ee40dbd5f172376ee55ae6988f6b871b32e29e7ba1cabddad6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-04-01T13:30:13Z","title_canon_sha256":"7755d3b81022b4aeb95052cfc48c132e9852bd1381124b7d6978e836baf75915"},"schema_version":"1.0","source":{"id":"1604.00235","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.00235","created_at":"2026-05-18T01:17:54Z"},{"alias_kind":"arxiv_version","alias_value":"1604.00235v1","created_at":"2026-05-18T01:17:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.00235","created_at":"2026-05-18T01:17:54Z"},{"alias_kind":"pith_short_12","alias_value":"VNN26BETTB3G","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"VNN26BETTB3GNB5L","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"VNN26BET","created_at":"2026-05-18T12:30:48Z"}],"graph_snapshots":[{"event_id":"sha256:5324076792a401caf8cf37f6cda6c9d2bd264cb80e4310a13c3a74420602598a","target":"graph","created_at":"2026-05-18T01:17:54Z","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 graph is locally irregular if no two adjacent vertices have the same degree. The irregular chromatic index $\\chi_{\\rm irr}'(G)$ of a graph $G$ is the smallest number of locally irregular subgraphs needed to edge-decompose $G$. Not all graphs have such a decomposition, but Baudon, Bensmail, Przyby{\\l}o, and Wo\\'zniak conjectured that if $G$ can be decomposed into locally irregular subgraphs, then $\\chi_{\\rm irr}'(G)\\leq 3$. In support of this conjecture, Przyby{\\l}o showed that $\\chi_{\\rm irr}'(G)\\leq 3$ holds whenever $G$ has minimum degree at least $10^{10}$.\n  Here we prove that every bipa","authors_text":"Carsten Thomassen, Julien Bensmail, Martin Merker","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-04-01T13:30:13Z","title":"Decomposing graphs into a constant number of locally irregular subgraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.00235","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:84464c0b6f0cf0c47394176be55460f128ac795d0deaf741d7e2c4834b49ab75","target":"record","created_at":"2026-05-18T01:17:54Z","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":"5e4bb726c60099ee40dbd5f172376ee55ae6988f6b871b32e29e7ba1cabddad6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-04-01T13:30:13Z","title_canon_sha256":"7755d3b81022b4aeb95052cfc48c132e9852bd1381124b7d6978e836baf75915"},"schema_version":"1.0","source":{"id":"1604.00235","kind":"arxiv","version":1}},"canonical_sha256":"ab5baf049398766687ab98dce423544d86a655ef952037a049fa645c049f7c3c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ab5baf049398766687ab98dce423544d86a655ef952037a049fa645c049f7c3c","first_computed_at":"2026-05-18T01:17:54.239935Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:17:54.239935Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ifV0PyXyngfy8dEv3kB5s4Ii+I8kWDeDEfvT/lAuo1F9kcdEBgJt2XhtmkAv5pX8WnRa4aCeTba9soG0ZGKKDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:17:54.240623Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.00235","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:84464c0b6f0cf0c47394176be55460f128ac795d0deaf741d7e2c4834b49ab75","sha256:5324076792a401caf8cf37f6cda6c9d2bd264cb80e4310a13c3a74420602598a"],"state_sha256":"bcf42865f693bb32ce8e7c2caf03b4cc6b23327f2353bf46ddf207fadf0014df"}