{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:WQ4XVQ6ZEWJYICKADQ3HR76UFY","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":"cc0461600d600e488b94d3c1b3e923e48a3def92dd18b21957b64378fa612190","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-07T23:34:05Z","title_canon_sha256":"41e5277e3fd533ae6df578d7959d1c4cdf17878d85c0c0a2ad7e4503e8b00bfe"},"schema_version":"1.0","source":{"id":"1611.02341","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.02341","created_at":"2026-05-18T00:12:11Z"},{"alias_kind":"arxiv_version","alias_value":"1611.02341v2","created_at":"2026-05-18T00:12:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.02341","created_at":"2026-05-18T00:12:11Z"},{"alias_kind":"pith_short_12","alias_value":"WQ4XVQ6ZEWJY","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"WQ4XVQ6ZEWJYICKA","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"WQ4XVQ6Z","created_at":"2026-05-18T12:30:51Z"}],"graph_snapshots":[{"event_id":"sha256:38e93b0065e9cee5ae80d1a7f251f6ccbddc844c7e3d7e94e0b3bfbecbed6ce4","target":"graph","created_at":"2026-05-18T00:12:11Z","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 \\textit{locally irregular} if the neighbors of every vertex $v$ have degrees distinct from the degree of $v$. \\textit{locally irregular edge-coloring} of a graph $G$ is an (improper) edge-coloring such that the graph induced on the edges of any color class is locally irregular. It is conjectured that $3$ colors suffice for a locally irregular edge-coloring. Recently, Bensmail et al. (Bensmail, Merker, Thomassen: Decomposing graphs into a constant number of locally irregular subgraphs, {\\em European J. Combin.}, 60:124--134, 2017) settled the first constant upper bound for the proble","authors_text":"Borut Lu\\v{z}ar, Jakub Przyby{\\l}o, Roman Sot\\'ak","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-07T23:34:05Z","title":"New bounds for locally irregular chromatic index of bipartite and subcubic graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.02341","kind":"arxiv","version":2},"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:ac3212e2b304db928abf0c98f68c52a673510f77d3158df886c8d64ab5804a3b","target":"record","created_at":"2026-05-18T00:12:11Z","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":"cc0461600d600e488b94d3c1b3e923e48a3def92dd18b21957b64378fa612190","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-07T23:34:05Z","title_canon_sha256":"41e5277e3fd533ae6df578d7959d1c4cdf17878d85c0c0a2ad7e4503e8b00bfe"},"schema_version":"1.0","source":{"id":"1611.02341","kind":"arxiv","version":2}},"canonical_sha256":"b4397ac3d925938409401c3678ffd42e285f1d0098c72524b87960badaeb1a4f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b4397ac3d925938409401c3678ffd42e285f1d0098c72524b87960badaeb1a4f","first_computed_at":"2026-05-18T00:12:11.506134Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:12:11.506134Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RMPudqP3kRw/UVFTc/Q+aYGp1iFmsLF/8oQMwmfnEnUijCvy7rE+UVnHnzk7ClvyziHvCNUmYdH15pM6Ur5QBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:12:11.506815Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.02341","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ac3212e2b304db928abf0c98f68c52a673510f77d3158df886c8d64ab5804a3b","sha256:38e93b0065e9cee5ae80d1a7f251f6ccbddc844c7e3d7e94e0b3bfbecbed6ce4"],"state_sha256":"9923710562449e3dc0fe917b0634c1053ca254e3dec42efcf9bbe6add8d20a1c"}